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.
Funder
National Social Science Foundation of China
Tianjin Social Science Foundation of China
China Postdoctoral Science Foundation
Subject
General Mathematics,Engineering (miscellaneous),Computer Science (miscellaneous)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献