Author
Listed:
- Soroush Fatemi-Anaraki
- Reza Tavakkoli-Moghaddam
- Dorsa Abdolhamidi
- Behdin Vahedi-Nouri
Abstract
Maritime shipment plays a pivotal role in goods transportation worldwide. Ships intending to load/unload a cargo should visit a port. Three main steps are taken during this process. Firstly, ships go through a waterway to reach the berthing area. Secondly, they are allocated to eligible wharves, and quay cranes are assigned to them. At last, ships leave the port area through the waterway. In this paper, the three mentioned stages are considered and solved in an integrated manner. A two-way waterway is deemed with the width limitation for ships moving in opposite directions. Furthermore, ships may arrive during the planning horizon. Tidal impacts, draft limit, and safety distance between ships are prominent maritime limitations included in this paper. As the three stages take place consecutively, the problem appears to resemble a hybrid flow shop scheduling problem with unrelated parallel machines, machine eligibility constraint, and shared resources. Following this attitude, a mathematical model is developed. Due to the problem complexity, three distinct matheuristic approaches are developed by combining the genetic algorithm, discrete differential evolution, and grey wolf optimiser with a mathematical model and tested using randomly-generated numerical instances. At last, developed matheuristics are compared, and some managerial insights are provided.
Suggested Citation
Soroush Fatemi-Anaraki & Reza Tavakkoli-Moghaddam & Dorsa Abdolhamidi & Behdin Vahedi-Nouri, 2021.
"Simultaneous waterway scheduling, berth allocation, and quay crane assignment: A novel matheuristic approach,"
International Journal of Production Research, Taylor & Francis Journals, vol. 59(24), pages 7576-7593, December.
Handle:
RePEc:taf:tprsxx:v:59:y:2021:i:24:p:7576-7593
DOI: 10.1080/00207543.2020.1845412
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
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:taf:tprsxx:v:59:y:2021:i:24:p:7576-7593. 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.
We have no bibliographic references for this item. You can help adding them by using 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TPRS20 .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.