Neighborhood search heuristics for a dynamic vehicle dispatching problem with pick-ups and deliveries

被引：161
|
作者：
Gendreau, Michel
Guertin, Francois
Potvin, Jean-Yves
Seguin, Rene
机构：
[1] Univ Montreal, Dept Informat & Rech Operat, Montreal, PQ H3C 3J7, Canada
[2] Univ Montreal, Ctr Rech Transports, Montreal, PQ H3C 3J7, Canada
[3] Ctr Operat Res & Anal, Def Res & Dev Canada, Ottawa, ON K1A 0K2, Canada
来源：
TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES | 2006年 / 14卷 / 03期
关键词：
vehicle dispatching; real-time; tabu search; neighborhood; ejection chains; parallel computing;
D O I：
10.1016/j.trc.2006.03.002
中图分类号：
U [交通运输];
学科分类号：
08 ; 0823 ;
摘要：
This paper proposes neighborhood search heuristics to optimize the planned routes of vehicles in a context where new requests, with a pick-up and a delivery location, occur in real-time. Within this framework, new solutions are explored through a neighborhood structure based on ejection chains. Numerical results show the benefits of these procedures in a real-time context. The impact of a master slave parallelization scheme, using an increasing number of processors, is also investigated. (c) 2006 Elsevier Ltd. All rights reserved.
引用
收藏
页码：157 / 174
页数：18
相关论文
共 50 条
  • [1] A local search metaheuristic algorithm for the vehicle routing problem with simultaneous pick-ups and deliveries
    Zachariadis, Emmanouil E.
    Kiranoudis, Chris T.
    EXPERT SYSTEMS WITH APPLICATIONS, 2011, 38 (03) : 2717 - 2726
  • [2] Scatter search for the stochastic travel-time vehicle routing problem with simultaneous pick-ups and deliveries
    Zhang, Tao
    Chaovalitwongse, W. A.
    Zhang, Yuejie
    COMPUTERS & OPERATIONS RESEARCH, 2012, 39 (10) : 2277 - 2290
  • [3] An adaptive memory methodology for the vehicle routing problem with simultaneous pick-ups and deliveries
    Zachariadis, Emmanouil E.
    Tarantilis, Christos D.
    Kiranoudis, Chris T.
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2010, 202 (02) : 401 - 411
  • [4] An Improved Particle Swarm Optimization for the Vehicle Routing Problem with Simultaneous Deliveries and Pick-Ups
    Tang, Chunhua
    Wang, Taosheng
    ADVANCED RESEARCH ON COMPUTER SCIENCE AND INFORMATION ENGINEERING, 2011, 153 : 294 - 300
  • [5] The Vehicle Routing Problem with Simultaneous Pick-ups and Deliveries and Two-Dimensional Loading Constraints
    Zachariadis, Emmanouil E.
    Tarantilis, Christos D.
    Kiranoudis, Chris T.
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2016, 251 (02) : 369 - 386
  • [6] Containership routing with time deadlines and simultaneous deliveries and pick-ups
    Karlaftis, Matthew G.
    Kepaptsoglou, Konstantinos
    Sambracos, Evangelos
    TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2009, 45 (01) : 210 - 221
  • [7] A shortest path approach to the multiple-vehicle routing problem with split pick-ups
    Lee, CG
    Epelman, MA
    White, CC
    Bozer, YA
    TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2006, 40 (04) : 265 - 284
  • [8] MULTI-OBJECTIVE INVASIVE WEED OPTIMIZATION FOR STOCHASTIC GREEN HUB LOCATION ROUTING PROBLEM WITH SIMULTANEOUS PICK-UPS AND DELIVERIES
    Mohammadi, Mehrdad
    Razmi, Jafar
    Tavakkoli-Moghaddam, Reza
    ECONOMIC COMPUTATION AND ECONOMIC CYBERNETICS STUDIES AND RESEARCH, 2013, 47 (03): : 247 - 266
  • [9] A parallel variable neighborhood search for the vehicle routing problem with divisible deliveries and pickups
    Polat, Olcay
    COMPUTERS & OPERATIONS RESEARCH, 2017, 85 : 71 - 86
  • [10] The research on the inventory routing problem with split pick-ups based on genetic algorithm
    Wan Fengjiao
    Zhang Qingnian
    2008 4TH INTERNATIONAL CONFERENCE ON WIRELESS COMMUNICATIONS, NETWORKING AND MOBILE COMPUTING, VOLS 1-31, 2008, : 6568 - 6571
12345