Honey Bees Mating Optimization for the Location Routing Problem

IEMC-Europe 2008 - 2008 IEEE International Engineering Management Conference, Europe: Managing Engineering, Technology and Innovation for Growth

Volumn , Issue , 2008, Pages

  Marinakis, Yannis ^a   Marinaki, Magdalene ^a   Matsatsinis, Nikolaos ^a  

^a TECHNICAL UNIVERSITY OF CRETE   (Greece)

Author keywords

Expanding Neighborhood Search; Honey Bees Mating Optimization; Location Routing Problem; MPNS GRASP

Indexed keywords

ADAPTIVE ALGORITHMS; ALGORITHMS; BOOLEAN FUNCTIONS; INNOVATION; ROUTING ALGORITHMS; SUPPLY CHAIN MANAGEMENT; SUPPLY CHAINS; TECHNOLOGICAL FORECASTING;

EXPANDING NEIGHBORHOOD SEARCH; HONEY BEES MATING OPTIMIZATION; LOCATION ROUTING PROBLEM; MPNS-GRASP;

OPTIMIZATION;

EID: 53149154508     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IEMCE.2008.4618013     Document Type: Conference Paper

References (26)

1. H. A. Abbass, "A monogenous MBO approach to satisfiability," in Proceedings of the International Conference on Computational Intelligence for Modelling, Control and Automation, CIMCA'2001, Las Vegas, NV, USA, 2001.
2. H. A. Abbass, "Marriage in honey-bee optimization (MBO): a haplometrosis polygynous swarming approach," in The Congress on Evolutionary Computation, CEC2001, Seoul, Korea, pp. 207-214, May 2001.
3. A. Afshar, O. Bozog Haddad, M. A. Marino, and B. J. Adams, "Honeybee mating optimization (HBMO) algorithm for optimal reservoir operation," Journal of the Franklin Institute, vol. 344, pp. 452-462, 2007.
4. S. Barreto, C. Ferreira, J. Paixao, and B. S. Santos, "Using clustering analysis in a capacitated location-routing problem," European Journal of Operational Research, vol. 179, no. 3, pp. 968-977, 2007.
5. N. Christofides, and S. Eilon, "An algorithm for the vehicle dispatching problem," Operational Research Quarterly, vol. 20, pp. 309-318, 1969.
6. D. Dasgupta, (Ed.), Artificial Immune Systems and their Application, Springer, Heidelberg, 1998.
7. M. Daskin, Network and Discrete Location. Models, Algorithms and Applications, John Wiley and Sons, New York, 1995.
8. M. Dorigo, and T. Stützle, Ant Colony Optimization, A Bradford Book, The MIT Press Cambridge, Massachusetts, London, England, 2004.
9. M Fathian, B. Amiri, A. Maroosi, "Application of honey bee mating optimization algorithm on clustering," Applied Mathematics and Computation, Doi:10.1016/j.amc.2007.02.029, 2007.
10. T. A. Feo, and M. G. C. Resende, "Greedy Randomized Adaptive Search Procedure," Journal of Global Optimization, vol. 6, pp. 109-133, 1995.
11. T. J. Gaskell, "Bases for Vehicle Fleet Scheduling," Operational Research Quarterly, vol. 18, pp. 281-295, 1967.
12. O. B. Haddad, A. Afshar, and M. A. Marino, "Honey-bees mating optimization (HBMO) algorithm: A new heuristic approach for water resources optimization," Water Resources Management, vol. 20, pp. 661-680, 2006.
13. J. Kennedy, and R. Eberhart, "Particle swarm optimization," in Proceedings of 1995 IEEE International Conference on Neural Networks, vol. 4, pp. 1942-1948, 1995.
14. O. B. G. Madsen, "Methods for solving combined two level location routing problems of realistic dimension," European Journal of Operational Research, vol. 12, no. 3, pp. 295-301, 1983.
15. Y. Marinakis, and M. Marinaki, "A particle swarm optimization algorithm with path relinking for the location routing problem", Journal of Mathematical Modelling and Algorithms, 7, 1, pp. 59-78, 2008.
16. Y. Marinakis, and M. Marinaki, "A bilevel genetic algorithm for a real life location routing problem," International Journal of Logistics: Research and Applications, vol. 11, no. 1, pp. 49-65, 2008.
17. Y. Marinakis, M. Marinaki, and G. Dounias, "Honey bees optimization algorithm for the vehicle routing problem", Nature Inspired Cooperative Strategies for Optimization - NICSO 2007, Studies in Computational Intelligence, N. Krasnogor, G. Nicosia, M. Pavone, and D. Pelta (Eds.), Springer-Verlag, Berlin, 2007, in print.
18. Y. Marinakis, A. Migdalas, and P.M. Pardalos, "Expanding neighborhood GRASP for the traveling salesman problem," Computational Optimization and Applications, vol. 32, pp. 231-257, 2005.
19. Y. Marinakis, A. Migdalas, and P. M. Pardalos, "A hybrid genetic-GRASP algorithm using langrangean relaxation for the traveling salesman problem," Journal of Combinatorial Optimization, vol. 10, pp. 311-326, 2005.
20. Y. Marinakis, A. Migdalas, and P. M. Pardalos, "Multiple phase neighborhood search GRASP based on lagrangean relaxation, random backtracking Lin-Kernighan and path relinking for the traveling salesman problem", Journal of Combinatorial Optimization, DOI: 10.1007/s10878-007-9104-2, 2007.
21. H. Min, V. Jayaraman, and R. Srivastava, "Combined location-routing problems: A synthesis and future research directions," European Journal of Operational Research, vol. 108, pp. 1-15, 1998.
22. G. Nagy, and S. Salhi, "Location-routing: Issues, models and methods," European Journal of Operational Research, vol. 177, pp. 649-672, 2007.
23. Or, I., Traveling Salesman-Type Combinatorial Problems and their Relation to the Logistics of Regional Blood Banking. Ph. D. Thesis, Department of Industrial Engineering and Management Sciences, Northwestern University, Evanston, IL, 1976.
24. J. Perl, and M. S. Daskin, "A warehouse location routing model," Transportation Research B, vol. 19, pp. 381-396, 1985.
25. M. G. C. Resende, and C. C. Ribeiro, "Greedy randomized adaptive search procedures," in Handbooks of Metaheuristics, F. Glover, and G. A. Kochenberger, (Eds.), Kluwer Academic Publishers, Dordrecht, pp. 219-249, 2003.
26. Y. Rochat, and E.D. Taillard, "Probabilistic diversification and intensification in local search for vehicle routing," Journal of Heuristics, vol. 1, pp. 147-167, 1995.