Eco-friendly container transshipment route scheduling problem with repacking operations

Ming Liu, Rongfan Liu, E Zhang () and Chengbin Chu
Additional contact information
Ming Liu: Tongji University
Rongfan Liu: Tongji University
E Zhang: Shanghai University of Finance and Economics
Chengbin Chu: Université Paris-Est

Journal of Combinatorial Optimization, No 0, 26 pages

Abstract: Abstract Currently, a huge amount of cargo is transported via containers by liner shipping companies. Under stochastic demand, repacking operations and carbon reduction, which may lead to an increase in effectiveness and environmental improvement, have been rarely considered in previous literature. In this paper, we investigate a container transshipment route scheduling problem with repacking operations under stochastic demand and environmental protection. The problem is a combinatorial optimization problem. Lacking historical data, a chance-constrained programming model is proposed to minimize the total operating and environment-related costs. We choose two distribution-free approaches, i.e., approximation based in Markov’s Inequality and Mixed Integer Second-Order Conic Program to approximate the chance constraints. As the loses induced by unfulfilled demand are not taken into account in the above model, a scenario-based model is developed considering the loses. Risk-neutral model may provide solutions that perform poorly while considering uncertainty. To incorporate decision makers’ perspectives, therefore, we also propose a risk-averse model adopting a risk aversion measure called Conditional Value-at-Risk to meet different preferences. Finally, we conduct computational experiments based on real data to compare the performances of the modeling methods and illustrate the impacts by testing different risk levels and confidence levels.

Keywords: Scheduling; Uncertain demand; Risk-averse; Container repacking; Carbon reduction (search for similar items in EconPapers)
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-020-00619-8 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

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:jcomop:v::y::i::d:10.1007_s10878-020-00619-8

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-020-00619-8

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().