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] Typology and literature review for dial-a-ride problems
    Yves Molenbruch
    Kris Braekers
    An Caris
    Annals of Operations Research, 2017, 259 : 295 - 325
  • [32] Typology and literature review for dial-a-ride problems
    Molenbruch, Yves
    Braekers, Kris
    Caris, An
    ANNALS OF OPERATIONS RESEARCH, 2017, 259 (1-2) : 295 - 325
  • [33] A modeling system for simulation of dial-a-ride services
    Häll C.H.
    Högberg M.
    Lundgren J.T.
    Public Transport, 2012, 4 (1) : 17 - 37
  • [34] A survey of dial-a-ride problems: Literature review and recent developments
    Ho, Sin C.
    Szeto, W. Y.
    Kuo, Yong-Hong
    Leung, Janny M. Y.
    Petering, Matthew
    Tou, Terence W. H.
    TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2018, 111 : 395 - 421
  • [35] Taxi-sharing: Parameterized complexity and approximability of the dial-a-ride problem with money as an incentive
    Watel, Dimitri
    Faye, Alain
    THEORETICAL COMPUTER SCIENCE, 2018, 745 : 202 - 223
  • [36] The study of a dynamic dial-a-ride problem under time-dependent and stochastic environments
    Xiang, Zhihai
    Chu, Chengbin
    Chen, Haoxun
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2008, 185 (02) : 534 - 551
  • [37] Adaptive large neighborhood search for the time-dependent profitable dial-a-ride problem
    Zhao, Jingyi
    Poon, Mark
    Zhang, Zhenzhen
    Gu, Ruixue
    COMPUTERS & OPERATIONS RESEARCH, 2022, 147
  • [38] A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives
    Madsen, OBG
    Ravn, HF
    Rygaard, JM
    ANNALS OF OPERATIONS RESEARCH, 1995, 60 : 193 - 208
  • [39] Dial-a-Ride Problem With Meeting Point Feature Known-as Express-Pool
    Ham, Andy
    IEEE ACCESS, 2021, 9 : 86404 - 86411
  • [40] The electric vehicle dial-a-ride problem: Integrating ride-sharing and time-of-use electricity pricing
    Dong, Huichang
    Luo, Zhixing
    Huang, Nan
    Hu, Hongjian
    Qin, Hu
    TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2025, 194