A lamda-optimal based heuristic for the berth scheduling problem |
| |
| Affiliation: | 1. Department of Industrial and Systems Engineering, Indian Institute of Technology, Kharagpur, 721302, West Bengal, India;2. Haute école de gestion de Genève, University of Applied Sciences Western Switzerland, 1227 Geneva, Switzerland;1. Department of Mathematics and Center for Research and Development in Mathematics and Applications, University of Aveiro, Portugal;2. Department of Mathematics, University of Aveiro, Portugal;1. Departamento de Ingeniería Informática y de Sistemas, Universidad de La Laguna, España;2. Institute of Information Systems, University of Hamburg, Germany |
| |
| Abstract: | Berth scheduling aims to optimally schedule vessels to berthing areas along a quay and is a complex optimization problem. In this paper we propose a lamda-optimal based heuristic as a resolution approach for the discrete space berth scheduling problem. The proposed heuristic can also be applied to validate optimality, in the case where other (meta)heuristics are applied as resolution approaches. A second internal Genetic Algorithms based heuristic is also proposed to reduce the computational time required for medium to large scale instances. Numerical experiments performed show that the proposed heuristic is adequate to produce near-optimal results within acceptable computational times. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
