Class BestInsertion

java.lang.Object
com.graphhopper.jsprit.core.algorithm.recreate.AbstractInsertionStrategy
com.graphhopper.jsprit.core.algorithm.recreate.BestInsertion
All Implemented Interfaces:
InsertionStrategy

public final class BestInsertion extends AbstractInsertionStrategy
Sequential insertion that processes jobs in random order, inserting each at its best position.

Note: Despite the name, this is NOT "Best Insertion" as defined in VRP literature. This implementation:

  1. Shuffles jobs randomly
  2. Sorts by priority
  3. For each job in this order, inserts it at the position with minimum additional cost
This is more accurately called "Sequential Insertion with Random Order" or "Random Order Insertion".

For true Best Insertion (Cheapest Insertion) as defined in literature, where the globally cheapest (job, position) pair is selected at each iteration, use CheapestInsertion.

Author:
stefan schroeder
See Also: