Article ID: | iaor20014139 |
Country: | United Kingdom |
Volume: | 52 |
Issue: | 4 |
Start Page Number: | 433 |
End Page Number: | 439 |
Publication Date: | Apr 2001 |
Journal: | Journal of the Operational Research Society |
Authors: | Laporte Gilbert, Soriano P., Clossey J. |
Keywords: | programming: travelling salesman |
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.