Solving the Traveling Salesman Problem with release dates via branch and cut

In this paper we study the Traveling Salesman Problem with release dates (TSP-rd) and completion time minimization. The TSP-rd considers a single vehicle and a set of customers that must be served exactly once with goods that arrive to the depot over time, during the planning horizon. The time at wh...

Fuld beskrivelse

Bibliografiske detaljer

Principais autores:	Agustín Montero, Isabel Méndez-Díaz, Juan José Miranda-Bront
Format:	Artigo
Sprog:	Inglês
Udgivet:	Elsevier 2023-01-01
Serier:	EURO Journal on Transportation and Logistics
Fag:	Traveling Salesman Problem Release dates Integer Linear Programming Branch and cut
Online adgang:	http://www.sciencedirect.com/science/article/pii/S2192437623000183
Tags:	Tilføj Tag Ingen Tags, Vær først til at tagge denne postø!