Metaheuristics to compute an optimized solution for the combined MTCVRPTW and DSP problem
-
Updated
Apr 6, 2021 - C++
Metaheuristics to compute an optimized solution for the combined MTCVRPTW and DSP problem
R package implementing the Clarke-Wright algorithm to find a quasi-optimal solution to the Capacitated Vehicle Routing Problem.
This program is a solution to the Vehicle Routing Problem for Pickup and Delivery (VRPPD) with constraint on distance travelled by each driver. It efficiently assigns loads to drivers while minimizing total distance travelled using Clark-Wright Savings algorithm
Penerapan Harris Hawks Optimization Pada Capacitated Vehicle Routing Problem
Code for paper: Machine-Learning Component for Multi-Start Metaheuristics to Solve the Capacitated Vehicle Routing Problem
A Branch-and-Cut based Pricer for the Capacitated Vehicle Routing Problem
This project about The Capacitated Vehicle Routing Problem
Modern implementation of the hybrid genetic search (HGS) algorithm specialized to the capacitated vehicle routing problem (CVRP). This code also includes an additional neighborhood called SWAP*.
Algorithms applied to Last-Mile Capacitated Vehicle Routing Problems
Problema de Enrutamiento de Vehículos con Capacidad Limitada utilizando Algoritmos Genéticos.
Project for the "Advanced Data Structures and Algorithms" Curricular Unit (FEUP) - VRP Solver
C++ Solver for Vehicle Routing with Time Windows (CVRPTW) problem
Using Simulated-Annealing algorithm to solve CVRP problem
Problème logistique de la CVRP résolu en Java
An archive of docs and sample codes from the training period in MSO Lab, HUST. Sep 2022
Add a description, image, and links to the cvrp topic page so that developers can more easily learn about it.
To associate your repository with the cvrp topic, visit your repo's landing page and select "manage topics."