基于GRASP-NSGAII混合算法的双目标时延车辆路径问题

IF 3 Q2 OPERATIONS RESEARCH & MANAGEMENT SCIENCE

International Journal of Management Science and Engineering Management Pub Date : 2022-05-29 DOI:10.1080/17509653.2022.2076168

Partha Sarathi Barma, J. Dutta, A. Mukherjee, S. Kar

{"title":"基于GRASP-NSGAII混合算法的双目标时延车辆路径问题","authors":"Partha Sarathi Barma, J. Dutta, A. Mukherjee, S. Kar","doi":"10.1080/17509653.2022.2076168","DOIUrl":null,"url":null,"abstract":"ABSTRACT This paper proposes a bi-objective capacitated vehicle routing problem with two types of customers based on priority. The priority customers must be served earlier compared to non-priority customers. This paper aims to minimize the total distance traveled by all the vehicles and minimize customers’ average latency. This paper considers three scenarios for the average latency calculation based on the customer type. In the first scenario, this paper considers only priority customers’ average latency. The second scenario considers the latency of all customers, ignoring the priority. The third scenario considers the average latency of all customers, but priority customers must be served first. A hybrid metaheuristic based on Greedy Randomized Adaptive Search Procedure (GRASP) and Non-dominated Sorting Genetic Algorithm (NSGAII) is developed to solve the proposed model. The proposed model is solved for some of the benchmark data sets from VRP literature, and finally, the results are analyzed with the help of some performance metrics.","PeriodicalId":46578,"journal":{"name":"International Journal of Management Science and Engineering Management","volume":"18 1","pages":"190 - 207"},"PeriodicalIF":3.0000,"publicationDate":"2022-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"A bi-objective latency based vehicle routing problem using hybrid GRASP-NSGAII algorithm\",\"authors\":\"Partha Sarathi Barma, J. Dutta, A. Mukherjee, S. Kar\",\"doi\":\"10.1080/17509653.2022.2076168\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"ABSTRACT This paper proposes a bi-objective capacitated vehicle routing problem with two types of customers based on priority. The priority customers must be served earlier compared to non-priority customers. This paper aims to minimize the total distance traveled by all the vehicles and minimize customers’ average latency. This paper considers three scenarios for the average latency calculation based on the customer type. In the first scenario, this paper considers only priority customers’ average latency. The second scenario considers the latency of all customers, ignoring the priority. The third scenario considers the average latency of all customers, but priority customers must be served first. A hybrid metaheuristic based on Greedy Randomized Adaptive Search Procedure (GRASP) and Non-dominated Sorting Genetic Algorithm (NSGAII) is developed to solve the proposed model. The proposed model is solved for some of the benchmark data sets from VRP literature, and finally, the results are analyzed with the help of some performance metrics.\",\"PeriodicalId\":46578,\"journal\":{\"name\":\"International Journal of Management Science and Engineering Management\",\"volume\":\"18 1\",\"pages\":\"190 - 207\"},\"PeriodicalIF\":3.0000,\"publicationDate\":\"2022-05-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Management Science and Engineering Management\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1080/17509653.2022.2076168\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"OPERATIONS RESEARCH & MANAGEMENT SCIENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Management Science and Engineering Management","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1080/17509653.2022.2076168","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"OPERATIONS RESEARCH & MANAGEMENT SCIENCE","Score":null,"Total":0}

引用次数: 2

摘要

提出了一种基于优先级的两类顾客的双目标有能力车辆路径问题。优先级客户必须比非优先级客户更早得到服务。本文的目标是最小化所有车辆行驶的总距离，最小化顾客的平均延迟。本文考虑了基于客户类型的平均延迟计算的三种场景。在第一种场景中，本文只考虑优先级客户的平均延迟。第二个场景考虑所有客户的延迟，忽略优先级。第三个场景考虑所有客户的平均延迟，但必须首先为优先级客户提供服务。提出了一种基于贪婪随机自适应搜索算法(GRASP)和非支配排序遗传算法(NSGAII)的混合元启发式算法来求解该模型。利用VRP文献中的一些基准数据集对模型进行求解，最后利用一些性能指标对结果进行分析。

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

查看原文本刊更多论文

A bi-objective latency based vehicle routing problem using hybrid GRASP-NSGAII algorithm

ABSTRACT This paper proposes a bi-objective capacitated vehicle routing problem with two types of customers based on priority. The priority customers must be served earlier compared to non-priority customers. This paper aims to minimize the total distance traveled by all the vehicles and minimize customers’ average latency. This paper considers three scenarios for the average latency calculation based on the customer type. In the first scenario, this paper considers only priority customers’ average latency. The second scenario considers the latency of all customers, ignoring the priority. The third scenario considers the average latency of all customers, but priority customers must be served first. A hybrid metaheuristic based on Greedy Randomized Adaptive Search Procedure (GRASP) and Non-dominated Sorting Genetic Algorithm (NSGAII) is developed to solve the proposed model. The proposed model is solved for some of the benchmark data sets from VRP literature, and finally, the results are analyzed with the help of some performance metrics.

求助全文

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

来源期刊

International Journal of Management Science and Engineering Management OPERATIONS RESEARCH & MANAGEMENT SCIENCE-

CiteScore

8.50

自引率

33.30%

发文量

期刊介绍： International Journal of Management Science and Engineering Management (IJMSEM) is a peer-reviewed quarterly journal that provides an international forum for researchers and practitioners of management science and engineering management. The journal focuses on identifying problems in the field, and using innovative management theories and new management methods to provide solutions. IJMSEM is committed to providing a platform for researchers and practitioners of management science and engineering management to share experiences and communicate ideas. Articles published in IJMSEM contain fresh information and approaches. They provide key information that will contribute to new scientific inquiries and improve competency, efficiency, and productivity in the field. IJMSEM focuses on the following: 1. identifying Management Science problems in engineering; 2. using management theory and methods to solve above problems innovatively and effectively; 3. developing new management theory and method to the newly emerged management issues in engineering; IJMSEM prefers papers with practical background, clear problem description, understandable physical and mathematical model, physical model with practical significance and theoretical framework, operable algorithm and successful practical applications. IJMSEM also takes into account management papers of original contributions in one or several aspects of these elements.