In the Double Travelling Salesman Problem with Multiple Stacks (DTSPMS) a set of orders is given, each one requiring transportation of one item from a customer in a pickup region to a customer in a delivery region. The vehicle available for the transportation in each region carries a container, which is organised in rows of given length. Each row is handled independently from the others according to a LIFO stack policy. The DTSPMS consists in determining the pickup tour, the loading plan of the container and the delivery tour in such a way that the total length of the two tours is minimised. We present different modelling approaches to solving the DTSPMS to optimality and use the solutions obtained to evaluate the quality of previously obtained heuristic solutions.
|Publication status||Published - 2009|
|Event||Odysseus 2009 : Fourth International Workshop on Freight Transportation and Logistics - Çeşme, Turkey|
Duration: 1 Jan 2009 → …
Conference number: 4
|Conference||Odysseus 2009 : Fourth International Workshop on Freight Transportation and Logistics|
|Period||01/01/2009 → …|