Skip to Main content Skip to Navigation
Journal articles

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

Abstract : 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.
Complete list of metadatas

https://hal-utt.archives-ouvertes.fr/hal-02475804
Contributor : Daniel Gavrysiak <>
Submitted on : Wednesday, February 12, 2020 - 11:59:50 AM
Last modification on : Thursday, February 20, 2020 - 11:32:01 AM

Identifiers

Collections

Citation

Hasan Murat Afsar. A Branch-and-Price Algorithm for Capacitated Arc Routing Problem with Flexible Time Windows. Electronic Notes in Discrete Mathematics, Elsevier, 2010, 36, pp.319-326. ⟨10.1016/j.endm.2010.05.041⟩. ⟨hal-02475804⟩

Share

Metrics

Record views

55