Coupling ant colony systems with strong local searches

European Journal of Operational Research

Volumn 220, Issue 3, 2012, Pages 831-843

  Gambardella, L M ^a   Montemanni, R ^a   Weyland, D ^a  

^a DALLE MOLLE INSTITUTE FOR ARTIFICIAL INTELLIGENCE IDSIA   (Switzerland)

Author keywords

Ant colony optimization; Combinatorial optimization; Metaheuristics; Probabilistic traveling salesman problems; Sequential ordering problems; Team orienteering problems

Indexed keywords

ANT COLONY OPTIMIZATION (ACO); META HEURISTICS; ORIENTEERING PROBLEM; PROBABILISTIC TRAVELING SALESMAN PROBLEM; SEQUENTIAL ORDERING;

ALGORITHMS; TRAVELING SALESMAN PROBLEM;

COMBINATORIAL OPTIMIZATION;

EID: 84859751410     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2012.02.038     Document Type: Article

References (71)

1. D. Anghinolfi, R. Montemanni, M. Paolucci, L.M. Gambardella, A particle swarm optimization approach for the sequential ordering problem, in: Proceedings of the VIII Metaheuristic International Conference (MIC 2009), 2009.
2. D. Anghinolfi, R. Montemanni, M. Paolucci, and L.M. Gambardella A hybrid particle swarm optimization approach for the sequential ordering problem Computers and Operations Research 38 7 2011 1076 1085
3. C. Archetti, A. Hertz, and M.G. Speranza Metaheuristics for the team orienteering problem Journal of Heuristics 13 2007 49 76
4. N. Ascheuer, Hamiltonian path problems in the on-line optimization of flexible manufacturing systems, PhD thesis, Technische Universität Berlin, 1995.
5. N. Ascheuer, L.F. Escudero, M. Grötschel, and M. Stoer A cutting plane approach to the sequential ordering problem (with applications to job scheduling in manufacturing) SIAM Journal on Optimization 3 1993 25 42
6. P. Balaprakash, M. Birattari, T. Stützle, and M. Dorigo Adaptive sample size and importance sampling in estimation-based local search for the probabilistic traveling salesman problem European Journal of Operational Research 199 2009 98 110
7. P. Balaprakash, M. Birattari, T. Stützle, Z. Yuan, and M. Dorigo Estimation-based ant colony optimization and local search for the probabilistic traveling salesman problem Swarm Intelligence 3 3 2009 223 242
8. E. Balas, M. Fischetti, and W.R. Pulleyblank The precedence-constrained asymmetric traveling salesman polytope Mathematical Programming 65 1995 241 265
9. J.L. Bentley Fast algorithms for geometric traveling salesman problems ORSA Journal on Computing 4 1992 387 411
10. L. Bianchi, L.M. Gambardella, and M. Dorigo Solving the homogeneous probabilistic traveling salesman problem by the ACO metaheuristic Lecture Notes in Computer Science 2002 176 187
11. L. Bianchi, L.M. Gambardella, and M. Dorigo An ant colony optimization approach to the probabilistic traveling salesman problem Lecture Notes in Computer Science 2003 883 892
12. M. Birattari, P. Balaprakash, T. Stützle, and M. Dorigo Estimation-based local search for stochastic combinatorial optimization using delta evaluations: a case study on the probabilistic traveling salesman problem INFORMS Journal on Computing 20 4 2008 644 658
13. S. Boussier, D. Feillet, and M. Gendreau An exact algorithm for team orienteering problems 4OR 5 3 2007 211 230
14. J. Branke, and M. Guntsch Solving the probabilistic TSP with ant colony optimization Journal of Mathematical Modelling and Algorithms 3 4 2004 403 425
15. S. Butt, and D. Ryan A heuristic for the multiple path maximum collection problem Computers and Operations Research 26 1999 427 441
16. S.E. Butt, and T.M. Cavalier A heuristic for the multiple path maximum collection problem Computers and Operations Research 21 1994 101 111
17. A.M. Campbell Aggregation for the probabilistic traveling salesman problem Computers and Operations Research 33 9 2006 2703 2724
18. I-M. Chao, B.L. Golden, and E.A. Wasil A fast and effective heuristic for the orienteering problem European Journal of Operational Research 88 1996 475 489
19. I-M. Chao, B.L. Golden, and E.A. Wasil The team orienteering problem European Journal of Operational Research 88 1996 464 474
20. S. Chen, S. Smith, Commonality and genetic algorithms, Technical Report CMU-RI-TR-96-27, The Robotic Institute, Carnagie Mellon University, 1996.
21. A. Colorni, M. Dorigo, V. Maniezzo, Distributed optimization by ant colonies, in: Proceeding of ECAL - European Conference on Artificial Life, 1991, pp. 134-142.
22. M. Dorigo, and C. Blum Ant colony optimization theory: a survey Theoretical Computer Science 344 2005 243 278
23. M. Dorigo, G. Di Caro, and L.M. Gambardella Ant algorithms for discrete optimization Artificial Life 5 1999 137 172
24. M. Dorigo, V. Maniezzo, and A. Colorni The ant system: optimization by a colony of cooperating agents IEEE Transactions on Systems, Man, and Cybernetics - Part B: Cybernetics 26 1 1996 29 41
25. L.F. Escudero An inexact algorithm for the sequential ordering problem European Journal of Operational Research 37 1988 232 253
26. L.F. Escudero, M. Guignard, and K. Malik A Lagrangian relax-and-cut approach for the sequential ordering problem with precedence relationships Annals of Operations Research 50 1994 219 237
27. M. Fischetti, J.J. Salazar-González, and P. Toth Solving the orienteering problem through branch-and-cut INFORMS Journal on Computing 20 1998 133 148
28. L.M. Gambardella, and M. Dorigo An ant colony system hybridized with a new local search for the sequential ordering problem INFORMS Journal on Computing 12 3 2000 237 255
29. L.M. Gambardella, É. Taillard, and G. Agazzi MACS-VRPTW: a multiple ant colony system for vehicle routing problems with time windows D. Corne, New Ideas in Optimization 1999 McGraw-Hill London, UK 63 76
30. M. Gendreau, G. Laporte, and R. Seguin An exact algorithm for the vehicle routing problem with stochastic demands and customers Transportation Science 29 2 1995 143
31. M. Gendreau, G. Laporte, and R. Seguin A tabu search heuristic for the vehicle routing problem with stochastic demands and customers Operations Research 1996 469 477
32. M. Gendreau, G. Laporte, and R. Seguin Stochastic vehicle routing European Journal of Operational Research 88 1 1996 3 12
33. M. Gendreau, G. Laporte, and F. Semet The selective traveling salesman problem Networks 32 1998 263 273
34. B.L. Golden, L. Levy, and R. Vohra The orienteering problem Naval Research Logistics 34 1987 307 318
35. B.L. Golden, Q. Wang, and L. Liu A multifaceted heuristic for the orienteering problem Naval Research Logistics 35 1987 359 366
36. F. Guerriero, and M. Mancini A cooperative parallel rollout algorithm for the sequential ordering problem Parallel Computing 29 5 2003 663 677
37. R. Hall, and M. Racer Transportation with common carrier and private fleet: system assignment and shipment frequency optimization IIE Transactions 21 1995 217 225
38. I.T. Hernàdvölgyi, Solving the sequential ordering problem with automatically generated lower bounds, in: Proceedings of Operations Research 2003, pp. 355-362.
39. I.T. Hernàdvölgyi, Automatically Generated Lower Bounds for Search, PhD thesis, University of Ottawa, 2004.
40. S. Irnich A unified modeling and solution framework for vehicle routing and local search-based metaheuristics INFORMS Journal on Computing 20 2 2008 270 287
41. P. Jaillet, Probabilistic traveling salesman problems, PhD thesis, MIT, Dept. of Civil Engineering, 1985.
42. D.S. Johnson, and L.A. McGeoch The traveling salesman problem: a case study in local optimization Local Search in Combinatorial Optimization 1997 215 310
43. M. Kantor, and M. Rosenwein The orienteering problem with time windows Journal of the Operational Research Society 43 6 1992 629 635
44. S. Kataoka, T. Yamada, and S. Morito Minimum directed 1-subtree relaxation for score orienteering problem European Journal of Operational Research 104 1998 139 153
45. L. Ke, C. Archetti, and Z. Feng Ants can solve the team orienteering problem Computers and Industrial Engineering 54 2008 49 76
46. T. Kötzing, F. Neumann, H. Röglin, C. Witt, Theoretical properties of two ACO approaches for the traveling salesman problem, in: Proceedings of the 7th ANTS Conference, 2010, pp. 324-335.
47. E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, and D.B. Shmoys The Traveling Salesman Problem 1985 Wiley Chichester
48. A.C. Leifer, and M.B. Rosenwein Strong linear programming relaxations for the orienteering problem European Journal of Operational Research 73 1989 517 523
49. R. Mansini, M. Pelizzari, R. Wolfler Calvo, A granular variable neighborhood search heuristics for the tour orienteering problem with time windows, Technical Report 2008-02-52, Dipartimento di Elettronica per l'Automazione, Universitá di Brescia, 2008.
50. O. Martin, and S. Otto Combining simulated annealing with local search heuristics Annals of Operations Research 63 1996 57 75 doi: 10.1007/BF02601639
51. N. Monmarché, F. Guinand, and P. Siarry Artificial Ants 2010 John Wiley & Sons
52. R. Montemanni, and L.M. Gambardella An ant colony system for team orienteering problems with time windows Foundations of Computing and Decision Sciences 34 4 2009 287 306
53. R. Montemanni, D.H. Smith, L.M. Gambardella, Ant colony systems for large sequential ordering problems, in: Proceedings of IEEE Swarm Intelligence Symposium, 2007.
54. R. Montemanni, D.H. Smith, and L.M. Gambardella A heuristic manipulation technique for the sequential ordering problem Computers and Operations Research 35 12 2008 3931 3944
55. R. Montemanni, D.H. Smith, A.E. Rizzoli, and L.M. Gambardella Sequential ordering problems for crane scheduling in port terminals International Journal of Simulation and Process Modelling 5 4 2009 348 361
56. W. Pullyblank, M. Timlin, Precedence constrained routing and helicopter scheduling: heuristic design, Technical Report RC17154 (#76032), IBM T.J. Watson Research Center, 1991.
57. G. Reinelt The Traveling Salesman: Computational Solutions for TSP Applications 1994 Springer-Verlag Berlin
58. M.G.C. Resende, and C.C. Ribeiro Grasp with path-relinking: recent advances and applications Metaheuristics: Progress as Real Problem Solvers 2005 Springer 29 63
59. M.G.C. Resende, C.C. Ribeiro, F. Glover, and R. Martì Scatter search and path-relinking: fundamentals, advances, and applications Handbook of Metaheuristics 2010 Springer 87 107
60. G. Righini, and M. Salani Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming Computers and Operations Research 36 4 2009 1191 1203
61. M.W.P. Savelsbergh An efficient implementation of local search algorithms for constrained routing problems European Journal of Operational Research 47 1990 75 85
62. D.-I. Seo, B.R. Moon, A hybrid genetic algorithm based on complete graph representation for the sequential ordering problem, in: Proceedings of GECCO 2003, pp. 69-680.
63. W. Souffriau, P. Vansteenwegen, G. Vanden Berghe, and D. Van Oudheusden A path relinking approach for the team orienteering problem Computers and Operations Research 37 11 2010 1853 1859
64. É. Taillard, P. Badeau, M. Gendreau, F. Guertin, and J.-Y. Potvin A tabu search heuristic for the vehicle routing problem with soft time windows Transportation Science 31 1997 170 186
65. H. Tang, and E. Miller-Hooks A tabu search heuristic for the team orienteering problem Computers and Operations Research 32 2005 1379 1407
66. F. Tricoire, M. Romauch, K.F. Doerner, R.F. Hartl, Addendum to the paper "Heuristics for the multi-period orienteering problem with multiple time windows, November 2010 < http://prolog.univie.ac.at/research/op/ >.
67. F. Tricoire, M. Romauch, K.F. Doerner, and R.F. Hartl Heuristics for the multi-period orienteering problem with multiple time windows Computers and Operations Research 37 2 2010 351 367
68. P. Vansteenwegen, W. Souffriau, G. Vanden Berghe, and D. Van Oudheusden Iterated local search for the team orienteering problem with time windows Computers and Operations Research 36 12 2009 3281 3290
69. P. Vansteenwegen, W. Souffriau, and D. Van Oudheusden The orienteering problem: a survey European Journal of Operational Research 209 1 2011 1 10
70. D. Weyland, L. Bianchi, L.M. Gambardella, New approximation-based local search algorithms for the probabilistic traveling salesman problem, in: Proceedings of the 12th International Conference on Computer Aided Systems Theory, 2009.
71. D. Weyland, L. Bianchi, L.M. Gambardella, New heuristics for the probabilistic traveling salesman problem, in: Proceedings of the VIII Metaheuristic International Conference (MIC 2009), 2009.