可持续城市物流的夜间车辆路径

Alfan Kurnia Yudha, S. Starita
{"title":"可持续城市物流的夜间车辆路径","authors":"Alfan Kurnia Yudha, S. Starita","doi":"10.1109/ICTKE47035.2019.8966825","DOIUrl":null,"url":null,"abstract":"Vehicle routing problems play a critical role in logistics distribution, allowing companies to minimize operational parameters such as cost, fuel consumption, emissions etc. This paper studies a customized vehicle routing problem incorporating nighttime delivery options for a heavily congested urban area. The aim is to identify the optimal combination of day and night routes by trading off between fuel and staff costs. A Linear Programming (LP) formulation for the Night Time Vehicle Routing Problem (NTVRP) is introduced. The model is then applied to a case study using real data from a department store in Bangkok, Thailand. A fuel consumption model is used alongside an emission model to estimate the beneficial impact of NTVRP on both costs and emissions. Results show that when demand is high and 55 tonne heavy goods vehicles are used, the cost savings are about 16.7 percent. More significantly, CO2 emissions are reduced by more than 30 percent. With low demand, cost savings are more than 30.8 percent, together with a 28.2 percent reduction in CO2 emissions. Overall, the case study shows that nighttime delivery is a viable option to increase efficiency and sustainability of a logistics company.","PeriodicalId":442255,"journal":{"name":"2019 17th International Conference on ICT and Knowledge Engineering (ICT&KE)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Nighttime Vehicle Routing for Sustainable Urban Logistics\",\"authors\":\"Alfan Kurnia Yudha, S. Starita\",\"doi\":\"10.1109/ICTKE47035.2019.8966825\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Vehicle routing problems play a critical role in logistics distribution, allowing companies to minimize operational parameters such as cost, fuel consumption, emissions etc. This paper studies a customized vehicle routing problem incorporating nighttime delivery options for a heavily congested urban area. The aim is to identify the optimal combination of day and night routes by trading off between fuel and staff costs. A Linear Programming (LP) formulation for the Night Time Vehicle Routing Problem (NTVRP) is introduced. The model is then applied to a case study using real data from a department store in Bangkok, Thailand. A fuel consumption model is used alongside an emission model to estimate the beneficial impact of NTVRP on both costs and emissions. Results show that when demand is high and 55 tonne heavy goods vehicles are used, the cost savings are about 16.7 percent. More significantly, CO2 emissions are reduced by more than 30 percent. With low demand, cost savings are more than 30.8 percent, together with a 28.2 percent reduction in CO2 emissions. Overall, the case study shows that nighttime delivery is a viable option to increase efficiency and sustainability of a logistics company.\",\"PeriodicalId\":442255,\"journal\":{\"name\":\"2019 17th International Conference on ICT and Knowledge Engineering (ICT&KE)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 17th International Conference on ICT and Knowledge Engineering (ICT&KE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICTKE47035.2019.8966825\",\"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 17th International Conference on ICT and Knowledge Engineering (ICT&KE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICTKE47035.2019.8966825","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

车辆路线问题在物流配送中起着至关重要的作用,使公司能够最大限度地减少运营参数,如成本、燃料消耗、排放等。本文研究了一个针对严重拥堵的城市地区,包含夜间送货选项的定制车辆路线问题。其目的是通过在燃料和人员成本之间进行权衡,确定白天和夜间路线的最佳组合。介绍了夜间车辆路径问题(NTVRP)的线性规划(LP)公式。然后将该模型应用于使用泰国曼谷一家百货商店的真实数据的案例研究。同时使用油耗模型和排放模型来估计NTVRP对成本和排放的有利影响。结果表明,当需求高时,使用55吨重型货车,成本节约约16.7%。更重要的是,二氧化碳排放量减少了30%以上。在低需求的情况下,成本节约超过30.8%,二氧化碳排放量减少28.2%。总的来说,该案例研究表明,夜间配送是提高物流公司效率和可持续性的可行选择。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Nighttime Vehicle Routing for Sustainable Urban Logistics
Vehicle routing problems play a critical role in logistics distribution, allowing companies to minimize operational parameters such as cost, fuel consumption, emissions etc. This paper studies a customized vehicle routing problem incorporating nighttime delivery options for a heavily congested urban area. The aim is to identify the optimal combination of day and night routes by trading off between fuel and staff costs. A Linear Programming (LP) formulation for the Night Time Vehicle Routing Problem (NTVRP) is introduced. The model is then applied to a case study using real data from a department store in Bangkok, Thailand. A fuel consumption model is used alongside an emission model to estimate the beneficial impact of NTVRP on both costs and emissions. Results show that when demand is high and 55 tonne heavy goods vehicles are used, the cost savings are about 16.7 percent. More significantly, CO2 emissions are reduced by more than 30 percent. With low demand, cost savings are more than 30.8 percent, together with a 28.2 percent reduction in CO2 emissions. Overall, the case study shows that nighttime delivery is a viable option to increase efficiency and sustainability of a logistics company.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信