Path: blob/main/tests/tools/drt/drtOrtools/oneTaxi_addNewReq/output.tools
428536 views
Retrying in 1 seconds
Simulation parameters:
end: 600.0
interval: 30
time_limit: 10
cost_type: CostType.DISTANCE
drf: -1.0
waiting_time: 900
fix_allocation: False
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 C0D0
Reservation 0 ends at edge C1D1
Reservation 1 ends at edge D0D1
Reservation 0 has direct route costs 680
Reservation 1 has direct route costs 385
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 dropoff 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 900
reservation 1 has a maximum (hard) pickup time at 900
## Done
Set solution heuristic...
Start solving the problem.
Objective: 2235
Route for vehicle 0:
5 (L: 0, C: 0, T: (1,307))
-> 1 (L: 1, C: 588, T: (43,349))
-> 3 (L: 2, C: 1174, T: (85,391))
-> 4 (L: 1, C: 1559, T: (176,482))
-> 2 (L: 0, C: 2235, T: (294,600))
-> 0 (L: 0, C: 2235, T: (294,600))
Costs of the route: 2235
Total cost of the routes: 2235
Start interpreting the solution for SUMO.
Dispatching v0 with ['0', '1', '1', '0']
Costs for v0: 2235
timestep: 30.0
Reservations being picked up: ['1']
Reservations en route: ['0']
Taxis picking up: ('v0',)
Taxis occupied: ('v0',)
Taxis occupied and picking up: ('v0',)
timestep: 60.0
Reservations en route: ['0', '1']
Taxis occupied: ('v0',)
timestep: 90.0
Reservations en route: ['0', '1']
Taxis occupied: ('v0',)
timestep: 120.0
Reservations en route: ['0', '1']
Taxis occupied: ('v0',)
timestep: 150.0
Reservations en route: ['0', '1']
Taxis occupied: ('v0',)
timestep: 180.0
Reservations waiting: ['2']
Reservations en route: ['0']
Taxis occupied: ('v0',)
Solve CPDP
Start creating the model.
dp reservations: ['2']
do reservations: ['0']
Reservation 2 starts at edge C2C1
Reservation 2 ends at edge D1D2
Drop-off of reservation 0 at edge C1D1
Reservation 2 has direct route costs 485
Reservation 0 has direct route costs 680
Penalty factor is 800
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 2
Add dropoff constraints...
reservation 0 in veh v0(0), droppoff node: 3
Add capacity constraints...
Add time windows constraints...
hard time window for node 1: [180, 600]
hard time window for node 2: [180, 600]
soft time window for node 3: [180, 600]
hard time window for node 4: [180, 600]
Add waiting time constraints...
reservation 2 has a maximum (hard) pickup time at 1070
## Done
Set solution heuristic...
Start solving the problem.
Initial solution:
veh 0: [3]
Objective: 1240
Route for vehicle 0:
4 (L: 1, C: 0, T: (180,180))
-> 1 (L: 2, C: 470, T: (222,222))
-> 3 (L: 1, C: 855, T: (313,313))
-> 2 (L: 0, C: 1240, T: (403,403))
-> 0 (L: 0, C: 1240, T: (403,403))
Costs of the route: 1240
Total cost of the routes: 1240
Start interpreting the solution for SUMO.
Dispatching v0 with ['2', '0', '2']
Costs for v0: 1240
timestep: 210.0
Reservations en route: ['0', '2']
Taxis occupied: ('v0',)
timestep: 240.0
Reservations en route: ['0', '2']
Taxis occupied: ('v0',)
timestep: 270.0
Reservations en route: ['0', '2']
Taxis occupied: ('v0',)
timestep: 300.0
Reservations en route: ['2']
Taxis occupied: ('v0',)
timestep: 330.0
Reservations en route: ['2']
Taxis occupied: ('v0',)
timestep: 360.0
Reservations en route: ['2']
Taxis occupied: ('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',)