Class PositionBasedRegretInsertion

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

public class PositionBasedRegretInsertion extends AbstractInsertionStrategy
Position-based regret insertion strategy.

Unlike route-based regret which considers only the best insertion per route, position-based regret considers ALL feasible insertion positions across all routes. This approach was ranked #1 in Voigt et al. 2025 meta-analysis of LNS operators.

The key difference from RegretInsertionFast:

  • Route-based: compares best positions across routes (one position per route)
  • Position-based: compares individual positions across all routes (many positions per route)

This typically yields better solution quality at the cost of more computation, as it has finer granularity for the regret calculation.

Author:
schroeder