The "vehicle routing problem" is a combinatorial optimization problem which asks "What is the optimal set of routes for a fleet of vehicles to traverse in order to deliver to a given set of customers?". It generalises the travelling salesman problem.
Questions tagged [vehicle-routing]
258 questions
2
votes
0 answers
benchmark results for VRPTW - comparing jsprit and ortools-vrp solvers?
I've been trying to find results for some known VRPTW benchmarks (e.g. http://neo.lcc.uma.es/vrp/known-best-results/) for comparing jsprit vs. ortools-vrp, using the best search-heuristics both have to offer. Is there some known resource for that?
ihadanny
- 4,377
- 7
- 45
- 76
2
votes
1 answer
How to make only some tours return to depot in vehicle routing problem with or-tools?
In the instance of the Vehicle Routing Problem (VRP) with Google's OR-Tools that I'm trying to solve, only certain routes (tours) should end at the starting point, i.e. the depot.
I can edit the distances from every location to the depot. Setting…
Vital V
- 235
- 1
- 4
- 15
2
votes
1 answer
Vehicle Routing Problem: "Solution Infeasible" with PuLP when linking the variable "path (X)" and the variable "Delivered_Quantity"
Trying to minimize total travel distance (using pulp), I got an infeasible solution while it is clearly feasible.
The solution becomes infeasible when I am linking the variable "path (X)" and the variable "Delivered_Quantity". In the code, the link…
LFM
- 61
- 4
2
votes
1 answer
How to implement routing protocols on Estinet network simulator?
I am trying to implement routing protocols such as AODV and DSR in a vanet simulation using Estinet ( previously called NCTUns network simulator ) https://www.estinet.com/ns/.
However, i cant find any information on how this is achieved. Is there…
Young4844
- 247
- 1
- 4
- 12
2
votes
2 answers
How to generate some feasible solutions in CPLEX-PYTHON (Not docplex)?
I am working on my thesis about a variant form of Vehicle routing problem (VRP) using a linear mathematical programming approach. I have a well-tested model that I formulated but this model is solved in an acceptable computational time for at most…
Hctor Alonso Hormazbal Vildsol
- 331
- 3
- 13
2
votes
1 answer
finding way ids for list of osm nodes in shortest path
In a route, we get a list of all the nodes from the source to destination.
route = nx.shortest_path(G,origin_node,desitination_node, weight='length')
Is it possible to get all the osm way ids from source to destination?
Isfand
- 43
- 5
2
votes
1 answer
Capacitated Vehicle Routing Problem with Time Windows crashing
I am working on the sample code shared by Google OR Tools. This sample is for Capacitated Vehicle Routing Problem with Time Windows.
When I run the entire programme shared here . It runs fine and gives the output as shown on…
Manish Kumar
- 1,419
- 3
- 17
- 36
2
votes
4 answers
Linear programming of vehicle routing
Need help for linear programming of vehicle routing problem.
In vehicle routing problem (VRP), a vehicle will serve a set of nodes such that the total travelling cost is minimized.
My decision variable is:Xij=1 if node j is visited after node i.
The…
Hossein Beheshti Fakher
- 105
- 12
1
vote
1 answer
Applying OptaPlanner for VRP with customized transportation network
In short - does OptaPlanner require integration with mapping products, e.g. google maps or openstreet maps?
I am researching options for incorporating VRP optimization into a product feature set. The use case is to optimize the routing of…
user22277842
- 11
- 1
1
vote
1 answer
limit the number of visited nodes for each type of nodes in different set of group nodes to a predefined value in or-tools for CVRP
I have implemented or tools (python) for Capacited Vehicle Routing Problem and it is working. I just have another goal in mind: I want to build a callback function that gives each route an upper limit for visiting various types of nodes in a certain…
Nazanin Moarref
- 11
- 3
1
vote
0 answers
OR Tools taking infinite time for MVRP
I am trying to solve MVRP problem using Google OR-Tools where I have 1000 points and 30 fleets(Vehicles). This seems to take indefinite amount of time but when I am reducing the fleets(vehicles) to 1 it is giving me solution.
The above situation…
Varun Singh
- 489
- 3
- 13
1
vote
1 answer
in VRPTW, how to make the constraints soft instead of being strictly hard when doing the routing?
as the title indicates, when incorporating time window, vehicle constraints for nodes, in some scenarios the constraints are too strict and I am unable to produce an output.
How can I make the constraints optional or soft but reflect that in a cost…
heman33
- 25
- 4
1
vote
2 answers
In or-tools, VRPTW, how can I incorporate the constraint that some stops should be visited by only one subset of vehicles?
vehicle 1
vehicle 2
vehicle 3
vehicle 4
node 1
1
1
0
0
node 2
0
1
1
0
node 3
0
0
1
1
As could be seen from the matrix, a node could only be served by a specified list of vehicles. Node 1 should be served by vehicle 1 or vehicle 2,…
heman33
- 25
- 4
1
vote
0 answers
Python Gurobi not able to get optimize solution
I'm working on a Gurobi optimize question but can't not find the solution I want.
This question is trying to find the best path for picking materials in warehouse.
Here is the current solution.
x(0,5,33) 1.0
q(1,33) 2.0
x(1,2,33) 1.0
q(2,33)…
Mangoosun
- 11
- 1
1
vote
2 answers
Can we only print the first solution strategy and not the local search solution in Google OR Tools?
I am currently learning how to use Google OR-Tools, specifically on the CVRP Problem. The code is divided into two stages. The first one is finding the initial/first solution using path-cheapest-arc, savings algorithm, etc. the second stage is…
Cakra1337
- 23
- 4