A variable neighborhood descent heuristic for arc routing problems with time-dependent service costs

This paper proposes a variable neighborhood descent heuristic for solving a capacitated arc routing problem with time-dependent service costs. The problem is motivated by winter gritting applications where the timing of each intervention is crucial. The variable neighborhood descent is based on neighborhood structures that manipulate arcs or sequences of arcs. Computational results are reported on problems derived from classical capacitated arc routing problem instances. A comparison is also provided with an alternative approach where the arc routing problem is solved after being transformed into an equivalent node routing problem. © 2010 Elsevier Ltd. All rights reserved.

https://doi.org/10.1016/j.cie.2010.09.006

Cite as:

@article{Tagmouti_2010,
	doi = {10.1016/j.cie.2010.09.006},
	url = {https://doi.org/10.1016%2Fj.cie.2010.09.006},
	year = 2010,
	month = {nov},
	publisher = {Elsevier {BV}},
	volume = {59},
	number = {4},
	pages = {954--963},
	author = {Mariam Tagmouti and Michel Gendreau and Jean-Yves Potvin},
	title = {A variable neighborhood descent heuristic for arc routing problems with time-dependent service costs},
	journal = {Computers {&}amp$mathsemicolon$ Industrial Engineering}
}