A hybrid classical approach to a fixed-charged transportation problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7208 LNAI, Issue PART 1, 2012, Pages 557-566

  Pintea, Camelia M ^a   Sitar, Corina Pop ^a   Hajdu Macelaru, Mara ^a   Petrica, Pop ^a  

^a TECHNICAL UNIVERSITY OF CLUJ NAPOCA   (Romania)

Author keywords

Hybrid algorithms; Nearest Neighbor; Transportation Problem

Indexed keywords

CLASSICAL APPROACH; COMPLEX PROBLEMS; DISTRIBUTION CENTERS; ECONOMICAL MODEL; FEASIBLE SOLUTION; FIXED CHARGES; HYBRID ALGORITHMS; LARGE SIZES; NEAREST NEIGHBOR SEARCH; NEAREST NEIGHBORS; NUMERICAL RESULTS; SUPPLY CHAIN NETWORK; SUPPLY-DEMAND; TOTAL COSTS; TRANSPORTATION PROBLEM; TWO STAGE;

INTELLIGENT SYSTEMS; SALES; SUPPLY CHAINS; WAREHOUSES;

CUSTOMER SATISFACTION;

EID: 84858778358     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-28942-2_50     Document Type: Conference Paper

References (18)

1. Hitchcock, F.L.: The distribution of a product from several sources to numerous localities. J. of Mathematical Physic. 20, 224-230 (1941)
2. Diaby, M.: Successive linear approximation procedure for generalized fixed charge transportation problems. J. of Oper. Research Society 42, 991-1001 (1991)
3. Adlakha, V., Kowalski, K.: On the fixed-charge transportation problem. OMEGA: The International Journal of Management Science 27, 381-388 (1999)
4. Sun, M., Aronson, J.E., Mckeown, P.G., Drinka, D.: A tabu search heuristic procedure for the fixe charge transportation problem. European Journal of Operational Research 106, 441-456 (1998)
5. Fayyad, U.M., Piatetsky-Shapiro, G., Smyth, P., Uthurusamy, R.: Advancesin Knowledge Discovery and Data Mining. AAAI Press/MIT Press (1996)
6. Duda, R.O., Hart, P.E.: Pattern Classification and Scene Analysis. John Wiley& Sons, NY (1973)
7. Cost, S., Salzberg, S.: A weighted nearest neighbor algorithm for learning with symbolic features. Machine Learning 10, 57-78 (1993)
8. Gersho, A., Gray, R.M.: Vector Quantization and Signal Compression. Kluwer Academic, Boston (1991)
9. Flickner, M., Sawhney, H., Niblack, W., Ashley, J., Huang, Q., Dom, B., Gorkani, M., Hafner, J., Lee, D., Petkovic, D., Steele, D., Yanker, P.: Query by image and video content: The QBIC system. IEEE Computer 28, 23-32 (1995)
10. Deerwester, S., Dumals, S.T., Furnas, G.W., Landauer, T.K., Harshman, R.: Indexing by latend semantic analysis. J. Amer. Soc. Inform. Sci. 41, 391-407 (1990)
11. Devroye, L., Wagner, T.J.: Nearest neighbor methods in discrimination. In: Krishnaiah, P.R., Kanal, L.N. (eds.) Handbook of Statistics, vol. 2. North-Holland (1982)
12. Arya, S., Mount, D.M., Netanyahu, N.S., Silverman, R.: An Optimal Algorithm for Approximate Nearest Neighbor Searching in Fixed Dimensions. Journal of the ACM 45(6), 891-923
13. Knuth, D.: The Art of Computer Programming, vol. 3. Addison-Wesley, Boston (1997)
14. Molla-Alizadeh-Zavardehi, S., Hajiaghaei-Keshteli, M., Tavakkoli-Moghaddam, R.: Solving a capacitated fixed-charge transportation problem by artificial immune and genetic algorithms with a Prüfer number representation. Expert Systems with Applications 38, 10462-10474 (2011)
15. Gutin, G., Yeo, A., Zverovich, A.: Traveling Salesman should not be greedy: domination analysis of greedy-type heuristics for the TSP. Discrete Applied Mathematics 117, 81-86 (2002)
16. Chira, C., Dumitrescu, D., Pintea, C.-M.: Learning sensitive stigmergic agents for solving complex problems. Computing and Informatics 29(3), 337-356 (2010)
17. Pintea, C.-M., Crişan, G.-C., Chira, C.: Hybrid Ant Models with a Transition Policy for Solving a Complex Problem. Logic Journal of the IGPL (2011), doi:10.1093/jigpal/jzr004
18. Reyes, L.C., Zezzatti, C.A.O.O., Santillán, C.G., Hernández, P.H., Fuerte, M.V.: A Cultural Algorithm for the Urban Public Transportation. In: Corchado, E., Graña Romay, M., Manhaes Savio, A. (eds.) HAIS 2010. LNCS, vol. 6077, pp. 135-142. Springer, Heidelberg (2010)