New dynamic programming algorithms for the resource constrained elementary shortest path problem

The resource constrained elementary shortest path problem (RCESPP) arises as a pricing subproblem in branch‐and‐price algorithms for vehicle‐routing problems with additional constraints. We address the optimization of the RCESPP and we present and compare three methods. The first method is a well‐kn...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Networks Jg. 51; H. 3; S. 155 - 170
Hauptverfasser:	Righini, Giovanni, Salani, Matteo
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Hoboken Wiley Subscription Services, Inc., A Wiley Company 01.05.2008 John Wiley & Sons
Schlagworte:	Applied sciences branch-and-bound column generation dynamic-programming Exact sciences and technology Logistics Operational research and scientific management Operational research. Management science shortest path vehicle-routing Branching Lower bound Fleet Branch and bound method Vehicle routing problem Shortest path Routing State space Hybridization State space method Optimization Column generation Time window branch-and-bound vehicle-routing Pricing Capacity constraint Dynamic programming Resource management dynamic-programming
ISSN:	0028-3045, 1097-0037
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!