Non-approximability of the single crane container transhipment problem

Pesch Erwin , Katarzyna Kuźmicz

Abstract

The makespan of operations at container terminals is crucial for the lead time of cargo and consequently the reduction of transportation costs. Therefore, an efficient transhipment and short storage of containers are demanded. Our paper refers to the consolidation process of trains in a container transhipment terminal as well as to the intermediate storage of containers in seaports in order to accelerate the loading and unloading of the vessels. It can also be encountered in automated storage/retrieval systems. Each of these (container) storage and retrieval moves corresponds to a crane operation, carrying a load from its pickup to its drop-off position. The problem is to find a permutation of the loaded crane moves that minimises the total empty crane travel time, which is the sum of times the crane needs to get from the last drop-off point of a load to the next pickup point of a load. We address the problem as an extension of an asymmetric travelling salesman problem (ATSP), assuming that n ordered pairs of points in the two-dimensional Euclidean space need to be traversed. Each point corresponds to a crane operation carrying a load from its pickup to its drop-off position. Despite that the problem seems to be easier than the ATSP, because a simple constant factor approximation exists, which was for a long time an open question for the ATSP, we are the first to prove that there is no polynomial-time approximation algorithm with an approximation guarantee less than 1+0.23/n unless P=NP.
Author Pesch Erwin
Pesch Erwin,,
-
, Katarzyna Kuźmicz (FEM / ICCEEILSS)
Katarzyna Kuźmicz,,
- International Chineese and Central-Eastern European Institute of Logistics and Service Sciences
Journal seriesInternational Journal of Production Research, ISSN 0020-7543, (N/A 100 pkt)
Issue year2019
Keywords in Englishnon-approximability, container transhipment, asymmetric travelling salesman problem, NP-completeness
ASJC Classification1408 Strategy and Management; 1803 Management Science and Operations Research; 2209 Industrial and Manufacturing Engineering
DOIDOI:10.1080/00207543.2019.1637036
Internal identifierROC 19-20
Languageen angielski
Score (nominal)100
Score sourcejournalList
ScoreMinisterial score = 100.0, 12-02-2020, ArticleFromJournal
Publication indicators Scopus SNIP (Source Normalised Impact per Paper): 2018 = 1.72; WoS Impact Factor: 2018 = 3.199 (2) - 2018=3.363 (5)
Citation count*
Cite
Share Share

Get link to the record


* presented citation count is obtained through Internet information analysis and it is close to the number calculated by the Publish or Perish system.
Back
Confirmation
Are you sure?