How to Bike Transport Pune to Delhi
Recently we did a trip to Leh and we had to transport our bikes (bicycles) from Mangalore and Pune to Delhi.
See also questions close to this topic
Theoretical background of Google Or-tools
Currenlty I'm working on my thesis work about Tourism optimization, that contain both Knapsack and VRP solvers from OR-tools. At this point I need some theoretical background about OR-tools.
After internet search I didn't find any information I looked for. My main concerns are:
1. How does it work in a nutshell?(in comparison with other solvers)
2. Is it using any known algorithms as Gradient Decent or other or it developed it's own?
3. What are the key factor making OR-tools faster than other solvers?
I understand that all this information might be confidencial, and that's why there's nothing on internet. I hope for any clarification on this topic and will be grateful for any useful information.
Google OR-Tools vehicle routing: minimum arc-cost per vehicle?
I'm trying to optimise the total costs of a product distribution operation via google OR-tools. As such, I'm calculating the arc-cost as $ amounts for the specific vehicle, calculated as KM driven * per-km cost of the vehicle:
for n, vehicle_cost in enumerate(vehicle_costs): def vehicle_distance_cost_evaluator(source, destination): return distance_evaluator(source, destination) * vehicle_cost routing.SetArcCostEvaluatorOfVehicle(vehicle_distance_cost_evaluator, n)
This works just great, but there's a catch: in addition to per-km costs, each vehicle has minimum hiring cost. For example, a vehicle could have 1$ per-km cost, and 100$ minimum hiring cost. Meaning, any distance driven below 100km would still cost 100$. From there on, 101km would cost 101$ and so on.
How could I go about implementing this? Modify
vehicle_distance_cost_evaluator, make it return 100$ for leaving the depot and then somehow access and re-calculate the real previous path of the vehicle, returning 0$ until we hit 100km driven?
Maybe there's a better way to do this via some routing constraint? I'm using the python version of OR-tools if that changes anything.
How can I generate the density information of vehicles in only SUMO?
This is the my sumocfg file code in the SUMO program.
<input> <net-file value="updated.net.xml"/> <route-files value="trips.trips.xml"/> </input> <time> <begin value="0"/> </time> <report> <verbose value="true"/> <no-step-log value="true"/> </report>
updated.net.xml is network file which I write, and trips.trips.xml is just the vehicle mobility file.
In https://sumo.dlr.de/wiki/Simulation/Output/Lane-_or_Edge-based_Traffic_Measures, there is the density information format, but I don't know how can I generate the additional output file including vehicle density information.
What code should I add here?