Hybridation de programmation linéaire et de programmation par contraintes pour le problème de déplacement de conteneurs

Abstract : The containers in a bay are stored in a given number of (possibly empty) stacks. Only the topmost container of a stack can be picked up. It can then be either retrieved from the bay or relocated on the top of any other stack which has not yet reached the maximum height allowed. The problem is to retrieve all containers from a bay in a given sequence with a minimum number of relocations. We address the variant where, at each step of the sequence, only the containers on top of the next container to retrieve are allowed to be relocated. We present an hybrid Constraint Programming/Integer Linear Programming approach.
Document type :
Conference papers
Complete list of metadatas

Cited literature [4 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01109049
Contributor : Sophie Demassey <>
Submitted on : Tuesday, January 27, 2015 - 9:48:25 AM
Last modification on : Monday, November 12, 2018 - 11:04:21 AM
Long-term archiving on : Tuesday, April 28, 2015 - 10:06:01 AM

File

demassey15roadef.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01109049, version 1

Citation

Sophie Demassey, Dominique Feillet. Hybridation de programmation linéaire et de programmation par contraintes pour le problème de déplacement de conteneurs. ROADEF'15 - 16ème congrès annuel de la Société française de Recherche Opérationnelle et d'Aide à la Décision, Feb 2015, Marseille, France. ⟨hal-01109049⟩

Share

Metrics

Record views

420

Files downloads

213