Add to ORKGThree different implementations of a Metaheuristic (Variable Neighborhood Search Algorithm) for the Capacitated Vehicle Routing Problem. Some more details are given in the attached PDF
This work proposes a partial optimization metaheuristic under special intensification conditions (PO...
We investigate a structural decomposition for the capacitated vehicle routing problem (CVRP) based o...
The purpose of the Vehicle Routing Problem is to obtain a vehicle route with a minimum mileage in me...
Three different implementations of a Metaheuristic (Variable Neighborhood Search Algorithm) for the ...
Three different implementations of a Metaheuristic (Variable Neighborhood Search Algorithm) for the ...
This chapter presents the best-known heuristics and metaheuristics that are applied to solve the cap...
International audienceThis chapter presents the main metaheuristics working on a sequence of solutio...
This work aims to develop an enhanced Perturbation based Variable Neighborhood Search with Adaptive ...
This paper presents a novel optimization algorithm that consists of metaheuristic processes to solve...
This study proposes a novel hybrid algorithm based on Iterated Local Search (ILS) and Random Variabl...
International audienceSimple heuristics and local search procedures are important components of meta...
This paper addresses the Capacitated Vehicle Routing Problem (CVRP), which is a widely studied optim...
We investigate a structural decomposition for the capacitated vehicle routing problem (CVRP) based o...
the details of all computational results of all algorithms for the capacitated vehicle routing probl...
In this paper, three cluster-first route-second approaches are proposed to solve the capacitated veh...
This work proposes a partial optimization metaheuristic under special intensification conditions (PO...
We investigate a structural decomposition for the capacitated vehicle routing problem (CVRP) based o...
The purpose of the Vehicle Routing Problem is to obtain a vehicle route with a minimum mileage in me...
Three different implementations of a Metaheuristic (Variable Neighborhood Search Algorithm) for the ...
Three different implementations of a Metaheuristic (Variable Neighborhood Search Algorithm) for the ...
This chapter presents the best-known heuristics and metaheuristics that are applied to solve the cap...
International audienceThis chapter presents the main metaheuristics working on a sequence of solutio...
This work aims to develop an enhanced Perturbation based Variable Neighborhood Search with Adaptive ...
This paper presents a novel optimization algorithm that consists of metaheuristic processes to solve...
This study proposes a novel hybrid algorithm based on Iterated Local Search (ILS) and Random Variabl...
International audienceSimple heuristics and local search procedures are important components of meta...
This paper addresses the Capacitated Vehicle Routing Problem (CVRP), which is a widely studied optim...
We investigate a structural decomposition for the capacitated vehicle routing problem (CVRP) based o...
the details of all computational results of all algorithms for the capacitated vehicle routing probl...
In this paper, three cluster-first route-second approaches are proposed to solve the capacitated veh...
This work proposes a partial optimization metaheuristic under special intensification conditions (PO...
We investigate a structural decomposition for the capacitated vehicle routing problem (CVRP) based o...
The purpose of the Vehicle Routing Problem is to obtain a vehicle route with a minimum mileage in me...