A Branch-and-Price Algorithm for Capacitated Arc Routing Problem with Flexible Time Windows - Archive ouverte HAL Access content directly
Journal Articles Electronic Notes in Discrete Mathematics Year : 2010

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

(1)
1

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.
Not file

Dates and versions

hal-02475804 , version 1 (12-02-2020)

Identifiers

Cite

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

Altmetric

Share

Gmail Facebook Twitter LinkedIn More