An Asymmetric Multiple Traveling Salesman Problem with Backhauls to solve a Dial-a-Ride Problem

被引：0
|
作者：
Osaba, E. [1 ]
Onieva, E. [1 ]
Diaz, F. [1 ]
Carballedo, R. [1 ]
Lopez, P. [1 ]
Perallos, A. [1 ]
机构：
[1] Univ Deusto, Deusto Instute Technol, Ave Univ 24, Bilbao, Spain
来源：
2015 IEEE 13TH INTERNATIONAL SYMPOSIUM ON APPLIED MACHINE INTELLIGENCE AND INFORMATICS (SAMI) | 2015年
关键词：
On demand transportation; Traveling Salesman Problem; Combinatorial optimization; Genetic Algorithm; Meta-heuristic; VEHICLE-ROUTING PROBLEM; ALGORITHMS;
D O I：
暂无
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
Nowadays, public transportation has become an essential area for the actual society, which directly affects the quality of life. There are different sort of public transportation systems. One type that receives much attention these days because of its great social interest is the transportation on-demand. Some of the most well-known on-demand transports systems are the Demand Responsive Transit, and the Dial-a-Ride. In this paper, a real-world Dial-a-Ride problem is presented and modeled as a Multi-Attribute Traveling Salesman Problem. In addition, in this work a benchmark of this problem is presented, and the first resolution of this benchmark is offered. For the resolution of the problem an Adaptive Multi-Crossover Population Algorithm has been implemented.
引用
收藏
页码：151 / 156
页数：6
相关论文
共 50 条
  • [1] The traveling salesman problem with backhauls
    Gendreau, M
    Hertz, A
    Laporte, G
    [J]. COMPUTERS & OPERATIONS RESEARCH, 1996, 23 (05) : 501 - 508
  • [2] The dial-a-ride problem with fairness
    Miyaoka, Makoto
    Sukegawa, Noriyoshi
    Asano, Takao
    [J]. JOURNAL OF ADVANCED MECHANICAL DESIGN SYSTEMS AND MANUFACTURING, 2018, 12 (03):
  • [3] The Dial-A-Ride Problem with Transfers
    Masson, Renaud
    Lehuede, Fabien
    Peton, Olivier
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2014, 41 : 12 - 23
  • [4] The Integrated Dial-a-Ride Problem
    Häll C.H.
    Andersson H.
    Lundgren J.T.
    Värbrand P.
    [J]. Public Transport, 2009, 1 (1) : 39 - 54
  • [5] A Matheuristic for the Dial-a-Ride Problem
    Calvo, Roberto Wolfler
    Touati-Moungla, Nora
    [J]. NETWORK OPTIMIZATION, 2011, 6701 : 450 - 463
  • [6] THE TRAVELING SALESMAN PROBLEM WITH DELIVERY AND BACKHAULS
    ANILY, S
    MOSHEIOV, G
    [J]. OPERATIONS RESEARCH LETTERS, 1994, 16 (01) : 11 - 18
  • [7] The finite capacity dial-a-ride problem
    Charikar, M
    Raghavachari, B
    [J]. 39TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 1998, : 458 - 467
  • [8] The dial-a-ride problem: models and algorithms
    Jean-François Cordeau
    Gilbert Laporte
    [J]. Annals of Operations Research, 2007, 153 : 29 - 46
  • [9] The dial-a-ride problem: models and algorithms
    Cordeau, Jean-Francois
    Laporte, Gilbert
    [J]. ANNALS OF OPERATIONS RESEARCH, 2007, 153 (01) : 29 - 46
  • [10] STRATEGIES FOR THE DYNAMIC DIAL-A-RIDE PROBLEM
    Wong, K. I.
    [J]. TRANSPORTATION AND THE ECONOMY, 2005, : 551 - 559
12345