All Projects → itinero → optimization

itinero / optimization

Licence: Apache-2.0 license
Routing optimization module module for Itinero.

Programming Languages

C#
18002 projects

Projects that are alternatives of or similar to optimization

Node Or Tools
Node.js bindings for or-tools vehicle routing problems
Stars: ✭ 115 (+144.68%)
Mutual labels:  optimization, routing
cplex-example
Solving a TSP with the CPLEX C++ API.
Stars: ✭ 40 (-14.89%)
Mutual labels:  optimization, tsp
tsp-essay
A fun study of some heuristics for the Travelling Salesman Problem.
Stars: ✭ 15 (-68.09%)
Mutual labels:  logistics, tsp
optimizer-api
Unified API for multiple optimizer engines
Stars: ✭ 26 (-44.68%)
Mutual labels:  optimization, tsp
Router
⚡️ A lightning fast HTTP router
Stars: ✭ 158 (+236.17%)
Mutual labels:  optimization, routing
Scikit Opt
Genetic Algorithm, Particle Swarm Optimization, Simulated Annealing, Ant Colony Optimization Algorithm,Immune Algorithm, Artificial Fish Swarm Algorithm, Differential Evolution and TSP(Traveling salesman)
Stars: ✭ 2,791 (+5838.3%)
Mutual labels:  optimization, tsp
Multiple-Vehicle-Routing
Simple MVR simulation
Stars: ✭ 27 (-42.55%)
Mutual labels:  routing, tsp
CSDP.jl
Julia Wrapper for CSDP (https://projects.coin-or.org/Csdp/)
Stars: ✭ 18 (-61.7%)
Mutual labels:  optimization
flow-router
🚦 Carefully extended flow-router for Meteor
Stars: ✭ 191 (+306.38%)
Mutual labels:  routing
cac-tripplanner
Clean Air Council Circuit Trip Planner and Travelshed
Stars: ✭ 12 (-74.47%)
Mutual labels:  routing
genx
Genx provides modular building blocks to run simulations of optimization and search problems using Genetic Algorithms
Stars: ✭ 31 (-34.04%)
Mutual labels:  optimization
IterativeLQR.jl
A Julia package for constrained iterative LQR (iLQR)
Stars: ✭ 15 (-68.09%)
Mutual labels:  optimization
LBFGS-Lite
LBFGS-Lite: A header-only L-BFGS unconstrained optimizer.
Stars: ✭ 98 (+108.51%)
Mutual labels:  optimization
hopperOptimizations
A mod that optimizes hoppers and their interactions with entities and inventories. It drastically reduces hopper lag without changing any behavior.
Stars: ✭ 65 (+38.3%)
Mutual labels:  optimization
vrpy
A python framework for solving the VRP and its variants with column generation.
Stars: ✭ 94 (+100%)
Mutual labels:  optimization
route-descriptor
Single source of truth for routing
Stars: ✭ 17 (-63.83%)
Mutual labels:  routing
JWT-user-auth-API-bolilerplate
Boilerplate for backend API user authentication with JWT
Stars: ✭ 13 (-72.34%)
Mutual labels:  routing
optimum
🏎️ Accelerate training and inference of 🤗 Transformers with easy to use hardware optimization tools
Stars: ✭ 567 (+1106.38%)
Mutual labels:  optimization
RouteNow
RouteNow is a small fast library ⚡ that will help you in developing a SinglePage Application without any dependencies like jQuery, AngularJs, vue.js or any of those bulky frameworks.
Stars: ✭ 17 (-63.83%)
Mutual labels:  routing
gweatherrouting
Sailing weather routing made easy
Stars: ✭ 15 (-68.09%)
Mutual labels:  routing

Itinero.Optimization

A module for solving optimization routing problems with Itinero as a routing solution.

CI Visit our website GPL licensed

  • Itinero.Optimization: NuGet

Supported problems

Current we have the following problems supported:

  • TSP: The default travelling salesman problem.
  • Directed TSP: The TSP with costs for turns.
  • TSP-TW: The TSP with time window constraints.
  • Directed TSP-TW: The TSP-TW with costs for turns.
  • STSP: The selective travelling salesman problem, generates routes with as much locations as possible with a maxium travel time.
  • DirectedSTSP: Identical to the STSP but with u-turn prevention.
  • CVRP (experimental): The capacitated vehicle routing problem.

Solutions

Usage

Install the following package via Nuget:

PM> Install-Package Itinero.Optimization -IncludePrerelease

Then immediately some extension methods are available on top the default Itinero Router class.

TSP, Directed TSP:

router.Optimize (string profileName, Coordinate[] locations)

This calculates a TSP by default starting and ending at the location at index 0. Specifiy first and last to change this behaviour, when leaving last=null the solver decides the best last location. When setting turnPenalty u-turns are being avoided when they introduce a cost bigger than the given penalty.

Note that the project description data, including the texts, logos, images, and/or trademarks, for each open source project belongs to its rightful owner. If you wish to add or remove any projects, please contact us at [email protected].