Feasible solutions could not be found. Closest infeasible solution is found with infeasibilities in: Capacity dimension

When trying to send data as below, I get information that the service could not process the request because the capisties conditions were not met.

Does the request contain an error? I wanted to verify the Pickup and Delivery model with the assumption that the car on the route can be loaded or unloaded (0,1).

The car has 100 occupancy units, and each route requires 60.

{ “action”: “cuOpt_OptimizedRouting”,
“data”: {
“cost_waypoint_graph_data”: None,
“travel_time_waypoint_graph_data”: None,
“cost_matrix_data”: {
“data”: {
“1”: [
[
0,
513,
354,
513,
354
],
[
514,
0,
219,
1,
219
],
[
354,
219,
0,
219,
1
],
[
514,
1,
219,
0,
219
],
[
354,
219,
1,
219,
0
]
]
}
},
“travel_time_matrix_data”: {
“data”: {
“1”: [
[
0,
385,
262,
385,
262
],
[
385,
0,
215,
0,
215
],
[
261,
214,
0,
214,
0
],
[
385,
0,
215,
0,
215
],
[
261,
214,
0,
214,
0
]
]
}
},
“fleet_data”: {
“vehicle_locations”: [
[
0,
0
]
],
“vehicle_ids”: [
“vid”
],
“capacities”: [
[
100
]
],
“vehicle_types”: [
1
],
“vehicle_time_windows”: [
[
0,
5100
]
]
},
“task_data”: {
“pickup_and_delivery_pairs”: [
[
0,
1
],
[
2,
3
]
],
“task_locations”: [
1,
2,
3,
4
],
“task_ids”: [
“o1L”,
“o1U”,
“o2L”,
“o2U”
],
“demand”: [
[
60,
-60,
60,
-60
]
],
“task_time_windows”: [
[
1500,
2220
],
[
1920,
2400
],
[
1500,
2220
],
[
1920,
2400
]
],
“service_times”: [
30,
50,
30,
50
]
},
“solver_config”: {
“time_limit”: 5,
“objectives”: {
“cost”: 0,
“travel_time”: 1,
“variance_route_size”: 0,
“variance_route_service_time”: 0,
“prize”: 0
},
“error_logging”: True
}
},
“client_version”: “”

Response:

{‘response’: {‘solver_infeasible_response’: {‘status’: 1, ‘num_vehicles’: 1, ‘solution_cost’: 1021.0, ‘objective_values’: {‘cost’: 1088.0, ‘travel_time’: 1021.0}, ‘vehicle_data’: {‘vid’: {‘task_id’: [‘Depot’, ‘o1L’, ‘o2L’, ‘o1U’, ‘o2U’, ‘Depot’], ‘arrival_stamp’: [1260.0, 1645.0, 1675.0, 1920.0, 1970.0, 2281.0], ‘type’: [‘Depot’, ‘Pickup’, ‘Pickup’, ‘Delivery’, ‘Delivery’, ‘Depot’], ‘route’: [0, 1, 3, 2, 4, 0]}}, ‘dropped_tasks’: {‘task_id’: , ‘task_index’: }}, ‘perf_times’: {‘etl_time’: 0.02270221710205078, ‘solver_run_time’: 5.12641978263855}}, ‘notes’: [‘Feasible solutions could not be found. Closest infeasible solution is found with infeasibilities in:\n\tCapacity dimension\n’]}

The notes: shows only possible issues which might have made it infeasible, and as far as I can see, this is feasible with respect to capacity, but it is actually seems infeasible with respect to time windows. And we will try to improve the failure messages a better to handle this scenario.