Framework branch-and-price algorithm for yard management problem at container terminals

Ming Liu 1 Lujun Xu 1 Chengbin Chu 1, 2 Feng Chu 3
1 School of Economics and Management
2 LGI - Laboratoire Génie Industriel - EA 2606
3 IBISC - Informatique, Biologie Intégrative et Systèmes Complexes
Abstract : We study a deterministic storage yard management problem which jointly determines storage space allocation and yard crane assignment. The problem is first formulated as an integer grogram to minimize the total operational cost. To solve large-scaled problems, we then transform it to a set partitioning formulation and provide a framework of branch-and-price algorithm. Computational experiments to explain the performance of the solution approach are to be further conducted.
Document type :
Conference papers
Complete list of metadatas
https://hal.archives-ouvertes.fr/hal-01352204
Contributor : Frédéric Davesne <>
Submitted on : Friday, August 5, 2016 - 7:56:14 PM
Last modification on : Tuesday, January 14, 2020 - 12:18:56 PM

Identifiers

Collections

IBISC | IBISC-AROBAS | UNIV-EVRY | LGI | CENTRALESUPELEC | LGI-AD | UNIV-PARIS-SACLAY | LGI-MO

Citation

Ming Liu, Lujun Xu, Chengbin Chu, Feng Chu. Framework branch-and-price algorithm for yard management problem at container terminals. 13th IEEE International Conference on Networking, Sensing and Control (ICNSC 2016), Apr 2016, Mexico City, Mexico. (elec. proc.), ⟨10.1109/ICNSC.2016.7478967⟩. ⟨hal-01352204⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

148

Contact

Informations

CCSD