基于拍卖的取货调度服务的协同车辆路径

Duy Tran Ngoc Bao, T. Pham
{"title":"基于拍卖的取货调度服务的协同车辆路径","authors":"Duy Tran Ngoc Bao, T. Pham","doi":"10.1109/KSE.2019.8919466","DOIUrl":null,"url":null,"abstract":"The surge pricing in ride-hailing applications made customers and partners difficult to decide their bookings. Auction-based approaches are often used to optimize the costs of parties involved such as customers, drivers, and service providers and the overall performance of the whole system. Balancing the benefits of parties involved is a challenging issue. By analyzing current auction-based and fixed-price models for pickup and delivery dispatch systems, this paper identifies sustainable constraints and objectives for adapting the auction-based solutions to today highly competitive market, and formalizes the problem in a three-index mathematical model. A modified genetic algorithm with more actual biological features and the ability to abbreviate the converge time is introduced to tackle this problem. Computational results on models with optimization solver, original and modified genetic algorithms are included to illustrate the advantages of the proposed solution.","PeriodicalId":439841,"journal":{"name":"2019 11th International Conference on Knowledge and Systems Engineering (KSE)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Collaborative Vehicle Routing for Auction-based Pickup and Delivery Dispatch Services\",\"authors\":\"Duy Tran Ngoc Bao, T. Pham\",\"doi\":\"10.1109/KSE.2019.8919466\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The surge pricing in ride-hailing applications made customers and partners difficult to decide their bookings. Auction-based approaches are often used to optimize the costs of parties involved such as customers, drivers, and service providers and the overall performance of the whole system. Balancing the benefits of parties involved is a challenging issue. By analyzing current auction-based and fixed-price models for pickup and delivery dispatch systems, this paper identifies sustainable constraints and objectives for adapting the auction-based solutions to today highly competitive market, and formalizes the problem in a three-index mathematical model. A modified genetic algorithm with more actual biological features and the ability to abbreviate the converge time is introduced to tackle this problem. Computational results on models with optimization solver, original and modified genetic algorithms are included to illustrate the advantages of the proposed solution.\",\"PeriodicalId\":439841,\"journal\":{\"name\":\"2019 11th International Conference on Knowledge and Systems Engineering (KSE)\",\"volume\":\"25 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 11th International Conference on Knowledge and Systems Engineering (KSE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/KSE.2019.8919466\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 11th International Conference on Knowledge and Systems Engineering (KSE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/KSE.2019.8919466","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

网约车应用程序中的动态定价让客户和合作伙伴难以决定他们的预订。基于拍卖的方法通常用于优化客户、司机和服务提供商等相关方的成本以及整个系统的整体性能。平衡各方利益是一个具有挑战性的问题。通过分析当前基于拍卖和固定价格的提货和配送调度系统模型,本文确定了使基于拍卖的解决方案适应当今高度竞争市场的可持续约束和目标,并将问题正式化为三指数数学模型。为了解决这一问题,引入了一种具有更实际的生物特征和缩短收敛时间的改进遗传算法。文中给出了采用优化求解器、原始遗传算法和改进遗传算法的模型的计算结果,以说明所提方法的优越性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Collaborative Vehicle Routing for Auction-based Pickup and Delivery Dispatch Services
The surge pricing in ride-hailing applications made customers and partners difficult to decide their bookings. Auction-based approaches are often used to optimize the costs of parties involved such as customers, drivers, and service providers and the overall performance of the whole system. Balancing the benefits of parties involved is a challenging issue. By analyzing current auction-based and fixed-price models for pickup and delivery dispatch systems, this paper identifies sustainable constraints and objectives for adapting the auction-based solutions to today highly competitive market, and formalizes the problem in a three-index mathematical model. A modified genetic algorithm with more actual biological features and the ability to abbreviate the converge time is introduced to tackle this problem. Computational results on models with optimization solver, original and modified genetic algorithms are included to illustrate the advantages of the proposed solution.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信