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.
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: