Algoritmo genético para solução de [problemas cvrp](https://en.wikipedia.org/wiki/Vehicle_routing_problem) desenvolvido para a disciplina de Inteligência Artificial do curso de Sistemas de Informação da universidade de São Paulo.
A genetic algorithm to optimise the Capacitated Vehicle Routing Problem
vrp is a collection of code related to the vehicle routing problem
Capacitated Vehicle Routing Problem Solver
Heterogeneous capacitated vehicle routing problem
C++ Solver for Vehicle Routing with Time Windows (CVRPTW) problem
Amazing Collection Vehicle Routing Problem
Capacitated Vehicle Routing Problem solved with Ant Colony Optimization
Resolução do Capacitated Vehicle Routing Problem (CVRP) de forma meta-heurística utilizando o GILS-RVND
Capacitated vehicle routing problem implemented in python using DEAP package. Non dominated sorting Genetic algorithm is used to solve Multiobjective problem of minimizing Total distance travelled by all vehicles and minimizing total number of vehicles at same time.
A Web application for automatic smart route generation for day-to-day garbage collection which minimizes the fuel consumption of garbage trucks by providing systematic routes on the basis of real time percentage level of garbage in the bins, capacity of trucks, road feasibility
Dynamic Attention Encoder-Decoder model to learn and design heuristics to solve capacitated vehicle routing problems
Implementation of method "route first, cluster-second" for solving CVRP.
An implementation of the Ant Colony optimization algorithm (ACO) for the capacitated vehicle routing problem (CVRP) for bike sharing rebalancing
An implementation of the Particle Swarm Optimization method applied to the specific problem of Bike Sharing Redistribution
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."