A Matheuristic for the Dial-a-Ride Problem

被引：0
|
作者：
Calvo, Roberto Wolfler [1 ]
Touati-Moungla, Nora [2 ]
机构：
[1] 99 Ave J-B Clement, F-93430 Villetaneuse, France
[2] Ecole Polytech, Lab Informat LIX, F-91128 Palaiseau, France
来源：
NETWORK OPTIMIZATION | 2011年 / 6701卷
关键词：
VEHICLE-ROUTING PROBLEM; TABU SEARCH; TIME WINDOWS; DELIVERY PROBLEM; ALGORITHMS; PICKUP; BRANCH; CUT;
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
The Dial-a-Ride is a transport system on demand. A fleet of vehicles, without fixed routes and schedules, carries people from their pickup points to their delivery points, during a pre-specified time interval. It can be modeled as an NP-hard routing and scheduling problem, with a suitable mixed integer programming formulation. Exact approaches to this problem are too limited to tackle real-life instances: time dependent network, requests received on-line, different objective functions. In this paper we propose an algorithm to solve the off-line Dial-a-Ride Problem (DARP), based on a Granular Tabu Search method. This algorithm was fast and effective, when tested on instances created ad hoc using the Milan network.
引用
收藏
页码：450 / 463
页数：14
相关论文
共 50 条
  • [1] The Dial-A-Ride Problem with Transfers
    Masson, Renaud
    Lehuede, Fabien
    Peton, Olivier
    COMPUTERS & OPERATIONS RESEARCH, 2014, 41 : 12 - 23
  • [2] The dial-a-ride problem with fairness
    Miyaoka, Makoto
    Sukegawa, Noriyoshi
    Asano, Takao
    JOURNAL OF ADVANCED MECHANICAL DESIGN SYSTEMS AND MANUFACTURING, 2018, 12 (03):
  • [3] The Integrated Dial-a-Ride Problem
    Häll C.H.
    Andersson H.
    Lundgren J.T.
    Värbrand P.
    Public Transport, 2009, 1 (1) : 39 - 54
  • [4] The finite capacity dial-a-ride problem
    Charikar, M
    Raghavachari, B
    39TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 1998, : 458 - 467
  • [5] The dial-a-ride problem: models and algorithms
    Jean-François Cordeau
    Gilbert Laporte
    Annals of Operations Research, 2007, 153 : 29 - 46
  • [6] The dial-a-ride problem: models and algorithms
    Cordeau, Jean-Francois
    Laporte, Gilbert
    ANNALS OF OPERATIONS RESEARCH, 2007, 153 (01) : 29 - 46
  • [7] STRATEGIES FOR THE DYNAMIC DIAL-A-RIDE PROBLEM
    Wong, K. I.
    TRANSPORTATION AND THE ECONOMY, 2005, : 551 - 559
  • [8] Customers' Satisfaction in a Dial-A-Ride Problem
    Mauri, Geraldo Regis
    Nogueira Lorena, Luiz Antonio
    IEEE INTELLIGENT TRANSPORTATION SYSTEMS MAGAZINE, 2009, 1 (03) : 6 - 14
  • [9] The electric autonomous dial-a-ride problem
    Bongiovanni, Claudia
    Kaspi, Mor
    Geroliminis, Nikolas
    TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2019, 122 : 436 - 456
  • [10] A New Formulation for the Dial-a-Ride Problem
    Rist, Yannik
    Forbes, Michael A.
    TRANSPORTATION SCIENCE, 2021, 55 (05) : 1113 - 1135
12345