采用人机协作决策方法调度具有灵活发车时间的定制公交车

IF 6.3 1区 工程技术 Q1 ECONOMICS
{"title":"采用人机协作决策方法调度具有灵活发车时间的定制公交车","authors":"","doi":"10.1016/j.tra.2024.104184","DOIUrl":null,"url":null,"abstract":"<div><p>Public transport agencies need to leverage on emerging technologies to remain competitive in a mobility landscape that is increasingly subject to disruptive mobility services ranging from ride-hailing to shared micro-mobility. Customized bus (CB) is an innovative transit system that provides advanced, personalized, and flexible demand-responsive transit service by using digital travel platforms. One of the challenging tasks in planning and operating a CB system is to efficiently and practically schedule a set of CB vehicles while meeting passengers’ personalized travel demand. Previous studies assume that CB passengers’ preferred pickup or delivery time is within a pre-defined hard time window, which is fixed and cannot change. However, some recent studies show that introducing soft flexible time windows can further reduce operational costs. Considering soft flexible time windows, this study first proposes a nearest neighbour-based passenger-to-vehicle assignment algorithm to assign CB passengers to vehicle trips and generate the required vehicle service trips. Then, a novel bi-objective integer programming model is proposed to optimize CB operation cost (measured by fleet size) and level of service (measured by passenger departure time deviation penalty cost). Model reformulations are conducted to make the bi-objective model solvable by using commercial optimization solvers, together with a deficit function-based graphical vehicle scheduling technique. A novel two-stage human–machine collaborative optimization methodology, which makes use of both machine intelligence and human intelligence to collaboratively solve the problem, is developed to generate more practical Pareto-optimal CB scheduling results. Computation results of a real-world CB system demonstrate the effectiveness and advantages of the proposed optimization model and solution methodology.</p></div>","PeriodicalId":49421,"journal":{"name":"Transportation Research Part A-Policy and Practice","volume":null,"pages":null},"PeriodicalIF":6.3000,"publicationDate":"2024-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0965856424002325/pdfft?md5=20463408c3802abaea458a2e8d25b701&pid=1-s2.0-S0965856424002325-main.pdf","citationCount":"0","resultStr":"{\"title\":\"Human-Machine collaborative decision-making approach to scheduling customized buses with flexible departure times\",\"authors\":\"\",\"doi\":\"10.1016/j.tra.2024.104184\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>Public transport agencies need to leverage on emerging technologies to remain competitive in a mobility landscape that is increasingly subject to disruptive mobility services ranging from ride-hailing to shared micro-mobility. Customized bus (CB) is an innovative transit system that provides advanced, personalized, and flexible demand-responsive transit service by using digital travel platforms. One of the challenging tasks in planning and operating a CB system is to efficiently and practically schedule a set of CB vehicles while meeting passengers’ personalized travel demand. Previous studies assume that CB passengers’ preferred pickup or delivery time is within a pre-defined hard time window, which is fixed and cannot change. However, some recent studies show that introducing soft flexible time windows can further reduce operational costs. Considering soft flexible time windows, this study first proposes a nearest neighbour-based passenger-to-vehicle assignment algorithm to assign CB passengers to vehicle trips and generate the required vehicle service trips. Then, a novel bi-objective integer programming model is proposed to optimize CB operation cost (measured by fleet size) and level of service (measured by passenger departure time deviation penalty cost). Model reformulations are conducted to make the bi-objective model solvable by using commercial optimization solvers, together with a deficit function-based graphical vehicle scheduling technique. A novel two-stage human–machine collaborative optimization methodology, which makes use of both machine intelligence and human intelligence to collaboratively solve the problem, is developed to generate more practical Pareto-optimal CB scheduling results. Computation results of a real-world CB system demonstrate the effectiveness and advantages of the proposed optimization model and solution methodology.</p></div>\",\"PeriodicalId\":49421,\"journal\":{\"name\":\"Transportation Research Part A-Policy and Practice\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":6.3000,\"publicationDate\":\"2024-07-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://www.sciencedirect.com/science/article/pii/S0965856424002325/pdfft?md5=20463408c3802abaea458a2e8d25b701&pid=1-s2.0-S0965856424002325-main.pdf\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Transportation Research Part A-Policy and Practice\",\"FirstCategoryId\":\"5\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0965856424002325\",\"RegionNum\":1,\"RegionCategory\":\"工程技术\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"ECONOMICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Transportation Research Part A-Policy and Practice","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0965856424002325","RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"ECONOMICS","Score":null,"Total":0}
引用次数: 0

摘要

公共交通机构需要利用新兴技术,在从叫车服务到共享微型交通等颠覆性交通服务日益增多的交通环境中保持竞争力。定制公交(CB)是一种创新型公交系统,它利用数字出行平台提供先进、个性化和灵活的需求响应型公交服务。规划和运营定制公交系统的挑战之一是在满足乘客个性化出行需求的同时,高效、实用地调度定制公交车辆。以往的研究假设 CB 乘客首选的上车或下车时间是在预先确定的硬时间窗口内,而这个时间窗口是固定不变的。然而,最近的一些研究表明,引入软弹性时间窗可以进一步降低运营成本。考虑到软弹性时间窗口,本研究首先提出了一种基于近邻的乘客到车辆分配算法,将 CB 乘客分配到车辆行程,并生成所需的车辆服务行程。然后,提出了一个新颖的双目标整数编程模型,以优化 CB 运营成本(以车队规模衡量)和服务水平(以乘客出发时间偏差惩罚成本衡量)。通过使用商业优化求解器和基于赤字函数的图形化车辆调度技术,对模型进行了重构,以使双目标模型可以求解。开发了一种新颖的两阶段人机协同优化方法,利用机器智能和人类智能协同解决问题,以生成更实用的帕累托最优 CB 调度结果。实际 CB 系统的计算结果证明了所提出的优化模型和求解方法的有效性和优势。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Human-Machine collaborative decision-making approach to scheduling customized buses with flexible departure times

Public transport agencies need to leverage on emerging technologies to remain competitive in a mobility landscape that is increasingly subject to disruptive mobility services ranging from ride-hailing to shared micro-mobility. Customized bus (CB) is an innovative transit system that provides advanced, personalized, and flexible demand-responsive transit service by using digital travel platforms. One of the challenging tasks in planning and operating a CB system is to efficiently and practically schedule a set of CB vehicles while meeting passengers’ personalized travel demand. Previous studies assume that CB passengers’ preferred pickup or delivery time is within a pre-defined hard time window, which is fixed and cannot change. However, some recent studies show that introducing soft flexible time windows can further reduce operational costs. Considering soft flexible time windows, this study first proposes a nearest neighbour-based passenger-to-vehicle assignment algorithm to assign CB passengers to vehicle trips and generate the required vehicle service trips. Then, a novel bi-objective integer programming model is proposed to optimize CB operation cost (measured by fleet size) and level of service (measured by passenger departure time deviation penalty cost). Model reformulations are conducted to make the bi-objective model solvable by using commercial optimization solvers, together with a deficit function-based graphical vehicle scheduling technique. A novel two-stage human–machine collaborative optimization methodology, which makes use of both machine intelligence and human intelligence to collaboratively solve the problem, is developed to generate more practical Pareto-optimal CB scheduling results. Computation results of a real-world CB system demonstrate the effectiveness and advantages of the proposed optimization model and solution methodology.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
13.20
自引率
7.80%
发文量
257
审稿时长
9.8 months
期刊介绍: Transportation Research: Part A contains papers of general interest in all passenger and freight transportation modes: policy analysis, formulation and evaluation; planning; interaction with the political, socioeconomic and physical environment; design, management and evaluation of transportation systems. Topics are approached from any discipline or perspective: economics, engineering, sociology, psychology, etc. Case studies, survey and expository papers are included, as are articles which contribute to unification of the field, or to an understanding of the comparative aspects of different systems. Papers which assess the scope for technological innovation within a social or political framework are also published. The journal is international, and places equal emphasis on the problems of industrialized and non-industrialized regions. Part A''s aims and scope are complementary to Transportation Research Part B: Methodological, Part C: Emerging Technologies and Part D: Transport and Environment. Part E: Logistics and Transportation Review. Part F: Traffic Psychology and Behaviour. The complete set forms the most cohesive and comprehensive reference of current research in transportation science.
×
引用
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学术官方微信