Solving the Car-Sequencing Problem as a Non-binary CSP

A search algorithm based on non-binary forward checking (nFC) is used to solve the car-sequencing problem. The choice of value ordering heuristics having a dramatic effect on solution time for this problem, different ordering heuristics were implementented. The results obtained by using these methods are compared on the instances reported in the CSPLib.

• Type: Conference
• Year: 2005
• Where: CP
• Authors: Mihaela Butaru, Zineb Habbas
• Keywords: CP 2005, Different Ordering Heuristics, Non-binary Forward Checking, Programming Languages, Value Ordering Heuristics