THE TRAVELING SALESMAN PROBLEM WITH PICK-UP AND DELIVERY

被引：100
|
作者：
MOSHEIOV, G [1 ]
机构：
[1] HEBREW UNIV JERUSALEM, DEPT STAT, JERUSALEM, ISRAEL
来源：
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 1994年 / 79卷 / 02期
关键词：
ROUTING WITH PICK-UP AND DELIVERY; DISTRIBUTION; TRANSPORTATION GENERAL; HEURISTICS;
D O I：
10.1016/0377-2217(94)90360-3
中图分类号：
C93 [管理学];
学科分类号：
12 ; 1201 ; 1202 ; 120202 ;
摘要：
Demand points for pick-up and delivery are located in the plane. A single vehicle of a given capacity performs both pick-ups and deliveries. The objective is to find the shortest feasible tour. A real life application is described. We compare this problem to the classic Travelling Salesman Problem. Based on their similarity we develop a simple heuristic consisting of pick-up and delivery along the travelling salesman tour. Asymptotic behavior and worst case analysis are provided. We then introduce an alternative solution method which is an extension of the well known Cheapest Insertion heuristic. Performance of both heuristics is tested on various-size simulated problems.
引用
收藏
页码：299 / 310
页数：12
相关论文
共 50 条
  • [31] 'PICK-UP'
    BOOTH, P
    [J]. AMERICAN POETRY REVIEW, 1986, 15 (02): : 39 - 39
  • [32] An improved genetic algorithm for the vehicle routing problem with simultaneous delivery and pick-up service
    Erbao Cao
    Mingyong Lai
    [J]. SIXTH WUHAN INTERNATIONAL CONFERENCE ON E-BUSINESS, VOLS 1-4: MANAGEMENT CHALLENGES IN A GLOBAL WORLD, 2007, : 2100 - 2106
  • [33] A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service
    Montané, FAT
    Galvao, RD
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2006, 33 (03) : 595 - 619
  • [34] A hybrid metaheuristic algorithm for the vehicle routing problem with simultaneous delivery and pick-up service
    Zachariadis, Emmanouil E.
    Tarantilis, Christos D.
    Kiranoudis, Chris T.
    [J]. EXPERT SYSTEMS WITH APPLICATIONS, 2009, 36 (02) : 1070 - 1081
  • [35] Vehicle routing and reverse logistics: the vehicle routing problem with simultaneous delivery and pick-up
    Dethloff, J
    [J]. OR SPEKTRUM, 2001, 23 (01) : 79 - 96
  • [36] The dynamic nearest neighbor policy for the multi-vehicle pick-up and delivery problem
    Sheridan, Patricia Kristine
    Gluck, Erich
    Guan, Qi
    Pickles, Thomas
    Balcioglu, Baris
    Benhabib, Beno
    [J]. TRANSPORTATION RESEARCH PART A-POLICY AND PRACTICE, 2013, 49 : 178 - 194
  • [37] Heuristics policies and simulation for the stochastic dynamic pick-up and delivery vehicle routing problem
    Chen, Jiu-Mei
    Zhang, Xu-Mei
    Xiao, Jian
    [J]. Jisuanji Jicheng Zhizao Xitong/Computer Integrated Manufacturing Systems, CIMS, 2009, 15 (08): : 1578 - 1585
  • [38] Ant Colony System Algorithm for the Vehicle Routing Problem with Simultaneous Delivery and Pick-Up
    Cabrera G, Guillermo
    Peralta, Felipe
    [J]. ICCIT: 2009 FOURTH INTERNATIONAL CONFERENCE ON COMPUTER SCIENCES AND CONVERGENCE INFORMATION TECHNOLOGY, VOLS 1 AND 2, 2009, : 1575 - 1580
  • [39] The load-dependent vehicle routing problem and its pick-up and delivery extension
    Zachariadis, Emmanouil E.
    Tarantilis, Christos D.
    Kiranoudis, Chris T.
    [J]. TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2015, 71 : 158 - 181
  • [40] Event-driven optimal control for a robotic exploration, pick-up and delivery problem
    Nenchev, Vladislav
    Cassandras, Christos G.
    Raisch, Jorg
    [J]. NONLINEAR ANALYSIS-HYBRID SYSTEMS, 2018, 30 : 266 - 284
12345