Combining two pheromone structures for solving the car sequencing problem with Ant Colony Optimization

European Journal of Operational Research

Volumn 191, Issue 3, 2008, Pages 1043-1055

  Solnon, Christine ^a  

^a UNIVERSITÉ LYON 1   (France)

Author keywords

Ant Colony Optimization; Car sequencing problem; Multiple pheromone structures

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; NUMERICAL METHODS; OPTIMIZATION;

ANT COLONY OPTIMIZATION; CAR SEQUENCING PROBLEM; MULTIPLE PHEROMONE STRUCTURES;

PROBLEM SOLVING;

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

References (41)

1. Bullnheimer B., Hartl R.F., and Strauss C. An improved Ant System algorithm for the vehicle routing problem. Annals of Operations Research 89 (1999) 319-328
2. Chu S.C., Roddick J.F., and Pan J.S. Ant Colony system with communication strategies. Information Sciences 167 (2004) 63-76
3. Dorigo M., Di Caro G., and Gambardella L.M. Ant algorithms for discrete optimization. Artificial Life 5 2 (1999) 137-172
4. Dorigo M., and Di Caro G. The Ant Colony Optimization meta-heuristic. In: Corne D., Dorigo M., and Glover F. (Eds). New Ideas in Optimization (1999), McGraw-Hill, UK 11-32
5. Dorigo M., and Gambardella L.M. Ant Colony system: A cooperative learning approach to the traveling salesman problem. IEEE Transactions on Evolutionary Computation 1 1 (1997) 53-66
6. Dorigo M., Maniezzo V., and Colorni A. Ant System: Optimization by a colony of cooperating agents. IEEE Transactions on Systems, Man, and Cybernetics-Part B: Cybernetics 26 1 (1996) 29-41
7. M. Dorigo, Optimization, learning and natural algorithms, Ph.D. Thesis, Dipartimento di Elettronica, Politecnico di Milano, Italy, 1992 (in Italian).
8. Dorigo M., and Stuetzle T. Ant Colony Optimization (2004), MIT Press
9. M. Dincbas, H. Simonis, P. van Hentenryck, Solving the car-sequencing problem in constraint logic programming, in: Y. Kodratoff (Ed.), Proceedings of ECAI-88, 1988, pp. 290-295.
10. A.J. Davenport, E.P.K. Tsang, Solving constraint satisfaction sequencing problems by iterative repair, in: Proceedings of the First International Conference on the Practical Applications of Constraint Technologies and Logic Programming (PACLP), 1999, pp. 345-357.
11. B. Estellon, F. Gardi, K. Nouioua, Ordonnancement de véhicules: une approche par recherche locale à grand voisinage, in: Actes des premières Journées Francophones de Programmation par Contraintes (JFPC), 2005, pp. 21-28.
12. B. Estellon, F. Gardi, K. Nouioua, Two local search approaches for solving real-life car sequencing problems. European Journal of Operational Research, in press, doi:10.1016/j.ejor.2007.04.043.
13. Gravel M., Gagné C., and Price W.L. Review and comparison of three methods for the solution of the car-sequencing problem. Journal of the Operational Research Society (2004)
14. Gottlieb J., Puchta M., and Solnon C. A study of greedy, local search and Ant Colony Optimization approaches for car sequencing problems. Applications of Evolutionary Computing. LNCS vol. 2611 (2003), Springer 246-257
15. Gambardella L.M., Taillard E.D., and Agazzi G. MACS-VRPTW: A multiple Ant Colony system for vehicle routing problems with time windows. In: Corne D., Dorigo M., and Glover F. (Eds). New Ideas in Optimization (1999), McGraw-Hill, London, UK 63-76
16. Gambardella L.M., Taillard E., and Dorigo M. Ant colonies for the quadratic assignment problem. Journal of the Operational Research Society 50 (1999) 167-176
17. I.P. Gent, T. Walsh, Csplib: A benchmark library for constraints, Technical report, APES-09-1999, 1999. Available from: . A shorter version appears in CP99.
18. Iredi S., Merkle D., and Middendorf M. Bi-criterion optimization with multi-colony ant algorithms. First International Conference on Evolutionary Multi-Criterion Optimization. Lecture Notes in Computer Science vol. 1993 (2001), Springer 359-372
19. T. Jones, S. Forrest, Fitness distance correlation as a measure of problem difficulty for genetic algorithms, in: Proceedings of International Conference on Genetic Algorithms, Morgan Kaufmann, Sydney, Australia, 1995, pp. 184-192.
20. Kis T. On the complexity of the car sequencing problem. Operations Research Letters 32 (2004) 331-335
21. J.H.M. Lee, H.F. Leung, H.W. Won, Performance of a comprehensive and efficient constraint library using local search, in: 11th Australian JCAI, LNAI, Springer-Verlag, 1998.
22. Maniezzo V., and Colorni A. The Ant System applied to the quadratic assignment problem. IEEE Transactions on Data and Knowledge Engineering 11 5 (1999) 769-778
23. Merz P., and Freisleben B. Fitness landscapes and memetic algorithm design. In: Corne D., Dorigo M., and Glover F. (Eds). New Ideas in Optimization (1999), McGraw-Hill, UK 245-260
24. Michel L., and Van Hentenryck P. A constraint-based architecture for local search. OOPSLA '02: Proceedings of the 17th ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications (2002), ACM Press, New York, NY, USA 83-100
25. Montgomery J., and Randall M. Ant-pheromones as a tool for better exploration of search space. Third International Workshop on Ants Algorithms (ANTS'2002). Lecture Notes in Computer Science vol. 2463 (2002), Springer 100-110
26. Middendorf M., Reischle F., and Schmeck H. Multi colony ant algorithms. Journal of Heuristics 8 3 (2002) 305-320
27. A. Nguyen, V.-D. Cung, Le problème du car sequencing renault et le challenge roadef'2005, in: Premières Journées Francophones de Programmation par Contraintes (JFPC 2005), 2005, pp. 3-10.
28. Neveu B., Trombettoni G., and Glover F. Id walk: A candidate list strategy with a simple diversification device. Proceedings of CP'2004. LNCS vol. 3258 (2004), Springer-Verlag 423-437
29. Puchta M., and Gottlieb J. Solving car sequencing problems by local optimization. Applications of Evolutionary Computing (EvoCOP 2002). LNCS vol. 2279 (2002), Springer 132-142
30. Perron L., and Shaw P. Combining forces to solve the car sequencing problem. Proceedings of CP-AI-OR'2004. LNCS vol. 3011 (2004), Springer 225-239
31. J.-C. Regin, J.-F. Puget, A filtering algorithm for global sequencing constraints, in: CP97, LNCS, vol. 1330, Springer-Verlag, 1997, pp. 32-46.
32. C. Solnon, V.-D. Cung, A. Nguyen, C. Artigues, Editorial: The car sequencing problem: Overview of state-of-the-art methods and industrial case-study of the roadef'2005 challenge problem, European Journal of Operational Research, in press, doi:10.1016/j.ejor.2007.04.033.
33. Solnon C., and Fenet S. A study of ACO capabilities for solving the maximum clique problem. Journal of Heuristics 12 3 (2006) 155-180
34. Stützle T., and Hoos H.H. MAX-MIN Ant System. Journal of Future Generation Computer Systems, special issue on Ant Algorithms 16 (2000) 889-914
35. Solnon C. Solving permutation constraint satisfaction problems with artificial ants. Proceedings of ECAI'2000 (2000), IOS Press, Amsterdam, The Netherlands 118-122
36. Solnon C. Ants can solve constraint satisfaction problems. IEEE Transactions on Evolutionary Computation 6 4 (2002) 347-357
37. Solnon C. Boosting ACO with a preprocessing step. Applications of Evolutionary Computing, Proceedings of EvoWorkshops2002: EvoCOP, EvoIASP, EvoSTim. LNCS vol. 2279 (2002), Springer-Verlag 161-170
38. Sammoud O., Solnon C., and Ghédira K. Ant algorithm for the graph matching problem. 5th European Confernce on Evolutionary Computation in Combinatorial Optimization (EvoCOP 2005). LNCS vol. 3448 (2005), Springer-Verlag 213-223
39. Sammoud O., Sorlin S., Solnon C., and Ghédira K. A comparative study of Ant Colony Optimization and reactive search for graph matching problems. In: Raidl G., and Gottlieb J. (Eds). LNCS vol. 3906 (2006) 234-246
40. Tsang E.P.K. Foundations of Constraint Satisfaction (1993), Academic Press, London, UK
41. Warwick T., and Tsang E. Tackling car sequencing problems using a genetic algorithm. Journal of Evolutionary Computation-MIT Press 3 3 (1995) 267-298