A hybrid honey bees mating optimization algorithm for the probabilistic traveling salesman problem

2009 IEEE Congress on Evolutionary Computation, CEC 2009

Volumn , Issue , 2009, Pages 1762-1769

  Marinakis, Yannis ^a   Marinaki, Magdalene ^a  

^a TECHNICAL UNIVERSITY OF CRETE   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

ANT COLONY OPTIMIZATION ALGORITHMS; BENCH-MARK PROBLEMS; CROSSOVER OPERATOR; GREEDY RANDOMIZED ADAPTIVE SEARCH PROCEDURE; HONEY BEE; NEIGHBORHOOD SEARCH; OPTIMIZATION ALGORITHMS; PARTICLE SWARM OPTIMIZATION ALGORITHM; PROBABILISTIC TRAVELING SALESMAN PROBLEM; ROUTING PROBLEMS; TABU SEARCH ALGORITHMS;

CONSTRAINED OPTIMIZATION; LEARNING ALGORITHMS; MATHEMATICAL OPERATORS; PARTICLE SWARM OPTIMIZATION (PSO); PROBLEM SOLVING; TABU SEARCH;

TRAVELING SALESMAN PROBLEM;

EID: 70449922695     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CEC.2009.4983154     Document Type: Conference Paper

References (39)

1. H. A. Abbass, "A monogenous MBO approach to satisfiability", Proc. 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", Proc. The Congress on Evolutionary Computation (CEC2001), Seoul, Korea, May 2001, pp. 207-214, 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. D. J. Bertsimas, Probabilistic Combinatorial Optimization Problems. Ph.D. thesis, MIT, Cambridge, MA, USA, 1988.
5. D. J. Bertsimas and L. Howell, "Further results on the probabilistic traveling salesman problem", European Journal of Operational Research, vol.65(1), pp. 68-95, 1993.
6. D. J. Bertsimas, P. Chervi and M. Peterson, "Computational approaches to stochastic vehicle routing problems", Transportation Science, vol.29(4), pp. 342-352, 1995.
7. L. Bianchi, Ant Colony Optimization and Local Search for the Probabilistic Traveling Salesman Problem: A Case Study in Stochastic Combinatorial Optimization. Ph. D. Thesis, Universite Libre de Bruxelles, Belgium, 2006.
8. L. Bianchi, J. Knowles and N. Bowler, "Local search for the probabilistic traveling salesman problem: correction to the 2-p-opt and 1-shift algorithms", European Journal of Operational Research, vol.162(1), pp. 206-219, 2005.
9. L. Bianchi, L. M. Gambardella and M. Dorigo, "An ant colony optimization approach to the probabilistic traveling salesman problem". in Proc. Seventh Parallel Problem Solving from Nature (PPSN VII), Lecture Notes in Computer Science, Edited by J. J. Merelo Guervòs, P. Adamidis, H. G. Beyer, J. L. Ferńandez-Villacañas and H. P. Schwefel, vol.2439, Berlin: Springer, pp. 883-892, 2002.
10. L. Bianchi, L. M. Gambardella and M. Dorigo, "Solving the homogeneous probabilistic traveling salesman problem by the ACO metaheuristic". in Proc. Third International Workshop ANTS 2002, Lecture Notes in Computer Science, Edited by M. Dorigo, G. DiCaro and M. Sampels, vol.2463, Berlin: Springer, pp. 176-187, 2002.
11. N. E. Bowler, T. M. A. Fink and R. C. Ball, "Characterization of the probabilistic traveling salesman problem", Physical Review E, vol.68(2), pp. 036703-1-036703-7, 2003.
12. J. Branke and M. Guntsch, "Solving the probabilistic TSP with ant colony optimization". Journal of Mathematical Modelling and Algorithms, vol.3(4), pp. 403-425, 2004. (Pubitemid 40317585)
13. A. M. Campbell, "Aggregation for the probabilistic travelling salesman problem", Computers and Operations Research, vol.33, pp. 2703-2724, 2006.
14. J. Choi, J. H. Lee and M. J. Realff, "An algorithmic framework for improving heuristic solutions: Part II. A new version of the stochastic traveling salesman problem", Computers and Chemical Engineering, vol.28 (8), pp. 1297-1307, 2004. (Pubitemid 38609083)
15. M. Dorigo and T. Stutzle, Ant Colony Optimization, A Bradford Book, The MIT Press Cambridge, Massachusetts, London, England, 2004.
16. M. Fathian, B. Amiri and A. Maroosi, "Application of Honey Bee Mating Optimization Algorithm on Clustering", Applied Mathematics and Computation, vol.190, pp. 1502-1513, 2007.
17. T. A. Feo and M. G. C. Resende "Greedy randomized adaptive search procedure", Journal of Global Optimization, vol.6, pp. 109-133, 1995.
18. R. Garfinkel and G. Nemhauser, Integer Programming, Wiley and Sons, 1972.
19. F. Glover, "Tabu search I", ORSA Journal on Computing, vol.1 (3), pp. 190-206, 1989.
20. F. Glover, "Tabu search II", ORSA Journal on Computing, vol.2 (1), pp. 4-32, 1990.
21. O. B. Haddad, A. Afshar and M. A. Marino, "Honey-Bees Mating Optimization (HBMO) Algorithm: A New Heuristic Approach forWater Resources Optimization", Water Resources Management, vol.20, pp. 661-680, 2006.
22. P. Hansen and N. Mladenovic, "Variable neighborhood search: Principles and applications", European Journal of Operational Research, vol.130, pp. 449-467, 2001.
23. P. Jaillet, Probabilistic Traveling Salesman Problems. PhD Thesis, MIT, Cambridge, MA, USA, 1985.
24. P. Jaillet and A. R. Odoni, "The probabilistic vehicle routing problem", in Vehicle Routing: Methods and Studies, Edited by B. L. Golden and A. A. Assad, Elsevier Science Publishers B. V. North Holland, pp. 293- 318, 1988.
25. P. Jaillet, "A priori solution of a traveling salesman problem in which a random subset of the customers are visited", Operations Research, vol.36(6), pp. 929-936, 1988.
26. J. Kennedy and R. Eberhart, "Particle swarm optimization". In: Proc. IEEE International Conference on Neural Networks, vol.4, pp. 1942- 1948, 1995.
27. J. Kennedy, R. Eberhart and Y. Shi, Swarm Intelligence, Morgan Kaufmann Publisher, San Francisco, 2001.
28. H. H. Laidlaw and R. E. Page, "Mating designs", in Bee Genetics and Breeding, Edited by T. E. Rinderer, Academic Press Inc., NY, pp. 323-341, 1986.
29. G. Laporte, E. Louveaux and H. Mercure, "A priori optimization of the probabilistic traveling salesman problem". Operations Research, vol.42, pp. 543-549, 1994.
30. Y. H. Liu, "A hybrid scatter search for the probabilistic traveling salesman problem". Computers and Operations Research, vol.34, pp. 2949-2963, 2007.
31. Y. H. Liu, R. C. Jou and C. J. Wang, "Genetic algorithms for the probabilistic traveling salesman problem", Proc. Conference on Elogistics, Taoyuan, Taiwan, pp. 77-82, 2004.
32. Y. Marinakis, A. Migdalas, P. M. Pardalos, "Expanding neighborhood GRASP for the traveling salesman problem", Computational Optimization and Applications, 32, 231-257, 2005.
33. Y. Marinakis, A. Migdalas, P. M. Pardalos, "Expanding neighborhood search GRASP for the probabilistic traveling salesman problem", Optimization Letters, vol.2 (3), pp. 351-361, 2007.
34. P. Moscato and C. Cotta, "A Gentle Introduction to Memetic Algorithms", in Handbooks of Metaheuristics, Edited by F. Glover and G.A., Kochenberger, Kluwer Academic Publishers, Dordrecht, pp. 105-144, 2003.
35. W. B. Powell, P. Jaillet and A. Odoni, "Stochastic and dynamic networks and routing", in Network Routing, Handbooks in Operations Research and Management Science, Edited by M. O. Ball, T. L. Magnanti, C. L. Momma and G. L. Nemhauser, Elsevier Science B. V., Amsterdam, vol.8, pp. 141-295, 1995.
36. H. N. Psaraftis, "Dynamic vehicle routing problems", in Vehicle Routing: Methods and Studies, Edited by B. L. Golden and A. A. Assad, Elsevier Science Publishers B. V., North Holland, pp. 223-248, 1988.
37. 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.
38. F.A. Rossi and I. Gavioli, "Aspects of heuristics methods in the probabilistic traveling salesman problem", in Advanced School on Stochastics in Combinatorial Optimization, Edited by G. Andreatta, F. Mason and P. Serafini, World Scientific Press, Singapore, pp. 214-227, 1987.
39. H. Tang and E. Miller-Hooks, "Approximate procedures for the probabilistic traveling salesperson problem", Transportation Research Record, vol.1882, pp. 27-36, 2004.