Computing nine new best-so-far solutions for Capacitated VRP with a cellular Genetic Algorithm

Information Processing Letters

Volumn 98, Issue 6, 2006, Pages 225-230

  Alba, Enrique ^a   Dorronsoro, Bernabé ^a  

^a UNIVERSITY OF MÁLAGA   (Spain)

Author keywords

Algorithms; Approximation algorithms; Cellular Genetic Algorithm; Design of algorithms; Hybrid Genetic Algorithm; Vehicle Routing Problem

Indexed keywords

APPROXIMATION THEORY; CAPACITANCE; COMBINATORIAL CIRCUITS; HEURISTIC METHODS; PROBLEM SOLVING; ROUTERS;

APPROXIMATION ALGORITHMS; CELLULAR GENETIC ALGORITHM; DESIGN OF ALGORITHMS; HYBRID GENETIC ALGORITHM; VEHICLE ROUTING PROBLEM;

GENETIC ALGORITHMS;

EID: 33646112638     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2006.02.006     Document Type: Article

References (22)

1. Dantzig G., and Ramser R. The truck dispatching problem. Management Science 6 (1959) 80-91
2. Alba E., and Dorronsoro B. Solving the vehicle routing problem by using cellular genetic algorithms. Evolutionary Computation in Combinatorial Optimization (EvoCOP). Lecture Notes in Comput. Sci. vol. 3004 (2004), Springer-Verlag, Berlin 11-20
3. Manderick B., and Spiessens P. Fine-grained parallel genetic algorithm. Proc. of the 3rd Int. Conference on Genetic Algorithms (ICGA) (1989), Morgan Kaufmann, Los Altos, CA 428-433
4. Whitley D. Cellular genetic algorithms. Proc. of the 5th Internat. Conference on Genetic Algorithms (ICGA) (1993), Morgan Kaufmann, Los Altos, CA 658
5. In: Christofides N., Mingozzi A., and Toth P. (Eds). Combinatorial Optimization (1979), John Wiley 315-338 (Ch. The Vehicle Routing Problem)
6. A.V. Breedam, An analysis of the behavior of heuristics for the vehicle routing problem for a selection of problems with vehicle related, customer-related, and time-related constraints, Ph.D. thesis, University of Antwerp, RUCA, Belgium, 1994
7. Golden B., Wasil E., Kelly J., and Chao I.-M. Fleet Management and Logistics (1998), Kluwer, Boston 33-56 (Ch. The Impact of Metaheuristics on Solving the Vehicle Routing Problem: algorithms, problem sets, and computational results)
8. Taillard E. Parallel iterative search methods for vehicle routing problems. Networks 23 8 (1993) 661-673
9. Whitley D., Starkweather T., and Fuquay D. Scheduling problems and traveling salesman: The genetic edge recombination operator. Proc. of the 3rd Internat. Conference on Genetic Algorithms (ICGA) (1989), Morgan Kaufmann, Los Altos, CA 133-140
10. Fogel D. An evolutionary approach to the traveling salesman problem. Biological Cybernetics 60 (1988) 139-144
11. Banzhaf W. The "molecular" traveling salesman. Biological Cybernetics 64 (1990) 7-14
12. Holland J. Adaptation in Natural and Artificial Systems (1975), University of Michigan Press
13. Croes G. A method for solving traveling salesman problems. Operations Research 6 (1958) 791-812
14. Osman I. Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problems. Annals of Operations Research 41 (1993) 421-451
15. http://neo.lcc.uma.es/radi-aeb/WebVRP/Problem_Instances/CVRPInstances.html
16. Breedam A.V. Comparing descent heuristics and metaheuristics for the vehicle routing problem. Computers & Operations Research 28 (2001) 289-315
17. Breedam A.V. A parametric analysis of heuristics for the vehicle routing problem with side-constraints. European Journal of Operational Research 137 (2002) 348-370
18. Mester D., and Bräysy O. Active guided evolution strategies for large-scale vehicle routing problems with time windows. Computers & Operations Research 32 (2005) 1593-1614
19. Li F., Golden B., and Wasil E. Very large-scale vehicle routing: New test problems, algorithms, and results. Computers & Operations Res. 32 (2005) 1165-1179
20. Gambardella L., Taillard E., and Agazzi G. New Ideas in Optimization (1999), McGraw-Hill 63-76 (Ch. MACS-VRPTW: A Multiple Ant Colony System for Vehicle Routing Problems with Time Windows)
21. Tarantilis C., and Kiranoudis C. Boneroute: an adaptive memory-based method for effective fleet management. Annals of Operations Research 115 (2002) 227-241
22. Rochat Y., and Taillard E. Probabilistic diversification and intensification in local search for vehicle routing. Journal of Heuristics 1 (1995) 147-167