A study of greedy, local search, and ant colony optimization approaches for car sequencing problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2611, Issue , 2003, Pages 246-257

  Gottlieb, Jens ^a   Puchta, Markus ^a   Solnon, Christine ^b  

^a SAP RESEARCH   (Germany)

^b UNIVERSITÉ LYON 1   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; BENCHMARKING; HEURISTIC METHODS; LOCAL SEARCH (OPTIMIZATION); OPTIMIZATION;

ANT COLONY OPTIMIZATION (ACO); CAR SEQUENCING PROBLEM; GREEDY HEURISTICS; HEURISTIC APPROACH; LOCAL SEARCH; SOLUTION QUALITY;

ANT COLONY OPTIMIZATION;

EID: 35248834581     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36605-9_23     Document Type: Article

References (14)

1. A. Davenport and 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, 345-357, 1999
2. A. Davenport, E. Tsang, K. Zhu and C. Wang. GENET: a connectionist architecture for solving constraint satisfaction problems by iterative improvement. In Proceedings of AAAI'94, 325-330, 1994
3. M. Dincbas, H. Simonis and P. van Hentenryck. Solving the car-sequencing problem in constraint logic programming. In Proceedings of ECAI-88, 290-295, 1988
4. M. Dorigo and G. Di Caro. The Ant Colony Optimization Meta-Heuristic. In D. Corne, M. Dorigo, and F. Glover (eds.), New Ideas in Optimization, 11-32, McGraw Hill, UK, 1999
5. I.P. Gent. Two Results on Car-sequencing Problems. Technical report APES. 1998
6. I.P. Gent and T. Walsh. CSPLib: a benchmark library for constraints. Technical report APES-09-1999, available from http://4c.ucc.ie/∼tw/csplib, a shorter version appeared in CP99, 1999
7. J.H.M. Lee, H.F. Leung and H.W. Won. Performance of a Comprehensive and Efficient Constraint Library using Local Search. In Proceedings of 11th Australian Joint Conference on Artificial Intelligence, 191-202, LNAI 1502, Springer, 1998
8. M. Puchta and J. Gottlieb. Solving Car Sequencing Problems by Local Optimization. In Applications of Evolutionary Computing, 132-142, LNCS 2279, Springer, 2002
9. J.-C. Regin and J.-F. Puget. A Filtering Algorithm for Global Sequencing Constraints. In Principles and Practice of Constraint Programming, 32-46, LNCS 1330, Springer, 1997
10. B. Smith. Succeed-first or fail-first: A case study in variable and value ordering heuristics. In Third Conference on the Practical Applications of Constraint Technology, 321-330, 1996
11. C. Solnon. Solving Permutation Constraint Satisfaction Problems with Artificial Ants. In Proceedings of ECAI-2000, 118-122, IOS Press, 2000
12. T. Stützte and H.H. Hoos. MAX-MIN Ant System. Journal of Future Generation Computer Systems, Volume 16, 889-914, 2000
13. E. Tsang. Foundations of Constraint Satisfaction. Academic Press, 1993
14. T. Warwick and E. Tsang. Tackling car sequencing problems using a genetic algorithm. Evolutionary Computation, Volume 3, Number 3, 267-298, 1995