A Branch-and-Price Algorithm for Capacitated Arc Routing Problem with Flexible Time Windows

A Branch-and-Price Algorithm for Capacitated Arc Routing Problem with Flexible Time Windows

In this paper we study Capacitated Arc Routing Problem with Flexible Time Windows where violating a time windows implies some extra cost. We propose a branch-and-price algorithm due to the Dantzig-Wolfe decomposition. The subproblem is a non-elementary capacitated shortest path problem. Experimental...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Electronic notes in discrete mathematics 2010-08, Vol.36, p.319-326
1. Verfasser: Afsar, H. Murat
Format: Artikel
Sprache:eng
Schlagworte:
Capacitated arc routing
column generation
Computer Science
Discrete Mathematics
flexible time windows
Operations Research
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this paper we study Capacitated Arc Routing Problem with Flexible Time Windows where violating a time windows implies some extra cost. We propose a branch-and-price algorithm due to the Dantzig-Wolfe decomposition. The subproblem is a non-elementary capacitated shortest path problem. Experimental results are presented on the instances up to 40 nodes and 69 required edges.
ISSN:1571-0653
1571-0653
DOI:10.1016/j.endm.2010.05.041