Kernel Search for the Capacitated Vehicle Routing Problem

This paper addresses the Capacitated Vehicle Routing Problem (CVRP), which is a widely studied optimization problem due to its relevance to the field of transportation, distribution, and logistics. We present a matheuristic method for CVRP that adopts the main idea of the Kernel Search algorithm (KS...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Applied sciences Ročník 12; číslo 22; s. 11421
Hlavný autor: Borčinová, Zuzana
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Basel MDPI AG 01.11.2022
Predmet:
Algorithms
capacitated vehicle routing problem
Customers
Heuristic
kernel search
Linear programming
Literature reviews
Mathematical programming
matheuristics
mixed integer linear programming
Optimization
Variables
Vehicles
ISSN:2076-3417, 2076-3417
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:This paper addresses the Capacitated Vehicle Routing Problem (CVRP), which is a widely studied optimization problem due to its relevance to the field of transportation, distribution, and logistics. We present a matheuristic method for CVRP that adopts the main idea of the Kernel Search algorithm (KS) based on decomposing the original problem into sub-problems that are easier to solve. Unlike the original scheme of KS, our approach uses the Clarke–Wright savings algorithm to construct a sequence of smaller sub-problems, which are subsequently solved using mathematical programming strategies. The computational experiments performed on a set of benchmark instances showed that the proposed matheuristics achieves good results in acceptable computational time.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2076-3417
2076-3417
DOI:10.3390/app122211421