Package org.ddolib.examples.srflp
Class SRFLPLnsMain
java.lang.Object
org.ddolib.examples.srflp.SRFLPLnsMain
Entry point for solving the Single Row Facility Layout Problem (SRFLP)
using a Large Neighborhood Search (LNS) approach.
This class reads an instance file describing an SRFLP problem, constructs an LNS model, and attempts to find an optimal or near-optimal solution within a time limit. The solution and its statistics are printed to standard output.
Usage:
java SRFLPLnsMain [instanceFilePath] [maxWidth]
instanceFilePath(optional): Path to the SRFLP instance file. If omitted, the default instance located atdata/SRFLP/simpleis used.maxWidth(optional): Maximum width for the search tree heuristic. Defaults to 50 if not provided.
The LNS model is configured with:
- A
SRFLPFastLowerBoundfor fast estimation of lower bounds. - A
SRFLPRankingto rank decisions during the search. - A fixed width heuristic (
FixedWidth) with the specifiedmaxWidth.
The search is time-limited (100 milliseconds) per iteration, and the best solution found is printed along with its statistics.
This class does not currently implement dominance checks.
- Version:
- 1.0
- Author:
-
Constructor Summary
Constructors -
Method Summary
-
Constructor Details
-
SRFLPLnsMain
public SRFLPLnsMain()
-
-
Method Details
-
main
Main method to run the SRFLP LNS solver.- Parameters:
args- optional command-line arguments:args[0]: path to the SRFLP instance file (default:data/SRFLP/simple)args[1]: maximum width for the width heuristic (default: 50)
- Throws:
IOException- if there is an error reading the instance file.
-