Metaheurísticas para Rutas Turísticas
-
Updated
Nov 26, 2017 - C++
Metaheurísticas para Rutas Turísticas
A Routing-Matching model for a routing delivery markeplace. More documentation to come.
This is a Java implementation of solving Vehicle Routing Problems (VRP) using Google OR-Tools.
This an implementation of the paper proposed by Niu et al. in 2021, entitled "An improved learnable evolution model for solving multi-objective vehicle routing problem with stochastic demand".
Optimized Routing for Electric Delivery Vehicles
My final year project. Optimize the routes for courier delivery.
This software tries to solve a version of the vehicle routing problem.
Résolution à l'aide du problème de tournée des véhicules (VRP) à l'aide d'algorithmes heuristiques. Utilisation de l'algorithme Clarke and Wright doublé d'un algorithme de recherche local (2opt) et d'une heuristique faite main, plus globale. Travail effectué dans le cadre des TIPE en classes préparatoires.
Optimizing vehicle routing for efficient delivery of goods to various customer locations while minimizing costs. This project implements algorithms to solve the Capacitated Vehicle Routing Problem (CVRP) using Python and frameworks like Google OR-Tools and the nearest neighbor heuristic, with the latter being used for comparison purposes.
Algoritms for opeartion Research
Clients for the route optimization optiflow api
This project presents an approach to solving the Vehicle Routing Problem (VRP) using various metaheuristics. It explores the creation of efficient delivery routes to serve customers while respecting specific constraints, implementing algorithms such as Tabu Search, Simulated Annealing, and Gradient Descent.
Gym environments for logistics tasks that can be described as "Move something from A to B"
Add a description, image, and links to the vrp topic page so that developers can more easily learn about it.
To associate your repository with the vrp topic, visit your repo's landing page and select "manage topics."