Package com.graphhopper.jsprit.core.algorithm.recreate

Class RegretKAlternatives

java.lang.Object

com.graphhopper.jsprit.core.algorithm.recreate.RegretKAlternatives

public class RegretKAlternatives
extends Object

Holds k-best insertion alternatives for a job, sorted by insertion cost. Used for regret-k insertion heuristics where k can be 2, 3, 4, or more.

Nested Class Summary

Nested Classes

Modifier and Type	Class	Description
static class	RegretKAlternatives.Alternative	Represents a single insertion alternative with its route and cost.

Constructor Summary

Constructors

Constructor	Description
RegretKAlternatives()
RegretKAlternatives(List<RegretKAlternatives.Alternative> alternatives)

Method Summary

Modifier and Type	Method	Description
void	add(InsertionData insertionData, VehicleRoute route)	Adds an alternative and maintains sorted order by cost.
static RegretKAlternatives	fromBestAndSecondBest(InsertionData best, InsertionData secondBest, VehicleRoute bestRoute, VehicleRoute secondBestRoute)	Creates RegretKAlternatives from best and secondBest InsertionData for backward compatibility.
RegretKAlternatives.Alternative	get(int index)	Returns the alternative at the given index (0-based).
List<RegretKAlternatives.Alternative>	getAlternatives()	Returns all alternatives sorted by cost (ascending).
RegretKAlternatives.Alternative	getBest()	Returns the best (lowest cost) alternative, or null if empty.
RegretKAlternatives.Alternative	getSecondBest()	Returns the second-best alternative for backward compatibility.
List<RegretKAlternatives.Alternative>	getTopK(int k)	Returns the top k alternatives (or all if fewer than k exist).
boolean	isEmpty()	Returns true if there are no alternatives.
int	size()	Returns the number of alternatives.

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

RegretKAlternatives

public RegretKAlternatives()

RegretKAlternatives

public RegretKAlternatives(List<RegretKAlternatives.Alternative> alternatives)

Method Details

add

public void add(InsertionData insertionData,
 VehicleRoute route)

Adds an alternative and maintains sorted order by cost.

getAlternatives

public List<RegretKAlternatives.Alternative> getAlternatives()

Returns all alternatives sorted by cost (ascending).

getBest

public RegretKAlternatives.Alternative getBest()

Returns the best (lowest cost) alternative, or null if empty.

getSecondBest

public RegretKAlternatives.Alternative getSecondBest()

Returns the second-best alternative for backward compatibility. Returns null if fewer than 2 alternatives exist.

get

public RegretKAlternatives.Alternative get(int index)

Returns the alternative at the given index (0-based). Returns null if index is out of bounds.

size

public int size()

Returns the number of alternatives.

isEmpty

public boolean isEmpty()

Returns true if there are no alternatives.

getTopK

public List<RegretKAlternatives.Alternative> getTopK(int k)

Returns the top k alternatives (or all if fewer than k exist).

fromBestAndSecondBest

public static RegretKAlternatives fromBestAndSecondBest(InsertionData best,
 InsertionData secondBest,
 VehicleRoute bestRoute,
 VehicleRoute secondBestRoute)

Creates RegretKAlternatives from best and secondBest InsertionData for backward compatibility.