A HEURISTIC ALGORITHM FOR THE PERIOD VEHICLE-ROUTING PROBLEM

被引：73
|
作者：
TAN, CCR
BEASLEY, JE
机构：
来源：
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE | 1984年 / 12卷 / 05期
关键词：
D O I：
10.1016/0305-0483(84)90050-1
中图分类号：
C93 [管理学];
学科分类号：
12 ; 1201 ; 1202 ; 120202 ;
摘要：
引用
收藏
页码：497 / 504
页数：8
相关论文
共 50 条
  • [1] AN IMPROVED HEURISTIC FOR THE PERIOD VEHICLE-ROUTING PROBLEM
    CHAO, IM
    GOLDEN, BL
    WASIL, E
    [J]. NETWORKS, 1995, 26 (01) : 25 - 44
  • [2] A HEURISTIC FOR THE PERIODIC VEHICLE-ROUTING PROBLEM
    GAUDIOSO, M
    PALETTA, G
    [J]. TRANSPORTATION SCIENCE, 1992, 26 (02) : 86 - 92
  • [3] A TABU SEARCH HEURISTIC FOR THE VEHICLE-ROUTING PROBLEM
    GENDREAU, M
    HERTZ, A
    LAPORTE, G
    [J]. MANAGEMENT SCIENCE, 1994, 40 (10) : 1276 - 1290
  • [4] THE SAVINGS ALGORITHM FOR THE VEHICLE-ROUTING PROBLEM
    PAESSENS, H
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1988, 34 (03) : 336 - 344
  • [5] Exact and Heuristic Solution of the Consistent Vehicle-Routing Problem
    Goeke, Dominik
    Roberti, Roberto
    Schneider, Michael
    [J]. TRANSPORTATION SCIENCE, 2019, 53 (04) : 1023 - 1042
  • [6] A GENERALIZED EXCHANGE HEURISTIC FOR THE CAPACITATED VEHICLE-ROUTING PROBLEM
    HARCHE, F
    RAGHAVAN, P
    [J]. INTERNATIONAL JOURNAL OF SYSTEMS SCIENCE, 1994, 25 (11) : 1911 - 1920
  • [7] THE SPACEFILLING CURVE WITH OPTIMAL PARTITIONING HEURISTIC FOR THE VEHICLE-ROUTING PROBLEM
    BOWERMAN, RL
    CALAMAI, PH
    HALL, GB
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1994, 76 (01) : 128 - 142
  • [8] THE VEHICLE-ROUTING PROBLEM
    MEHBALI, M
    [J]. ARS COMBINATORIA, 1990, 29A : 129 - 140
  • [9] A NEW HEURISTIC FOR THE FLEET SIZE AND MIX VEHICLE-ROUTING PROBLEM
    DESROCHERS, M
    VERHOOG, TW
    [J]. COMPUTERS & OPERATIONS RESEARCH, 1991, 18 (03) : 263 - 274
  • [10] A PRACTICAL HEURISTIC FOR A LARGE-SCALE VEHICLE-ROUTING PROBLEM
    RAGHAVENDRA, A
    KRISHNAKUMAR, TS
    MURALIDHAR, R
    SARVANAN, D
    RAGHAVENDRA, BG
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1992, 57 (01) : 32 - 38
12345