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 条
  • [31] An effective and fast heuristic for the Dial-a-Ride problem
    Calvo, Roberto Wolfler
    Colorni, Alberto
    4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH, 2007, 5 (01): : 61 - 73
  • [32] MILP models for the Dial-a-ride problem with transfers
    Pierotti, Jacopo
    van Essen, J. Theresia
    EURO JOURNAL ON TRANSPORTATION AND LOGISTICS, 2021, 10
  • [33] The Dial-a-Ride Problem with Split Requests and Profits
    Parragh, Sophie N.
    de Sousa, Jorge Pinho
    Almada-Lobo, Bernardo
    TRANSPORTATION SCIENCE, 2015, 49 (02) : 311 - 334
  • [34] Anticipation in the Dial-a-Ride Problem: an introduction to the robustness
    Deleplanque, Samuel
    Derutin, Jean-Pierre
    Quilliot, Alain
    2013 FEDERATED CONFERENCE ON COMPUTER SCIENCE AND INFORMATION SYSTEMS (FEDCSIS), 2013, : 299 - 305
  • [35] Dial-a-ride problem in a public transit system
    Uchimura, Keiichi
    Saitoh, Takashi
    Takahashi, Hiro
    Electronics and Communications in Japan, Part III: Fundamental Electronic Science (English translation of Denshi Tsushin Gakkai Ronbunshi), 1999, 82 (07): : 30 - 38
  • [36] Waiting strategies for the dynamic dial-a-ride problem
    Yuen, C. W.
    Wong, K. I.
    Han, Anthony F.
    INTERNATIONAL JOURNAL OF ENVIRONMENT AND SUSTAINABLE DEVELOPMENT, 2009, 8 (3-4) : 314 - 329
  • [37] A Sample Average Approximation Approach for the Stochastic Dial-A-Ride Problem on a Multigraph with User Satisfaction
    Lu, Chang
    Wu, Yuehui
    Yu, Shanchuan
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2022, 302 (03) : 1031 - 1044
  • [38] Graph representation of the fixed route dial-a-ride problem
    Grinshpoun, Tal
    Shufan, Elad
    Ilani, Hagai
    Levit, Vadim
    Brama, Haya
    JOURNAL OF SCHEDULING, 2023, 26 (05) : 479 - 495
  • [39] A Granular Tabu Search algorithm for the Dial-a-Ride Problem
    Kirchler, Dominik
    Calvo, Roberto Wolfler
    TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2013, 56 : 120 - 135
  • [40] The dial-a-ride problem with private fleet and common carrier
    Schenekemberg, Cleder M.
    Chaves, Antonio A.
    Coelho, Leandro C.
    Guimaraes, Thiago A.
    Avelino, Gustavo G.
    COMPUTERS & OPERATIONS RESEARCH, 2022, 147