vrp_vroomJobsPlain - Experimental¶
vrp_vroomJobsPlain
- Vehicle Routing Problem with VROOM, involving only
jobs, with plain integer values instead of TIMESTAMP or INTERVAL.
Warning
Possible server crash
These functions might create a server crash
Warning
Experimental functions
They are not officially of the current release.
They likely will not be officially be part of the next release:
The functions might not make use of ANY-INTEGER and ANY-NUMERICAL
Name might change.
Signature might change.
Functionality might change.
pgTap tests might be missing.
Might need c/c++ coding.
May lack documentation.
Documentation if any might need to be rewritten.
Documentation examples might need to be automatically generated.
Might need a lot of feedback from the comunity.
Might depend on a proposed function of vrpRouting
Might depend on a deprecated function of vrpRouting
Availability
Version 0.3.0
Function modified for VROOM 1.11.0
Version 0.2.0
New experimental function
Description¶
VROOM is an open-source optimization engine that aims at providing good solutions to various real-life vehicle routing problems (VRP) within a small computing time. This function can be used to get the solution to a problem involving only jobs.
Signature¶
Example: This example is based on the VROOM Data of the Sample Data network:
SELECT *
FROM vrp_vroomJobsPlain(
'SELECT * FROM vroom.jobs',
'SELECT * FROM vroom.jobs_time_windows',
'SELECT * FROM vroom.vehicles',
'SELECT * FROM vroom.breaks',
'SELECT * FROM vroom.breaks_time_windows',
'SELECT * FROM vroom.matrix'
);
seq | vehicle_seq | vehicle_id | vehicle_data | step_seq | step_type | task_id | location_id | task_data | arrival | travel_time | setup_time | service_time | waiting_time | departure | load
-----+-------------+------------+--------------+----------+-----------+---------+-------------+-----------+---------+-------------+------------+--------------+--------------+-----------+-------
1 | 1 | 1 | {} | 1 | 1 | -1 | 1 | {} | 300 | 0 | 0 | 0 | 0 | 300 | {20}
2 | 1 | 1 | {} | 2 | 5 | 1 | 1 | {} | 300 | 0 | 0 | 0 | 0 | 300 | {20}
3 | 1 | 1 | {} | 3 | 2 | 1 | 1 | {} | 300 | 0 | 0 | 250 | 3325 | 3875 | {20}
4 | 1 | 1 | {} | 4 | 6 | -1 | 1 | {} | 3875 | 0 | 0 | 0 | 0 | 3875 | {20}
5 | 1 | 1 | {} | 0 | 0 | 0 | 0 | {} | 0 | 0 | 0 | 250 | 3325 | 0 | {}
6 | 2 | 2 | {} | 1 | 1 | -1 | 1 | {} | 275 | 0 | 0 | 0 | 0 | 275 | {100}
7 | 2 | 2 | {} | 2 | 5 | 2 | 1 | {} | 275 | 0 | 0 | 10 | 0 | 285 | {100}
8 | 2 | 2 | {} | 3 | 2 | 2 | 2 | {} | 335 | 50 | 0 | 250 | 915 | 1500 | {100}
9 | 2 | 2 | {} | 4 | 2 | 5 | 4 | {} | 1590 | 90 | 0 | 250 | 0 | 1840 | {100}
10 | 2 | 2 | {} | 5 | 2 | 3 | 3 | {} | 1890 | 50 | 0 | 250 | 835 | 2975 | {100}
11 | 2 | 2 | {} | 6 | 2 | 4 | 3 | {} | 2975 | 0 | 0 | 250 | 550 | 3775 | {100}
12 | 2 | 2 | {} | 7 | 6 | -1 | 3 | {} | 3775 | 0 | 0 | 0 | 0 | 3775 | {100}
13 | 2 | 2 | {} | 0 | 0 | 0 | 0 | {} | 0 | 190 | 0 | 1010 | 2300 | 0 | {}
14 | 0 | 0 | {} | 0 | 0 | 0 | 0 | {} | 0 | 190 | 0 | 1260 | 5625 | 0 | {}
(14 rows)
Parameters¶
Parameter |
Type |
Description |
---|---|---|
|
Query describing the single-location pickup and/or delivery |
|
|
Query describing valid slots for job service start. |
|
|
Query describing the available vehicles. |
|
|
Query describing the driver breaks. |
|
|
Query describing valid slots for break start. |
|
|
Query containing the distance or travel times between the locations. |
Optional Parameters¶
Parameter |
Type |
Default |
Description |
---|---|---|---|
|
|
\(5\) |
Exploration level to use while solving.
|
|
|
\(-1\) |
Timeout value to stop the solving process.
|
Inner Queries¶
Jobs SQL¶
A SELECT
statement that returns the following columns:
id, location_id
[setup, service, delivery, pickup, skills, priority, data]
Maximum values apply from vroom
setup
and service
\(4294967295\)
skills
\(2147483647\)
priority
\(100\)
Column |
Type |
Default |
Description |
---|---|---|---|
|
ANY-INTEGER |
Positive unique identifier of the job. |
|
|
ANY-INTEGER |
Positive unique identifier of the location of the job. |
|
|
ANY-INTEGER |
\(0\) |
The Job setup duration. |
|
ANY-INTEGER |
\(0\) |
The Job service duration. Max value: |
|
|
|
Array of non-negative integers describing multidimensional quantities for pickup such as number of items, weight, volume etc.
|
|
|
|
Array of non-negative integers describing multidimensional quantities for delivery such as number of items, weight, volume etc.
|
|
|
|
Array of non-negative integers defining mandatory skills. |
|
|
\(0\) |
Value range: \([0, 100]\) |
|
|
|
Any metadata information of the job. |
Jobs Time Windows SQL¶
A SELECT
statement that returns the following columns:
id, tw_open, tw_close
Column |
Type |
Description |
---|---|---|
|
ANY-INTEGER |
Positive unique identifier of the: job, pickup/delivery shipment, or break. |
|
ANY-INTEGER |
Time window opening time. |
|
ANY-INTEGER |
Time window closing time. |
Vehicles SQL¶
A SELECT
statement that returns the following columns:
id, start_id, end_id
[capacity, skills, tw_open, tw_close, speed_factor, max_tasks, data]
Maximum values apply from vroom
skills
\(2147483647\)
priority
\(100\)
Column |
Type |
Default |
Description |
---|---|---|---|
|
ANY-INTEGER |
Positive unique identifier of the vehicle. |
|
|
ANY-INTEGER |
Positive unique identifier of the start location. |
|
|
ANY-INTEGER |
Positive unique identifier of the end location. |
|
|
|
|
Array of non-negative integers describing multidimensional quantities such as number of items, weight, volume etc.
|
|
|
|
Array of non-negative integers defining mandatory skills. |
|
ANY-INTEGER |
\(0\) |
Time window opening time.
|
|
ANY-INTEGER |
\(4294967295\) |
Time window closing time.
|
|
ANY-NUMERICAL |
\(1.0\) |
Vehicle travel time multiplier.
|
|
|
\(2147483647\) |
Maximum number of tasks in a route for the vehicle.
|
|
|
|
Any metadata information of the vehicle. |
Note:
At least one of the
start_id
orend_id
shall be present.If
end_id
is omitted, the resulting route will stop at the last visited task, whose choice is determined by the optimization process.If
start_id
is omitted, the resulting route will start at the first visited task, whose choice is determined by the optimization process.To request a round trip, specify both
start_id
andend_id
as the same index.A vehicle is only allowed to serve a set of tasks if the resulting load at each route step is lower than the matching value in capacity for each metric. When using multiple components for amounts, it is recommended to put the most important/limiting metrics first.
It is assumed that all delivery-related amounts for jobs are loaded at vehicle start, while all pickup-related amounts for jobs are brought back at vehicle end.
Breaks SQL¶
A SELECT
statement that returns the following columns:
id, vehicle_id
[service, data]
Column |
Type |
Default |
Description |
---|---|---|---|
|
ANY-INTEGER |
Positive unique identifier of the break. Unique for the same vehicle. |
|
|
ANY-INTEGER |
Positive unique identifier of the vehicle. |
|
|
ANY-INTEGER |
\(0\) |
The break duration |
|
|
|
Any metadata information of the break. |
Breaks Time Windows SQL¶
A SELECT
statement that returns the following columns:
id, tw_open, tw_close
Column |
Type |
Description |
---|---|---|
|
ANY-INTEGER |
Positive unique identifier of the: job, pickup/delivery shipment, or break. |
|
ANY-INTEGER |
Time window opening time. |
|
ANY-INTEGER |
Time window closing time. |
Time Matrix SQL¶
A SELECT
statement that returns the following columns:
start_id, end_id, duration
[ cost]
Column |
Type |
Default |
Description |
---|---|---|---|
|
ANY-INTEGER |
Identifier of the start node. |
|
|
ANY-INTEGER |
Identifier of the end node. |
|
|
ANY-INTEGER |
Time to travel from |
|
|
ANY-INTEGER |
|
Cost of travel from |
Result Columns¶
Returns set of
(seq, vehicle_seq, vehicle_id, vehicle_data, step_seq, step_type, task_id,
task_data, arrival, travel_time, service_time, waiting_time, load)
Column |
Type |
Description |
---|---|---|
|
|
Sequential value starting from 1. |
|
|
Sequential value starting from 1 for current vehicles. The \(n^{th}\) vehicle in the solution. |
|
|
Current vehicle identifier.
|
|
|
Metadata information of the vehicle. |
|
|
Sequential value starting from 1 for the stops made by the current vehicle. The \(m^{th}\) stop of the current vehicle.
|
|
|
Kind of the step location the vehicle is at:
|
|
|
Identifier of the task performed at this step.
|
|
|
Identifier of the task location.
|
|
|
Metadata information of the task. |
|
ANY-INTEGER |
Estimated time of arrival at this step. |
|
ANY-INTEGER |
Travel time from previous
|
|
ANY-INTEGER |
Setup time at this step. |
|
ANY-INTEGER |
Service time at this step. |
|
ANY-INTEGER |
Waiting time at this step. |
|
ANY-INTEGER |
Estimated time of departure at this step.
|
|
|
Vehicle load after step completion (with capacity constraints) |
Note:
Unallocated tasks are mentioned at the end with
vehicle_id = -1
.The last step of every vehicle denotes the summary row, where the columns
travel_time
,service_time
andwaiting_time
denote the total time for the corresponding vehicle,The last row denotes the summary for the complete problem, where the columns
travel_time
,service_time
andwaiting_time
denote the total time for the complete problem,
Additional Example¶
Problem involving 2 jobs, using a single vehicle, corresponding to the VROOM Documentation Example 2.
SELECT *
FROM vrp_vroomJobsPlain(
$jobs$
SELECT * FROM (
VALUES (1414, 2), (1515, 3)
) AS C(id, location_id)
$jobs$,
NULL,
$vehicles$
SELECT * FROM (
VALUES (1, 1, 4)
) AS C(id, start_id, end_id)
$vehicles$,
NULL,
NULL,
$matrix$
SELECT * FROM (
VALUES (1, 2, 2104), (1, 3, 197), (1, 4, 1299),
(2, 1, 2103), (2, 3, 2255), (2, 4, 3152),
(3, 1, 197), (3, 2, 2256), (3, 4, 1102),
(4, 1, 1299), (4, 2, 3153), (4, 3, 1102)
) AS C(start_id, end_id, duration)
$matrix$
);
seq | vehicle_seq | vehicle_id | vehicle_data | step_seq | step_type | task_id | location_id | task_data | arrival | travel_time | setup_time | service_time | waiting_time | departure | load
-----+-------------+------------+--------------+----------+-----------+---------+-------------+-----------+---------+-------------+------------+--------------+--------------+-----------+------
1 | 1 | 1 | {} | 1 | 1 | -1 | 1 | {} | 0 | 0 | 0 | 0 | 0 | 0 | {}
2 | 1 | 1 | {} | 2 | 2 | 1414 | 2 | {} | 2104 | 2104 | 0 | 0 | 0 | 2104 | {}
3 | 1 | 1 | {} | 3 | 2 | 1515 | 3 | {} | 4359 | 2255 | 0 | 0 | 0 | 4359 | {}
4 | 1 | 1 | {} | 4 | 6 | -1 | 4 | {} | 5461 | 1102 | 0 | 0 | 0 | 5461 | {}
5 | 1 | 1 | {} | 0 | 0 | 0 | 0 | {} | 0 | 5461 | 0 | 0 | 0 | 0 | {}
6 | 0 | 0 | {} | 0 | 0 | 0 | 0 | {} | 0 | 5461 | 0 | 0 | 0 | 0 | {}
(6 rows)
See Also¶
The queries use the Sample Data network.
Indices and tables