Trip Algorithms

Trip algorithms perform a specific algorithm on each selected trip. Hence, all trip algorithms require a ResourceSelector and DateRangeSelector specification.

Normalize

The normalization of a trip does not require any properties.

OptimizeTrip

Property Description Default Example
reInsert Optimize with reinsert, i.e. try to create a trip with less costs by re-inserting each task in the trip into an empty trip. false true
oneOpt Use the 1-Opt optimization. true false

FillTrip

Property Description Default Example
sortOnLatest When trying to find a seed visit, the candidate tasks are sorted on the latest field first. false true
includeDepartureAndArrival When sorting the list of candidates by distance to the next stop, the departure and arrival in the trip are taken into account as a valid stop to compare the distance with. true false
maxDistance The candidate task must be in a range of the specified maximum distance in meters. 50000 400000

Unplan

Property Description Default Example
unplanFixed Do not unplan fixed tasks if this property is set. true false

ReInsert

The ReInsert algorithm does not require any properties.

Constraint Properties

Any trip algorithm can be specified with additional constraint properties.

Property Description Default Example
checkOverload During each evaluation, check if adding a stop to the trip will exceed the overload limit. The preference value false
acceptEqual Accumulate options having equal costs. The preference value true
checkTerritory Only resources belonging to the task's territory. The preference value false
fixedTaskTypes Consider task types. The preference value, if specified. Otherwise, undefined. FX,TX
maxExceptions Accept a certain number of hard constraint exceptions while running the algorithm. 10 100

results matching ""

    No results matching ""