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 条
  • [41] Evaluating the performance of a dial-a-ride service using simulation
    Haell, Carl H.
    Lundgren, Jan T.
    Voss, Stefan
    [J]. PUBLIC TRANSPORT, 2015, 7 (02) : 139 - 157
  • [42] Maximizing Rides Served for Dial-a-Ride on the Uniform Metric
    Anthony, Barbara M.
    Birnbaum, Ricky
    Boyd, Sara
    Chung, Christine
    Das, Ananya
    Davis, Patrick
    Dhimar, Jigar
    Tran, Duc
    Yuen, David
    [J]. THEORY OF COMPUTING SYSTEMS, 2025, 69 (01)
  • [43] Hybrid metaheuristic for the dial-a-ride problem with private fleet and common carrier integrated with public transportation
    Schenekemberg, Cleder M.
    Chaves, Antonio A.
    Guimaraes, Thiago A.
    Coelho, Leandro C.
    [J]. ANNALS OF OPERATIONS RESEARCH, 2024,
  • [44] An adaptive insertion algorithm for the single-vehicle dial-a-ride problem with narrow time windows
    Hame, Lauri
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2011, 209 (01) : 11 - 22
  • [45] Exact and meta-heuristic approach for a general heterogeneous dial-a-ride problem with multiple depots
    Braekers, Kris
    Caris, An
    Janssens, Gerrit K.
    [J]. TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2014, 67 : 166 - 186
  • [46] A High-level Category Survey of Dial-a-Ride Problems
    Goekay, Sevket
    Heuvels, Andreas
    Krempels, Karl-Heinz
    [J]. PROCEEDINGS OF THE 5TH INTERNATIONAL CONFERENCE ON VEHICLE TECHNOLOGY AND INTELLIGENT TRANSPORT SYSTEMS (VEHITS 2019), 2019, : 594 - 600
  • [47] Deliberation of Providing Dial-a-Ride Service in Urban Transit Planning
    Li, WenZhao
    Yang, XiaoKuan
    [J]. INTERNATIONAL SYMPOSIUM MODERN EDUCATION AND HUMAN SCIENCES (MEHS 2014), 2014, : 76 - 81
  • [48] Statistical and machine learning approach for planning dial-a-ride systems
    Markovic, Nikola
    Kim, Myungseob Edward
    Schonfeld, Paul
    [J]. TRANSPORTATION RESEARCH PART A-POLICY AND PRACTICE, 2016, 89 : 41 - 55
  • [49] Computer-aided complexity classification of dial-a-ride problems
    de Paepe, WE
    Lenstra, JK
    Sgall, J
    Sitters, RA
    Stougie, L
    [J]. INFORMS JOURNAL ON COMPUTING, 2004, 16 (02) : 120 - 132
  • [50] On-line single-server dial-a-ride problems
    Feuerstein, E
    Stougie, L
    [J]. THEORETICAL COMPUTER SCIENCE, 2001, 268 (01) : 91 - 105