Parameters for solving the VRP problem

Solver parameters control the underlying solver behaviors and should be used only by experts.

algorithmstring

Solver to be used for optimization. dynamic should be used for real time operations (on-demand)

Possible values: [static, dynamic]

Default value: static

first_solution_strategyinteger

The first_solution_strategy value defines the first solution-finding strategy to be used during calculations. See the documentation for a detailed explanation of each strategy.

Default value: 0

solution_limitnumber

Limit to the number of solutions generated during the search.

Default value: 10000000

use_local_search_metaheuristicboolean

Flag that enables the use of a local search metaheuristic.

Default value: false

guided_local_search_lambda_coefficientnumber

Parameter of the local search procedure.

Default value: 0.1

use_tsp_optboolean

Flag that enables Traveling Salesperson Problem (TSP) optimization.

Default value: false

time_limit_msnumber

Limit in ms to the time spent in the search.

Default value: 10000000

log_searchboolean

Flag that enables log search.

Default value: false

lns_time_limit_msnumber

Limit in ms to the time spent in the completion search for each local search neighbor.

Default value: 1000

savings_neighbors_rationumber

Savings neighbors ratio.

Default value: 0

waypoints_optimization_second_phaseboolean

Enables second phase waypoints optimization for prebook.

Default value: false

waypoints_solution_limitnumber

Waypoints solution limit in the second phase.

Default value: 1000

optimization_stepnumber

Minimum step by which the solution must be improved in local search.

Default value: 1

use_all_local_search_operatorsboolean

Use all available local search operators.

Default value: false

use_depth_first_searchboolean

If true, the solver should use depth-first search rather than local search to solve the problem.

Default value: false

use_local_search_operatorsstring[]

List of additional local search operator names. Currently supported: extended_swap_active that improves solutions when waypoints are used; logistics_relocate_pair that improves performance when logistics problem is solved in prebook mode.

Possible values: [extended_swap_active, logistics_relocate_pair]

first_solution_strategies_second_stage:integer[]

First solution strategies for second stage (Only one of them is used)

time_limit_ms_second_stageinteger

Maximum calculation time for second stage in milliseconds

Parameters for solving the VRP problem

{
  "algorithm": "static",
  "first_solution_strategy": 0,
  "solution_limit": 10000000,
  "use_local_search_metaheuristic": false,
  "guided_local_search_lambda_coefficient": 0.1,
  "use_tsp_opt": false,
  "time_limit_ms": 10000000,
  "log_search": false,
  "lns_time_limit_ms": 1000,
  "savings_neighbors_ratio": 0,
  "waypoints_optimization_second_phase": false,
  "waypoints_solution_limit": 1000,
  "optimization_step": 1,
  "use_all_local_search_operators": false,
  "use_depth_first_search": false,
  "use_local_search_operators": [
    "extended_swap_active"
  ],
  "first_solution_strategies_second_stage:": [
    0
  ],
  "time_limit_ms_second_stage": 0
}