Asymmetric multi-depot vehicle routing problems: valid inequalities and a branch-and-cut algorithm
"Using Genetic Algorithms for Multi-depot Vehicle Routing" paper implementation.
HGSADC is a metaheuristic to solve the multi-depot vehicle routing problem.
Genetic algorithm for Multi-Depot Vehicle Routing Problem optimization
Multi Depot Vehicle Routing Problem (MDVRP) with genetic algorithm & brute force solver written in Python.
Solving the NP-hard Multiple Depot Vehicle Routing Problem with a Genetic Algorithm
Solving the Multi Depot Vehicle Routing Problem (MDVRP) using a Genetic Algorithm (GA). This was a part of the course IT3708 - Bio-Inspired Artificial Intelligence at NTNU spring 2021.
Genetic Algorithms for Feature Selection, solving a variant of the Multi-Depot Vehicle Routing Problem (MDVRP), and image segmentation with a Multiobjective Evolutionary Algorithm (MOEA).
Genetic algorithm for Multi-Depot Vehicle Routing Problem optimization
Genetic Algorithms for Feature Selection, Solving a variant of the Multi-Depot Vehicle Routing Problem (MDVRP) using a Genetic Algorithm (GA), and Image Segmentation With a Multiobjective Evolutionary Algorithm
Solving the Multiple Depot Vehicle Routing Problem (MDVRP) with a Genetic Algorithm
Solver e simulador para roteamento de veículos com múltiplos depósitos (MDVRP) sob falhas: clusterização capacitada + algoritmo genético com split linear constroem o plano do dia, e uma cascata de contingência em três estágios responde a bloqueios de via durante a operação. Python, instâncias de Cordeau.
🗺️ Proposed solution for the Multi-Depot Vehicle Routing Problem with time constraints
To associate your repository with the mdvrp topic, visit your repo's landing page and select "manage topics."