The paper deals with a sequencing and routing problem originated by a real-world application context. The problem consists in defining the best sequence of locations to visit within a warehouse for the storage and/or retrieval of a given set of items during a specified time horizon, by considering some specific requirements and operating policies which are typical of the kind of warehouse under study. A fleet composed of both electric (i.e., equipped with a lithium-ion battery) and conventional (i.e., with internal combustion engine) forklifts is considered. We model the problem in terms of constrained multicommodity flows on a space-time network, and we extend a matheuristic approach proposed for the case of only conventional vehicles. Preliminary computational results are also presented.
The Green Sequencing and Routing Problem
Lanza G.;Passacantando M.;Scutella M. G.
2022-01-01
Abstract
The paper deals with a sequencing and routing problem originated by a real-world application context. The problem consists in defining the best sequence of locations to visit within a warehouse for the storage and/or retrieval of a given set of items during a specified time horizon, by considering some specific requirements and operating policies which are typical of the kind of warehouse under study. A fleet composed of both electric (i.e., equipped with a lithium-ion battery) and conventional (i.e., with internal combustion engine) forklifts is considered. We model the problem in terms of constrained multicommodity flows on a space-time network, and we extend a matheuristic approach proposed for the case of only conventional vehicles. Preliminary computational results are also presented.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
