Honey bees mating optimization algorithm for the vehicle routing problem

Studies in Computational Intelligence

Volumn 129, Issue , 2008, Pages 139-148

  Marinakis, Yannis ^a   Marinaki, Magdalene ^a   Dounias, Georgios ^b  

^a TECHNICAL UNIVERSITY OF CRETE   (Greece)

^b UNIVERSITY OF THE AEGEAN   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 44949219287     PISSN: 1860949X     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-3-540-78987-1_13     Document Type: Article

References (28)

1. Abbass H A (2001) A monogenous MBO approach to satisfiability. In: Proceeding of the International Conference on Computational Intelligence for Modelling, Control and Automation, CIMCA'2001. Las Vegas, NV, USA
2. Abbass H A (2001) Marriage in honey-bee optimization (MBO): A haplometrosis polygynous swarming approach. In: The Congress on Evolutionary Computation (CEC2001). Seoul, Korea, May 2001: 207-214
3. Afshar A, Bozog Haddad O, Marino M A, Adams B J (2007) Honey-bee mating optimization (HBMO) algorithm for optimal reservoir operation. Journal of the Franklin Institute 344: 452-462
4. Baker B M, Ayechew M A (2003) A genetic algorithm for the vehicle routing problem. Computers and Operations Research 30(5): 787-800
5. Berger J, Barkaoui M (2003) A hybrid genetic algorithm for the capacitated vehicle routing problem. In: Proceedings of the Genetic and Evolutionary Computation Conference. Chicago: 646-656
6. Bodin L, Golden B, Assad A, Ball M (1983) The state of the art in the routing and scheduling of vehicles and crews. Computers and Operations Research 10: 63-212
7. Christofides N, Mingozzi A, Toth P (1979) The vehicle routing problem. In: Christofides N, Mingozzi A, Toth P, Sandi C (eds) Combinatorial Optimization. Wiley, Chichester.
8. Dantzig G B, Ramser J H (1959) The Truck Dispatching Problem. Management Science 6(1): 80-91
9. Fathian M, Amiri B, Maroosi A (2007) Application of honey bee mating optimization algorithm on clustering. Applied Mathematics and Computation, doi:10.1016/j.amc.2007.02.029
10. Feo T A, Resende M G C (1995) Greedy randomized adaptive search procedure. Journal of Global Optimization 6: 109-133
11. Gendreau M, Hertz A, Laporte G (1994) A tabu search heuristic for the vehicle routing problem. Management Science 40: 1276-1290
12. Haddad O B, Afshar A, Marino M A (2006) Honey-bees mating optimization (HBMO) algorithm: A new heuristic approach for water resources optimization. Water Resources Management 20: 661-680
13. Marinakis Y, Migdalas A, Pardalos P M (2005) Expanding neighborhood GRASP for the traveling salesman problem. Computational Optimization and Applications 32: 231-257
14. Marinakis Y, Migdalas A, Pardalos P M (2005) A hybrid Genetic-GRASP algortihm using langrangean relaxation for the traveling salesman problem. Journal of Combinatorial Optimization 10: 311-326
15. Marinakis Y, Migdalas A, Pardalos PM(2007) A new bilevel formulation for the vehicle routing problem and a solution method using a genetic algorithm. Journal of Global Optimization 38: 555-580
16. Marinakis Y, Migdalas A, Pardalos P M (2006) Multiple phase neighborhood search GRASP for the vehicle routing problem (submitted to Computational Management Science)
17. Marinakis Y, Marinaki M, Migdalas A (2006) A hybrid Genetic - GRASP - ENS algorithm for the vehicle routing problem (submitted to IEEE Transactions on Evolutionary Computation)
18. Marinakis Y, Marinaki M, Dounias G (2007) Nature Inspired Intelligence for the Supply Chain Management: A Hybrid Particle Swarm Optimization Algorithm for the Vehicle Routing Problem (submitted in Computers and Operations Research)
19. Mester D, Braysy O (2007) Active-guided evolution strategies for large-scale capacitated vehicle routing problems. Computers and Operations Research 34(10): 2964-2975
20. Osman I H (1993) Metastrategy simulated annealing and tabu search algorithms for combinatorial optimization problems. Annals of Operations Research 41: 421-451
21. Prins C (2004) A simple and effective evolutionary algorithm for the vehicle routing problem. Computers and Operations Research 31: 1985-2002
22. Reimann M, Stummer M, Doerner K (2002) A savings based ant system for the vehicle routing problem. In: Proceedings of the Genetic and Evolutionary Computation Conference. New York: 1317-1326
23. Reimann M, Doerner K, Hartl R F (2004) D-Ants: Savings based ants divide and conquer the vehicle routing problem. Computers and Operations Research 31(4): 563-591
24. Resende M G C, Ribeiro C C (2003) Greedy randomized adaptive search procedures. In: Glover F, Kochenberger G A (eds), Handbook of Metaheuristics. Kluwer Academic Publishers, Boston: 219-249
25. Rochat Y, Taillard E D (1995) Probabilistic diversification and intensification in local search for vehicle routing. Journal of Heuristics 1: 147-167
26. Taillard E D (1993) Parallel iterative search methods for vehicle routing problems. Networks 23: 661-672
27. Tarantilis C D (2005) Solving the vehicle routing problem with adaptive memory programming methodology. Computers and Operations Research 32(9): 2309-2327
28. Toth P, Vigo D (2002) The vehicle routing problem. Monographs on Discrete Mathematics and Applications, Siam