A new hybrid matheuristic of GRASP and VNS based on constructive heuristics, set-covering and set-partitioning formulations applied to the capacitated vehicle routing problem

Machado, André Manhães; Mauri, Geraldo Regis; Bóeres, Maria Claudia Silva; Rosa, Rodrigo de Alvarenga

doi:10.1016/j.eswa.2021.115556

Cited by 17 publications

(4 citation statements)

References 28 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The smallest neighborhood search is initially used, and, when no further improvement to the solution is possible, a slightly larger neighborhood is applied. Upon any improvement to the solution, the smallest neighborhood is reintroduced; otherwise, an even larger neighborhood is applied [171][172][173]. Simulated annealing, greedy randomized adaptive search, and iterative local search algorithms all use strategies to avoid local optima [143].…”

Section: Metaheuristic Algorithmsmentioning

confidence: 99%

A Bibliometric Visualized Analysis and Classification of Vehicle Routing Problem Research

Tang

2023

Sustainability

View full text Add to dashboard Cite

The vehicle routing problem (VRP), as a classic combinatorial optimization problem, has always been a hot research topic in operations research. In order to gain a deeper understanding of the VRP problem, this work uses the knowledge graph to comprehensively analyze and summarize the literature related to VRP from 1959 to 2022 in the Web of Science (WoS) database. Firstly, according to the basic statistical information of the literature, the annual publications, the authors, their institutions and countries, the keyword co-occurrence, and the literature co-citation network are analyzed to comprehensively summarize and generalize the research on VRP and predict its future development trend. The results show that, in the past 60 years, there have been abundant changes in the research on VRP. The United States and China have made the most important contributions in the field of VRP. According to the WoS literature retrieval results and classification methods, the VRP models and their solutions are comprehensively classified, and the model solving algorithms are divided into exact algorithms, heuristic algorithms, metaheuristic algorithms, hyper-heuristic algorithms, machine learning, etc. The results show that the development of information computing technology plays an important role in research on the VRP problem, and dynamic VRP, hyper-heuristic algorithms, deep reinforcement learning, etc. are the future development directions of the VRP model and its optimization. The results of this research can provide help and guidance for beginners and scholars outside the industry to comprehensively understand the development and research hotspots of VRP.

show abstract

Section: Metaheuristic Algorithmsmentioning

confidence: 99%

A Bibliometric Visualized Analysis and Classification of Vehicle Routing Problem Research

Tang

2023

Sustainability

View full text Add to dashboard Cite

show abstract

“…The research on CVRP has received extensive attention from many scholars, and its focus is mainly on the research and improvement of the solution algorithm. It mainly includes two categories: exact algorithm and heuristic algorithm [2,3]. In terms of exact algorithms, Liu et al [4] proposed a branch-and-cut algorithm for the two-echelon capacitated vehicle routing problem with grouping constraints.…”

Section: Introductionmentioning

confidence: 99%

Hybrid Artificial Bee Colony Algorithm with Variable Neighborhood Search for Capacitated Vehicle Routing Problem

Xinyu Zhang, Kaiwen Geng, Yang Li

2024

jes

View full text Add to dashboard Cite

Aiming at the capacitated vehicle routing problem, a hybrid integer programming model with goal of lowest path cost is constructed, and a hybrid artificial bee colony algorithm with variable neighborhood search based on the model and the characteristics of the CVRP problem is proposed to solve the problem. The hybrid algorithm integrates the artificial bee colony algorithm and the variable neighborhood search algorithm, embeds a multi-variable neighborhood operator in the local search link of the artificial bee colony to carry out iteration. And the operator contains targeted transformation operations on path nodes, strings, and sub paths to ensure the diversity of the bee population. In addition, a variable neighborhood perturbation strategy is used to strengthen the algorithm's ability to escape from local optima. The comparative analysis of the literature study set and its algorithm solution shows that the designed hybrid variable neighborhood artificial bee colony algorithm has strong global search ability and high solution accuracy, especially in solution stability. HABC-VNS can obtain 47 optimal solutions in 74 examples. The average minimum deviation of the optimal solution is 0.34%, and the average deviation of the average CVRP set is 0.57%. The overall performance is better than the algorithm in the comparative literature.

show abstract

“…The Set Covering model is part of linear programming (Medrano-Gómez et al, 2020;Zhang and Zhang, 2015) formed to minimize the number of facility locations (Bangun et al, 2022;Bendík, 2015;Segall et al, 2017;Sitepu et al, 2019a) while still serving all requests (Akhter, 2015;Binev et al, 2018). Some of the Set Covering models include the Location Set Covering Problem (LSCP) (Machado et al, 2021) and p-Median Problem (Doungpan, 2020;Sitepu et al, 2022). LSCP is a problem in the distribution system that aims to find the optimal number of facility locations (Yang et al, 2020;Zhang and Zhang, 2015) so that it can serve all points of demand (Alizadeh and Nishi, 2019;Kocaoglu et al, 2014;Mohri and Haghshenas, 2021).…”

Section: Introductionmentioning

confidence: 99%

Formulation of Set Covering Problem Using Myopic Algorithm and Greedy Reduction Algorithm in Determining the Location of Temporary Landfills in Semambu Island Village, Ogan Ilir Regency, South Sumatra

Puspita

Octarina

Hanum

et al. 2023

Sci. Technol. Indones

View full text Add to dashboard Cite

This study discusses Set Covering Problem (SCP) in designing the optimal temporary waste disposal site (TWDS) in Semambu Island Village using the Myopic Algorithm (MA) and Greedy Reduction Algorithm (GRA). The analysis was carried out and compared using a maximum distance of 500m and 1000m to get the best solution from two methods. The results of the p Median Problem by LINGO 13.0 software and MA with a maximum distance of 500m show the same TWDS location, namely Working Area (WA) 1, 2, 3, 4, 5, and 6 with the location of the candidate TWDS being at TWDS 2 WA 1, TWDS 1 WA 2, TWDS 2 WA 3, and TWDS 2 WA 5. For 1000m, it will be the location of the candidate’s TWDS being at TWDS 2 WA 1, TWDS WA 2, and TWDS 2 WA 3. Using GRA, results were obtained will be 4 TWDS, namely TWDS 2 Hamlet 1, TWDS 1 Hamlet 2, TWDS 2 Hamlet 3, TWDS 2, Hamlet 5. Then using GRA, 2 solutions are obtained, namely columns 2 and 5 which dominate. Column 2 nomination are Hamlets 1, 2, 3, and 6. Column 5 which dominates will be Hamlets 1, 3, 5, and 6.

show abstract

A new hybrid matheuristic of GRASP and VNS based on constructive heuristics, set-covering and set-partitioning formulations applied to the capacitated vehicle routing problem

Cited by 17 publications

References 28 publications

A Bibliometric Visualized Analysis and Classification of Vehicle Routing Problem Research

A Bibliometric Visualized Analysis and Classification of Vehicle Routing Problem Research

Hybrid Artificial Bee Colony Algorithm with Variable Neighborhood Search for Capacitated Vehicle Routing Problem

Formulation of Set Covering Problem Using Myopic Algorithm and Greedy Reduction Algorithm in Determining the Location of Temporary Landfills in Semambu Island Village, Ogan Ilir Regency, South Sumatra

Contact Info

Product

Resources

About