A Branch-and-Bound Algorithm for the Bi-Objective Quay Crane Scheduling Problem Based on Efficiency and Energy

A Branch-and-Bound Algorithm for the Bi-Objective Quay Crane Scheduling Problem Based on Efficiency and Energy

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

Full description

Bibliographic Details
Main Authors: Hongming Li, Xintao Li
Format: Article
Language:English
Published: MDPI AG 2022-12-01
Series:Mathematics
Subjects:
bi-objective optimization
integer programming
branch-and-bound
quay crane scheduling
Online Access:https://www.mdpi.com/2227-7390/10/24/4705

Internet

https://www.mdpi.com/2227-7390/10/24/4705

Similar Items