An asexual genetic algorithm for the general single vehicle routing problem

Engineering Optimization

Volumn 37, Issue 1, 2005, Pages 1-27

  Chakroborty, Partha ^a   Manual, Arijit ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY KANPUR   (India)

Author keywords

Asexual genetic algorithms; Vehicle routing

Indexed keywords

COMPUTATIONAL COMPLEXITY; GENETIC ALGORITHMS; MUTAGENESIS; OPTIMAL SYSTEMS; OPTIMIZATION; PROBLEM SOLVING; TRAVELING SALESMAN PROBLEM;

ASEXUAL GENETIC ALGORITHMS; DELIVERY PROBLEM; OPTIMAL ROUTE; VEHICLE ROUTING;

VEHICLES;

EID: 11844258797     PISSN: 0305215X     EISSN: None     Source Type: Journal    
DOI: 10.1080/03052150410001721468     Document Type: Article

References (26)

1. Calvo, R.W., A new heuristic for the traveling salesman problem with time windows. Transport. Sci., 2000, 34(1), 113-124.
2. Chakroborty, P. and Dwivedi, T., Optimal route network design for transit systems using genetic algorithms. Eng. Optim., 2002, 34(1), 83-100.
3. Chatterjee, S., Carrera, C. and Lynch, L.A., Genetic algorithms and traveling salesman problems. Eur. J. Oper. Res., 1996, 93, 490-510.
4. Christofides, N., Vehicle routing. In Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, edited by E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan and D.B. Shmoys, 1985 (Wiley: Chichester).
5. del Castillo, J.M., A heuristic for the traveling salesman problem based on a continuous approximation. Transport. Res. B, 1999, 33, 123-152.
6. Desrosiers, J., Dumas, Y. and Soumis, F., A dynamic programming solution of the large scale single vehicle dial-a-ride problem with time windows. Am. J. Math. Sci., 1986, 6, 301-325.
7. Desrosiers, J., Dumas, Y., Solomon, M.M. and Soumis, F., Time constrained routing and scheduling. In Nehvork Routing, edited by M.O. Ball, T.L. Magnanti, C.L. Monma and G.L. Nemhauser, 1995 (Elsevier Science: Amsterdam).
8. Fisher, M., Vehicle routing. In Network Routing. edited by M.O. Ball, T.L. Magnanti, C.L. Monma and G.L. Nemhauser, 1995 (Elsevier Science: Amsterdam).
9. Gendreau, M., Laporte, G. and Vigo, D., Heuristics for the traveling salesman problem with pick-up and delivery. Comput. Oper. Res., 1999, 26, 699-714.
10. Goldberg, D.E., Genetic Algorithms in Search. Optimization and Machine Learning, 1989 (Addison-Wesley: Reading. MA).
11. Golden, B., Bodin, L., Doyle, T. and Stewart, W., Approximate traveling salesman algorithms. Oper. Res., 1980, 28, 694-711.
12. Hasegawa, M. Ikeguchi, T. and Aihara, K., Solving large scale traveling salesman problems by chaotic neurodynamics. Neur. Netw., 2002, 15, 271-283.
13. Kalantari, B., Hill, A.V. and Arrora, S.R., An algorithm for the traveling salesman problem with pick-up and delivery customers. Eur. J. Oper. Res., 1985, 22, 377-386.
14. Mandai, A., A genetic algorithm based fast and generalized optimization method for large single vehicle routing problems. Master's thesis. Indian Institute of Technology, Kanpur, India, 2002.
15. Moon, C., Kim, J., Choi, G. and Seo, Y., An efficient genetic algorithm for the traveling salesman problem with precedence constraints. Eur. J. Oper. Res., 2002, 140, 606-617.
16. Nanry, W.P. and Barnes, J.W., Solving the pick-up and delivery problem with time windows using reactive tabu search. Transport. Res. B, 2000, 34, 107-121.
17. Padberg, M. and Rinaldi, G., A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems. SIAM Rev., 1991, 33(1), 60-100.
18. Potvin, J.Y., Genetic algorithms for the traveling salesman problem. Ann. Oper. Res., 1996, 63, 339-370.
19. Psaraftis, H.N., A dynamic programming solution to the single vehicle many-to-many immediate request dial-a-ride problem. Transport. Sci., 1980, 14(2), 130-154.
20. Psaraftis, H.N., An exact algorithm for the single vehicle many-to-rnany dial-a-ride problem with time windows. Transport. Sci., 1983, 17(3), 351-357.
21. Renaud, J., Boctor, F. and Ouenniche, J., A heuristic for the pick-up and delivery traveling salesman problem. Comput. Oper. Res., 2000, 27, 905-916.
22. Renaud, J., Boctor, F. and Laporte, G., Perturbation heuristics for the pick-up and delivery traveling salesman problem. Camput. Oper. Res., 2002, 29, 1129-1141.
23. Rosenkrantz, D., Stearns, R. and Lewis, P., Approximate algorithms for the traveling salesman problem, in Proceedings of the 15th Annual IEEE Symposium of Switching and Automata Theory, 1974, pp. 33-42.
24. Savelsbergh, M.W.P. and Sol, M., The general pick-up and delivery problem. Transport. Sci., 1995, 29, 17-29.
25. TSPLIB, A library of TSP and related problems from various sources. Available online at: http://www.iwr. uni-heidelberg.de/groups/comopt/software/TSPLIB95/(2001).
26. Ugajin, R., Method to solve the traveling salesman problem using the inverse of diffusion process. Physica A, 2002, 307, 260-268.