A new approach based on the Multi-Objective Simulated Annealing to solving the dynamic Dial a Ride Problem

I. Zidi, K. Mesghouni, K. Zidi, K. Ghédira
{"title":"A new approach based on the Multi-Objective Simulated Annealing to solving the dynamic Dial a Ride Problem","authors":"I. Zidi, K. Mesghouni, K. Zidi, K. Ghédira","doi":"10.1109/LOGISTIQUA.2011.5939419","DOIUrl":null,"url":null,"abstract":"The paper describes a multi-objective mathematical model for the Dial a Ride Problem (DRP) and an application of the Multi-Objective Simulated Annealing (MOSA) to solve the dynamic DRP. Indeed, different versions of the dynamic Dial a Ride Problem are found in every day practice; transportation of people in low-density areas, transportation of the handicapped and elderly persons and parcel pick-up and delivery service in urban areas. The problem is to affect every new passenger request to one of the vehicles and to design a new route and schedule for this vehicle. This affectation must be done in real time. In this work, we offer our contribution to the study and solving the dynamic DRP in the application using the MOSA algorithm. Numerical results show the benefits of this algorithm in a real-time context.","PeriodicalId":324478,"journal":{"name":"2011 4th International Conference on Logistics","volume":"27 28","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 4th International Conference on Logistics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LOGISTIQUA.2011.5939419","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

The paper describes a multi-objective mathematical model for the Dial a Ride Problem (DRP) and an application of the Multi-Objective Simulated Annealing (MOSA) to solve the dynamic DRP. Indeed, different versions of the dynamic Dial a Ride Problem are found in every day practice; transportation of people in low-density areas, transportation of the handicapped and elderly persons and parcel pick-up and delivery service in urban areas. The problem is to affect every new passenger request to one of the vehicles and to design a new route and schedule for this vehicle. This affectation must be done in real time. In this work, we offer our contribution to the study and solving the dynamic DRP in the application using the MOSA algorithm. Numerical results show the benefits of this algorithm in a real-time context.
基于多目标模拟退火的动态调乘问题求解新方法
本文建立了座车问题的多目标数学模型,并应用多目标模拟退火(MOSA)求解动态座车问题。事实上,在每天的练习中都可以发现不同版本的动态拨号骑行问题;人口密度低地区的交通运输、残疾人、老年人的交通运输和城市地区的包裹收发服务。问题是如何影响每一个新乘客对一辆车的要求,并为这辆车设计新的路线和时间表。这种伪装必须实时完成。在这项工作中,我们为使用MOSA算法研究和解决应用中的动态DRP做出了自己的贡献。数值结果表明了该算法在实时环境下的优越性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信