Solving arc routing problems with turn penalties

J Clossey, G Laporte () and P Soriano
Additional contact information
J Clossey: GERAD and École des Hautes Études Commerciales
G Laporte: GERAD and École des Hautes Études Commerciales
P Soriano: GERAD and École des Hautes Études Commerciales

Journal of the Operational Research Society, 2001, vol. 52, issue 4, 433-439

Abstract: Abstract In several arc routing problems, it is necessary to take turn penalties into account when designing a solution. Traditionally, this is done through a transformation of the arc routing problem into an equivalent vertex routing problem. In this paper it is shown that a more direct approach, not resorting to such a transformation, may be more efficient.

Keywords: arc routing problems; turn penalties; travelling salesman problem; Chinese postman problem; heuristics (search for similar items in EconPapers)
Date: 2001
References: Add references at CitEc
Citations: View citations in EconPapers (15)

Downloads: (external link)
http://link.springer.com/10.1057/palgrave.jors.2601052 Abstract (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:pal:jorsoc:v:52:y:2001:i:4:d:10.1057_palgrave.jors.2601052

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/41274

DOI: 10.1057/palgrave.jors.2601052

Access Statistics for this article

Journal of the Operational Research Society is currently edited by Tom Archibald and Jonathan Crook

More articles in Journal of the Operational Research Society from Palgrave Macmillan, The OR Society
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().