Solving large instances of capacitated vehicle routing problem over cell BE

Proceedings - 10th IEEE International Conference on High Performance Computing and Communications, HPCC 2008

Volumn , Issue , 2008, Pages 131-138

  Munawar, Asim ^a   Wahib, Mohamed ^a   Munetomo, Masaharu ^a   Akama, Kiyoshi ^a  

^a HOKKAIDO UNIVERSITY   (Japan)

Author keywords

Cell broadband engine architecture; Cellular genetic algorithm (cGA); Combinatorial optimization problem; Multicore; Vehicle routing problem

Indexed keywords

ALGORITHMS; AUTOMOBILE ENGINES; AUTOMOBILE PARTS AND EQUIPMENT; CELLS; COMBINATORIAL MATHEMATICS; COMBINATORIAL OPTIMIZATION; CYTOLOGY; DIESEL ENGINES; GENETIC ALGORITHMS; HIGH PERFORMANCE LIQUID CHROMATOGRAPHY; KETONES; NETWORK ROUTING; PARALLEL ALGORITHMS; ROUTING ALGORITHMS; TELECOMMUNICATION SYSTEMS;

CELL BROADBAND ENGINE ARCHITECTURE; CELLULAR GENETIC ALGORITHM (CGA); COMBINATORIAL OPTIMIZATION PROBLEM; MULTICORE; VEHICLE ROUTING PROBLEM;

VEHICLE ROUTING;

EID: 56349168646     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/HPCC.2008.76     Document Type: Conference Paper

References (15)

1. E. Alba and B. Dorronsoro. Solving the vehicle routing problem by using cellular genetic algorithms. In J. Gottlieb and G. R. Raidl, editors, EvoCOP, volume 3004 of Lecture Notes in Computer Science, pages 11-20. Springer, 2004.
2. E. Alba and B. Dorronsoro. Computing nine new best-so-far solutions for capacitated vrp with a cellular genetic algorithm. Information Processing Letters, 98(6): 225-230, June 2006.
3. E. Alba and B. Dorronsoro. Engineering Evolutionary Intelligent Systems, volume 82, chapter A Hybrid Cellular Genetic Algorithm for the Capacitated Vehicle Routing Problem, pages 379-422. Springer, 2008.
4. J. Berger and M. Barkaoui. A hybrid genetic algorithm for the capacitated vehicle routing problem. In GECCO, volume 2723 of Lecture Notes in Computer Science, pages 646-656. Springer, 2003.
5. N. Christofides, A. Mingozzi, and P. Toth. Combinatorial Optimization, chapter The vehicle routing problem. John Wiley & Sons, 1979.
6. G. Croes. A method for solving traveling salesman problems. In Operations Research 6, pages 791-812, 1958.
7. W. Darrell, T. Starkweather, and D. Fuquay. Scheduling problems and traveling salesman: The genetic edge recombination operator. In International Conference on Genetic Algorithms, pages 133-140, 1989.
8. F. Glover and M. Laguna. Tabu search. In C. Reeves, editor, Modern Heuristic Techniques for Combinatorial Problems, Oxford, England, 1993. Blackwell Scientific Publishing.
9. D. E. Goldberg. Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley Professional, January 1989.
10. B. Golden, E. Wasil, J. Kelly, and I. Chao. Fleet Management and Logistics, chapter Metaheuristics in vehicle routing. Kluwer Academic Publishers, Boston, 1998.
11. S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi. Optimization by simulated annealing. Science, Number 4598, 13 May 1983, 220, 4598: 671-680, 1983.
12. Y. Nagata. Edge assembly crossover for the capacitated vehicle routing problem. In C. Cotta and J. I. van Hemert, editors, EvoCOP, volume 4446 of Lecture Notes in Computer Science, pages 142-153. Springer, 2007.
13. I. H. Osman. Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Ann. Oper. Res. 41(1-4): 421-451, 1993.
14. Y. Rochat and E. Taillard. Probabilistic diversification and intensification in local search for vehicle routing. Journal of Heuristics, 1: 147-167, 1995.
15. P. Toth and D. Vigo. The vehicle routing problem. Monographs on Discrete Mathematics and Applications. SIAM, 2001.