Self-organizing maps in population based metaheuristic to the dynamic vehicle routing problem

• Angeniol B, de La Croix Vaubois G, Le Texier JY (1988) Self-organizing feature maps and the travelling salesman problem. Neural Netw 1:289–293

  Article  Google Scholar 

• Bent R, Van Hentenryck P (2003) Dynamic vehicle routing with stochastic requests. In: Proceedings of the 18th international joint conference on artificial intelligence, Acapulco, Mexico, pp 1362–1363

  Google Scholar 

• Bent R, Van Hentenryck P (2004) Scenario-based planning for partially dynamic vehicle routing with stochastic customers. Oper Res 52:977–987

  Article  MATH  Google Scholar 

• Bentley JL, Weide BW, Yao AC (1980) Optimal expected time algorithms for closest point problems. ACM Trans Math Softw 6:563–580

  Article  MathSciNet  MATH  Google Scholar 

• Bertsimas D, Simchi-Levi D (1996) A new generation of vehicle routing research: robust algorithms, addressing uncertainty. Oper Res 4:286–304

  Article  Google Scholar 

• Christofides N, Mingozzi A, Toth P (1979) The vehicle routing problem. In: Christofides N et al. (eds) Combinatorial optimization. Wiley, New York, pp 315–338

  Google Scholar 

• Cordeau JF, Gendreau M, Hertz A, Laporte G, Sormany JS (2005) New heuristics for the vehicle routing problem. In: Langevin A, Riopel D (eds) Logistics systems: design and optimization. Springer, New York, pp 279–297

  Chapter  Google Scholar 

• Cordeau JF, Laporte G, Mercier A (2001) A unified tabu search heuristic for vehicle routing problems with time windows. J Oper Res Soc 52:928–936

  Article  MATH  Google Scholar 

• Creput JC, Koukam A (2009) A memetic neural network for the Euclidean traveling salesman problem. Neurocomputing 72:1250–1264

  Article  Google Scholar 

• Creput JC, Koukam A (2008) The memetic self-organizing map approach to the vehicle routing problem. Soft Comput 12:1125–1141

  Article  Google Scholar 

• Creput JC, Koukam A, Hajjam A (2007) Self-organizing maps in evolutionary approach meant for dimensioning routes to the demand. In: Proceedings of the 21th international conference on computer, electrical, and systems science, and engineering, Vienna, Austria, May 25–27, pp 444–551

  Google Scholar 

• Durbin R, Willshaw DJ (1987) An analogue approach to the traveling salesman problem using an elastic net method. Nature 326:689–691

  Article  Google Scholar 

• Fisher M, Jakumar R, van Wassenhove L (1981) A generalized assignment heuristic for vehicle routing. Networks 11:109–124

  Article  MathSciNet  Google Scholar 

• Gambardella LM, Taillard E, Agazzi G (1999) MACS-VRPTW: a multiple ant colony system for vehicle routing problems with time windows. In: Corne D, Dorigo M, Glover F (eds) New ideas in optimization. McGraw-Hill, New York, pp 63–76

  Google Scholar 

• Gendreau M, Guertin F, Potvin JY, Taillard E (1999) Parallel tabu search for real-time vehicle routing and dispatching. Transp Sci 33:381–390

  Article  MATH  Google Scholar 

• Gendreau M, Laporte G, Potvin J-Y (2002) Metaheuristics for the capacitated VRP. In: Toth P, Vigo D (eds) The vehicle routing problem. SIAM, Philadelphia, pp 129–154

  Chapter  Google Scholar 

• Ghiani G, Guerriero F, Laporte G, Musmanno R (2003) Real-time vehicle routing: Solution concepts, algorithms and parallel computing strategies. Eur J Oper Res 151:1–11

  Article  MATH  Google Scholar 

• Golden BL, Wasil EA, Kelly JP, Chao IM (1999) Metaheuristics in vehicle routing. In: Crainic TG, Laporte G (eds) Fleet management and logistics. Kluwer, Boston, pp 33–56

  Google Scholar 

• Goncalves G, Hsu T, Dupas R, Housroum H (2007) Plateforme de simulation pour la gestion dynamique de tournées des véhicules. J Eur Des Syst Autom 41:515–539

  Google Scholar 

• Helsgaun K (2000) An effective implementation of the Lin-Kernighan traveling salesman heuristic. Eur J Oper Res 126:106–130

  Article  MathSciNet  MATH  Google Scholar 

• Kilby P, Prosser P, Shaw P (1998) Dynamic VRPs: a study of scenarios. Technical Report APES-06-1998, University of Strathclyde, UK

• Kohonen T (2001) Self-organization maps and associative memory, 3rd edn. Springer, Berlin

  Google Scholar 

• Larsen A (2000) The dynamic vehicle routing problem. PhD thesis, Technical University of Denmark, Lyngby, Denmark

• Larsen A, Madsen OBG, Solomon M (2008) Recent developments in dynamic vehicle routing systems. In: The vehicle routing problem: latest advances and new challenges. Springer, Berlin, pp 199–218

  Chapter  Google Scholar 

• Mester D, Bräysy O (2005) Active guided evolution strategies for large scale vehicle routing problems with time windows. Comput Oper Res 32:1593–1614

  Article  Google Scholar 

• Montemanni R, Gambardella LM, Rizzoli AE, Donati AV (2005) Ant colony system for a dynamic vehicle routing problem. J Comb Optim 10:327–343

  Article  MathSciNet  MATH  Google Scholar 

• Moscato P, Cotta C (2003) A gentle introduction to memetic algorithms. In: Glover F, Kochenberger G (eds) Handbook of metaheuristics. Kluwer Academic, Boston, pp 105–144

  Google Scholar 

• Oja M, Kaski S, Kohonen T (2003) Bibliography of self-organizing map (SOM) papers: 1998–2001 addendum. Neural Comput Surv 3:1–156

  Google Scholar 

• Reinelt G (1991) TSPLIB-A traveling salesman problem library. ORSA J Comput 3:376–384

  Article  MATH  Google Scholar 

• Taillard E (1994) Parallel iterative search methods for vehicle-routing problems. Networks 23:661–673

  Article  Google Scholar 

• Zeddini B, Temani M, Yassine A, Ghedira K (2008) An agent-oriented approach for the dynamic vehicle routing problem. In: International workshop on advanced information systems for enterprises. IEEE Comput Soc, Los Alamitos. doi:10.1109/IWAISE

  Google Scholar 

Download references