Soft car sequencing with colors: Lower bounds and optimality proofs

European Journal of Operational Research

Volumn 191, Issue 3, 2008, Pages 957-971

  Benoist, Thierry ^a  

^a Bouygues Telecom   (France)

Author keywords

Car sequencing; Dynamic programming; Linear programming; Local search

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; DYNAMIC PROGRAMMING; HEURISTIC METHODS; LINEAR PROGRAMMING; POLYNOMIAL APPROXIMATION;

CAR SEQUENCING; LOCAL SEARCH; SIMPLE RATIO CONSTRAINTS;

PROBLEM SOLVING;

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

References (12)

1. Bartholdi J.J., Orlin J.B., and Ratliff H.D. Cyclic scheduling via integer programs with circular ones. Operations Research 28 (1980) 110-118
2. Benoist T., and Rottembourg B. Upper bounds for revenue maximization in a satellite scheduling problem. 4OR: A Quarterly Journal of Operations Research 2 3 (2004) 235-249
3. Danna E., Rothberg E., and Le Pape C. Exploring relaxation induced neighborhoods to improve MIP solutions. Mathematical Programming 102 1 (2005) 71-90
4. Dincbas, M., Simonis, H., van Hentenryck, P., 1988. Solving the car-sequencing problem in constraint logic programming. In: Kodratoff, Y., (Ed.), Proceedings of the ECAI-88, pp. 290-295.
5. Estellon, B., Gardi, F., Nouioua, K., 2005. Ordonnancement de véhicules: une approche par recherche locale à grand voisinage. In: Journées Françaises de Programmation par Contraintes, Angers.
6. Gent, I., 1998. Two results on car-sequencing problems. APES Report APES-02-1998: April 1998. .
7. Glover F. Future paths for integer programming and links to artificial intelligence. Computers and Operations Research 13 (1986) 533-549
8. Glover F., Laguna M., and Martl R. Fundamentals of scatter search and path relinking. Control and Cybernetics 39 (2000) 653-684
9. 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 56 (2005) 1287-1295
10. Puchta M., and Gottlieb J. Solving car sequencing problems by local optimization. Applications of Evolutionary Computing. LNCS vol. 2279 (2002), Springer-Verlag 132-142
11. Ribeiro, C., Aloise, D., Noronha, T., Rocha, C., Urrutia, S., 2005. A heuristic for a real-life car sequencing problem with multiple requirements. In: MIC 2005, Vienna.
12. Solnon C. Solving permutation constraint satisfaction problems with artificial ants. Proceedings of 14th European Conference on Artificial Intelligence (ECAI 2000) (2000), IOS Press 118-122