IDEAS home Printed from https://ideas.repec.org/r/eee/transb/v37y2003i5p437-457.html
   My bibliography  Save this item

Berth allocation with service priority

Citations

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


Cited by:

  1. 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.
  2. 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.
  3. Elio Canestrelli & Marco Corazza & Giuseppe Nadai & Raffaele Pesenti, 2017. "Managing the Ship Movements in the Port of Venice," Networks and Spatial Economics, Springer, vol. 17(3), pages 861-887, September.
  4. 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.
  5. Jean-François Cordeau & Gilbert Laporte & Pasquale Legato & Luigi Moccia, 2005. "Models and Tabu Search Heuristics for the Berth-Allocation Problem," Transportation Science, INFORMS, vol. 39(4), pages 526-538, November.
  6. Lalla-Ruiz, Eduardo & Expósito-Izquierdo, Christopher & Melián-Batista, Belén & Moreno-Vega, J. Marcos, 2016. "A Set-Partitioning-based model for the Berth Allocation Problem under Time-Dependent Limitations," European Journal of Operational Research, Elsevier, vol. 250(3), pages 1001-1012.
  7. Yu, Jingjing & Tang, Guolei & Song, Xiangqun, 2022. "Collaboration of vessel speed optimization with berth allocation and quay crane assignment considering vessel service differentiation," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 160(C).
  8. 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.
  9. 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.
  10. 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.
  11. 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.
  12. Ursavas, Evrim & Zhu, Stuart X., 2016. "Optimal policies for the berth allocation problem under stochastic nature," European Journal of Operational Research, Elsevier, vol. 255(2), pages 380-387.
  13. 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.
  14. 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.
  15. 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.
  16. 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.
  17. 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.
  18. 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.
  19. Chinnawat Hoonsiri & Siriluk Chiarakorn & Vasin Kiattikomol, 2021. "Using Combined Bus Rapid Transit and Buses in a Dedicated Bus Lane to Enhance Urban Transportation Sustainability," Sustainability, MDPI, vol. 13(6), pages 1-18, March.
  20. 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.
  21. Imai, Akio & Sun, Xin & Nishimura, Etsuko & Papadimitriou, Stratos, 2005. "Berth allocation in a container port: using a continuous location space approach," Transportation Research Part B: Methodological, Elsevier, vol. 39(3), pages 199-221, March.
  22. Mao, Anjia & Yu, Tiantian & Ding, Zhaohao & Fang, Sidun & Guo, Jinran & Sheng, Qianqian, 2022. "Optimal scheduling for seaport integrated energy system considering flexible berth allocation," Applied Energy, Elsevier, vol. 308(C).
  23. 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.
  24. 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.
  25. 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.
  26. 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.
  27. 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.
  28. 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.
  29. 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.
  30. 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.
  31. 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.
  32. 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.
  33. 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.
  34. Ya Xu & Qiushuang Chen & Xiongwen Quan, 2012. "Robust berth scheduling with uncertain vessel delay and handling time," Annals of Operations Research, Springer, vol. 192(1), pages 123-140, January.
  35. Jingjing Tong & Heather Nachtmann, 2017. "Cargo prioritization and terminal allocation problem for inland waterway disruptions," Maritime Economics & Logistics, Palgrave Macmillan;International Association of Maritime Economists (IAME), vol. 19(3), pages 403-427, August.
  36. Hsien-Pin Hsu & Tai-Lin Chiang & Chia-Nan Wang & Hsin-Pin Fu & Chien-Chang Chou, 2019. "A Hybrid GA with Variable Quay Crane Assignment for Solving Berth Allocation Problem and Quay Crane Assignment Problem Simultaneously," Sustainability, MDPI, vol. 11(7), pages 1-21, April.
  37. Evangelia N. Kaselimi & Theo E. Notteboom & Bruno De Borger, 2011. "A game theoretical approach to competition between multi-user terminals: the impact of dedicated terminals," Maritime Policy & Management, Taylor & Francis Journals, vol. 38(4), pages 395-414, January.
  38. 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.
  39. Li, Chen & Qi, Xiangtong & Song, Dongping, 2016. "Real-time schedule recovery in liner shipping service with regular uncertainties and disruption events," Transportation Research Part B: Methodological, Elsevier, vol. 93(PB), pages 762-788.
  40. 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.
  41. 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.
  42. J Blazewicz & T C E Cheng & M Machowiak & C Oguz, 2011. "Berth and quay crane allocation: a moldable task scheduling model," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(7), pages 1189-1197, July.
  43. Goodchild, A. V. & Daganzo, C. F., 2004. "Reducing Ship Turn-Around Time Using Double-Cycling," Institute of Transportation Studies, Research Reports, Working Papers, Proceedings qt86r4p6sc, Institute of Transportation Studies, UC Berkeley.
  44. 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.
  45. 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.
  46. 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.
  47. 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.
  48. Fernández, Elena & Munoz-Marquez, Manuel, 2022. "New formulations and solutions for the strategic berth template problem," European Journal of Operational Research, Elsevier, vol. 298(1), pages 99-117.
  49. Evrim Ursavas, 2022. "Priority control of berth allocation problem in container terminals," Annals of Operations Research, Springer, vol. 317(2), pages 805-824, October.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.