Modern Heuristics of MCDM for the Operation Optimization in Container Terminals

Zhihong Jin (), Na Li, Qi Xu and Zhan Bian
Additional contact information
Zhihong Jin: Dalian Maritime University
Na Li: Dalian Maritime University
Qi Xu: Dalian Maritime University
Zhan Bian: Capital University of Economics and Business

Chapter Chapter 11 in Multi-Criteria Decision Making in Maritime Studies and Logistics, 2018, pp 271-322 from Springer

Abstract: Abstract This chapter systematically applies modern heuristics to solve multi-criteria decision making problems in the fields of container terminal, which consists of three geographically interrelated core areas: container terminal, anchorage ground on its sea side, and gateway on its land side. For the container terminal, the container loading sequence problem is considered and a hybrid dynamic programming approach is proposed. The considered problem aims at obtaining an optimized container loading sequence for a crane to retrieve all the containers from the yard to the ship. The proposed dynamic algorithms consist of two phases. A heuristic algorithm is developed to retrieve the containers subset which needs no relocation and may be loaded directly onto the ship at the first phase, and a dynamic programming with heuristic rules is applied to solve the loading sequence problem for the rest of the containers at the second phase. For the anchorage ground on the sea side of a container terminal, the tugboat scheduling problem is formulated as a multiprocessor tasks scheduling problem after analyzing the characteristics of tugboat operation. The model considers factors of multi-anchorage bases and three stages of operations (berthing/shifting-berth/unberthing). The objective is to minimize the total operation times for all tugboats and the waste of the tugboats horsepower in use at the same time. A hybrid simulated annealing algorithm is proposed to solve the addressed problem. For the gateway on the land side of a container terminal, resource deployment for truck appointment system on container terminals is solved as an optimization problem. A bi-objective model is set up to minimize resource input and balance workloads. Modern heuristics method based on non-dominated genetic algorithmII is proposed to solve difficulties of simultaneous optimization of resource input and appointment quotas. Three chromosomes representing quotas, yard cranes and gate lanes are set up, some of which are two dimensional. Numerical experiments are untaken to evaluate the effectiveness of the proposed algorithms and show the efficiency of the proposed algorithm. The three parts analyzed above cover all the core elements of modern heuristics of MCDM for the operation optimization in a container terminal from a container terminal to both its land side and its sea side.

Keywords: Operation optimization; Container loading sequence problem; Dynamic programming; Tugboat scheduling problem; Simulated annealing; Resource deployment; Non-dominated genetic algorithm (search for similar items in EconPapers)
Date: 2018
References: Add references at CitEc
Citations: View citations in EconPapers (1)

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:isochp:978-3-319-62338-2_11

Ordering information: This item can be ordered from
http://www.springer.com/9783319623382

DOI: 10.1007/978-3-319-62338-2_11

Access Statistics for this chapter

More chapters in International Series in Operations Research & Management Science from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().