13 search results - page 1 / 3 » Tabu Search for a Car Sequencing Problem |
FLAIRS
2006
13 years 6 months ago
2006
The goal of this paper is to propose a tabu search heuristic for the car sequencing problem (CSP) used for the ROADEF 2005 international Challenge. This NP-hard problem was propos...
IWANN
2009
Springer
13 years 9 months ago
2009
Springer
EOR
2008
13 years 4 months ago
2008
ANOR
2005
13 years 4 months ago
2005
In the paper, two evolutionary approaches to the general DNA sequencing problem, assuming both negative and positive errors in the spectrum, are compared. The older of them is base...
CP
2005
Springer
13 years 10 months ago
2005
Springer
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 solu...