Package org.jacop.examples.fd
Class ConferenceTalkPlacement
java.lang.Object
org.jacop.examples.fd.ConferenceTalkPlacement
It solves a simple conference talk placement problem.
- Version:
- 4.8
It solves a simple conference example problem, where different sessions must be scheduled according to the specified constraints.
-
Field Summary
Fields -
Constructor Summary
Constructors -
Method Summary
Modifier and TypeMethodDescriptionprivate int
computeLowerBound
(int noOfParallelTracks, int noOfTimeSlots, Map<Integer, Map<Integer, Integer>> costs) static void
It executes the program to solve this Travelling Salesman Problem.void
model
(int noOfParallelTracks, int noOfTalks, int noOfTimeSlots, int maxSingleCost, Map<Integer, Map<Integer, Integer>> costMap) randomCosts
(int noOfTalks, int randomSeed, int maxSingleCost) boolean
search
(int maxCostAllowed, int timeOutSeconds) boolean
searchMaxRegretForMatrixOptimal
(int timeOutSeconds) It uses MaxRegret variable ordering heuristic to search for a solution.transformCosts
(int[][] costs, int noOfTalks)
-
Field Details
-
store
Store store -
cost
IntVar cost -
vars
-
varsMatrix
IntVar[][] varsMatrix -
search
DepthFirstSearch<IntVar> search
-
-
Constructor Details
-
ConferenceTalkPlacement
public ConferenceTalkPlacement()
-
-
Method Details
-
transformCosts
-
randomCosts
-
computeLowerBound
-
model
-
searchMaxRegretForMatrixOptimal
public boolean searchMaxRegretForMatrixOptimal(int timeOutSeconds) It uses MaxRegret variable ordering heuristic to search for a solution.- Parameters:
timeOutSeconds
- time-out in seconds- Returns:
- true if there is a solution, false otherwise.
-
search
public boolean search(int maxCostAllowed, int timeOutSeconds) -
main
It executes the program to solve this Travelling Salesman Problem.- Parameters:
args
- no argument is used.
-