Published in

MDPI, Applied Sciences, 20(11), p. 9380, 2021

DOI: 10.3390/app11209380

Links

Tools

Export citation

Search in Google Scholar

Dwell Time Estimation of Import Containers as an Ordinal Regression Problem

This paper is made freely available by the publisher.
This paper is made freely available by the publisher.

Full text: Download

Green circle
Preprint: archiving allowed
Green circle
Postprint: archiving allowed
Green circle
Published version: archiving allowed
Data provided by SHERPA/RoMEO

Abstract

The optimal stacking of import containers in a terminal reduces the reshuffles during the unloading operations. Knowing the departure date of each container is critical for optimal stacking. However, such a date is rarely known because it depends on various attributes. Therefore, some authors have proposed estimation algorithms using supervised classification. Although supervised classifiers can estimate this dwell time, the variable “dwell time” takes ordered values for this problem, suggesting using ordinal regression algorithms. Thus, we have compared an ordinal regression algorithm (selected from 15) against two supervised classifiers (selected from 30). We have set up two datasets with data collected in a container terminal. We have extracted and evaluated 35 attributes related to the dwell time. Additionally, we have run 21 experiments to evaluate both approaches regarding the mean absolute error modified and the reshuffles. As a result, we have found that the ordinal regression algorithm outperforms the supervised classifiers, reaching the lowest mean absolute error modified in 15 (71%) and the lowest reshuffles in 14 (67%) experiments.