Research Article
Parameter Tuning for Local-Search-Based Matheuristic Methods
Input: (portion of the resources included in ) | Output: (approximately optimal solution) | (1) begin | (2) ; | (3) ; | (4) solve ; // set current sol | (5) ; // set best sol | (6) ; // tabu list initially empty | (7) ; | (8) repeat | (9) ; | (10) ; | (11) foreach do | (12) solve ; | (13) ; | (14) Sort; | (15) foreach do | (16) if isTabu then | (17) if then | (18) ; | (19) ; | (20) ; | (21) ; | (22) ; | (23) break; | (24) else | (25) ; | (26) ; | (27) if then | (28) ; | (29) ; | (30) else | (31) ; | (32) break; | (33) if then | (34) ; | (35) until time limit is reached; | (36) return ; |
|