{"title":"A hybrid metaheuristic approach for solving a bi-objective capacitated electric vehicle routing problem with time windows and partial recharging","authors":"Farbod Zahedi, H. Kia, M. Khalilzadeh","doi":"10.1108/jamr-01-2023-0007","DOIUrl":null,"url":null,"abstract":"PurposeThe vehicle routing problem (VRP) has been widely investigated during last decades to reduce logistics costs and improve service level. In addition, many researchers have realized the importance of green logistic system design in decreasing environmental pollution and achieving sustainable development.Design/methodology/approachIn this paper, a bi-objective mathematical model is developed for the capacitated electric VRP with time windows and partial recharge. The first objective deals with minimizing the route to reduce the costs related to vehicles, while the second objective minimizes the delay of arrival vehicles to depots based on the soft time window. A hybrid metaheuristic algorithm including non-dominated sorting genetic algorithm (NSGA-II) and teaching-learning-based optimization (TLBO), called NSGA-II-TLBO, is proposed for solving this problem. The Taguchi method is used to adjust the parameters of algorithms. Several numerical instances in different sizes are solved and the performance of the proposed algorithm is compared to NSGA-II and multi-objective simulated annealing (MOSA) as two well-known algorithms based on the five indexes including time, mean ideal distance (MID), diversity, spacing and the Rate of Achievement to two objectives Simultaneously (RAS).FindingsThe results demonstrate that the hybrid algorithm outperforms terms of spacing and RAS indexes with p-value <0.04. However, MOSA and NSGA-II algorithms have better performance in terms of central processing unit (CPU) time index. In addition, there is no meaningful difference between the algorithms in terms of MID and diversity indexes. Finally, the impacts of changing the parameters of the model on the results are investigated by performing sensitivity analysis.Originality/valueIn this research, an environment-friendly transportation system is addressed by presenting a bi-objective mathematical model for the routing problem of an electric capacitated vehicle considering the time windows with the possibility of recharging.","PeriodicalId":46158,"journal":{"name":"Journal of Advances in Management Research","volume":" ","pages":""},"PeriodicalIF":2.6000,"publicationDate":"2023-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Advances in Management Research","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1108/jamr-01-2023-0007","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MANAGEMENT","Score":null,"Total":0}
引用次数: 0
Abstract
PurposeThe vehicle routing problem (VRP) has been widely investigated during last decades to reduce logistics costs and improve service level. In addition, many researchers have realized the importance of green logistic system design in decreasing environmental pollution and achieving sustainable development.Design/methodology/approachIn this paper, a bi-objective mathematical model is developed for the capacitated electric VRP with time windows and partial recharge. The first objective deals with minimizing the route to reduce the costs related to vehicles, while the second objective minimizes the delay of arrival vehicles to depots based on the soft time window. A hybrid metaheuristic algorithm including non-dominated sorting genetic algorithm (NSGA-II) and teaching-learning-based optimization (TLBO), called NSGA-II-TLBO, is proposed for solving this problem. The Taguchi method is used to adjust the parameters of algorithms. Several numerical instances in different sizes are solved and the performance of the proposed algorithm is compared to NSGA-II and multi-objective simulated annealing (MOSA) as two well-known algorithms based on the five indexes including time, mean ideal distance (MID), diversity, spacing and the Rate of Achievement to two objectives Simultaneously (RAS).FindingsThe results demonstrate that the hybrid algorithm outperforms terms of spacing and RAS indexes with p-value <0.04. However, MOSA and NSGA-II algorithms have better performance in terms of central processing unit (CPU) time index. In addition, there is no meaningful difference between the algorithms in terms of MID and diversity indexes. Finally, the impacts of changing the parameters of the model on the results are investigated by performing sensitivity analysis.Originality/valueIn this research, an environment-friendly transportation system is addressed by presenting a bi-objective mathematical model for the routing problem of an electric capacitated vehicle considering the time windows with the possibility of recharging.