PARAMETER_FILE = pmona
Reading PROBLEM_FILE: "mona-lisa100K.tsp" ... done
ASCENT_CANDIDATES = 50
BACKBONE_TRIALS = 0
BACKTRACKING = NO
# CANDIDATE_FILE =
CANDIDATE_SET_TYPE = DELAUNAY
EXCESS = 1e-05
EXTRA_CANDIDATES = 0 
EXTRA_CANDIDATE_SET_TYPE = QUADRANT
GAIN23 = YES
GAIN_CRITERION = YES
INITIAL_PERIOD = 1000
INITIAL_STEP_SIZE = 1
INITIAL_TOUR_ALGORITHM = WALK
# INITIAL_TOUR_FILE = 
INITIAL_TOUR_FRACTION = 1.000
# INPUT_TOUR_FILE = 
KICK_TYPE = 0
KICKS = 1
# MAX_BREADTH =
MAX_CANDIDATES = 5 
MAX_SWAPS = 100000
MAX_TRIALS = 1
# MERGE_TOUR_FILE =
MOVE_TYPE = 8
NONSEQUENTIAL_MOVE_TYPE = 22
# OPTIMUM =
OUTPUT_TOUR_FILE = mona-lisa100K.6.tour
PATCHING_A = 7 
PATCHING_C = 8 
# PI_FILE = 
PRECISION = 100
PROBLEM_FILE = mona-lisa100K.tsp
RESTRICTED_SEARCH = YES
RUNS = 10
SEED = 1
STOP_AT_OPTIMUM = YES
SUBGRADIENT = YES
# SUBPROBLEM_SIZE =
# SUBPROBLEM_TOUR_FILE = 
SUBSEQUENT_MOVE_TYPE = 8
SUBSEQUENT_PATCHING = YES
# TIME_LIMIT =
TOUR_FILE = mona-lisa100K.$.tour
TRACE_LEVEL = 1

Lower bound = 5751392.8, Ascent time = 591.5 sec.
Cand.min = 2, Cand.avg = 5.0, Cand.max = 5
Preprocessing time = 594.0 sec.
* 1: Cost = 5757795, Time = 2667.2 sec. 
Writing TOUR_FILE: "mona-lisa100K.5757795.tour" ... done
Run 1: Cost = 5757795, Time = 2667.3 sec. 

Successes/Runs = 0/1 
Cost.min = 5757795, Cost.avg = 5757795.00, Cost.max = 5757795
Gap.min = 0.000%, Gap.avg = 0.000%, Gap.max = 0.000%
Trials.min = 1, Trials.avg = 1.0, Trials.max = 1
Time.min = 2667.3 sec., Time.avg = 2667.3 sec., Time.max = 2667.3 sec.