Path: blob/main/tests/tools/drt/drtOrtools/waiting_time1/output.tools
428505 views
Simulation parameters:
end: 600.0
interval: 30
time_limit: 10
cost_type: CostType.DISTANCE
drf: 3.0
waiting_time: 40.0
fix_allocation: True
timestep: 0.0
Reservations waiting: ['0', '1']
Taxis empty: ('v0',)
Solve CPDP
Start creating the model.
dp reservations: ['0', '1']
do reservations: []
Reservation 0 starts at edge B0C0
Reservation 1 starts at edge C2C1
Reservation 0 ends at edge C1C2
Reservation 1 ends at edge C0B0
Reservation 0 has direct route costs 485
Reservation 1 has direct route costs 480
Penalty factor is 2000
Start solving the problem.
Register distance callback.
Create time dimension.
Add distance constraints...
Add pickup and delivery constraints...
pickup/dropoff nodes: 1/2
allow to reject new reservation 0
pickup/dropoff nodes: 3/4
allow to reject new reservation 1
Add direct route factor constraints...
reservation 0: direct route cost 485 and (hard) max cost 1455
reservation 1: direct route cost 480 and (hard) max cost 1440
Add dropoff constraints...
Add "no re-allocation" constraints...
Add capacity constraints...
Add time windows constraints...
hard time window for node 1: [1, 600]
hard time window for node 2: [1, 600]
hard time window for node 3: [1, 600]
hard time window for node 4: [1, 600]
hard time window for node 5: [1, 600]
Add waiting time constraints...
reservation 0 has a maximum (hard) pickup time at 40
reservation 1 has a maximum (hard) pickup time at 40
## Done
Set solution heuristic...
Start solving the problem.
Objective: 800000
Route for vehicle 0:
5 (L: 0, C: 0, T: (1,600))
-> 0 (L: 0, C: 0, T: (1,600))
Costs of the route: 0
Total cost of the routes: 0
Start interpreting the solution for SUMO.
Dispatching v0 with []
Costs for v0: 0
timestep: 30.0
Reservations waiting: ['0', '1']
Taxis empty: ('v0',)
Solve CPDP
Start creating the model.
dp reservations: ['0', '1']
do reservations: []
Reservation 0 starts at edge B0C0
Reservation 1 starts at edge C2C1
Reservation 0 ends at edge C1C2
Reservation 1 ends at edge C0B0
Reservation 0 has direct route costs 485
Reservation 1 has direct route costs 480
Penalty factor is 2000
Start solving the problem.
Register distance callback.
Create time dimension.
Add distance constraints...
Add pickup and delivery constraints...
pickup/dropoff nodes: 1/2
allow to reject new reservation 0
pickup/dropoff nodes: 3/4
allow to reject new reservation 1
Add direct route factor constraints...
reservation 0: direct route cost 485 and (hard) max cost 1455
reservation 1: direct route cost 480 and (hard) max cost 1440
Add dropoff constraints...
Add "no re-allocation" constraints...
Add capacity constraints...
Add time windows constraints...
hard time window for node 1: [30, 600]
hard time window for node 2: [30, 600]
hard time window for node 3: [30, 600]
hard time window for node 4: [30, 600]
hard time window for node 5: [30, 600]
Add waiting time constraints...
reservation 0 has a maximum (hard) pickup time at 40
reservation 1 has a maximum (hard) pickup time at 40
## Done
Set solution heuristic...
Start solving the problem.
Initial solution:
veh 0: []
Objective: 800000
Route for vehicle 0:
5 (L: 0, C: 0, T: (30,600))
-> 0 (L: 0, C: 0, T: (30,600))
Costs of the route: 0
Total cost of the routes: 0
Start interpreting the solution for SUMO.
Dispatching v0 with []
Costs for v0: 0
timestep: 60.0
Reservations waiting: ['0', '1']
Taxis empty: ('v0',)
Solve CPDP
Start creating the model.
Reservations rejected: ['0', '1']
dp reservations: []
do reservations: []
Penalty factor is 1
Start solving the problem.
Register distance callback.
Create time dimension.
Add distance constraints...
Add pickup and delivery constraints...
Add direct route factor constraints...
Add dropoff constraints...
Add "no re-allocation" constraints...
Add capacity constraints...
Add time windows constraints...
hard time window for node 1: [60, 600]
Add waiting time constraints...
## Done
Set solution heuristic...
Start solving the problem.
Initial solution:
veh 0: []
Objective: 0
Route for vehicle 0:
1 (L: 0, C: 0, T: (60,600))
-> 0 (L: 0, C: 0, T: (60,600))
Costs of the route: 0
Total cost of the routes: 0
Start interpreting the solution for SUMO.
Dispatching v0 with []
Costs for v0: 0
timestep: 90.0
Taxis empty: ('v0',)
timestep: 120.0
Taxis empty: ('v0',)
timestep: 150.0
Taxis empty: ('v0',)
timestep: 180.0
Taxis empty: ('v0',)
timestep: 210.0
Taxis empty: ('v0',)
timestep: 240.0
Taxis empty: ('v0',)
timestep: 270.0
Taxis empty: ('v0',)
timestep: 300.0
Taxis empty: ('v0',)
timestep: 330.0
Taxis empty: ('v0',)
timestep: 360.0
Taxis empty: ('v0',)
timestep: 390.0
Taxis empty: ('v0',)
timestep: 420.0
Taxis empty: ('v0',)
timestep: 450.0
Taxis empty: ('v0',)
timestep: 480.0
Taxis empty: ('v0',)
timestep: 510.0
Taxis empty: ('v0',)
timestep: 540.0
Taxis empty: ('v0',)
timestep: 570.0
Taxis empty: ('v0',)
timestep: 600.0
Taxis empty: ('v0',)