A Branch-and-Bound Algorithm for the Bi-Objective Quay Crane Scheduling Problem Based on Efficiency and Energy
Open Access
- 11 December 2022
- journal article
- research article
- Published by MDPI AG in Mathematics
- Vol. 10 (24) , 4705
Abstract
Motivated by the call of the International Maritime Organization to meet the emission targets of 2030, this study considers two important practical aspects of quay crane scheduling: efficiency and energy consumption. More precisely, we introduce the bi-objective quay crane scheduling problem where the objective is to minimize the vessel’s completion time and the crane’s energy consumption. This is done by formulating a bi-objective mixed-integer programming model. A branch-and-bound algorithm was developed as the exact solution approach to find the full set of Pareto-optimal solutions. We consider (i) various lower bounds for both objectives, (ii) specific upper bounds, (iii) additional branching criteria, and (iv) fathoming criteria to detect Pareto-optimal solutions. Numerical experiments on benchmark instances show that the branch-and-bound algorithm can efficiently solve small- and medium-sized problems.Keywords
Funding Information
- National Social Science Fund of China (21CZZ007, TJGLQN20-001, 2020M670636, ZB22BZ0332)
- Tianjin Social Science Foundation of China (21CZZ007, TJGLQN20-001, 2020M670636, ZB22BZ0332)
- China Postdoctoral Science Foundation (21CZZ007, TJGLQN20-001, 2020M670636, ZB22BZ0332)
- Liberal Arts Development Foundation of Nankai University (21CZZ007, TJGLQN20-001, 2020M670636, ZB22BZ0332)
This publication has 45 references indexed in Scilit:
- Multiple objective branch and bound for mixed 0-1 linear programming: Corrections and improvements for the biobjective caseComputers & Operations Research, 2013
- Modeling and solving rich quay crane scheduling problemsComputers & Operations Research, 2012
- The quay crane scheduling problem with time windowsNaval Research Logistics (NRL), 2011
- Integrating berth allocation and quay crane assignmentsTransportation Research Part E: Logistics and Transportation Review, 2010
- A survey of berth allocation and quay crane scheduling problems in container terminalsEuropean Journal of Operational Research, 2010
- Multi-objective scheduling problems: Determination of pruned Pareto setsIIE Transactions, 2008
- Quay crane scheduling at container terminals to minimize the maximum relative tardiness of vessel departuresNaval Research Logistics (NRL), 2005
- A crane scheduling method for port container terminalsEuropean Journal of Operational Research, 2004
- A branch and bound algorithm for mixed zero-one multiple objective linear programmingEuropean Journal of Operational Research, 1998
- The crane scheduling problemTransportation Research Part B: Methodological, 1989