Future Generation Computer Systems
Performance of a Comprehensive and Efficient Constraint Library Based on Local Search
AI '98 Selected papers from the 11th Australian Joint Conference on Artificial Intelligence on Advanced Topics in Artificial Intelligence
Ant Colony Optimization
Constraint-Based Local Search
A study of greedy, local search, and ant colony optimization approaches for car sequencing problems
EvoWorkshops'03 Proceedings of the 2003 international conference on Applications of evolutionary computing
Encodings of the SEQUENCE constraint
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Revisiting the sequence constraint
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Ants can solve constraint satisfaction problems
IEEE Transactions on Evolutionary Computation
On the complexity of the car sequencing problem
Operations Research Letters
Hybrid metaheuristics in combinatorial optimization: A survey
Applied Soft Computing
Strong combination of ant colony optimization with constraint programming optimization
CPAIOR'10 Proceedings of the 7th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Modeling and solving technical product configuration problems
Artificial Intelligence for Engineering Design, Analysis and Manufacturing
| Hi-index | 0.00 |
We propose to integrate ACO in a Constraint Programming (CP) language. Basically, we use the CP language to describe the problem to solve by means of constraints and we use the CP propagation engine to reduce the search space and check constraint satisfaction; however, the classical backtrack search of CP is replaced by an ACO search. We report first experimental results on the car sequencing problem and compare different pheromone strategies for this problem.