621
Views
25
CrossRef citations to date
0
Altmetric
Original Articles

Solving the dynamic berth allocation problem by simulated annealing

&
Pages 308-327 | Received 10 Aug 2012, Accepted 03 Jan 2013, Published online: 29 Apr 2013

Keep up to date with the latest research on this topic with citation updates for this article.

Read on this site (3)

Guido Ignacio Novoa-Flores, Luisa Carpente & Silvia Lorenzo-Freire. (2020) Optimizing the production schedule of an agricultural cooperative: a case study. Engineering Optimization 52:2, pages 252-270.
Read now
Mohammad Mohammadi & Kamran Forghani. (2019) Solving a stochastic berth allocation problem using a hybrid sequence pair-based simulated annealing algorithm. Engineering Optimization 51:10, pages 1810-1828.
Read now
Abdorreza Sheikholeslami & Reza Ilati. (2018) A sample average approximation approach to the berth allocation problem with uncertain tides. Engineering Optimization 50:10, pages 1772-1788.
Read now

Articles from other publishers (22)

Meng Yu, Yaqiong Lv, Yuhang Wang & Xiaojing Ji. (2023) Enhanced Ant Colony Algorithm for Discrete Dynamic Berth Allocation in a Case Container Terminal. Journal of Marine Science and Engineering 11:10, pages 1931.
Crossref
Eleftherios Tsakirakis, Magdalene Marinaki & Yannis Marinakis. 2023. Advances in Swarm Intelligence. Advances in Swarm Intelligence 347 368 .
Rong Wang, Fei Ji, Yi Jiang, Sheng-Hao Wu, Sam Kwong, Jun Zhang & Zhi-Hui Zhan. (2022) An Adaptive Ant Colony System Based on Variable Range Receding Horizon Control for Berth Allocation Problem. IEEE Transactions on Intelligent Transportation Systems 23:11, pages 21675-21686.
Crossref
Shuang Tang, Sudong Xu, Jianwen Gao, Mengdi Ma & Peng Liao. (2022) Effect of Service Priority on the Integrated Continuous Berth Allocation and Quay Crane Assignment Problem after Port Congestion. Journal of Marine Science and Engineering 10:9, pages 1259.
Crossref
Luigi Pio Prencipe & Mario Marinelli. (2020) A novel mathematical formulation for solving the dynamic and discrete berth allocation problem by using the Bee Colony Optimisation algorithm. Applied Intelligence 51:7, pages 4127-4142.
Crossref
Anas Arram, Masri Ayob & Alaa Sulaiman. (2021) Hybrid Bird Mating Optimizer With Single-Based Algorithms for Combinatorial Optimization Problems. IEEE Access 9, pages 115972-115989.
Crossref
David Sacramento, Christine Solnon & David Pisinger. (2020) Constraint Programming and Local Search Heuristic: a Matheuristic Approach for Routing and Scheduling Feeder Vessels in Multi-terminal Ports. SN Operations Research Forum 1:4.
Crossref
Anas Arram, Masri Ayob, Graham Kendall & Alaa Sulaiman. (2020) Bird Mating Optimizer for Combinatorial Optimization Problems. IEEE Access 8, pages 96845-96858.
Crossref
Issam El Hammouti, Azza Lajjam & Mohamed El Merouani. (2020) Comparison of Planning Models for Dynamic Berth Allocation Problem Using A Sailfish-based Algorithm. Procedia Computer Science 176, pages 3112-3120.
Crossref
Hamza Bouzekri, Gulgun Alpan & Vincent Giard. (2019) Integrated Laycan and Berth Allocation Problem. Integrated Laycan and Berth Allocation Problem.
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 19:3, pages 903-927.
Crossref
Ahad Javandoust Qarebagh, Farnaz Sabahi & Dariush Nazarpour. (2019) Optimized Scheduling for Solving Position Allocation Problem in Electric Vehicle Charging Stations. Optimized Scheduling for Solving Position Allocation Problem in Electric Vehicle Charging Stations.
Xiaofei Sun*, Yanyu Zhang, Jie Wu, Mengke Xie & Hang Hu. (2019) Optimized Cyclic Water Injection Strategy for Oil Recovery in Low-Permeability Reservoirs. Journal of Energy Resources Technology 141:1.
Crossref
Shih-Wei Lin, Ching-Jung Ting & Kun-Chih Wu. (2017) Simulated annealing with different vessel assignment strategies for the continuous berth allocation problem. Flexible Services and Manufacturing Journal 30:4, pages 740-763.
Crossref
Xiaogang Jiao, Feifeng Zheng, Ming Liu & Yinfeng Xu. (2018) Integrated Berth Allocation and Time-Variant Quay Crane Scheduling with Tidal Impact in Approach Channel. Discrete Dynamics in Nature and Society 2018, pages 1-19.
Crossref
Murat Çolak, Gülşen Aydın Keskin, Hatice Esen & Canan Bektaş. (2018) A Simulation Based Approach for Efficient Yard Planning in a Container Port. Süleyman Demirel Üniversitesi Fen Bilimleri Enstitüsü Dergisi 22:3, pages 1157-1164.
Crossref
S. Mahdi Homayouni & Dalila B.M.M. Fontes. 2018. Metaheuristics for Maritime Operations. Metaheuristics for Maritime Operations 185 205 .
El Hammouti Issam, Lajjam Azza & El Merouani Mohamed. (2018) Solving the hybrid berth allocation problem using a bat-inspired algorithm. Solving the hybrid berth allocation problem using a bat-inspired algorithm.
Leonard Heilig, Eduardo Lalla-Ruiz & Stefan Voß. (2017) Multi-objective inter-terminal truck routing. Transportation Research Part E: Logistics and Transportation Review 106, pages 178-202.
Crossref
Saurabh Pratap, Ashutosh Nayak, Akhilesh Kumar, Naoufel Cheikhrouhou & Manoj Kumar Tiwari. (2017) An integrated decision support system for berth and ship unloader allocation in bulk material handling port. Computers & Industrial Engineering 106, pages 386-399.
Crossref
Christian Bierwirth & Frank Meisel. (2015) A follow-up survey of berth allocation and quay crane scheduling problems in container terminals. European Journal of Operational Research 244:3, pages 675-689.
Crossref
Shangyao Yan, Chung-Cheng Lu, Jun-Hsiao Hsieh & Han-Chun Lin. (2015) A network flow model for the dynamic and flexible berth allocation problem. Computers & Industrial Engineering 81, pages 65-77.
Crossref

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.