public class AnnealedTSPSearchPlanner extends TSPSearchPlanner implements Runnable
COS60, searchSequence, SIN60, SIXTY_DEGREES, THIRTY_DEGREES
pd, sweepWidth, trackSpacing
plan, searchArea, startPoint
Constructor and Description |
---|
AnnealedTSPSearchPlanner(GeoArea searchArea,
double S,
double PD,
double[] startPosit)
Creates a new instance of AnnealedTSPSearchPlanner
|
AnnealedTSPSearchPlanner(GeoArea searchArea,
double S,
double PD,
double[] startPosit,
boolean pointFocus)
Creates a new instance of AnnealedTSPSearchPlanner
|
Modifier and Type | Method and Description |
---|---|
protected double |
getPSwitch(double d0,
double d1,
double t)
Computes the probability that a switch of path waypoints is conducted
|
protected void |
incrementallyImprove()
Uses pairwise comparison of array elements to incrementally
improve a proposed traveling salesman problem solution.
|
void |
run()
Implements the Runnable interface
|
computeVisitPoints, distance, generatePlan, partialDistance, partialDistance, remainingDistance
setRequiredPD, setSweepWidth, setTrackSpacing
getPlan, getRunTime, setRunTime
public AnnealedTSPSearchPlanner(GeoArea searchArea, double S, double PD, double[] startPosit, boolean pointFocus)
searchArea
- geographic area that is to be searchedS
- PD
- startPosit
- double[2] defining the vehicle's position at the beginning of the searchpointFocus
- set to true if the vehicle is to start the search at the region's centerpublic AnnealedTSPSearchPlanner(GeoArea searchArea, double S, double PD, double[] startPosit)
searchArea
- geographic area that is to be searchedS
- PD
- startPosit
- double[2] defining the vehicle's position at the beginning of the searchprotected double getPSwitch(double d0, double d1, double t)
d0
- the distance of the original pathd1
- the distance of the path if the waypoints are switchedt
- the current value of tprotected void incrementallyImprove()
incrementallyImprove
in class TSPSearchPlanner
public void run()
run
in interface Runnable
run
in class TSPSearchPlanner