4316. Multi-Neighborhood Search for the AGV Scheduling Problem with Battery Constraints
Invited abstract in session TF-43: Metaheuristics for Scheduling and Timetabling, stream Metaheuristics.
Tuesday, 16:15-17:45Room: JUR – Seminar-Raum 63
Authors (first author is the speaker)
| 1. | Roberto Maria Rosati
|
| WU Vienna University of Economics and Business | |
| 2. | Maurizio Boccia
|
| DIETI, University of Naples "Federico II" | |
| 3. | Adriano Masone
|
| Department of Electrical Engineering and Information Technology, University "Federico II" of Naples | |
| 4. | Claudio Sterle
|
| Department of Electrical Engineering and Information Technology, Università Federico II di Napoli |
Abstract
The Automated Guided Vehicle (AGV) scheduling problem with battery constraints consists of determining the scheduling of jobs and charging operations of a fleet of AGVs, such that the makespan is minimized.
Our solution method relies on an implicit solution representation and a greedy decoder. The implicit search space is explored by a composition of six neighborhoods: Move, Swap, Kick, Two-Opt, Three-Opt, and Rotate.
Experimental results demonstrate that our method finds nearly optimal solutions in short computing times, while handling multiple problem variants at the decoder level.
Keywords
- Scheduling
- Metaheuristics
- Warehouse Design, Planning, and Control
Status: accepted
Back to the list of papers