随机拨乘问题的分布式求解方法

Brahim Issaoui, I. Zidi, K. Zidi, K. Ghédira
{"title":"随机拨乘问题的分布式求解方法","authors":"Brahim Issaoui, I. Zidi, K. Zidi, K. Ghédira","doi":"10.1109/ICADLT.2013.6568460","DOIUrl":null,"url":null,"abstract":"The paper describes a multi-objective mathematical model for the Dial a Ride Problem (DRP) and an application of Multi-Objective Simulated Annealing (MOSA) to solve it. DRP is to take over the passenger from a place of departure to a place of arrival. In the DRP, passengers send transportation requests to an operator. The ultimate aim is to offer an alternative to displacement optimized individually and collectively. The DRP is classified as NP-hard problem that's why most research has been concentrated on the use of approximate methods to solve it. Indeed the DRP is a multi-criteria problem, the proposed solution which aims to reduce both route duration in response to a certain quality of service provided. Actually, during the system of transport on demand (TOD) there are many problems can inhibit the proper functioning of the system, such as failure of the car and bottling etc. We propose a resolution of the dynamic DRP using a service of TOD called TOD with Simulated Annealing (TOD-SA). The solution proposed in this paper enables both a reduction of travel time also the distance traveled.","PeriodicalId":269509,"journal":{"name":"2013 International Conference on Advanced Logistics and Transport","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2013-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"A distributed approach for the resolution of a stochastic dial a Ride Problem\",\"authors\":\"Brahim Issaoui, I. Zidi, K. Zidi, K. Ghédira\",\"doi\":\"10.1109/ICADLT.2013.6568460\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The paper describes a multi-objective mathematical model for the Dial a Ride Problem (DRP) and an application of Multi-Objective Simulated Annealing (MOSA) to solve it. DRP is to take over the passenger from a place of departure to a place of arrival. In the DRP, passengers send transportation requests to an operator. The ultimate aim is to offer an alternative to displacement optimized individually and collectively. The DRP is classified as NP-hard problem that's why most research has been concentrated on the use of approximate methods to solve it. Indeed the DRP is a multi-criteria problem, the proposed solution which aims to reduce both route duration in response to a certain quality of service provided. Actually, during the system of transport on demand (TOD) there are many problems can inhibit the proper functioning of the system, such as failure of the car and bottling etc. We propose a resolution of the dynamic DRP using a service of TOD called TOD with Simulated Annealing (TOD-SA). The solution proposed in this paper enables both a reduction of travel time also the distance traveled.\",\"PeriodicalId\":269509,\"journal\":{\"name\":\"2013 International Conference on Advanced Logistics and Transport\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-05-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 International Conference on Advanced Logistics and Transport\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICADLT.2013.6568460\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 International Conference on Advanced Logistics and Transport","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICADLT.2013.6568460","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

摘要

本文提出了一种多目标座驾问题的数学模型,并应用多目标模拟退火法求解了座驾问题。DRP是将旅客从出发地接往到达地。在DRP中,乘客向操作员发送运输请求。最终目标是提供一种替代个人和集体优化的位移。DRP被归类为np困难问题,这就是为什么大多数研究都集中在使用近似方法来解决它。实际上,DRP是一个多准则问题,所提出的解决方案旨在减少路由持续时间,以响应所提供的一定质量的服务。实际上,在按需运输(TOD)系统中存在许多问题,如车辆故障、装瓶故障等,会影响系统的正常运行。我们提出了一个动态DRP的解决方案,使用TOD的服务,称为TOD与模拟退火(TOD- sa)。本文提出的解决方案既可以减少旅行时间,也可以减少旅行距离。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A distributed approach for the resolution of a stochastic dial a Ride Problem
The paper describes a multi-objective mathematical model for the Dial a Ride Problem (DRP) and an application of Multi-Objective Simulated Annealing (MOSA) to solve it. DRP is to take over the passenger from a place of departure to a place of arrival. In the DRP, passengers send transportation requests to an operator. The ultimate aim is to offer an alternative to displacement optimized individually and collectively. The DRP is classified as NP-hard problem that's why most research has been concentrated on the use of approximate methods to solve it. Indeed the DRP is a multi-criteria problem, the proposed solution which aims to reduce both route duration in response to a certain quality of service provided. Actually, during the system of transport on demand (TOD) there are many problems can inhibit the proper functioning of the system, such as failure of the car and bottling etc. We propose a resolution of the dynamic DRP using a service of TOD called TOD with Simulated Annealing (TOD-SA). The solution proposed in this paper enables both a reduction of travel time also the distance traveled.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信