This work introduces the Trigger Arc Travelling Salesman Problem (TATSP), a variant of the classical TSP that models dynamic arc costs influenced by the solution’s path. It is presented a real-world application that can be modelled through the TATSP, aiming to optimise operations in warehouses with compactable storage systems. An Integer Linear Programming model (ILP) is described and implemented. Finally, the experimental results obtained from a set of generated instances are discussed.
The Trigger Arc TSP: Optimise the Picking Process in Warehouses with Compactable Storage Systems
Cerrone, Carmine;Truvolo, Maria;Dragone, Raffaele;
2025-01-01
Abstract
This work introduces the Trigger Arc Travelling Salesman Problem (TATSP), a variant of the classical TSP that models dynamic arc costs influenced by the solution’s path. It is presented a real-world application that can be modelled through the TATSP, aiming to optimise operations in warehouses with compactable storage systems. An Integer Linear Programming model (ILP) is described and implemented. Finally, the experimental results obtained from a set of generated instances are discussed.
File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
