Similar Search Results

A dynamic programming based local search approach for the double traveling salesman problem with multiple stacks

Urrutia, Sebastián; Milanés, Anolan; Lokketangen, Arne - In: International transactions in operational research : … 22 (2015) 1, pp. 61-75

Persistent link: https://www.econbiz.de/10010498603

Dynamic programming for the minimum tour duration problem

Tilk, Christian; Irnich, Stefan - In: Transportation science : a journal of the Institute for … 51 (2017) 2, pp. 549-565

Persistent link: https://www.econbiz.de/10011689609

Exact methods for the traveling salesman problem with drone

Roberti, Roberto; Ruthmair, Mario - In: Transportation science : a journal of the Institute for … 55 (2021) 2, pp. 315-335

Persistent link: https://www.econbiz.de/10012506469

Dynamic programming for the time-dependent traveling salesman problem with time windows

Lera-Romero, Gonzalo; Miranda Bront, Juan José; … - In: INFORMS journal on computing : JOC ; charting new … 34 (2022) 6, pp. 3292-3308

Persistent link: https://www.econbiz.de/10014326819

Exponential-size neighborhoods for the pickup-and-delivery traveling salesman problem

Pacheco, Toni; Martinelli, Rafael; Subramanian, Anand; … - In: Transportation science 57 (2023) 2, pp. 463-481

Persistent link: https://www.econbiz.de/10014310760

Dynamic Programming Approaches for the Traveling Salesman Problem with Drone

Bouman, Paul; Agatz, Niels; Schmidt, Marie - 2018

A promising new delivery model involves the use of a delivery truck that collaborates with a drone to make deliveries. Effectively combining a truck and a drone gives rise to a new planning problem that is known as the Traveling Salesman Problem with Drone (TSP-D). This paper presents exact...

Persistent link: https://www.econbiz.de/10014119395