Solving Last-Mile Deliveries for Dairy Products Using a Biased Randomization-Based Spreadsheet. A Case Study

Q3 Business, Management and Accounting

American Journal of Mathematical and Management Sciences Pub Date : 2021-04-20 DOI:10.1080/01966324.2021.1910886

José G. Sanabria-Rey, E. L. Solano-Charris, C. A. Vega-Mejía, C. L. Quintero-Araújo

{"title":"Solving Last-Mile Deliveries for Dairy Products Using a Biased Randomization-Based Spreadsheet. A Case Study","authors":"José G. Sanabria-Rey, E. L. Solano-Charris, C. A. Vega-Mejía, C. L. Quintero-Araújo","doi":"10.1080/01966324.2021.1910886","DOIUrl":null,"url":null,"abstract":"Abstract During recent years, Last-mile deliveries (LMD) have become relevant due to its application in e-commerce, urban logistics, and food delivery among others. This work addresses an LMD denoted as a Vehicle Routing Problem with time windows (VRPTW) and aims to minimize total time of the distribution process (i.e., makespan). The LMD is an NP-Hard problem that refers to the delivery of goods from a consolidation center to a destination. For solving the problem, a spreadsheet-based solution that employs a multi-start algorithm based on the biased-randomized version of the nearest neighbor heuristic is introduced. Real historical data of last-mile deliveries for dairy products in Bogotá (Colombia) was considered for evaluating our proposed method. Computational experiments are carried out to show the competitiveness of our method in terms of makespan, number of vehicles, average vehicle occupancy, average load and costs. Some insights for future works are also provided.","PeriodicalId":35850,"journal":{"name":"American Journal of Mathematical and Management Sciences","volume":"41 1","pages":"51 - 69"},"PeriodicalIF":0.0000,"publicationDate":"2021-04-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1080/01966324.2021.1910886","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"American Journal of Mathematical and Management Sciences","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1080/01966324.2021.1910886","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Business, Management and Accounting","Score":null,"Total":0}

引用次数: 3

Abstract

Abstract During recent years, Last-mile deliveries (LMD) have become relevant due to its application in e-commerce, urban logistics, and food delivery among others. This work addresses an LMD denoted as a Vehicle Routing Problem with time windows (VRPTW) and aims to minimize total time of the distribution process (i.e., makespan). The LMD is an NP-Hard problem that refers to the delivery of goods from a consolidation center to a destination. For solving the problem, a spreadsheet-based solution that employs a multi-start algorithm based on the biased-randomized version of the nearest neighbor heuristic is introduced. Real historical data of last-mile deliveries for dairy products in Bogotá (Colombia) was considered for evaluating our proposed method. Computational experiments are carried out to show the competitiveness of our method in terms of makespan, number of vehicles, average vehicle occupancy, average load and costs. Some insights for future works are also provided.

查看原文本刊更多论文

使用基于偏差随机化的电子表格解决乳制品的最后一英里配送。案例研究

摘要近年来，最后一英里配送（LMD）因其在电子商务、城市物流和食品配送等领域的应用而变得越来越重要。这项工作解决了LMD，称为具有时间窗口的车辆路线问题（VRPTW），旨在最大限度地减少配送过程的总时间（即完工时间）。LMD是一个NP难问题，指的是将货物从合并中心运送到目的地。为了解决这个问题，引入了一种基于电子表格的解决方案，该解决方案采用了基于最近邻启发式的有偏随机版本的多启动算法。在评估我们提出的方法时，考虑了波哥大（哥伦比亚）乳制品最后一英里配送的真实历史数据。进行了计算实验，以显示我们的方法在制造周期、车辆数量、平均车辆占用率、平均负载和成本方面的竞争力。对今后的工作也提供了一些见解。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

American Journal of Mathematical and Management Sciences Business, Management and Accounting-Business, Management and Accounting (all)

CiteScore

2.70

自引率

0.00%

发文量