The Profitable Arc Tour Problem: Solution with a Branch-and-Price Algorithm

In this article, we introduce a new arc routing problem that we call the profitable arc tour problem. This problem is defined on a graph in which profits and travel costs are associated with the arcs. The objective is to find a set of cycles in the graph that maximizes the collection of profit minus...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Transportation science 2005-11, Vol.39 (4), p.539-552
Hauptverfasser:	Feillet, Dominique, Dejax, Pierre, Gendreau, Michel
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Analysis Applied sciences arc-routing problem bounded cycle cover Branch & bound algorithms branch and price column generation Commuting Cost efficiency Costs Exact sciences and technology Freight forwarding Ground, air and sea transportation, marine construction Heuristics Integers Logistics Mathematical models Matrix Network management systems Networks Operations research Optimal solutions Problem solving Profit Profits Routing routing problem with profits Statistical analysis Studies Traffic flow Transport Transportation Transportation planning, management and economics Travel Travel expenses Traveling salesman problem Vehicles Vertices
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!