基于保存矩阵算法的多容量车辆取货路径随机优化

IF 1.1 Q3 INFORMATION SCIENCE & LIBRARY SCIENCE

JOURNAL OF INFORMATION & OPTIMIZATION SCIENCES Pub Date : 2023-01-01 DOI:10.47974/jios-1413

Lokesh Kumar Bhuranda, M. Rizwanullah, A. Sharma, Kamlesh Gautam, Yash Chawla

{"title":"基于保存矩阵算法的多容量车辆取货路径随机优化","authors":"Lokesh Kumar Bhuranda, M. Rizwanullah, A. Sharma, Kamlesh Gautam, Yash Chawla","doi":"10.47974/jios-1413","DOIUrl":null,"url":null,"abstract":"The Multi-Capacitated Problem is an optimization problem. To reduce the overall distance, the optimization problem seeks out vehicle routes that connect every customer to a storage facility. This article uses a saving matrix approach to propose an extended Vehicle Routing Problem that considers a stochastic environment and multiple capacitors. Stochastic customers are an essential element of the problem. A computational analysis also supports the suggested approach to obtain the best route.","PeriodicalId":46518,"journal":{"name":"JOURNAL OF INFORMATION & OPTIMIZATION SCIENCES","volume":"1 1","pages":""},"PeriodicalIF":1.1000,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Stochastic optimization of multi-capacitated vehicle routing problem with pickup and delivery using saving matrix algorithm\",\"authors\":\"Lokesh Kumar Bhuranda, M. Rizwanullah, A. Sharma, Kamlesh Gautam, Yash Chawla\",\"doi\":\"10.47974/jios-1413\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The Multi-Capacitated Problem is an optimization problem. To reduce the overall distance, the optimization problem seeks out vehicle routes that connect every customer to a storage facility. This article uses a saving matrix approach to propose an extended Vehicle Routing Problem that considers a stochastic environment and multiple capacitors. Stochastic customers are an essential element of the problem. A computational analysis also supports the suggested approach to obtain the best route.\",\"PeriodicalId\":46518,\"journal\":{\"name\":\"JOURNAL OF INFORMATION & OPTIMIZATION SCIENCES\",\"volume\":\"1 1\",\"pages\":\"\"},\"PeriodicalIF\":1.1000,\"publicationDate\":\"2023-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"JOURNAL OF INFORMATION & OPTIMIZATION SCIENCES\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.47974/jios-1413\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"INFORMATION SCIENCE & LIBRARY SCIENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"JOURNAL OF INFORMATION & OPTIMIZATION SCIENCES","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.47974/jios-1413","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"INFORMATION SCIENCE & LIBRARY SCIENCE","Score":null,"Total":0}

引用次数: 0

摘要

多容问题是一个优化问题。为了减少总距离，优化问题寻求将每个客户连接到存储设施的车辆路线。本文采用节省矩阵的方法提出了一个考虑随机环境和多个电容器的扩展车辆路径问题。随机客户是这个问题的一个基本要素。计算分析也支持所建议的方法来获得最佳路线。

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

查看原文本刊更多论文

Stochastic optimization of multi-capacitated vehicle routing problem with pickup and delivery using saving matrix algorithm

The Multi-Capacitated Problem is an optimization problem. To reduce the overall distance, the optimization problem seeks out vehicle routes that connect every customer to a storage facility. This article uses a saving matrix approach to propose an extended Vehicle Routing Problem that considers a stochastic environment and multiple capacitors. Stochastic customers are an essential element of the problem. A computational analysis also supports the suggested approach to obtain the best route.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

JOURNAL OF INFORMATION & OPTIMIZATION SCIENCES INFORMATION SCIENCE & LIBRARY SCIENCE-

自引率

21.40%

发文量