Class TSLnsMain
java.lang.Object
org.ddolib.examples.talentscheduling.TSLnsMain
Entry point for solving the Talent Scheduling (TalentSched) problem using a
Large Neighborhood Search (LNS) approach.
This class reads an instance file describing a talent scheduling problem, constructs an LNS model, and searches for an optimal or near-optimal schedule within a time limit. The best solution found is printed along with runtime statistics.
Usage:
java TSLnsMain [instanceFilePath]
instanceFilePath(optional): Path to the Talent Scheduling instance file. If omitted, the default instance located atdata/TalentScheduling/film-12is used.
The LNS model is configured with:
- A
TSFastLowerBoundfor efficient lower bound estimation. - A
TSRankingto rank scheduling decisions during the search.
The search is limited to 1000 milliseconds per iteration, and the best
solution found is printed to System.out along with detailed statistics.
This implementation does not currently include dominance checks or width heuristics.
- Version:
- 1.0
- Author:
-
Constructor Summary
Constructors -
Method Summary
-
Constructor Details
-
TSLnsMain
public TSLnsMain()
-
-
Method Details
-
main
Main method to run the Talent Scheduling LNS solver.- Parameters:
args- optional command-line argument:args[0]: path to the Talent Scheduling instance file (default:data/TalentScheduling/film-12)
- Throws:
IOException- if there is an error reading the instance file.
-