Automatic Algorithm Configuration for the Permutation Flow Shop Scheduling Problem Minimizing Total Completion Time.
Lecture Notes in Computer Science(2018)
摘要
Automatic algorithm configuration aims to automate the often time-consuming task of designing and evaluating search methods. We address the permutation flow shop scheduling problem minimizing total completion time with a context-free grammar that defines how algorithmic components can be combined to form a full heuristic search method. We implement components from various works from the literature, including several local search procedures. The search space defined by the grammar is explored with a racing-based strategy and the algorithms obtained are compared to the state of the art.
更多查看译文
关键词
Automatic algorithm configuration,Iterated greedy algorithm,Iterated local search,Flow shop scheduling problem,Total completion time
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络