[NeurIPS 2023] DeepACO: Neural-enhanced Ant Systems for Combinatorial Optimization
-
Updated
Sep 29, 2024 - Jupyter Notebook
[NeurIPS 2023] DeepACO: Neural-enhanced Ant Systems for Combinatorial Optimization
Inventory-routing problem (IRP) branch-and-cut algorithm using C++ Gurobi's API and CVRPSEP package
This is a project developed to solve a routing problem using a heuristic algorithm.
Master 1's student working research on combined Localisation, Inventory and Routing problem.
This repository explores two optimization algorithms: the Traveling Salesman Problem (TSP) and Nearest Neighbor Search (NNS). It features Jupyter notebooks implementing brute-force solutions to both problems, utilizing Euclidean distance calculations and path visualizations. Ideal for learning about algorithm efficiency and optimization techniques.
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".
Algoritmo gentico para otimizar a rota de entrega de água criado na disciplina de sistemas de apoio a Decisão (IFBA- Campus Feira de Santana) - prof. @LuisAraujo
Add a description, image, and links to the routing-problem topic page so that developers can more easily learn about it.
To associate your repository with the routing-problem topic, visit your repo's landing page and select "manage topics."