An On-Demand Dynamic Taxi Crowdshipping Model for Urban Parcel Delivery

IF 1.1 4区 工程技术 Q4 MANAGEMENT Transportation Journal Pub Date : 2023-04-01 DOI:10.5325/transportationj.62.2.0177
Amirhossein Baghestani, S. Najafabadi, Mahdieh Allahviranloo
{"title":"An On-Demand Dynamic Taxi Crowdshipping Model for Urban Parcel Delivery","authors":"Amirhossein Baghestani, S. Najafabadi, Mahdieh Allahviranloo","doi":"10.5325/transportationj.62.2.0177","DOIUrl":null,"url":null,"abstract":"Abstract:In this article, a dynamic crowdshipping model is presented to use the vacant space of taxis to deliver parcels while serving passengers. A mixed integer linear programming (MILP) model within a rolling horizon framework that periodically updates input information is formulated. The objective function aims to maximize the number of matched trips while controlling the total travel time in the system. The developed model is tested using the taxi ridership and the household travel survey data in New York City, ensuring the credibility of the proposed model in addressing the goals of the study and its potential application to mitigate transportation externalities.","PeriodicalId":46529,"journal":{"name":"Transportation Journal","volume":null,"pages":null},"PeriodicalIF":1.1000,"publicationDate":"2023-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Transportation Journal","FirstCategoryId":"5","ListUrlMain":"https://doi.org/10.5325/transportationj.62.2.0177","RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MANAGEMENT","Score":null,"Total":0}
引用次数: 0

Abstract

Abstract:In this article, a dynamic crowdshipping model is presented to use the vacant space of taxis to deliver parcels while serving passengers. A mixed integer linear programming (MILP) model within a rolling horizon framework that periodically updates input information is formulated. The objective function aims to maximize the number of matched trips while controlling the total travel time in the system. The developed model is tested using the taxi ridership and the household travel survey data in New York City, ensuring the credibility of the proposed model in addressing the goals of the study and its potential application to mitigate transportation externalities.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
城市包裹配送的按需动态出租车拥挤运输模型
摘要:本文提出了一种动态众包模型,在为乘客服务的同时,利用出租车的空闲空间运送包裹。建立了滚动时域框架内的混合整数线性规划(MILP)模型,该模型周期性地更新输入信息。目标函数旨在最大化匹配行程的数量,同时控制系统中的总行程时间。使用纽约市的出租车乘客量和家庭出行调查数据对所开发的模型进行了测试,确保了所提出的模型在实现研究目标方面的可信度及其在缓解交通外部性方面的潜在应用。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
2.40
自引率
4.30%
发文量
6
期刊介绍: Transportation Journal is devoted to the publication of articles that present new knowledge relating to all sectors of the supply chain/logistics/transportation field. These sectors include supply chain/logistics management strategies and techniques; carrier (transport firm) and contract logistics firm (3PL and 4PL) management strategies and techniques; transport economics; regulation, promotion, and other dimensions of public policy toward transport and logistics; and education.
期刊最新文献
The impacts of season extension on upper Great Lakes shipping The value of supply chain orientation in entrepreneurship: Implications for opportunity evaluation and Lean Startup The vehicle routing programming of municipal solid waste collection under cognitive uncertainty Logistics customer service and customer satisfaction: Importance‐based segments for motor carriers Measuring dynamic supply chain risks for the offshoring decision in the post‐COVID‐19 era: A longitudinal study
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1