IDEAS home Printed from https://ideas.repec.org/r/eee/transb/v39y2005i3p199-221.html

Berth allocation in a container port: using a continuous location space approach

Citations

Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
as


Cited by:

  1. Feng Li & Jiuh-Biing Sheu & Zi-You Gao, 2015. "Solving the Continuous Berth Allocation and Specific Quay Crane Assignment Problems with Quay Crane Coverage Range," Transportation Science, INFORMS, vol. 49(4), pages 968-989, November.
  2. El Mehdi, Er Raqabi & Ilyas, Himmich & Nizar, El Hachemi & Issmaïl, El Hallaoui & François, Soumis, 2023. "Incremental LNS framework for integrated production, inventory, and vessel scheduling: Application to a global supply chain," Omega, Elsevier, vol. 116(C).
  3. Haoqi Xie & Daniela Ambrosino, 2025. "Operations Research, Machine Learning, and Integrated Techniques for Decision Problems in the Seaside Area of Container Terminals," SN Operations Research Forum, Springer, vol. 6(2), pages 1-51, June.
  4. Bierwirth, Christian & Meisel, Frank, 2010. "A survey of berth allocation and quay crane scheduling problems in container terminals," European Journal of Operational Research, Elsevier, vol. 202(3), pages 615-627, May.
  5. Kai Wang & Lu Zhen & Shuaian Wang, 2018. "Column Generation for the Integrated Berth Allocation, Quay Crane Assignment, and Yard Assignment Problem," Transportation Science, INFORMS, vol. 52(4), pages 812-834, August.
  6. Du, Yuquan & Chen, Qiushuang & Quan, Xiongwen & Long, Lei & Fung, Richard Y.K., 2011. "Berth allocation considering fuel consumption and vessel emissions," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 47(6), pages 1021-1037.
  7. Wang, Shuaian & Meng, Qiang, 2012. "Liner ship route schedule design with sea contingency time and port time uncertainty," Transportation Research Part B: Methodological, Elsevier, vol. 46(5), pages 615-633.
  8. Yi Ding & Shuai Jia & Tianyi Gu & Chung-Lun Li, 2016. "SGICT Builds an Optimization-Based System for Daily Berth Planning," Interfaces, INFORMS, vol. 46(4), pages 281-296, August.
  9. 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.
  10. H. L. Ma & S. H. Chung & H. K. Chan & Li Cui, 2019. "An integrated model for berth and yard planning in container terminals with multi-continuous berth layout," Annals of Operations Research, Springer, vol. 273(1), pages 409-431, February.
  11. Gao, Zhendi & Ji, Mingjun & Liang, Jinpeng & Kong, Lingrui, 2025. "Fill rate oriented scheduling policy for integrated ore terminal order acceptance and berth allocation," Transportation Research Part B: Methodological, Elsevier, vol. 202(C).
  12. Hansen, Pierre & Oguz, Ceyda & Mladenovic, Nenad, 2008. "Variable neighborhood search for minimum cost berth allocation," European Journal of Operational Research, Elsevier, vol. 191(3), pages 636-649, December.
  13. Yuquan Du & Qiushuang Chen & Jasmine Siu Lee Lam & Ya Xu & Jin Xin Cao, 2015. "Modeling the Impacts of Tides and the Virtual Arrival Policy in Berth Allocation," Transportation Science, INFORMS, vol. 49(4), pages 939-956, November.
  14. Ya Xu & Yuquan Du & Yongjian Li & Heng Zhang, 2021. "Collaborative emergency berth scheduling based on decentralized decision and price mechanism," Annals of Operations Research, Springer, vol. 298(1), pages 525-554, March.
  15. Liu, Changchun, 2020. "Iterative heuristic for simultaneous allocations of berths, quay cranes, and yards under practical situations," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 133(C).
  16. Yongpei Guan & Kang-Hung Yang & Zhili Zhou, 2013. "The crane scheduling problem: models and solution approaches," Annals of Operations Research, Springer, vol. 203(1), pages 119-139, March.
  17. Qingcheng Zeng & Yuanjun Feng & Zigen Chen, 2017. "Optimizing berth allocation and storage space in direct transshipment operations at container terminals," Maritime Economics & Logistics, Palgrave Macmillan;International Association of Maritime Economists (IAME), vol. 19(3), pages 474-503, August.
  18. Changchun Liu & Xi Xiang & Li Zheng, 2017. "Two decision models for berth allocation problem under uncertainty considering service level," Flexible Services and Manufacturing Journal, Springer, vol. 29(3), pages 312-344, December.
  19. Tao, Yi & Lee, Chung-Yee, 2015. "Joint planning of berth and yard allocation in transshipment terminals using multi-cluster stacking strategy," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 83(C), pages 34-50.
  20. Wang, Chong & Liu, Kaiyuan & Zhang, Canrong & Miao, Lixin, 2024. "Distributionally robust chance-constrained optimization for the integrated berth allocation and quay crane assignment problem," Transportation Research Part B: Methodological, Elsevier, vol. 182(C).
  21. Jiayin Pan & Cong Chen & Yinfeng Xu, 2024. "The price of anarchy for a berth allocation game," Journal of Scheduling, Springer, vol. 27(1), pages 51-60, February.
  22. Martin-Iradi, Bernardo & Pacino, Dario & Ropke, Stefan, 2024. "An adaptive large neighborhood search heuristic for the multi-port continuous berth allocation problem," European Journal of Operational Research, Elsevier, vol. 316(1), pages 152-167.
  23. Wang, Shuaian & Meng, Qiang & Liu, Zhiyuan, 2013. "A note on “Berth allocation considering fuel consumption and vessel emissions”," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 49(1), pages 48-54.
  24. Shih-Wei Lin & Ching-Jung Ting & Kun-Chih Wu, 2018. "Simulated annealing with different vessel assignment strategies for the continuous berth allocation problem," Flexible Services and Manufacturing Journal, Springer, vol. 30(4), pages 740-763, December.
  25. Imai, Akio & Nishimura, Etsuko & Papadimitriou, Stratos, 2013. "Marine container terminal configurations for efficient handling of mega-containerships," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 49(1), pages 141-158.
  26. Wang, Shuaian & Meng, Qiang, 2013. "Reversing port rotation directions in a container liner shipping network," Transportation Research Part B: Methodological, Elsevier, vol. 50(C), pages 61-73.
  27. Robenek, Tomáš & Umang, Nitish & Bierlaire, Michel & Ropke, Stefan, 2014. "A branch-and-price algorithm to solve the integrated berth allocation and yard assignment problem in bulk ports," European Journal of Operational Research, Elsevier, vol. 235(2), pages 399-411.
  28. Lingxiao Wu & Yossiri Adulyasak & Jean-François Cordeau & Shuaian Wang, 2022. "Vessel Service Planning in Seaports," Operations Research, INFORMS, vol. 70(4), pages 2032-2053, July.
  29. Giallombardo, Giovanni & Moccia, Luigi & Salani, Matteo & Vacca, Ilaria, 2010. "Modeling and solving the Tactical Berth Allocation Problem," Transportation Research Part B: Methodological, Elsevier, vol. 44(2), pages 232-245, February.
  30. Yaqiong Lv & Jingwen Wang & Zhongyuan Liu & Mingkai Zou, 2025. "From Heuristics to Multi-Agent Learning: A Survey of Intelligent Scheduling Methods in Port Seaside Operations," Mathematics, MDPI, vol. 13(17), pages 1-57, August.
  31. Zeng, Qingcheng & Yang, Zhongzhen & Lai, Luyuan, 2009. "Models and algorithms for multi-crane oriented scheduling method in container terminals," Transport Policy, Elsevier, vol. 16(5), pages 271-278, September.
  32. Guo, Liming & Zheng, Jianfeng & Liang, Jinpeng & Wang, Shuaian, 2023. "Column generation for the multi-port berth allocation problem with port cooperation stability," Transportation Research Part B: Methodological, Elsevier, vol. 171(C), pages 3-28.
  33. Golias, Mihalis & Boile, Maria & Theofanis, Sotirios, 2007. "The berth allocation problem: a formulation reflecting time Window service deadlines," 48th Annual Transportation Research Forum, Boston, Massachusetts, March 15-17, 2007 207826, Transportation Research Forum.
  34. Han, Xiao-le & Lu, Zhi-qiang & Xi, Li-feng, 2010. "A proactive approach for simultaneous berth and quay crane scheduling problem with stochastic arrival and handling time," European Journal of Operational Research, Elsevier, vol. 207(3), pages 1327-1340, December.
  35. Xu, Dongsheng & Li, Chung-Lun & Leung, Joseph Y.-T., 2012. "Berth allocation with time-dependent physical limitations on vessels," European Journal of Operational Research, Elsevier, vol. 216(1), pages 47-56.
  36. Abdellah Salhi & Ghazwan Alsoufi & Xinan Yang, 2019. "An evolutionary approach to a combined mixed integer programming model of seaside operations as arise in container ports," Annals of Operations Research, Springer, vol. 272(1), pages 69-98, January.
  37. Sung Won Cho & Hyun Ji Park & Chulung Lee, 2021. "An integrated method for berth allocation and quay crane assignment to allow for reassignment of vessels to other terminals," Maritime Economics & Logistics, Palgrave Macmillan;International Association of Maritime Economists (IAME), vol. 23(1), pages 123-153, March.
  38. Nitish Umang & Michel Bierlaire & Alan L. Erera, 2017. "Real-time management of berth allocation with stochastic arrival and handling times," Journal of Scheduling, Springer, vol. 20(1), pages 67-83, February.
  39. Lee, Yusin & Chen, Chuen-Yih, 2009. "An optimization heuristic for the berth scheduling problem," European Journal of Operational Research, Elsevier, vol. 196(2), pages 500-508, July.
  40. Shu-Chuan Chang & Ming-Hua Lin & Jung-Fa Tsai, 2024. "An Optimization Approach to Berth Allocation Problems," Mathematics, MDPI, vol. 12(5), pages 1-16, March.
  41. M. Flavia Monaco & Marcello Sammarra, 2007. "The Berth Allocation Problem: A Strong Formulation Solved by a Lagrangean Approach," Transportation Science, INFORMS, vol. 41(2), pages 265-280, May.
  42. Iris, Çağatay & Pacino, Dario & Ropke, Stefan & Larsen, Allan, 2015. "Integrated Berth Allocation and Quay Crane Assignment Problem: Set partitioning models and computational results," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 81(C), pages 75-97.
  43. Xiang, Xi & Liu, Changchun & Miao, Lixin, 2017. "A bi-objective robust model for berth allocation scheduling under uncertainty," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 106(C), pages 294-319.
  44. Lu Zhen & Ek Peng Chew & Loo Hay Lee, 2011. "An Integrated Model for Berth Template and Yard Template Planning in Transshipment Hubs," Transportation Science, INFORMS, vol. 45(4), pages 483-504, November.
  45. C. Cheong & K. Tan & D. Liu & C. Lin, 2010. "Multi-objective and prioritized berth allocation in container ports," Annals of Operations Research, Springer, vol. 180(1), pages 63-103, November.
  46. Wang, Shuaian & Meng, Qiang & Liu, Zhiyuan, 2013. "Containership scheduling with transit-time-sensitive container shipment demand," Transportation Research Part B: Methodological, Elsevier, vol. 54(C), pages 68-83.
  47. Zhen, Lu & Lee, Loo Hay & Chew, Ek Peng, 2011. "A decision model for berth allocation under uncertainty," European Journal of Operational Research, Elsevier, vol. 212(1), pages 54-68, July.
  48. Bukchin, Yossi & Raviv, Tal & Zaides, Ilya, 2020. "The consecutive multiprocessor job scheduling problem," European Journal of Operational Research, Elsevier, vol. 284(2), pages 427-438.
  49. Sunil Kumar Jauhar & Saurabh Pratap & Sachin Kamble & Shivam Gupta & Amine Belhadi, 2026. "A prescriptive analytics approach to solve the continuous berth allocation and yard assignment problem using integrated carbon emissions policies," Annals of Operations Research, Springer, vol. 359(1), pages 157-188, April.
  50. Zhen, Lu & Zhuge, Dan & Wang, Shuaian & Wang, Kai, 2022. "Integrated berth and yard space allocation under uncertainty," Transportation Research Part B: Methodological, Elsevier, vol. 162(C), pages 1-27.
  51. Agra, Agostinho & Oliveira, Maryse, 2018. "MIP approaches for the integrated berth allocation and quay crane assignment and scheduling problem," European Journal of Operational Research, Elsevier, vol. 264(1), pages 138-148.
  52. Jiayin Pan & Yinfeng Xu & Guiqing Zhang, 2018. "Online integrated allocation of berths and quay cranes in container terminals with 1-lookahead," Journal of Combinatorial Optimization, Springer, vol. 36(2), pages 617-636, August.
  53. Zhen, Lu, 2015. "Tactical berth allocation under uncertainty," European Journal of Operational Research, Elsevier, vol. 247(3), pages 928-944.
  54. Canrong Zhang & Tao Wu & Mingyao Qi & Lixin Miao, 2018. "Simultaneous Allocation of Berths and Quay Cranes under Discrete Berth Situation," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 35(03), pages 1-28, June.
  55. Bernardo Martin-Iradi & Dario Pacino & Stefan Ropke, 2022. "The Multiport Berth Allocation Problem with Speed Optimization: Exact Methods and a Cooperative Game Analysis," Transportation Science, INFORMS, vol. 56(4), pages 972-999, July.
  56. Wang, Shuaian & Meng, Qiang & Bell, Michael G.H., 2013. "Liner ship route capacity utilization estimation with a bounded polyhedral container shipment demand pattern," Transportation Research Part B: Methodological, Elsevier, vol. 47(C), pages 57-76.
  57. Liu, Baoli & Wang, Xincheng & Wang, Zehao & Zheng, Jianfeng & Sheng, Dian, 2025. "Modeling and solving the joint berth allocation and vessel sequencing problem with speed optimization in a busy seaport," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 197(C).
  58. Umang, Nitish & Bierlaire, Michel & Vacca, Ilaria, 2013. "Exact and heuristic methods to solve the berth allocation problem in bulk ports," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 54(C), pages 14-31.
  59. T. R. Lalita & G. S. R. Murthy, 2022. "Compact ILP formulations for a class of solutions to berth allocation and quay crane scheduling problems," OPSEARCH, Springer;Operational Research Society of India, vol. 59(1), pages 413-439, March.
  60. Changchun Liu & Xi Xiang & Canrong Zhang & Li Zheng, 2016. "A Decision Model for Berth Allocation Under Uncertainty Considering Service Level Using an Adaptive Differential Evolution Algorithm," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 33(06), pages 1-28, December.
  61. Ji, Bin & Hou, Ruizhe & Yu, Samson S., 2026. "A lock and port resource collaborative scheduling method based on mathematical programming model and heuristic," European Journal of Operational Research, Elsevier, vol. 329(2), pages 476-497.
  62. Fanrui Xie & Tao Wu & Canrong Zhang, 2019. "A Branch-and-Price Algorithm for the Integrated Berth Allocation and Quay Crane Assignment Problem," Transportation Science, INFORMS, vol. 53(5), pages 1427-1454, September.
  63. Changchun Liu & Xi Xiang & Li Zheng, 2020. "A two-stage robust optimization approach for the berth allocation problem under uncertainty," Flexible Services and Manufacturing Journal, Springer, vol. 32(2), pages 425-452, June.
  64. Andreas T. Ernst & Ceyda Oğuz & Gaurav Singh & Gita Taherkhani, 2017. "Mathematical models for the berth allocation problem in dry bulk terminals," Journal of Scheduling, Springer, vol. 20(5), pages 459-473, October.
  65. Shangyao Yan & Chung-Cheng Lu & Jun-Hsiao Hsieh & Han-Chun Lin, 2019. "A Dynamic and Flexible Berth Allocation Model with Stochastic Vessel Arrival Times," Networks and Spatial Economics, Springer, vol. 19(3), pages 903-927, September.
  66. Imai, Akio & Nishimura, Etsuko & Hattori, Masahiro & Papadimitriou, Stratos, 2007. "Berth allocation at indented berths for mega-containerships," European Journal of Operational Research, Elsevier, vol. 179(2), pages 579-593, June.
  67. Branislav Dragović & Nam Kyu Park & Zoran Radmilović, 2006. "Ship-berth link performance evaluation: simulation and analytical approaches," Maritime Policy & Management, Taylor & Francis Journals, vol. 33(3), pages 281-299, July.
  68. Iris, Çağatay & Pacino, Dario & Ropke, Stefan, 2017. "Improved formulations and an Adaptive Large Neighborhood Search heuristic for the integrated berth allocation and quay crane assignment problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 105(C), pages 123-147.
  69. Zhen, Lu & Liang, Zhe & Zhuge, Dan & Lee, Loo Hay & Chew, Ek Peng, 2017. "Daily berth planning in a tidal port with channel flow control," Transportation Research Part B: Methodological, Elsevier, vol. 106(C), pages 193-217.
  70. Imai, Akio & Yamakawa, Yukiko & Huang, Kuancheng, 2014. "The strategic berth template problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 72(C), pages 77-100.
  71. Meng, Qiang & Wang, Shuaian & Lee, Chung-Yee, 2015. "A tailored branch-and-price approach for a joint tramp ship routing and bunkering problem," Transportation Research Part B: Methodological, Elsevier, vol. 72(C), pages 1-19.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.