.png){kind=icon}
.png){kind=icon}
Return
Mixed-Integer Nonlinear Programming for Energy-Efficient Container Handling: Formulation and Customized Genetic Algorithm
.png){kind=icon}
OA
AI
DOI：10.1109/TITS.2021.3094815.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Energy consumption is expected to be reduced while maintaining high productivity for container handling. This paper investigates a new energy-efficient scheduling problem of automated container terminals, in which quay cranes (QCs) and lift automated guided vehicles (AGVs) cooperate to handle inbound and outbound containers. In our scheduling problem, operation times and task sequences are both to be determined. The underlying optimization problem is mixed-integer nonlinear programming (MINLP). To deal with its computational intractability, a customized and efficient genetic algorithm (GA) is developed to solve the studied MINLP problem, and lexicographic and weighted-sum strategies are further considered. An epsilon-constraint algorithm is also developed to analyze the Pareto frontiers. Comprehensive experiments are tested on a container handling benchmark system, and the results show the effectiveness of the proposed lexicographic GA, compared to results obtained with two commonly-used metaheuristics, a commercial MINLP solver, and two state-of-the-art methods.
Keywords:
Containers
Task analysis
Energy consumption
Genetic algorithms
Cranes
Optimization
Job shop scheduling
Automated container terminals
energy efficiency
mixed-integer nonlinear programming
genetic algorithm
Journal
IF:
8.4
Papers:
9.5K
Citations:
6.3W
View more organizations