Индекс
-
RouteOptimization(интерфейс) -
AggregatedMetrics(message) -
BatchOptimizeToursMetadata(message) -
BatchOptimizeToursRequest(message) -
BatchOptimizeToursRequest.AsyncModelConfig(message) -
BatchOptimizeToursResponse(message) -
BreakRule(message) -
BreakRule.BreakRequest(message) -
BreakRule.FrequencyConstraint(message) -
DataFormat(enum) -
DistanceLimit(message) -
GcsDestination(message) -
GcsSource(message) -
InjectedSolutionConstraint(message) -
InjectedSolutionConstraint.ConstraintRelaxation(message) -
InjectedSolutionConstraint.ConstraintRelaxation.Relaxation(message) -
InjectedSolutionConstraint.ConstraintRelaxation.Relaxation.Level(enum) -
InputConfig(message) -
Location(сообщение) -
OptimizeToursLongRunningMetadata(message) -
OptimizeToursRequest(message) -
OptimizeToursRequest.SearchMode(enum) -
OptimizeToursRequest.SolvingMode(enum) -
OptimizeToursResponse(message) -
OptimizeToursResponse.Metrics(message) -
OptimizeToursUriMetadata(message) -
OptimizeToursUriRequest(message) -
OptimizeToursUriResponse(message) -
OptimizeToursValidationError(message) -
OptimizeToursValidationError.FieldReference(message) -
OutputConfig(message) -
RouteModifiers(message) -
Shipment(сообщение) -
Shipment.Load(message) -
Shipment.VisitRequest(message) -
ShipmentModel(message) -
ShipmentModel.DurationDistanceMatrix(message) -
ShipmentModel.DurationDistanceMatrix.Row(message) -
ShipmentModel.Objective(message) -
ShipmentModel.Objective.Type(enum) -
ShipmentModel.PrecedenceRule(message) -
ShipmentRoute(message) -
ShipmentRoute.Break(message) -
ShipmentRoute.EncodedPolyline(message) -
ShipmentRoute.Transition(message) -
ShipmentRoute.VehicleLoad(message) -
ShipmentRoute.Visit(message) -
ShipmentTypeIncompatibility(message) -
ShipmentTypeIncompatibility.IncompatibilityMode(enum) -
ShipmentTypeRequirement(сообщение) -
ShipmentTypeRequirement.RequirementMode(enum) -
SkippedShipment(сообщение) -
SkippedShipment.Reason(message) -
SkippedShipment.Reason.Code(enum) -
TimeWindow(сообщение) -
TransitionAttributes(message) -
Uri(сообщение) -
Vehicle(сообщение) -
Vehicle.DurationLimit(message) -
Vehicle.LoadLimit(message) -
Vehicle.LoadLimit.Interval(message) -
Vehicle.LoadLimit.LoadCost(message) -
Vehicle.TravelMode(enum) -
Vehicle.UnloadingPolicy(перечисление) -
VehicleFullness(сообщение) -
Waypoint(сообщение)
Оптимизация маршрута
Сервис для оптимизации автомобильных туров.
Допустимость определенных типов полей:
-
google.protobuf.Timestamp- Время указано в формате Unix: секунды с 1970-01-01T00:00:00+00:00.
- секунды должны быть в диапазоне [0, 253402300799], то есть в [1970-01-01T00:00:00+00:00, 9999-12-31T23:59:59+00:00].
- Значение nanos должно быть либо не задано, либо установлено на 0.
-
google.protobuf.Duration- секунды должны быть в диапазоне [0, 253402300799], то есть в [1970-01-01T00:00:00+00:00, 9999-12-31T23:59:59+00:00].
- Значение nanos должно быть либо не задано, либо установлено на 0.
-
google.type.LatLng- Широта должна быть в диапазоне [-90,0, 90,0].
- Долгота должна быть в диапазоне [-180.0, 180.0].
- По крайней мере, одно из значений широты и долготы должно быть ненулевым.
| BatchOptimizeTours |
|---|
Оптимизирует маршруты движения транспортных средств для одного или нескольких сообщений Этот метод является длительной операцией (LRO). Входные данные для оптимизации (сообщения Пользователь может использовать метод `poll Если поле LRO Если поле
|
| OptimizeTours |
|---|
Отправляет запрос Модель Цель состоит в том, чтобы обеспечить такое распределение
|
| OptimizeToursLongRunning |
|---|
Это вариант метода Возвращаемая Экспериментальная версия: подробности см. на странице https://developers.google.com/maps/tt/route-optimization/experimental/otlr/make-request .
|
| OptimizeToursUri |
|---|
Это вариант метода Клиент указывает URI объекта Этот метод следует предпочитать методу Возвращаемая Экспериментальная версия: подробности см. на странице https://developers.google.com/maps/tt/route-optimization/experimental/otlr/make-request .
|
Агрегированные метрики
Сводные метрики для ShipmentRoute (соответственно для OptimizeToursResponse ) по всем элементам Transition и/или Visit (соответственно по всем элементам ShipmentRoute ).
| Поля | |
|---|---|
performed_shipment_count | Количество выполненных отправок. Обратите внимание, что пара "забор и доставка" учитывается только один раз. |
travel_duration | Общая продолжительность поездки по маршруту или решению. |
wait_duration | Общее время ожидания маршрута или решения. |
delay_duration | Общая продолжительность задержки для данного маршрута или решения. |
break_duration | Общая продолжительность перерыва для маршрута или решения. |
visit_duration | Общая продолжительность посещения для конкретного маршрута или решения. |
total_duration | Общая продолжительность должна быть равна сумме всех указанных выше продолжительностей. Для маршрутов это также соответствует: |
travel_distance_meters | Общее пройденное расстояние по маршруту или решению. |
max_loads | Максимальная нагрузка, достигнутая на всем маршруте (соответственно, решение), для каждой из величин на этом маршруте (соответственно, решение), вычисляется как максимум по всем |
performed_mandatory_shipment_count | Количество выполненных обязательных отгрузок. Экспериментальный: Поведение или существование данной области может измениться в будущем. |
performed_shipment_penalty_cost_sum | Сумма значений Экспериментальный: Поведение или существование данной области может измениться в будущем. |
BatchOptimizeToursMetadata
Этот тип не содержит полей.
Метаданные операции для вызовов BatchOptimizeToursRequest .
BatchOptimizeToursRequest
Запрос на пакетную оптимизацию туров в асинхронном режиме. Каждый входной файл должен содержать один OptimizeToursRequest , а каждый выходной файл — один объект OptimizeToursResponse . Запрос содержит информацию для чтения/записи и анализа файлов. Все входные и выходные файлы должны находиться в одном проекте.
| Поля | |
|---|---|
parent | Обязательно. Целевой проект и местоположение для звонка. Формат:
Если местоположение не указано, регион будет выбран автоматически. |
model_configs[] | Обязательно. Информация о входных/выходных данных для каждой модели покупки, такая как пути к файлам и форматы данных. |
AsyncModelConfig
Информация для асинхронного решения одной оптимизационной модели.
| Поля | |
|---|---|
display_name | Необязательно. Задается пользователем имя модели, которое может использоваться в качестве псевдонима для отслеживания моделей. |
input_config | Обязательно. Информация о входной модели. |
output_config | Обязательно. Информация о желаемом месте вывода. |
BatchOptimizeToursResponse
Этот тип не содержит полей.
Ответ на запрос BatchOptimizeToursRequest . Он возвращается в рамках длительной операции после ее завершения.
BreakRule
Правила организации перерывов для транспортного средства (например, обеденных перерывов). Перерыв — это непрерывный период времени, в течение которого транспортное средство простаивает на своем текущем месте и не может совершать никаких поездок. Перерыв может произойти:
- во время поездки между двумя визитами (включая время непосредственно до или сразу после визита, но не в середине визита), в этом случае оно увеличивает соответствующее время в пути между визитами.
- или до запуска двигателя (двигатель не может запускаться во время перерыва), в этом случае это не влияет на время запуска двигателя.
- или после окончания эксплуатации транспортного средства (аналогично, с указанием времени окончания эксплуатации транспортного средства).
| Поля | |
|---|---|
break_requests[] | Последовательность прерываний. См. сообщение |
frequency_constraints[] | Может применяться несколько |
BreakRequest
Последовательность перерывов (т.е. их количество и порядок), применяемых к каждому транспортному средству, должна быть известна заранее. Повторяющиеся BreakRequest определяют эту последовательность в том порядке, в котором они должны происходить. Их временные окна ( earliest_start_time / latest_start_time ) могут перекрываться, но они должны быть совместимы с порядком (это проверяется).
| Поля | |
|---|---|
earliest_start_time | Обязательно. Нижняя граница (включительно) на начало перерыва. |
latest_start_time | Обязательно. Верхняя граница (включительно) на начало перерыва. |
min_duration | Обязательно. Минимальная продолжительность перерыва. Должен быть положительным. |
Ограничение частоты
Можно дополнительно ограничить частоту и продолжительность указанных выше перерывов, установив минимальную частоту перерывов, например: «Перерыв должен длиться не менее 1 часа каждые 12 часов». Предполагая, что это можно интерпретировать как «В любом скользящем временном окне в 12 часов должен быть хотя бы один перерыв длительностью не менее одного часа», этот пример будет преобразован в следующее FrequencyConstraint :
{
min_break_duration { seconds: 3600 } # 1 hour.
max_inter_break_duration { seconds: 39600 } # 11 hours (12 - 1 = 11).
}
Время и продолжительность перерывов в решении будут соответствовать всем таким ограничениям, а также временным окнам и минимальной продолжительности, уже указанным в запросе BreakRequest .
FrequencyConstraint может на практике применяться к несмежным перерывам. Например, следующее расписание учитывает пример «1 час каждые 12 часов»:
04:00 vehicle start
.. performing travel and visits ..
09:00 1 hour break
10:00 end of the break
.. performing travel and visits ..
12:00 20-min lunch break
12:20 end of the break
.. performing travel and visits ..
21:00 1 hour break
22:00 end of the break
.. performing travel and visits ..
23:59 vehicle end
| Поля | |
|---|---|
min_break_duration | Обязательно. Минимальная продолжительность перерыва для этого ограничения. Неотрицательное значение. См. описание параметра |
max_inter_break_duration | Обязательно. Максимально допустимый интервал времени на маршруте, не включающий хотя бы частично перерыв |
Формат данных
Форматы данных для входных и выходных файлов.
| Перечисления | |
|---|---|
DATA_FORMAT_UNSPECIFIED | Недопустимое значение, формат не должен быть UNSpecIFIED. |
JSON | Объектная нотация JavaScript. |
PROTO_TEXT | Формат текста в Protocol Buffers. См. https://protobuf.dev/reference/protobuf/textformat-spec/ |
Ограничение по расстоянию
Ограничение, определяющее максимальное расстояние, которое можно преодолеть. Оно может быть жестким или мягким.
Если задано мягкое ограничение, то значения soft_max_meters и cost_per_kilometer_above_soft_max должны быть заданы и неотрицательны.
| Поля | |
|---|---|
max_meters | Жесткое ограничение, устанавливающее расстояние не более max_meters. Предел должен быть неотрицательным. |
soft_max_meters | Мягкое ограничение не устанавливает максимальный предел расстояния, но при его нарушении возникают затраты, которые суммируются с другими затратами, определенными в модели, при той же единице измерения. Если параметр soft_max_meters задан, он должен быть меньше max_meters и неотрицательным. |
cost_per_kilometer_below_soft_max | Стоимость за километр, увеличивающаяся до значения Данная стоимость не поддерживается в |
cost_per_kilometer_above_soft_max | Стоимость за километр взимается, если расстояние превышает лимит Стоимость должна быть неотрицательной. |
GcsDestination
Местоположение в Google Cloud Storage, куда будут записаны выходные файлы.
| Поля | |
|---|---|
uri | Обязательно. URI Google Cloud Storage. |
GcsSource
Местоположение в Google Cloud Storage, откуда будет считываться входной файл.
| Поля | |
|---|---|
uri | Обязательно. URI объекта Google Cloud Storage в формате |
Ограничение на вводимый раствор
В запросе содержится информация о том, какие посещения необходимо ограничить и каким образом.
| Поля | |
|---|---|
routes[] | Маршруты вводимого решения. Некоторые маршруты могут быть опущены из исходного решения. Маршруты и пропущенные поставки должны удовлетворять основным предположениям о допустимости, указанным для |
skipped_shipments[] | Пропущенные поставки раствора для инъекций. Некоторые из них могут отсутствовать в исходном растворе. См. поле |
constraint_relaxations[] | Для нуля или более групп транспортных средств указывается, когда и насколько следует ослабить ограничения. Если это поле пустое, все непустые маршруты транспортных средств полностью ограничены. |
Релаксация ограничений
Для группы транспортных средств указывается, при достижении какого порогового значения (или значений) ограничения на посещения будут ослаблены и до какого уровня. Отправления, указанные в поле skipped_shipment могут быть пропущены, то есть их выполнение невозможно.
| Поля | |
|---|---|
relaxations[] | Все послабления ограничений на посещения, которые будут применяться к посещениям маршрутов с транспортными средствами, указанными в |
vehicle_indices[] | Указывает индексы транспортных средств, к которым применяются Индекс транспортного средства сопоставляется так же, как |
Релаксация
Если relaxations пуст, время начала и последовательность всех посещений на routes полностью ограничены, и новые посещения не могут быть добавлены к этим маршрутам. Кроме того, время начала и окончания движения транспортного средства на routes полностью ограничено, за исключением случаев, когда транспортное средство пустое (т.е. не имеет посещений и параметр used_if_route_is_empty установлен в значение false в модели).
relaxations(i).level задает уровень ослабления ограничений, применяемый к посещению #j, удовлетворяющему условию:
-
route.visits(j).start_time >= relaxations(i).threshold_timeAND -
j + 1 >= relaxations(i).threshold_visit_count
Аналогично, запуск транспортного средства переходит в режим relaxations(i).level если выполняется следующее условие:
-
vehicle_start_time >= relaxations(i).threshold_timeAND -
relaxations(i).threshold_visit_count == 0, и уровень доступа к транспортному средству снижается доrelaxations(i).levelесли выполняется следующее условие: -
vehicle_end_time >= relaxations(i).threshold_timeAND -
route.visits_size() + 1 >= relaxations(i).threshold_visit_count
Чтобы применить уровень ослабления ограничений, если посещение соответствует пороговому threshold_visit_count ИЛИ threshold_time добавьте два relaxations с одинаковым level : одно только с заданным значением threshold_visit_count , а другое только с заданным значением threshold_time . Если посещение удовлетворяет условиям нескольких relaxations , применяется наиболее ослабленный уровень. В результате, от начала маршрута до его конца уровень ослабления становится более низким: то есть уровень ослабления не уменьшается по мере продвижения по маршруту.
Время и последовательность посещений маршрута, не удовлетворяющих пороговым условиям каких-либо relaxations , полностью ограничены, и в эти последовательности нельзя вставлять посещения. Кроме того, если начало или конец маршрута транспортного средства не удовлетворяет условиям какого-либо послабления, время фиксируется, за исключением случаев, когда транспортное средство пустое.
| Поля | |
|---|---|
level | Уровень ослабления ограничений, применяемый при выполнении условий, действующих в момент |
threshold_time | Время, после которого может быть применен |
threshold_visit_count | Количество посещений, после которых может быть применен Если значение равно |
Уровень
Выражает различные уровни ослабления ограничений, которые применяются для посещения и последующих посещений, когда выполняются пороговые условия.
Приведенный ниже список составлен в порядке возрастания степени расслабления.
| Перечисления | |
|---|---|
LEVEL_UNSPECIFIED | Неявный уровень ослабления ограничений по умолчанию: никакие ограничения не ослабляются, то есть все посещения полностью ограничены. Это значение не должно явно использоваться в |
RELAX_VISIT_TIMES_AFTER_THRESHOLD | Время начала и окончания посещений, а также время начала и окончания движения транспортных средств будут смягчены, но каждое посещение по-прежнему будет привязано к одному и тому же транспортному средству, и необходимо соблюдать последовательность посещений: между ними или перед ними нельзя вставлять новые посещения. |
RELAX_VISIT_TIMES_AND_SEQUENCE_AFTER_THRESHOLD | Аналогично параметру RELAX_VISIT_TIMES_AFTER_THRESHOLD , но последовательность посещений также смягчена: посещения могут быть совершены только этим транспортным средством, но потенциально могут быть отменены. |
RELAX_ALL_AFTER_THRESHOLD | Аналогично RELAX_VISIT_TIMES_AND_SEQUENCE_AFTER_THRESHOLD , но механизм также является более гибким: посещения полностью бесплатны в момент достижения порогового значения или после него и потенциально могут быть отменены. |
InputConfig
Укажите входные данные для [BatchOptimizeTours][google.maps.routeoptimization.v1.RouteOptimizationService.BatchOptimizeTours].
| Поля | |
|---|---|
data_format | Обязательно. Формат входных данных. |
Поле объединения source . Обязательно. source может быть только один из следующих вариантов: | |
gcs_source | Местоположение в Google Cloud Storage. Это должен быть один объект (файл). |
Расположение
Указывает местоположение (географическую точку и необязательный заголовок).
| Поля | |
|---|---|
lat_lng | Географические координаты контрольной точки. |
heading | Направление по компасу, связанное с направлением движения транспорта. Это значение используется для указания стороны дороги, используемой для посадки и высадки пассажиров. Значения направления могут быть от 0 до 360, где 0 означает направление строго на север, 90 — направление строго на восток и т. д. |
OptimizeToursLongRunningMetadata
Этот тип не содержит полей.
Метаданные операций для вызовов OptimizeToursLongRunning .
OptimizeToursRequest
Запрос на предоставление решателя задач оптимизации маршрута, который определяет модель доставки, а также параметры оптимизации.
| Поля | |
|---|---|
parent | Обязательно. Целевой проект или местоположение для совершения звонка. Формат:
Если местоположение не указано, регион будет выбран автоматически. |
timeout | Если этот тайм-аут установлен, сервер возвращает ответ до истечения периода ожидания или до достижения крайнего срока сервера для синхронных запросов, в зависимости от того, что наступит раньше. Для асинхронных запросов сервер сгенерирует решение (если это возможно) до истечения времени ожидания. |
model | Модель доставки, которую необходимо решить. |
solving_mode | По умолчанию режим решения — |
search_mode | Для решения запроса использовался режим поиска. |
injected_first_solution_routes[] | Направьте алгоритм оптимизации на поиск первого решения, аналогичного предыдущему решению. Модель ограничена на момент построения первого решения. Любые отгрузки, не выполненные по маршруту, неявно пропускаются в первом решении, но могут быть выполнены в последующих решениях. Решение должно удовлетворять ряду основных предположений о его достоверности:
Если предложенное решение нецелесообразно, ошибка проверки не обязательно будет возвращена, вместо этого может быть возвращена ошибка, указывающая на нецелесообразность. |
injected_solution_constraint | Ограничьте алгоритм оптимизации, чтобы найти окончательное решение, аналогичное предыдущему. Например, это может использоваться для замораживания участков маршрутов, которые уже завершены или которые должны быть завершены, но не должны быть изменены. Если предложенное решение нецелесообразно, ошибка проверки не обязательно будет возвращена, вместо этого может быть возвращена ошибка, указывающая на нецелесообразность. |
refresh_details_routes[] | Если поле не пустое, указанные маршруты будут обновлены без изменения последовательности посещений или времени в пути: будут обновлены только другие детали. Это не решает задачу модели. Начиная с ноября 2020 года, эта функция заполняет полилинии только непустых маршрутов и требует, чтобы Поля Это поле нельзя использовать вместе с |
interpret_injected_solutions_using_labels | Если это правда:
Данная интерпретация применяется к полям Если это так, то метки в следующих категориях должны встречаться в своей категории не более одного раза:
Если метка Удаление отдельных посещений маршрутов или целых маршрутов из внедренного решения может повлиять на подразумеваемые ограничения, что может привести к изменению решения, ошибкам проверки или невозможности его реализации. ПРИМЕЧАНИЕ: Вызывающая сторона должна убедиться, что каждый |
consider_road_traffic | Учитывайте оценку трафика при вычислении полей |
populate_polylines | Если это так, полилинии будут заполнены в ответ на запрос |
populate_transition_polylines | Если значение истинно, полилинии и токены маршрута будут заполнены в ответе |
allow_large_deadline_despite_interruption_risk | Если этот параметр установлен, то запрос может иметь крайний срок (см. https://grpc.io/blog/deadlines ) до 60 минут. В противном случае максимальный срок составляет всего 30 минут. Обратите внимание, что длительные запросы сопряжены со значительно большим (но все еще небольшим) риском прерывания. |
use_geodesic_distances | Если это так, то расстояния в пути будут вычисляться с использованием геодезических расстояний вместо расстояний Google Maps, а время в пути будет вычисляться с использованием геодезических расстояний со скоростью, определяемой параметром |
label | Метка, которая может использоваться для идентификации этого запроса, сообщается в объекте |
geodesic_meters_per_second | Если значение |
max_validation_errors | Усекает количество возвращаемых ошибок валидации. Эти ошибки обычно добавляются к полезной нагрузке ошибки INVALID_ARGUMENT в качестве подробной информации об ошибке BadRequest ( https://cloud.google.com/apis/design/errors#error_details) , если только solving_mode=VALIDATE_ONLY: см. поле |
SearchMode
Режим определяет поведение поиска, устанавливая компромисс между задержкой и качеством решения. Во всех режимах соблюдается глобальный крайний срок выполнения запроса.
| Перечисления | |
|---|---|
SEARCH_MODE_UNSPECIFIED | Неуказанный режим поиска, эквивалентный RETURN_FAST . |
RETURN_FAST | Прекратите поиск, найдя первое подходящее решение. |
CONSUME_ALL_AVAILABLE_TIME | Уделите все доступное время поиску лучших решений. |
Режим решения
Определяет, как решатель должен обрабатывать запрос. Во всех режимах, кроме VALIDATE_ONLY , если запрос недействителен, вы получите ошибку INVALID_REQUEST . См. max_validation_errors , чтобы ограничить количество возвращаемых ошибок.
| Перечисления | |
|---|---|
DEFAULT_SOLVE | Решите модель. Могут появиться предупреждения в [OptimizeToursResponse.validation_errors][google.cloud.optimization.v1.OptimizeToursResponse.validation_errors]. |
VALIDATE_ONLY | Проверяет модель, не решая её: заполняет максимально возможное количество полей OptimizeToursResponse.validation_errors . |
DETECT_SOME_INFEASIBLE_SHIPMENTS | Заполняет только поля ВАЖНО : сюда возвращаются не все невыполнимые заказы, а только те, которые были определены как невыполнимые в процессе предварительной обработки. |
TRANSFORM_AND_RETURN_REQUEST | Этот режим работает только в том случае, если Экспериментальная функция: подробности см. на странице https://developers.google.com/maps/tt/route-optimization/experimental/objectives/make-request . |
OptimizeToursResponse
Результат решения задачи оптимизации маршрута, включающий маршруты, пройденные каждым транспортным средством, пропущенные отправления и общую стоимость решения.
| Поля | |
|---|---|
routes[] | Маршруты рассчитаны для каждого транспортного средства; i-й маршрут соответствует i-му транспортному средству в модели. |
request_label | Копия файла |
skipped_shipments[] | Список всех пропущенных отправок. |
validation_errors[] | Список всех ошибок валидации, которые нам удалось обнаружить независимо. См. пояснение к сообщению |
processed_request | В некоторых случаях мы изменяем входящий запрос перед его обработкой, например, добавляем затраты. Если solving_mode == TRANSFORM_AND_RETURN_REQUEST, измененный запрос возвращается здесь. Экспериментальная функция: подробности см. на странице https://developers.google.com/maps/tt/route-optimization/experimental/objectives/make-request . |
metrics | Показатели продолжительности, расстояния и использования данного решения. |
Метрики
Общие показатели, агрегированные по всем маршрутам.
| Поля | |
|---|---|
aggregated_route_metrics | Показатели агрегируются по маршрутам. Каждый показатель представляет собой сумму (или максимум для грузов) по всем полям |
skipped_mandatory_shipment_count | Количество пропущенных обязательных поставок. |
used_vehicle_count | Количество использованных транспортных средств. Примечание: если маршрут транспортного средства пуст и |
earliest_vehicle_start_time | Самое раннее время начала движения подержанного автомобиля, вычисленное как минимальное значение по всем подержанным автомобилям, заданное параметром |
latest_vehicle_end_time | Самое позднее время окончания доставки подержанного автомобиля, вычисленное как максимальное значение по всем подержанным автомобилям из набора |
costs | Стоимость решения, разбитая по полям запроса, связанным со стоимостью. Ключами являются пути прототипов относительно входного параметра OptimizeToursRequest, например, "model.shipments.pickups.cost", а значениями — общая стоимость, сгенерированная соответствующим полем стоимости, агрегированная по всему решению. Другими словами, costs["model.shipments.pickups.cost"] — это сумма всех затрат на погрузку и разгрузку по всему решению. Все затраты, определенные в модели, подробно указаны здесь, за исключением затрат, связанных с TransitionAttributes, которые по состоянию на январь 2022 года отображаются только в агрегированном виде. |
total_cost | Общая стоимость решения. Сумма всех значений на карте затрат. |
OptimizeToursUriMetadata
Этот тип не содержит полей.
Метаданные операции для вызовов OptimizeToursUri .
OptimizeToursUriRequest
Запрос, используемый методом OptimizeToursUri .
| Поля | |
|---|---|
parent | Обязательно. Целевой проект или местоположение для совершения звонка. Формат:
Если местоположение не указано, регион будет выбран автоматически. |
input | Обязательно. URI объекта Cloud Storage, содержащего |
output | Обязательно. URI объекта Cloud Storage, который будет содержать |
OptimizeToursUriResponse
Ответ, возвращаемый методом OptimizeToursUri .
| Поля | |
|---|---|
output | Необязательно. URI объекта Cloud Storage, содержащего |
OptimizeToursValidationError
Описывает ошибку или предупреждение, возникшее при проверке запроса OptimizeToursRequest .
| Поля | |
|---|---|
code | Ошибка валидации определяется парой ( Поля, следующие за этим разделом, содержат более подробную информацию об ошибке. МНОЖЕСТВЕННЫЕ ОШИБКИ : При наличии нескольких ошибок процесс проверки пытается вывести несколько из них. Как и компилятор, это несовершенный процесс. Некоторые ошибки проверки могут быть «фатальными», то есть они останавливают весь процесс проверки. Это относится, в частности, к ошибкам СТАБИЛЬНОСТЬ : |
display_name | Название ошибки, отображаемое на экране. |
fields[] | Контекст ошибки может включать 0, 1 (в большинстве случаев) или более полей. Например, ссылка на транспортное средство №4 и первую погрузку груза №2 может быть сделана следующим образом: Однако следует отметить, что количество |
error_message | Human-readable string describing the error. There is a 1:1 mapping between STABILITY : Not stable: the error message associated to a given |
offending_values | May contain the value(s) of the field(s). This is not always available. You should absolutely not rely on it and use it only for manual model debugging. |
FieldReference
Specifies a context for the validation error. A FieldReference always refers to a given field in this file and follows the same hierarchical structure. For example, we may specify element #2 of start_time_windows of vehicle #5 using:
name: "vehicles" index: 5 sub_field { name: "end_time_windows" index: 2 }
We however omit top-level entities such as OptimizeToursRequest or ShipmentModel to avoid crowding the message.
| Поля | |
|---|---|
name | Name of the field, eg, "vehicles". |
sub_field | Recursively nested sub-field, if needed. |
Union field | |
index | Index of the field if repeated. |
key | Key if the field is a map. |
OutputConfig
Specify a destination for [BatchOptimizeTours][google.maps.routeoptimization.v1.RouteOptimizationService.BatchOptimizeTours] results.
| Поля | |
|---|---|
data_format | Required. The output data format. |
Union field destination . Required. destination can be only one of the following: | |
gcs_destination | The Google Cloud Storage location to write the output to. |
RouteModifiers
Encapsulates a set of optional conditions to satisfy when calculating vehicle routes. This is similar to RouteModifiers in the Google Maps Platform Routes Preferred API; see: https://developers.google.com/maps/documentation/routes/reference/rest/v2/RouteModifiers .
| Поля | |
|---|---|
avoid_tolls | Specifies whether to avoid toll roads where reasonable. Preference will be given to routes not containing toll roads. Applies only to motorized travel modes. |
avoid_highways | Specifies whether to avoid highways where reasonable. Preference will be given to routes not containing highways. Applies only to motorized travel modes. |
avoid_ferries | Specifies whether to avoid ferries where reasonable. Preference will be given to routes not containing travel by ferries. Applies only to motorized travel modes. |
avoid_indoor | Optional. Specifies whether to avoid navigating indoors where reasonable. Preference will be given to routes not containing indoor navigation. Applies only to the |
Отправка
The shipment of a single item, from one of its pickups to one of its deliveries. For the shipment to be considered as performed, a unique vehicle must visit one of its pickup locations (and decrease its spare capacities accordingly), then visit one of its delivery locations later on (and therefore re-increase its spare capacities accordingly).
| Поля | |
|---|---|
display_name | The user-defined display name of the shipment. It can be up to 63 characters long and may use UTF-8 characters. |
pickups[] | Set of pickup alternatives associated to the shipment. If not specified, the vehicle only needs to visit a location corresponding to the deliveries. |
deliveries[] | Set of delivery alternatives associated to the shipment. If not specified, the vehicle only needs to visit a location corresponding to the pickups. |
load_demands | Load demands of the shipment (for example weight, volume, number of pallets etc). The keys in the map should be identifiers describing the type of the corresponding load, ideally also including the units. For example: "weight_kg", "volume_gallons", "pallet_count", etc. If a given key does not appear in the map, the corresponding load is considered as null. |
allowed_vehicle_indices[] | The set of vehicles that may perform this shipment. If empty, all vehicles may perform it. Vehicles are given by their index in the |
costs_per_vehicle[] | Specifies the cost that is incurred when this shipment is delivered by each vehicle. If specified, it must have EITHER:
These costs must be in the same unit as |
costs_per_vehicle_indices[] | Indices of the vehicles to which |
pickup_to_delivery_absolute_detour_limit | Specifies the maximum absolute detour time compared to the shortest path from pickup to delivery. If specified, it must be nonnegative, and the shipment must contain at least a pickup and a delivery. For example, let t be the shortest time taken to go from the selected pickup alternative directly to the selected delivery alternative. Then setting If both relative and absolute limits are specified on the same shipment, the more constraining limit is used for each possible pickup/delivery pair. As of 2017/10, detours are only supported when travel durations do not depend on vehicles. |
pickup_to_delivery_time_limit | Specifies the maximum duration from start of pickup to start of delivery of a shipment. If specified, it must be nonnegative, and the shipment must contain at least a pickup and a delivery. This does not depend on which alternatives are selected for pickup and delivery, nor on vehicle speed. This can be specified alongside maximum detour constraints: the solution will respect both specifications. |
shipment_type | Non-empty string specifying a "type" for this shipment. This feature can be used to define incompatibilities or requirements between Differs from |
label | Specifies a label for this shipment. This label is reported in the response in the |
ignore | If true, skip this shipment, but don't apply a Ignoring a shipment results in a validation error when there are any Ignoring a shipment that is performed in |
penalty_cost | If the shipment is not completed, this penalty is added to the overall cost of the routes. A shipment is considered completed if one of its pickup and delivery alternatives is visited. The cost may be expressed in the same unit used for all other cost-related fields in the model and must be positive. IMPORTANT : If this penalty is not specified, it is considered infinite, ie the shipment must be completed. |
pickup_to_delivery_relative_detour_limit | Specifies the maximum relative detour time compared to the shortest path from pickup to delivery. If specified, it must be nonnegative, and the shipment must contain at least a pickup and a delivery. For example, let t be the shortest time taken to go from the selected pickup alternative directly to the selected delivery alternative. Then setting If both relative and absolute limits are specified on the same shipment, the more constraining limit is used for each possible pickup/delivery pair. As of 2017/10, detours are only supported when travel durations do not depend on vehicles. |
Нагрузка
When performing a visit, a predefined amount may be added to the vehicle load if it's a pickup, or subtracted if it's a delivery. This message defines such amount. See load_demands .
| Поля | |
|---|---|
amount | The amount by which the load of the vehicle performing the corresponding visit will vary. Since it is an integer, users are advised to choose an appropriate unit to avoid loss of precision. Must be ≥ 0. |
VisitRequest
Request for a visit which can be done by a vehicle: it has a geo-location (or two, see below), opening and closing times represented by time windows, and a service duration time (time spent by the vehicle once it has arrived to pickup or drop off goods).
| Поля | |
|---|---|
arrival_location | The geo-location where the vehicle arrives when performing this |
arrival_waypoint | The waypoint where the vehicle arrives when performing this |
departure_location | The geo-location where the vehicle departs after completing this |
departure_waypoint | The waypoint where the vehicle departs after completing this |
tags[] | Specifies tags attached to the visit request. Empty or duplicate strings are not allowed. |
time_windows[] | Time windows which constrain the arrival time at a visit. Note that a vehicle may depart outside of the arrival time window, ie arrival time + duration do not need to be inside a time window. This can result in waiting time if the vehicle arrives before The absence of Time windows must be disjoint, ie no time window must overlap with or be adjacent to another, and they must be in increasing order. |
duration | Duration of the visit, ie time spent by the vehicle between arrival and departure (to be added to the possible waiting time; see |
cost | Cost to service this visit request on a vehicle route. This can be used to pay different costs for each alternative pickup or delivery of a shipment. This cost must be in the same unit as |
load_demands | Load demands of this visit request. This is just like |
visit_types[] | Specifies the types of the visit. This may be used to allocate additional time required for a vehicle to complete this visit (see A type can only appear once. |
label | Specifies a label for this |
avoid_u_turns | Specifies whether U-turns should be avoided in driving routes at this location. U-turn avoidance is best effort and complete avoidance is not guaranteed. This is an experimental feature and behavior is subject to change. Experimental: See https://developers.google.com/maps/tt/route-optimization/experimental/u-turn-avoidance/make-request for more details. |
ShipmentModel
A shipment model contains a set of shipments which must be performed by a set of vehicles, while minimizing the overall cost, which is the sum of:
- the cost of routing the vehicles (sum of cost per total time, cost per travel time, and fixed cost over all vehicles).
- the unperformed shipment penalties.
- the cost of the global duration of the shipments
| Поля | |
|---|---|
shipments[] | Set of shipments which must be performed in the model. |
vehicles[] | Set of vehicles which can be used to perform visits. |
objectives[] | The set of objectives for this model, that we will transform into costs. If not empty, the input model has to be costless. To obtain the modified request, please use Experimental: See https://developers.google.com/maps/tt/route-optimization/experimental/objectives/make-request for more details. |
global_start_time | Global start and end time of the model: no times outside of this range can be considered valid. The model's time span must be less than a year, ie the When using |
global_end_time | If unset, 00:00:00 UTC, January 1, 1971 (ie seconds: 31536000, nanos: 0) is used as default. |
global_duration_cost_per_hour | The "global duration" of the overall plan is the difference between the earliest effective start time and the latest effective end time of all vehicles. Users can assign a cost per hour to that quantity to try and optimize for earliest job completion, for example. This cost must be in the same unit as |
duration_distance_matrices[] | Specifies duration and distance matrices used in the model. If this field is empty, Google Maps or geodesic distances will be used instead, depending on the value of the Примеры использования:
|
duration_distance_matrix_src_tags[] | Tags defining the sources of the duration and distance matrices; Tags correspond to |
duration_distance_matrix_dst_tags[] | Tags defining the destinations of the duration and distance matrices; Tags correspond to |
transition_attributes[] | Transition attributes added to the model. |
shipment_type_incompatibilities[] | Sets of incompatible shipment_types (see |
shipment_type_requirements[] | Sets of |
precedence_rules[] | Set of precedence rules which must be enforced in the model. IMPORTANT : Use of precedence rules limits the size of problem that can be optimized. Requests using precedence rules that include many shipments may be rejected. |
max_active_vehicles | Constrains the maximum number of active vehicles. A vehicle is active if its route performs at least one shipment. This can be used to limit the number of routes in the case where there are fewer drivers than vehicles and that the fleet of vehicles is heterogeneous. The optimization will then select the best subset of vehicles to use. Must be strictly positive. |
DurationDistanceMatrix
Specifies a duration and distance matrix from visit and vehicle start locations to visit and vehicle end locations.
| Поля | |
|---|---|
rows[] | Specifies the rows of the duration and distance matrix. It must have as many elements as |
vehicle_start_tag | Tag defining to which vehicles this duration and distance matrix applies. If empty, this applies to all vehicles, and there can only be a single matrix. Each vehicle start must match exactly one matrix, ie exactly one of their All matrices must have a different |
Ряд
Specifies a row of the duration and distance matrix.
| Поля | |
|---|---|
durations[] | Duration values for a given row. It must have as many elements as |
meters[] | Distance values for a given row. If no costs or constraints refer to distances in the model, this can be left empty; otherwise it must have as many elements as |
Цель
Objectives replace the cost model completely, and are therefore incompatible with pre-existing costs. Each objective maps to a number of pre-defined costs for, eg, vehicles, shipments or transition attributes.
Experimental: See https://developers.google.com/maps/tt/route-optimization/experimental/objectives/make-request for more details.
| Поля | |
|---|---|
type | The type of the objective. |
weight | How much this objective should count relatively to the others. This can be any non-negative number, weights do not have to sum to 1. Weights default to 1.0. |
Тип
The objective type that will be mapped to a set of costs.
| Перечисления | |
|---|---|
DEFAULT | A default set of costs will be used, to ensure a reasonable solution. Note: this objective can be used on its own, but will also always be added with weight 1.0, as a baseline, to the objectives specified by the user, if it's not already present. |
MIN_DISTANCE | "MIN" objectives. Minimize the total distance traveled. |
MIN_WORKING_TIME | Minimize the total working time, summed over all vehicles. |
MIN_TRAVEL_TIME | Same as above but focusing on travel time only. |
MIN_NUM_VEHICLES | Minimize the number of vehicles used. |
PrecedenceRule
A precedence rule between two events (each event is the pickup or the delivery of a shipment): the "second" event has to start at least offset_duration after "first" has started.
Several precedences can refer to the same (or related) events, eg, "pickup of B happens after delivery of A" and "pickup of C happens after pickup of B".
Furthermore, precedences only apply when both shipments are performed and are otherwise ignored.
| Поля | |
|---|---|
first_is_delivery | Indicates if the "first" event is a delivery. |
second_is_delivery | Indicates if the "second" event is a delivery. |
offset_duration | The offset between the "first" and "second" event. It can be negative. |
first_index | Shipment index of the "first" event. This field must be specified. |
second_index | Shipment index of the "second" event. This field must be specified. |
ShipmentRoute
A vehicle's route can be decomposed, along the time axis, like this (we assume there are n visits):
| | | | | T[2], | | |
| Transition | Visit #0 | | | V[2], | | |
| #0 | aka | T[1] | V[1] | ... | V[n-1] | T[n] |
| aka T[0] | V[0] | | | V[n-2],| | |
| | | | | T[n-1] | | |
^ ^ ^ ^ ^ ^ ^ ^
vehicle V[0].start V[0].end V[1]. V[1]. V[n]. V[n]. vehicle
start (arrival) (departure) start end start end end
Note that we make a difference between:
- "punctual events", such as the vehicle start and end and each visit's start and end (aka arrival and departure). They happen at a given second.
- "time intervals", such as the visits themselves, and the transition between visits. Though time intervals can sometimes have zero duration, ie start and end at the same second, they often have a positive duration.
Invariants:
- If there are n visits, there are n+1 transitions.
- A visit is always surrounded by a transition before it (same index) and a transition after it (index + 1).
- The vehicle start is always followed by transition #0.
- The vehicle end is always preceded by transition #n.
Zooming in, here is what happens during a Transition and a Visit :
---+-------------------------------------+-----------------------------+-->
| TRANSITION[i] | VISIT[i] |
| | |
| * TRAVEL: the vehicle moves from | PERFORM the visit: |
| VISIT[i-1].departure_location to | |
| VISIT[i].arrival_location, which | * Spend some time: |
| takes a given travel duration | the "visit duration". |
| and distance | |
| | * Load or unload |
| * BREAKS: the driver may have | some quantities from the |
| breaks (e.g. lunch break). | vehicle: the "demand". |
| | |
| * WAIT: the driver/vehicle does | |
| nothing. This can happen for | |
| many reasons, for example when | |
| the vehicle reaches the next | |
| event's destination before the | |
| start of its time window | |
| | |
| * DELAY: *right before* the next | |
| arrival. E.g. the vehicle and/or | |
| driver spends time unloading. | |
| | |
---+-------------------------------------+-----------------------------+-->
^ ^ ^
V[i-1].end V[i].start V[i].end
Lastly, here is how the TRAVEL, BREAKS, DELAY and WAIT can be arranged during a transition.
- Они не пересекаются.
- The DELAY is unique and must be a contiguous period of time right before the next visit (or vehicle end). Thus, it suffice to know the delay duration to know its start and end time.
- The BREAKS are contiguous, non-overlapping periods of time. The response specifies the start time and duration of each break.
- TRAVEL and WAIT are "preemptable": they can be interrupted several times during this transition. Clients can assume that travel happens "as soon as possible" and that "wait" fills the remaining time.
A (complex) example:
TRANSITION[i]
--++-----+-----------------------------------------------------------++-->
|| | | | | | | ||
|| T | B | T | | B | | D ||
|| r | r | r | W | r | W | e ||
|| a | e | a | a | e | a | l ||
|| v | a | v | i | a | i | a ||
|| e | k | e | t | k | t | y ||
|| l | | l | | | | ||
|| | | | | | | ||
--++-----------------------------------------------------------------++-->
| Поля | |
|---|---|
vehicle_index | Vehicle performing the route, identified by its index in the source |
vehicle_label | Label of the vehicle performing this route, equal to |
vehicle_start_time | Time at which the vehicle starts its route. |
vehicle_end_time | Time at which the vehicle finishes its route. |
visits[] | Ordered sequence of visits representing a route. visits[i] is the i-th visit in the route. If this field is empty, the vehicle is considered as unused. |
transitions[] | Ordered list of transitions for the route. |
has_traffic_infeasibilities | When Arrival at next_visit will likely happen later than its current time window due the increased estimate of travel time |
route_polyline | The encoded polyline representation of the route. This field is only populated if |
breaks[] | Breaks scheduled for the vehicle performing this route. The |
metrics | Duration, distance and load metrics for this route. The fields of |
vehicle_fullness | Experimental: This field's behavior or existence may change in future. |
route_costs | Cost of the route, broken down by cost-related request fields. The keys are proto paths, relative to the input OptimizeToursRequest, eg "model.shipments.pickups.cost", and the values are the total cost generated by the corresponding cost field, aggregated over the whole route. In other words, costs["model.shipments.pickups.cost"] is the sum of all pickup costs over the route. All costs defined in the model are reported in detail here with the exception of costs related to TransitionAttributes that are only reported in an aggregated way as of 2022/01. |
route_total_cost | Total cost of the route. The sum of all costs in the cost map. |
Перерыв
Data representing the execution of a break.
| Поля | |
|---|---|
start_time | Start time of a break. |
duration | Duration of a break. |
EncodedPolyline
The encoded representation of a polyline. More information on polyline encoding can be found here: https://developers.google.com/maps/documentation/utilities/polylinealgorithm https://developers.google.com/maps/documentation/javascript/reference/geometry#encoding .
| Поля | |
|---|---|
points | String representing encoded points of the polyline. |
Переход
Transition between two events on the route. See the description of ShipmentRoute .
If the vehicle does not have a start_location and/or end_location , the corresponding travel metrics are 0.
| Поля | |
|---|---|
travel_duration | Travel duration during this transition. |
travel_distance_meters | Distance traveled during the transition. |
traffic_info_unavailable | When traffic is requested via |
delay_duration | Sum of the delay durations applied to this transition. If any, the delay starts exactly |
break_duration | Sum of the duration of the breaks occurring during this transition, if any. Details about each break's start time and duration are stored in |
wait_duration | Time spent waiting during this transition. Wait duration corresponds to idle time and does not include break time. Also note that this wait time may be split into several non-contiguous intervals. |
total_duration | Total duration of the transition, provided for convenience. It is equal to:
|
start_time | Start time of this transition. |
route_polyline | The encoded polyline representation of the route followed during the transition. This field is only populated if |
route_token | Output only. An opaque token that can be passed to Navigation SDK to reconstruct the route during navigation, and, in the event of rerouting, honor the original intention when the route was created. Treat this token as an opaque blob. Don't compare its value across requests as its value may change even if the service returns the exact same route. This field is only populated if |
vehicle_loads | Vehicle loads during this transition, for each type that either appears in this vehicle's The loads during the first transition are the starting loads of the vehicle route. Then, after each visit, the visit's |
VehicleLoad
Reports the actual load of the vehicle at some point along the route, for a given type (see Transition.vehicle_loads ).
| Поля | |
|---|---|
amount | The amount of load on the vehicle, for the given type. The unit of load is usually indicated by the type. See |
Посещать
A visit performed during a route. This visit corresponds to a pickup or a delivery of a Shipment .
| Поля | |
|---|---|
shipment_index | Index of the |
is_pickup | If true the visit corresponds to a pickup of a |
visit_request_index | Index of |
start_time | Time at which the visit starts. Note that the vehicle may arrive earlier than this at the visit location. Times are consistent with the |
load_demands | Total visit load demand as the sum of the shipment and the visit request |
detour | Extra detour time due to the shipments visited on the route before the visit and to the potential waiting time induced by time windows. If the visit is a delivery, the detour is computed from the corresponding pickup visit and is equal to: Otherwise, it is computed from the vehicle |
shipment_label | Copy of the corresponding |
visit_label | Copy of the corresponding |
injected_solution_location_token | An opaque token representing information about a visit location. This field may be populated in the result routes' visits when Experimental: See https://developers.google.com/maps/tt/route-optimization/experimental/u-turn-avoidance/make-request for more details. |
ShipmentTypeIncompatibility
Specifies incompatibilties between shipments depending on their shipment_type. The appearance of incompatible shipments on the same route is restricted based on the incompatibility mode.
| Поля | |
|---|---|
types[] | List of incompatible types. Two shipments having different |
incompatibility_mode | Mode applied to the incompatibility. |
IncompatibilityMode
Modes defining how the appearance of incompatible shipments are restricted on the same route.
| Перечисления | |
|---|---|
INCOMPATIBILITY_MODE_UNSPECIFIED | Unspecified incompatibility mode. This value should never be used. |
NOT_PERFORMED_BY_SAME_VEHICLE | In this mode, two shipments with incompatible types can never share the same vehicle. |
NOT_IN_SAME_VEHICLE_SIMULTANEOUSLY | In this mode, two shipments with incompatible types can never be on the same vehicle at the same time:
|
ShipmentTypeRequirement
Specifies requirements between shipments based on their shipment_type. The specifics of the requirement are defined by the requirement mode.
| Поля | |
|---|---|
required_shipment_type_alternatives[] | List of alternative shipment types required by the |
dependent_shipment_types[] | All shipments with a type in the NOTE: Chains of requirements such that a |
requirement_mode | Mode applied to the requirement. |
RequirementMode
Modes defining the appearance of dependent shipments on a route.
| Перечисления | |
|---|---|
REQUIREMENT_MODE_UNSPECIFIED | Unspecified requirement mode. This value should never be used. |
PERFORMED_BY_SAME_VEHICLE | In this mode, all "dependent" shipments must share the same vehicle as at least one of their "required" shipments. |
IN_SAME_VEHICLE_AT_PICKUP_TIME | With the A "dependent" shipment pickup must therefore have either:
|
IN_SAME_VEHICLE_AT_DELIVERY_TIME | Same as before, except the "dependent" shipments need to have a "required" shipment on their vehicle at the time of their delivery . |
SkippedShipment
Specifies details of unperformed shipments in a solution. For trivial cases and/or if we are able to identify the cause for skipping, we report the reason here.
| Поля | |
|---|---|
index | The index corresponds to the index of the shipment in the source |
label | Copy of the corresponding |
reasons[] | A list of reasons that explain why the shipment was skipped. See comment above |
penalty_cost | This is a copy of the Experimental: This field's behavior or existence may change in future. |
estimated_incompatible_vehicle_ratio | Estimated ratio of vehicles that cannot perform this shipment for at least one of the reasons below. Note: this is only filled when reasons involve a vehicle. Experimental: This field's behavior or existence may change in future. |
Причина
If we can explain why the shipment was skipped, reasons will be listed here. If the reason is not the same for all vehicles, reason will have more than 1 element. A skipped shipment cannot have duplicate reasons, ie where all fields are the same except for example_vehicle_index . Example:
reasons {
code: DEMAND_EXCEEDS_VEHICLE_CAPACITY
example_vehicle_index: 1
example_exceeded_capacity_type: "Apples"
}
reasons {
code: DEMAND_EXCEEDS_VEHICLE_CAPACITY
example_vehicle_index: 3
example_exceeded_capacity_type: "Pears"
}
reasons {
code: CANNOT_BE_PERFORMED_WITHIN_VEHICLE_DISTANCE_LIMIT
example_vehicle_index: 1
}
The skipped shipment is incompatible with all vehicles. The reasons may be different for all vehicles but at least one vehicle's "Apples" capacity would be exceeded (including vehicle 1), at least one vehicle's "Pears" capacity would be exceeded (including vehicle 3) and at least one vehicle's distance limit would be exceeded (including vehicle 1).
| Поля | |
|---|---|
code | Refer to the comments of Code. |
example_vehicle_indices[] | Same as Experimental: This field's behavior or existence may change in future. |
example_exceeded_capacity_type | If the reason code is |
example_vehicle_index | If the reason is related to a shipment-vehicle incompatibility, this field provides the index of one relevant vehicle. |
Код
Code identifying the reason type. The order here is meaningless. In particular, it gives no indication of whether a given reason will appear before another in the solution, if both apply.
| Перечисления | |
|---|---|
CODE_UNSPECIFIED | This should never be used. |
NO_VEHICLE | There is no vehicle in the model making all shipments infeasible. |
DEMAND_EXCEEDS_VEHICLE_CAPACITY | The demand of the shipment exceeds a vehicle's capacity for some capacity types, one of which is example_exceeded_capacity_type . |
CANNOT_BE_PERFORMED_WITHIN_VEHICLE_DISTANCE_LIMIT | The minimum distance necessary to perform this shipment, ie from the vehicle's Note that for this computation we use the geodesic distances. |
CANNOT_BE_PERFORMED_WITHIN_VEHICLE_DURATION_LIMIT | The minimum time necessary to perform this shipment, including travel time, wait time and service time exceeds the vehicle's Note: travel time is computed in the best-case scenario, namely as geodesic distance x 36 m/s (roughly 130 km/hour). |
CANNOT_BE_PERFORMED_WITHIN_VEHICLE_TRAVEL_DURATION_LIMIT | Same as above but we only compare minimum travel time and the vehicle's travel_duration_limit . |
CANNOT_BE_PERFORMED_WITHIN_VEHICLE_TIME_WINDOWS | The vehicle cannot perform this shipment in the best-case scenario (see CANNOT_BE_PERFORMED_WITHIN_VEHICLE_DURATION_LIMIT for time computation) if it starts at its earliest start time: the total time would make the vehicle end after its latest end time. |
VEHICLE_NOT_ALLOWED | The allowed_vehicle_indices field of the shipment is not empty and this vehicle does not belong to it. |
VEHICLE_IGNORED | The vehicle's Experimental: This field's behavior or existence may change in future. |
SHIPMENT_IGNORED | The shipment's Experimental: This field's behavior or existence may change in future. |
SKIPPED_IN_INJECTED_SOLUTION_CONSTRAINT | The shipment is skipped in the Experimental: This field's behavior or existence may change in future. |
VEHICLE_ROUTE_IS_FULLY_SEQUENCE_CONSTRAINED | The vehicle route relaxation specified in the Experimental: This field's behavior or existence may change in future. |
ZERO_PENALTY_COST | The shipment has a zero penalty cost. While this can be useful as an advanced modelling choice, it may also explain after the fact why a shipment was skipped. Experimental: This field's behavior or existence may change in future. |
TimeWindow
Time windows constrain the time of an event, such as the arrival time at a visit, or the start and end time of a vehicle.
Hard time window bounds, start_time and end_time , enforce the earliest and latest time of the event, such that start_time <= event_time <= end_time . The soft time window lower bound, soft_start_time , expresses a preference for the event to happen at or after soft_start_time by incurring a cost proportional to how long before soft_start_time the event occurs. The soft time window upper bound, soft_end_time , expresses a preference for the event to happen at or before soft_end_time by incurring a cost proportional to how long after soft_end_time the event occurs. start_time , end_time , soft_start_time and soft_end_time should be within the global time limits (see ShipmentModel.global_start_time and ShipmentModel.global_end_time ) and should respect:
0 <= `start_time` <= `end_time` and
0 <= `start_time` <= `soft_start_time` and
0 <= `soft_end_time` <= `end_time`.
| Поля | |
|---|---|
start_time | The hard time window start time. If unspecified it will be set to |
end_time | The hard time window end time. If unspecified it will be set to |
soft_start_time | The soft start time of the time window. |
soft_end_time | The soft end time of the time window. |
cost_per_hour_before_soft_start_time | A cost per hour added to other costs in the model if the event occurs before soft_start_time, computed as: This cost must be positive, and the field can only be set if soft_start_time has been set. |
cost_per_hour_after_soft_end_time | A cost per hour added to other costs in the model if the event occurs after This cost must be positive, and the field can only be set if |
TransitionAttributes
Specifies attributes of transitions between two consecutive visits on a route. Several TransitionAttributes may apply to the same transition: in that case, all extra costs add up and the strictest constraint or limit applies (following natural "AND" semantics).
| Поля | |
|---|---|
src_tag | Tags defining the set of (src->dst) transitions these attributes apply to. A source visit or vehicle start matches iff its |
excluded_src_tag | See |
dst_tag | A destination visit or vehicle end matches iff its |
excluded_dst_tag | See |
cost | Specifies a cost for performing this transition. This is in the same unit as all other costs in the model and must not be negative. It is applied on top of all other existing costs. |
cost_per_kilometer | Specifies a cost per kilometer applied to the distance traveled while performing this transition. It adds up to any |
distance_limit | Specifies a limit on the distance traveled while performing this transition. As of 2021/06, only soft limits are supported. |
delay | Specifies a delay incurred when performing this transition. This delay always occurs after finishing the source visit and before starting the destination visit. |
Ури
A Universal Resource Identifier that points to a resource that can be read and written by the Route Optimization API.
| Поля | |
|---|---|
uri | The URI of the resource. The resource may not yet exist. The contents of the resource are encoded as either JSON or textproto. Only Google Cloud Storage resources are supported. If the resource is encoded as JSON, the resource name must be suffixed with |
Транспортное средство
Models a vehicle in a shipment problem. Solving a shipment problem will build a route starting from start_location and ending at end_location for this vehicle. A route is a sequence of visits (see ShipmentRoute ).
| Поля | |
|---|---|
display_name | The user-defined display name of the vehicle. It can be up to 63 characters long and may use UTF-8 characters. |
travel_mode | The travel mode which affects the roads usable by the vehicle and its speed. See also |
route_modifiers | A set of conditions to satisfy that affect the way routes are calculated for the given vehicle. |
start_location | Geographic location where the vehicle starts before picking up any shipments. If not specified, the vehicle starts at its first pickup. If the shipment model has duration and distance matrices, |
start_waypoint | Waypoint representing a geographic location where the vehicle starts before picking up any shipments. If neither |
end_location | Geographic location where the vehicle ends after it has completed its last |
end_waypoint | Waypoint representing a geographic location where the vehicle ends after it has completed its last |
start_tags[] | Specifies tags attached to the start of the vehicle's route. Empty or duplicate strings are not allowed. |
end_tags[] | Specifies tags attached to the end of the vehicle's route. Empty or duplicate strings are not allowed. |
start_time_windows[] | Time windows during which the vehicle may depart its start location. They must be within the global time limits (see Time windows belonging to the same repeated field must be disjoint, ie no time window can overlap with or be adjacent to another, and they must be in chronological order. |
end_time_windows[] | Time windows during which the vehicle may arrive at its end location. They must be within the global time limits (see Time windows belonging to the same repeated field must be disjoint, ie no time window can overlap with or be adjacent to another, and they must be in chronological order. |
unloading_policy | Unloading policy enforced on the vehicle. |
load_limits | Capacities of the vehicle (weight, volume, # of pallets for example). The keys in the map are the identifiers of the type of load, consistent with the keys of the |
cost_per_hour | Vehicle costs: all costs add up and must be in the same unit as Cost per hour of the vehicle route. This cost is applied to the total time taken by the route, and includes travel time, waiting time, and visit time. Using |
cost_per_traveled_hour | Cost per traveled hour of the vehicle route. This cost is applied only to travel time taken by the route (ie, that reported in |
cost_per_kilometer | Cost per kilometer of the vehicle route. This cost is applied to the distance reported in the |
fixed_cost | Fixed cost applied if this vehicle is used to handle a shipment. |
used_if_route_is_empty | This field only applies to vehicles when their route does not serve any shipments. It indicates if the vehicle should be considered as used or not in this case. If true, the vehicle goes from its start to its end location even if it doesn't serve any shipments, and time and distance costs resulting from its start --> end travel are taken into account. Otherwise, it doesn't travel from its start to its end location, and no |
route_duration_limit | Limit applied to the total duration of the vehicle's route. In a given |
travel_duration_limit | Limit applied to the travel duration of the vehicle's route. In a given |
route_distance_limit | Limit applied to the total distance of the vehicle's route. In a given |
extra_visit_duration_for_visit_type | Specifies a map from visit_types strings to durations. The duration is time in addition to If a visit request has multiple types, a duration will be added for each type in the map. |
break_rule | Describes the break schedule to be enforced on this vehicle. If empty, no breaks will be scheduled for this vehicle. |
label | Specifies a label for this vehicle. This label is reported in the response as the |
ignore | If true, If a shipment is performed by an ignored vehicle in If a shipment is performed by an ignored vehicle in |
travel_duration_multiple | Specifies a multiplicative factor that can be used to increase or decrease travel times of this vehicle. For example, setting this to 2.0 means that this vehicle is slower and has travel times that are twice what they are for standard vehicles. This multiple does not affect visit durations. It does affect cost if WARNING: Travel times will be rounded to the nearest second after this multiple is applied but before performing any numerical operations, thus, a small multiple may result in a loss of precision. See also |
DurationLimit
A limit defining a maximum duration of the route of a vehicle. It can be either hard or soft.
When a soft limit field is defined, both the soft max threshold and its associated cost must be defined together.
| Поля | |
|---|---|
max_duration | A hard limit constraining the duration to be at most max_duration. |
soft_max_duration | A soft limit not enforcing a maximum duration limit, but when violated makes the route incur a cost. This cost adds up to other costs defined in the model, with the same unit. If defined, |
quadratic_soft_max_duration | A soft limit not enforcing a maximum duration limit, but when violated makes the route incur a cost, quadratic in the duration. This cost adds up to other costs defined in the model, with the same unit. If
|
cost_per_hour_after_soft_max | Cost per hour incurred if the The cost must be nonnegative. |
cost_per_square_hour_after_quadratic_soft_max | Cost per square hour incurred if the The additional cost is 0 if the duration is under the threshold, otherwise the cost depends on the duration as follows: The cost must be nonnegative. |
LoadLimit
Defines a load limit applying to a vehicle, eg "this truck may only carry up to 3500 kg". See load_limits .
| Поля | |
|---|---|
soft_max_load | A soft limit of the load. See |
cost_per_unit_above_soft_max | If the load ever exceeds |
start_load_interval | The acceptable load interval of the vehicle at the start of the route. |
end_load_interval | The acceptable load interval of the vehicle at the end of the route. |
max_load | The maximum acceptable amount of load. |
cost_per_kilometer | Cost of moving one unit of load over one kilometer for this vehicle. This can be used as a proxy for fuel consumption: if the load is a weight (in Newtons), then load*kilometer has the dimension of an energy. Experimental: See https://developers.google.com/maps/tt/route-optimization/experimental/load-cost/make-request for more details. |
cost_per_traveled_hour | Cost of traveling with a unit of load during one hour for this vehicle. Experimental: See https://developers.google.com/maps/tt/route-optimization/experimental/load-cost/make-request for more details. |
Интервал
Interval of acceptable load amounts.
| Поля | |
|---|---|
min | A minimum acceptable load. Must be ≥ 0. If they're both specified, |
max | A maximum acceptable load. Must be ≥ 0. If unspecified, the maximum load is unrestricted by this message. If they're both specified, |
LoadCost
Cost of moving one unit of load during a Transition . For a given load, the cost is the sum of two parts:
- min(load,
load_threshold) *cost_per_unit_below_threshold - max(0, load -
load_threshold) *cost_per_unit_above_threshold
With this cost, solutions prefer to deliver high demands first, or equivalently pickup high demands last. For example, if a vehicle has
load_limit {
key: "weight"
value {
cost_per_kilometer {
load_threshold: 15
cost_per_unit_below_threshold: 2.0
cost_per_unit_above_threshold: 10.0
}
}
}
and its route is start,pickup,pickup,delivery,delivery,end with transitions:
transition { vehicle_load['weight'] { amount: 0 }
travel_distance_meters: 1000.0 }
transition { vehicle_load['weight'] { amount: 10 }
travel_distance_meters: 1000.0 }
transition { vehicle_load['weight'] { amount: 20 }
travel_distance_meters: 1000.0 }
transition { vehicle_load['weight'] { amount: 10 }
travel_distance_meters: 1000.0 }
transition { vehicle_load['weight'] { amount: 0 }
travel_distance_meters: 1000.0 }
then the cost incurred by this LoadCost is (cost_below * load_below * kilometers + cost_above * load_above * kms)
- transition 0: 0.0
- transition 1: 2.0 * 10 * 1.0 + 10.0 * 0 * 1.0 = 20.0
- transition 2: 2.0 * 15 * 1.0 + 10.0 * (20 - 15) * 1.0 = 80.0
- transition 3: 2.0 * 10 * 1.0 + 10.0 * 0 * 1.0 = 20.0
- transition 4: 0.0
So the LoadCost over the route is 120.0.
However, if the route is start,pickup,delivery,pickup,delivery,end with transitions:
transition { vehicle_load['weight'] { amount: 0 }
travel_distance_meters: 1000.0 }
transition { vehicle_load['weight'] { amount: 10 }
travel_distance_meters: 1000.0 }
transition { vehicle_load['weight'] { amount: 0 }
travel_distance_meters: 1000.0 }
transition { vehicle_load['weight'] { amount: 10 }
travel_distance_meters: 1000.0 }
transition { vehicle_load['weight'] { amount: 0 }
travel_distance_meters: 1000.0 }
then the cost incurred by this LoadCost is
- transition 0: 0.0
- transition 1: 2.0 * 10 * 1.0 + 10.0 * 0 * 1.0 = 20.0
- transition 2: 0.0
- transition 3: 2.0 * 10 * 1.0 + 10.0 * 0 * 1.0 = 20.0
- transition 4: 0.0
Here the LoadCost over the route is 40.0.
LoadCost makes solutions with heavy-loaded transitions more expensive.
Experimental: See https://developers.google.com/maps/tt/route-optimization/experimental/load-cost/make-request for more details.
| Поля | |
|---|---|
load_threshold | Amount of load above which the cost of moving a unit of load changes from cost_per_unit_below_threshold to cost_per_unit_above_threshold. Must be >= 0. |
cost_per_unit_below_threshold | Cost of moving a unit of load, for each unit between 0 and threshold. Must be a finite value, and >= 0. |
cost_per_unit_above_threshold | Cost of moving a unit of load, for each unit above threshold. In the special case threshold = 0, this is a fixed cost per unit. Must be a finite value, and >= 0. |
TravelMode
Travel modes which can be used by vehicles.
These should be a subset of the Google Maps Platform Routes API travel modes, see: https://developers.google.com/maps/documentation/routes/reference/rest/v2/RouteTravelMode
Note: WALKING routes are in beta and might sometimes be missing clear sidewalks or pedestrian paths. You must display this warning to the user for all walking routes that you display in your app.
| Перечисления | |
|---|---|
TRAVEL_MODE_UNSPECIFIED | Unspecified travel mode, equivalent to DRIVING . |
DRIVING | Travel mode corresponding to driving directions (car, ...). |
WALKING | Travel mode corresponding to walking directions. |
UnloadingPolicy
Policy on how a vehicle can be unloaded. Applies only to shipments having both a pickup and a delivery.
Other shipments are free to occur anywhere on the route independent of unloading_policy .
| Перечисления | |
|---|---|
UNLOADING_POLICY_UNSPECIFIED | Unspecified unloading policy; deliveries must just occur after their corresponding pickups. |
LAST_IN_FIRST_OUT | Deliveries must occur in reverse order of pickups |
FIRST_IN_FIRST_OUT | Deliveries must occur in the same order as pickups |
VehicleFullness
VehicleFullness is a metric which computes how full a vehicle is. Each VehicleFullness field is between 0 and 1, computed as the ratio between a capped metric field (eg AggregatedMetrics.travel_distance_meters ) and its related vehicle limit (eg Vehicle.route_distance_limit ), if it exists. Otherwise the fullness ratio stays unset. If the limit is 0, the field is set to 1. Note: when a route is subject to traffic infeasibilities, some raw fullness ratios might exceed 1.0, eg the vehicle might exceed its distance limit. In these cases, we cap the fullness values at 1.0.
| Поля | |
|---|---|
max_fullness | Maximum of all other fields in this message. |
distance | The ratio between |
travel_duration | The ratio between [AggregatedMetrics.travel_duration_seconds][] and |
active_duration | The ratio between [AggregatedMetrics.total_duration_seconds][] and |
max_load | The maximum ratio among all types of [AggregatedMetrics.max_load][] and their respective |
active_span | The ratio (vehicle_end_time - vehicle_start_time) / (latest_vehicle_end_time - earliest_vehicle_start_time) for a given vehicle. If the denominator is not present, it uses ( |
Путевая точка
Encapsulates a waypoint. Waypoints mark arrival and departure locations of VisitRequests, and start and end locations of Vehicles.
| Поля | |
|---|---|
side_of_road | Optional. Indicates that the location of this waypoint is meant to have a preference for the vehicle to stop at a particular side of road. When you set this value, the route will pass through the location so that the vehicle can stop at the side of road that the location is biased towards from the center of the road. This option doesn't work for the 'WALKING' travel mode. |
vehicle_stopover | Indicates that the waypoint is meant for vehicles to stop at, where the intention is to either pick up or drop off. This option works only for the 'DRIVING' travel mode, and when the 'location_type' is 'location'. Experimental: This field's behavior or existence may change in future. |
Union field location_type . Different ways to represent a location. location_type can be only one of the following: | |
location | A point specified using geographic coordinates, including an optional heading. |
place_id | The POI place ID associated with the waypoint. When using a place ID to specify arrival or departure location of a VisitRequest, use a place ID that is specific enough to determine a LatLng location for navigation to the place. For example, a place ID representing a building is suitable, but a place ID representing a road is discouraged. |