IDEAS home Printed from https://ideas.repec.org/p/hal/journl/hal-03005639.html
   My bibliography  Save this paper

Modélisation du problème de l'allocation des planches et des postes à quai dans les ports vraquiers

Author

Listed:
  • Hamza Bouzekri

    (G-SCOP_GCSP - Gestion et Conduite des Systèmes de Production - G-SCOP - Laboratoire des sciences pour la conception, l'optimisation et la production - CNRS - Centre National de la Recherche Scientifique - UGA - Université Grenoble Alpes - Grenoble INP - Institut polytechnique de Grenoble - Grenoble Institute of Technology - UGA - Université Grenoble Alpes)

  • Gülgün Alpan

    (G-SCOP_GCSP - Gestion et Conduite des Systèmes de Production - G-SCOP - Laboratoire des sciences pour la conception, l'optimisation et la production - CNRS - Centre National de la Recherche Scientifique - UGA - Université Grenoble Alpes - Grenoble INP - Institut polytechnique de Grenoble - Grenoble Institute of Technology - UGA - Université Grenoble Alpes)

  • Vincent Giard

    (LAMSADE - Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision - Université Paris Dauphine-PSL - PSL - Université Paris Sciences et Lettres - CNRS - Centre National de la Recherche Scientifique)

Abstract

L'exploitation optimale des ressources portuaires et le respect des clauses des contrats d'affrètement jouent un rôle important dans l'amélioration de la performance de la chaine logistique portuaire. Dans cet article, nous avons intégré le problème tactique de l'allocation des planches avec l'un des plus importants problèmes opérationnels de la gestion portuaire, à savoir le problème de l'allocation des postes à quai. Cette étude est menée dans le contexte des ports vraquiers multiquais dédiés à l'export, en considérant les contraintes liées aux marées qui limitent le départ des grands navires chargés et à l'acheminement des marchandises par convoyeurs depuis les zones de stockages jusqu'aux quais de chargement. Le problème a été modélisé sous forme d'un programme linéaire en nombres entiers où toutes les contraintes liées aux caractéristiques du port et des navires sont formulées sous forme de prédicats, ce qui améliore notablement la performance numérique du modèle. Ce dernier a été testé et validé par une série de tests numériques basés sur des instances inspirées de données réelles du port minéralier de Jorf Lasfar. Les résultats montrent que le modèle proposé peut être utilisé pour résoudre des instances allant jusqu'à 40 navires en des temps de calcul relativement faibles.

Suggested Citation

  • Hamza Bouzekri & Gülgün Alpan & Vincent Giard, 2020. "Modélisation du problème de l'allocation des planches et des postes à quai dans les ports vraquiers," Post-Print hal-03005639, HAL.
  • Handle: RePEc:hal:journl:hal-03005639
    Note: View the original document on HAL open archive server: https://hal.science/hal-03005639
    as

    Download full text from publisher

    File URL: https://hal.science/hal-03005639/document
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Unsal, Ozgur & Oguz, Ceyda, 2019. "An exact algorithm for integrated planning of operations in dry bulk terminals," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 126(C), pages 103-121.
    2. Hamza Bouzekri & Gülgün Alpan & Vincent Giard, 2019. "Integrated Laycan and Berth Allocation Problem," Post-Print hal-02342441, HAL.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Liu, Baoli & Li, Zhi-Chun & Sheng, Dian & Wang, Yadong, 2021. "Integrated planning of berth allocation and vessel sequencing in a seaport with one-way navigation channel," Transportation Research Part B: Methodological, Elsevier, vol. 143(C), pages 23-47.
    2. Tianhao Shao & Weijie Du & Yun Ye & Haoqing Li & Jingxin Dong & Guiyun Liu & Pengjun Zheng, 2024. "A Novel Virtual Arrival Optimization Method for Traffic Organization Scenarios," Sustainability, MDPI, vol. 16(1), pages 1-17, January.
    3. Marcos Wagner Jesus Servare Junior & Helder Roberto de Oliveira Rocha & José Leandro Félix Salles & Sylvain Perron, 2020. "A Linear Relaxation-Based Heuristic for Iron Ore Stockyard Energy Planning," Energies, MDPI, vol. 13(19), pages 1-18, October.
    4. Najat Bara & Frédéric Gautier & Vincent Giard, 2020. "Usage Des Pénalités Dans Les Modèles Économiques De Management Industriel," Post-Print hal-03005697, HAL.
    5. Kong, Lingrui & Ji, Mingjun & Gao, Zhendi, 2022. "An exact algorithm for scheduling tandem quay crane operations in container terminals," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 168(C).
    6. Guo, Zijian & Cao, Zhen & Wang, Wenyuan & Jiang, Ying & Xu, Xinglu & Feng, Peng, 2021. "An integrated model for vessel traffic and deballasting scheduling in coal export terminals," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 152(C).
    7. Cao, Zhen & Wang, Wenyuan & Jiang, Ying & Xu, Xinglu & Xu, Yunzhuo & Guo, Zijian, 2022. "Joint berth allocation and ship loader scheduling under the rotary loading mode in coal export terminals," Transportation Research Part B: Methodological, Elsevier, vol. 162(C), pages 229-260.
    8. Bor-Hong Lin & Hsuan-Shih Lee & Cheng-Chi Chung, 2020. "The Construction and Implication of Group Scale Efficiency Evaluation Model for Bulk Shipping Corporations," Mathematics, MDPI, vol. 8(5), pages 1-13, May.
    9. Mina Roohnavazfar & Seyed Hamid Reza Pasandideh, 2022. "Decomposition algorithm for the multi-trip single vehicle routing problem with AND-type precedence constraints," Operational Research, Springer, vol. 22(4), pages 4253-4285, September.
    10. Sun, Defeng & Meng, Ying & Tang, Lixin & Liu, Jinyin & Huang, Baobin & Yang, Jiefu, 2020. "Storage space allocation problem at inland bulk material stockyard," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 134(C).
    11. Bouzekri, Hamza & Bara, Najat & Alpan, Gülgün & Giard, Vincent, 2022. "An integrated Decision Support System for planning production, storage and bulk port operations in a fertilizer supply chain," International Journal of Production Economics, Elsevier, vol. 252(C).
    12. Qin, Tianbao & Du, Yuquan & Chen, Jiang Hang & Sha, Mei, 2020. "Combining mixed integer programming and constraint programming to solve the integrated scheduling problem of container handling operations of a single vessel," European Journal of Operational Research, Elsevier, vol. 285(3), pages 884-901.
    13. Chen, Sumin & Zeng, Qingcheng & Li, Yantong, 2023. "Integrated operations planning in highly electrified container terminals considering time-of-use tariffs," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 171(C).
    14. Liu, Baoli & Li, Zhi-Chun & Wang, Yadong, 2022. "A two-stage stochastic programming model for seaport berth and channel planning with uncertainties in ship arrival and handling times," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 167(C).
    15. Gleb Belov & Natashia L. Boland & Martin W. P. Savelsbergh & Peter J. Stuckey, 2020. "Logistics optimization for a coal supply chain," Journal of Heuristics, Springer, vol. 26(2), pages 269-300, April.
    16. Liu, Baoli & Li, Zhi-Chun & Wang, Yadong, 2023. "A branch-and-price heuristic algorithm for the bunkering operation problem of a liquefied natural gas bunkering station in the inland waterways," Transportation Research Part B: Methodological, Elsevier, vol. 167(C), pages 145-170.
    17. Hamza Bouzekri & Gülgün Alpan & Vincent Giard, 2022. "Integrated Laycan and Berth Allocation Problem with ship stability and conveyor routing constraints in bulk ports," Working Papers hal-03431793, HAL.
    18. João Luiz Marques Andrade & Gustavo Campos Menezes, 2023. "A column generation-based heuristic to solve the integrated planning, scheduling, yard allocation and berth allocation problem in bulk ports," Journal of Heuristics, Springer, vol. 29(1), pages 39-76, February.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hal:journl:hal-03005639. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: CCSD (email available below). General contact details of provider: https://hal.archives-ouvertes.fr/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.