Optimisation and heuristic approaches for assigning inbound containers to outbound carriers

Due to economical and/or geographical constraints, most of the time overseas containers cannot be directly shipped to their destinations. These containers visit transhipment ports where they are first unloaded and temporarily stored and then loaded onto smaller vessels (feeders) to be transported to...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Maritime policy and management Ročník 44; číslo 7; s. 825 - 836
Hlavní autoři: Öztürk, Cemalettin, Sargut, F. Zeynep, Örnek, M. Arslan, Türsel Eliiyi, Deniz
Médium: Journal Article
Jazyk:angličtina
Vydáno: Abingdon Routledge 03.10.2017
Taylor & Francis Ltd
Témata:
Assignment
Capacity
container assignment
Container terminal operations
Containers
Costs
Destinations
Feeders
Heuristic
heuristic algorithm
integer programming
Maritime industry
Mathematical models
Objectives
Opportunity costs
optimisation
Ports
Production capacity
Production scheduling
Transportation
Variants
Vessels
ISSN:0308-8839, 1464-5254
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Due to economical and/or geographical constraints, most of the time overseas containers cannot be directly shipped to their destinations. These containers visit transhipment ports where they are first unloaded and temporarily stored and then loaded onto smaller vessels (feeders) to be transported to their final destinations. The assignment of these containers to outbound vessels necessitates several factors to be taken into account simultaneously. In this paper, we develop a mathematical model to reflect multiple objectives with priorities and to assign these containers to different vessels at the transit container port terminal. Although we solve a single-objective (with the weighted sum of objectives) mathematical model to optimality, we also propose two heuristic approaches to solve this complex problem for a transit agency. The first heuristic is shipment based and has four variants differing in how the opportunity costs of the assignments are calculated. The second greedy heuristic is trip based, where the goal is to maximise the capacity utilisation of the vessels. The heuristics return very promising solutions in ignorable computational times. We also provide real-life cases and present our conclusions.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0308-8839
1464-5254
DOI:10.1080/03088839.2017.1341061