Solving arc routing problems with turn penalties

被引：26

作者：

Clossey, J

Laporte, G

Soriano, P

机构：

[1] Gerad, Montreal, PQ H3T 2A7, Canada

[2] Ecole Hautes Etud Commerciales, Montreal, PQ H3T 2A7, Canada

来源：

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY | 2001年 / 52卷 / 04期

基金：

加拿大自然科学与工程研究理事会;

关键词：

arc routing problems; turn penalties; travelling salesman problem; Chinese postman problem; heuristics;

D O I：

10.1057/palgrave.jors.2601052

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

In several are routing problems, it is necessary to take turn penalties into account when designing a solution. Traditionally, this is done through a transformation of the are 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.

引用

页码：433 / 439

页数：7

共 28 条

[1]

ALVAREZVALDES R, 1993, ARC COMPUTERISED SYS

[2]

Assad A. A., 1995, HDBK OPER R, P375, DOI 10.1016/S0927-0507(05)80109-4

[3] The directed rural postman problem with turn penalties [J].