Customers' Satisfaction in a Dial-A-Ride Problem

被引:13
|
作者
Mauri, Geraldo Regis [1 ]
Nogueira Lorena, Luiz Antonio [2 ]
机构
[1] Univ Fed Espirito Santo, Ctr Agrarian Sci, Vitoria, ES, Brazil
[2] INPE, Natl Inst Space Res, Lab Comp & Appl Math, Sao Paulo, Brazil
基金
巴西圣保罗研究基金会;
关键词
Dial-a-ride; Simulated Annealing; Heuristics; Routing;
D O I
10.1109/MITS.2009.934641
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
This paper presents a general model for a dial-a-ride problem and a Simulated Annealing approach to solve it focusing on the quality of service. The model includes several distinct cases of the real problems and an objective function that treats transportation costs and customer's inconveniences. The routes are clustered and scheduled in a separate way us-ing specific heuristic methods. The solution method is implemented in C++ and performed over a data set based on real problems. Computational results present new best known solutions with a higher level of quality of service than a recent method found in the literature.
引用
收藏
页码:6 / 14
页数:9
相关论文
共 50 条
  • [21] The dial-a-ride problem in a public transit system
    Uchimura, K
    Saitoh, T
    Takahashi, H
    ELECTRONICS AND COMMUNICATIONS IN JAPAN PART III-FUNDAMENTAL ELECTRONIC SCIENCE, 1999, 82 (07): : 30 - 38
  • [22] WAITING STRATEGIES FOR THE DYNAMIC DIAL-A-RIDE PROBLEM
    Yuen, C. W.
    Wong, K. I.
    Han, Anthony F.
    TRANSPORTATION SYSTEMS: ENGINEERING & MANAGEMENT, 2007, : 277 - 277
  • [23] The rail-road Dial-a-Ride problem
    Jodeau, Jean
    Absi, Nabil
    Chevrier, Remy
    Feillet, Dominique
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2024, 318 (02) : 486 - 499
  • [24] Efficiency and Truthfulness in Dial-a-Ride Problems with Customers Location Preferences
    Aleksandrov, Martin
    Kilby, Philip
    AI 2022: ADVANCES IN ARTIFICIAL INTELLIGENCE, 2022, 13728 : 690 - 703
  • [25] A Hyperheuristic for the Dial-a-Ride Problem with Time Windows
    Urra, Enrique
    Cubillos, Claudio
    Cabrera-Paniagua, Daniel
    MATHEMATICAL PROBLEMS IN ENGINEERING, 2015, 2015
  • [26] Analysis of the dial-a-ride problem of Hunsaker and Savelsbergh
    Firat, Murat
    Woeginger, Gerhard J.
    OPERATIONS RESEARCH LETTERS, 2011, 39 (01) : 32 - 35
  • [27] Variable neighborhood search for the dial-a-ride problem
    Parragh, Sophie N.
    Doerner, Karl F.
    Hartl, Richard F.
    COMPUTERS & OPERATIONS RESEARCH, 2010, 37 (06) : 1129 - 1138
  • [28] A hard dial-a-ride problem that is easy on average
    Coja-Oghlan, A
    Krumke, SO
    Nierhoff, T
    JOURNAL OF SCHEDULING, 2005, 8 (03) : 197 - 210
  • [29] A Hard Dial-a-Ride Problem that is Easy on Average
    Amin Coja-Oghlan
    Sven O. Krumke
    Till Nierhoff
    Journal of Scheduling, 2005, 8 : 197 - 210
  • [30] The Electric Dial-a-Ride Problem on a Fixed Circuit
    Molenbruch, Yves
    Braekers, Kris
    Eisenhandler, Ohad
    Kaspi, Mor
    TRANSPORTATION SCIENCE, 2023, 57 (03) : 594 - 612