The rural postman problem with deadline classes

被引：20
|
作者：
Letchford, AN [1 ]
Eglese, RW [1 ]
机构：
[1] Univ Lancaster, Sch Management, Dept Management Sci, Lancaster LA1 4YX, England
来源：
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 1998年 / 105卷 / 03期
关键词：
rural postman problem; time windows; integer programming; cutting-planes;
D O I：
10.1016/S0377-2217(97)00090-8
中图分类号：
C93 [管理学];
学科分类号：
12 ; 1201 ; 1202 ; 120202 ;
摘要：
Vehicle routing problems with general time windows are extremely difficult to solve. However, the time windows in a particular problem may have a special structure which can be exploited. We consider a single-vehicle are-routing problem in which the arcs are partitioned into deadline classes. It is shown that a cutting-plane approach works well for this problem. (C) 1998 Elsevier Science B.V.
引用
收藏
页码：390 / 400
页数：11
相关论文
共 50 条
  • [1] On crossings, the crossing postman problem, and the rural postman problem
    Garfinkel, RS
    Webb, IR
    [J]. NETWORKS, 1999, 34 (03) : 173 - 180
  • [2] Solving the hierarchical Chinese postman problem as a rural postman problem
    Cabral, EA
    Gendreau, M
    Ghiani, G
    Laporte, G
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2004, 155 (01) : 44 - 50
  • [3] ALGORITHMS FOR THE RURAL POSTMAN PROBLEM
    PEARN, WL
    WU, TC
    [J]. COMPUTERS & OPERATIONS RESEARCH, 1995, 22 (08) : 819 - 828
  • [4] Reoptimizing the rural postman problem
    Archetti, C.
    Guastaroba, G.
    Speranza, M. G.
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2013, 40 (05) : 1306 - 1313
  • [5] Heuristics for the rural postman problem
    Holmberg, Kaj
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2010, 37 (05) : 981 - 990
  • [6] The Rural Postman Problem with Time Windows
    Monroy-Licht, Marcela
    Alberto Amaya, Ciro
    Langevin, Andre
    [J]. NETWORKS, 2014, 64 (03) : 169 - 180
  • [7] The Hierarchical Mixed Rural Postman Problem
    Colombi, Marco
    Corberan, Angel
    Mansini, Renata
    Plana, Isaac
    Sanchis, Jose M.
    [J]. TRANSPORTATION SCIENCE, 2017, 51 (02) : 755 - 770
  • [8] A heuristic for the periodic rural postman problem
    Ghiani, G
    Musmanno, R
    Paletta, G
    Triki, C
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2005, 32 (02) : 219 - 228
  • [9] Heuristics for a dynamic rural postman problem
    Moreira, Luis A.
    Oliveira, Jose F.
    Gomes, A. Miguel
    Ferreira, J. Soeiro
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2007, 34 (11) : 3281 - 3294
  • [10] A POLYHEDRAL APPROACH TO THE RURAL POSTMAN PROBLEM
    CORBERAN, A
    SANCHIS, JM
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1994, 79 (01) : 95 - 114
12345