A GA based heuristic for the vehicle routing problem with multiple trips

Journal of Mathematical Modelling and Algorithms

Volumn 6, Issue 4, 2007, Pages 591-613

  Salhi, S ^a   Petch, R J ^b  

^a UNIVERSITY OF KENT   (United Kingdom)

^b London Underground Modernisation Programme   (United Kingdom)

Author keywords

Bin packing; Genetic algorithm; Heuristic; Multiple trip

Indexed keywords

EID: 36549063541     PISSN: 15701166     EISSN: 15729214     Source Type: Journal    
DOI: 10.1007/s10852-007-9069-2     Document Type: Article

References (22)

1. Brandao, J., Mercer, A.: A tabu search algorithm for the multi-trip vehicle routing and scheduling problem. Eur. J. Oper. Res. 100, 180-191 (1997)
2. Brandao, J., Mercer, A.: The multi-trip vehicle routing problem. J. Oper. Res. Soc. 49, 799-805 (1998)
3. Christofides, N., Mingozzi, A., Toth, P.: The vehicle routing problem. In: Combinatorial Optimization, pp. 313-338. Wiley, Chichester (1979)
4. Clarke, G., Wright, J.: Scheduling of vehicles for a central depot to a number of delivery points. Oper. Res. 12, 568-581 (1964)
5. Fisher, M.: Optimal solution of vehicle routing problems using minimum k-trees. Oper. Res. 42(4), 626-646 (1994)
6. Fleischmann, B.: The vehicle routing problem with multiple use of vehicles. Working paper, Fachbereich Wirschaftswissenschaften, Universitat Hamburg (1990)
7. Glover, F.: A template for scatter search and path relinking. In: Artificial Evolution. Lecture Notes in Computer Science, pp. 13-54. Springer, Berlin Heidelberg New York (1998)
8. Golden, B., Laporte, G., Taillard, E.: An adaptive memory heuristic for a class of vehicle routing problems with minmax objective. Comput. Oper. Res. 24, 445-452 (1997)
9. Martello, S., Toth, P.: Knapsack Problems. Wiley, Chichester (1990)
10. Olivera, A., Viera, O.: Adaptive memory progarmming for the vehicle routing problem with multiple trips. Comput. Oper. Res. 34, 28-47 (2007)
11. Osman, I., Salhi, S.: Local search strategies for the mix fleet routing problem. In: Rayward-Smith, V.J., et al.(eds.) Modern Heuristic Search Methods, chap. 8, pp. 131-154. Wiley, Chichester (1996)
12. Petch, R.: Constructive and population based heuristics for the vehicle routing problem with multiple trips. Ph.D. thesis. University of Birmingham, UK (2001)
13. Petch, R., Salhi, S.: A multi-phase constructive heuristic for the vehicle routing problem with multiple trips. Discrete Appl. Math. 133, 69-92 (2004)
14. Potvin, J.: Genetic algorithms for the traveling salesman problem. Ann. Oper. Res. 63, 339-370 (1996)
15. Reeves, C. (ed.).: Modern Heuristic Techniques for Combinatorial Problems. Blackwell, Oxford, UK (1995)
16. Rochat, Y., Taillard, E.: Probabilistic diversification and intensification in local search for vehicle routing. Heuristics 1, 147-167 (1995)
17. Salhi, S.: The integration of routing into the location-allocation and vehicle composition problems. Ph.D. Thesis, University of Lancaster, pp. 198-208 (1987)
18. Salhi, S.: Heuristic search methods. In: Marcoulides, G. (ed.) Modern Methods for Business Research, chap. 6. Lawrence Erlbaum, London (1998)
19. Salhi, S.: Heuristic search methods: the science of tomorrow. In: Salhi, S.(ed.) Keynote Papers at OR48, pp. 39-58. Operational Research Society, Bath (2006)
20. Salhi, S., Rand, G.: Incorporating vehicle routing into the vehicle fleet composition problem. Eur. J. Oper. Res. 66, 313-330 (1993)
21. Taillard, E., Laporte, G., Gendreau, M.: Vehicle routing with multiple use of vehicles. J. Oper. Res. Soc. 47, 1065-1070 (1996)
22. Thangiah, S., Salhi, S.: Genetic clustering: an dadptive heuristic for the multi depot vehicle routing problem. Appl. Artif. Intell. 15, 361-383 (2001)