Cooperating memes for vehicle routing problems

International Journal of Innovative Computing, Information and Control

Volumn 7, Issue 11, 2011, Pages 6483-6506

  Chen, Xianshun ^a   Ong, Yew Soon ^a   Lim, Meng Hiot ^b   Ping, Yeo Swee ^c  

^a NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

^b NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

^c NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

Combinatorial optimization; Cooperating memes; Memetic algorithms; Metaheuristics; Vehicle routing problems

Indexed keywords

CAPACITATED VEHICLE ROUTING PROBLEM; COOPERATING MEMES; DOMAIN SPECIFIC; HIGH-QUALITY SOLUTIONS; INDIVIDUAL LEARNING; LOCAL SEARCH METHOD; MEMETIC ALGORITHMS; META HEURISTICS; VEHICLE ROUTING PROBLEM; VEHICLE ROUTING PROBLEMS;

COMBINATORIAL OPTIMIZATION; EVOLUTIONARY ALGORITHMS; HEURISTIC ALGORITHMS; NETWORK ROUTING; ROUTING ALGORITHMS;

VEHICLES;

EID: 80054831219     PISSN: 13494198     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (49)

1. A. S. Alfa, S. S. Heragu and M. Chen, A 3-opt based simulated annealing algorithm for vehicle routing problem, Computers and Operations Research, vol.21, pp.635-639, 1991.
2. C. Aranha and H. Iba, The memetic tree-based genetic algorithm and its application to portfolio optimization, Memetic Computing, vol.1, no.2, pp.139-151, 2009.
3. P. Augerat, J. M. Belenguer, E. Benavent, A. Corber, D. Naddef and G. Rinaldi, Computational results with a branch and cut code for the capacitated vehicle routing problem, Research Report 949-M, Universite Joseph Fourier, Grenoble, France, 1995.
4. J. F. Bard and L. Huang, A branch and cut algorithm for the vrp with satellite facilities, III, Transactions, vol.30, no.9, pp.821-834, 1998.
5. J. Berger and M. Barkaoui, A hybrid genetic algorithm for the capacitated vehicle routing problem, Genetic and Evolutionary Computation Conference, Chicago, pp.646-656, 2003.
6. N. Christofides and S. Eilon, An algorithm for the vehicle dispatching problem, Operational Research Quarterly, vol.20, pp.309-318, 1969.
7. N. Christofides, A. Mingozzi and P. Toth, The vehicle routing problem, Combinatorial Optimization, pp.315-338, 1979.
8. J. F. Cordeau, M. Gendreau and G. Laporte, A tabu search heuristic for the periodic and multi-depot vehicle routing problems, Networks, vol.30, pp. 105-119, 1994.
9. B. D. Diaz, Vrp Benchmarks, World Wide Web Electronic Publication, 2009.
10. L. M. Gambardella, E. Taillard and G. Agazzi, Macs-vrptw: A multiple ant colony system for vehicle routing problems with time windows, New Ideas in Optimization, pp.63-76, 1999.
11. M. Gendreau, A. Hertz and G. Laporte, A tabu search heuristic for the vehicle routing problem, Manage. Sci, vol.40, no.10, pp.1276-1290, 1994.
12. M. Gendreau, G. Laporte and J. Y. Potvin, Metaheuristics for the vehicle routing problem, Technical Report, GERAD Research, Montreal, Canada, 1998.
13. M. Gendreau, G. Laporte and J. Y. Potvin, Local Search in Combinatorial Optimization, Princeton University Press, Princeton, 2003.
14. B. E. Gillett and L. R. Miller, A heuristic algorithm for the vehicle-dispatch problem, Operations Research, vol.22, no.2, pp.340-349, 1974.
15. B. L. Golden, E. A. Wasil, J. P. Kelly and I. M. Chao, The impact of metaheuristics on solving the vehicle routing problem: Algorithms, problem sets, and computational results, Fleet Management and Logistics, pp.33-56, 1998.
16. P. Ji, Y. Wu, H. Liu and H. Wu, The vehicle routing problem with time-varying travel times and a solution method, International Journal of Innovative Computing, Information and Control, vol.5, no.4, pp.1001-1011, 2009.
17. N. Krasnogor, Self generating metaheuristics in bioinformatics: The proteins structure comparison case, Genetic Programming and Evolvable Machines, vol.5, no.2, pp.181-201, 2004.
18. N. Krasnogor, B. P. Blackburne, E. K. Burke and J. D. Hirst, Multimeme algorithms for protein structure prediction, Proc. of the Parallel Problem Solving from Nature VII, LNCS, pp.769-778, 2002.
19. M. Kubiak, Systematic construction of recombination operators for the vehicle routing problem, Foundations of Computing and Decision Sciences, vol.29, pp.205-226, 2004.
20. M. Kubiak, Distance measures and fitness-distance analysis for the capacitated vehicle routing problem, Metaheuristics, vol.39, pp.345-364, 2007.
21. R. S. K. Kwan, A. S. K. Kwan and A. S. K. Wren, Evolutionary driver scheduling with relief chains, Evolutionary Computation, vol.9, no.4, pp.445-460, 2001
22. M. H. Lim and Y. L. Xu, Application of hybrid genetic algorithm in supply chain management, International Journal of Computers, Systems, and Signals, vol.6, 2005.
23. S. J. Louis, X. Yin and Z. Y. Yuan, Multiple vehicle routing with time windows using genetic algorithms, Proc. of the Congress of Evolutionary Computation, pp.1804-1808, 1999.
24. R. Meuth, M.-H. Lim, Y.-S. Ong and D. C. Wunsch II, A proposition on memes and meta-memes in computing for higher-order learning, Memetic Computing, vol.1, no.2, pp.85-100, 2009.
25. Q. H. Nguyen, Y. S. Ong and M. H. Lim, A probabilistic memetic framework, IEEE Transactions on Evolutionary Computation, vol.13, no.3, pp.604-623, 2009.
26. Y. S. Ong, M. H. Lim, N. Zhu and K. W. Wong, Classification of adaptive memetic algorithms: A comparative study, IEEE Transactions on Systems, Man, and Cybernetics, Part B, vol.36, no.l, pp.141-152, 2006.
27. I. H. Osman, Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem, Annals of Operations Research, vol.41, no.4, pp.421-451, 1993.
28. F. B. Pereira, J. Tavares, P. Machado and E. Costa, Gvr: A new genetic representation for the vehicle routing problem, Proc. of the 13th Irish Conference on Artificial Intelligence and Cognitive Science, pp.95-102, 2002.
29. C. Prins, A simple and effective evolutionary algorithm for the vehicle routing problem, Computers and Operations Research, vol.31, no.12, pp.1985-2002, 2004.
30. C. Rego and C. Rouchairol, Metaheuristics: Theory and Applications, Kluwer, Boston, 1996.
31. Y. Rochat and E. D. Taillard, Probabilistic diversification and intensification in local search for vehicle routing, Journal of Heuristics 1, pp.147-167, 1995.
32. L. J. Schmitt, An Empirical Computational Study of Genetic Algorithms to Solve Order Based Problems: An Emphasis on TSP and VRPTC, Ph.D. Thesis, Memphis State University, Memphis, 1994.
33. L. J. Schmitt, An evaluation of a genetic algorithmic approach to the vehicle routing problem, Technical Report, Christian Brothers University, Memphis, 1995.
34. J. Schonberger, Memetic Algorithm Vehicle Routing, Springer, Berlin, 2006.
35. P. Shaw, Using constraint programming and local search methods to solve vehicle routing problems, Proc. of the 4th International Conference on Principles and Practice of Constraint Programming, pp.417-431, 1998.
36. E. D. Taillard, Parallel iterative search methods for vehicle routing problems, Networks, pp.661-673, 1993.
37. C. D. Tarantilis and C. T. Kiranoudis, Boneroute: An adaptive memory-based method for effective fleet management, Annals of Operations Research, 2002.
38. P. Toth and D. Vigo, Exact solution of the vehicle routing problem, in Fleet Management and Logistic, T. G. Crainic and G. Laporte (eds.), Boston, Kluwer Academic Publisher, 1998.
39. P. Toth and D. Vigo, The granular tabu search and its application to the vrp, INFORMS Journal of Computing, 1998.
40. X. Wang, C. Xu and D. Yang, Disruption management for vehicle routing problem with the request changes of customers, International Journal of Innovative Computing, Information and Control, vol.5, no.8, pp.2427-2438, 2009.
41. X. Wang, K. Zhang and D. Yang, Disruption management of urgency vehicle routing problem with fuzzy time window, ICIC Express Letters, vol.3, no.4(A), pp.883-890, 2009.
42. P. Wark and J. Holt, A repeated matching heuristic for the vehicle routing problem, Journal of Operational Research Society, vol.45, pp.1156-1167, 1994.
43. D. H. Wolpert and W. G. Macready, No free lunch theorems for optimization, IEEE Transactions on Evolutionary Computation, vol.1, no.l, pp.67-82, 1997.
44. Y. Wu, P. Ji and T. Wang, An empirical study of a pure genetic algorithm to solve the capacitated vehicle routing problem, ICIC Express Letters, vol.2, no.l, pp.41-45, 2008.
45. J. Xu and J. Kelly, A network flow-based tabu search for the vehicle routing problem, Transportation Science, vol.30, pp.379-393, 1996.
46. K. Zhu, A new genetic algorithm for vrptw, International Conference on Artificial Intelligence, Las Vegas, 2000.
47. Y. S. Ong, M. H. Lim and X. Chen, Memetic computation - Past, present & future, IEEE Computational Intelligence Magazine, vol.5, no.2, pp.24-31, 2010.
48. M. N. Le, Y. S. Ong, Y. Jin and B. Sendhoff, Lamarckian memetic algorithms: Local optimum and connectivity structure analysis, Memetic Computing Journal, vol.1, no.3, pp.175-190, 2009.
49. S. Hasan, R. Sarker, D. Essam and D. Cornforth, Memetic algorithms for solving job-shop scheduling problems, Memetic Computing, vol.1, no.l, pp.69-83, 2009.