An MDD-Based Lagrangian Approach to the Multicommodity Pickup-and-Delivery TSP

We address the one-to-one multicommodity pickup-and-delivery traveling salesman problem, a challenging variant of the traveling salesman problem that includes the transportation of commodities between locations. The goal is to find a minimum cost tour such that each commodity is delivered to its des...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	INFORMS journal on computing 2020-04, Vol.32 (2), p.263-278, Article ijoc.2018.0881
Hauptverfasser:	Castro, Margarita P., Cire, Andre A., Beck, J. Christopher
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Combinatorial analysis Commodities Construction methods decision diagrams Lagrange multiplier Lagrangian duality Mathematical problems Minimum cost Optimization algorithms Routing Traveling salesman problem vehicle routing
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!