A Novel Cooperative Multi-Stage Hyper-Heuristic for Combination Optimization Problems

Abstract

A hyper-heuristic algorithm is a general solution framework that adaptively selects the optimizer to address complex problems. A classical hyper-heuristic framework consists of two levels, including the high-level heuristic and a set of low-level heuristics. The low-level heuristics to be used in the optimization process are chosen by the high-level tactics in the hyper-heuristic. In this study, a Cooperative Multi-Stage Hyper-Heuristic (CMS-HH) algorithm is proposed to address certain combinatorial optimization problems. In the CMS-HH, a genetic algorithm is introduced to perturb the initial solution to increase the diversity of the solution. In the search phase, an online learning mechanism based on the multi-armed bandits and relay hybridization technology are proposed to improve the quality of the solution. In addition, a multi-point search is introduced to cooperatively search with a single-point search when the state of the solution does not change in continuous time. The performance of the CMS-HH algorithm is assessed in six specific combinatorial optimization problems, including Boolean satisfiability problems, one-dimensional packing problems, permutation flow-shop scheduling problems, personnel scheduling problems, traveling salesman problems, and vehicle routing problems. The experimental results demonstrate the efficiency and significance of the proposed CMS-HH algorithm.

Multi-Population Enhanced Slime Mould Algorithm and with Application to Postgraduate Employment Stability Prediction

“…Due to its strong optimization capability, the developed MSMA can also be applied to other optimization problems, such as multi-objective or many optimization problems [75][76][77], big data optimization problems [78], and combination optimization problems [79]. Moreover, it can be applied to tackle the practical problems such as medical diagnosis [80][81][82][83], location-based service [84,85], service ecosystem [86], communication system conversion [87][88][89], kayak cycle phase segmentation [90], image dehazing and retrieval [91,92], information retrieval service [93][94][95], multi-view learning [96], human motion capture [97], green supplier selection [98], scheduling [99][100][101], and microgrid planning [102] problems.…”

Multilevel threshold image segmentation for COVID-19 chest radiography: A framework using horizontal and vertical multiverse optimization

“…As a result, more and more researchers have started introducing swarm intelligence algorithm (SIOA) into the traditional MTIS to improve the segmentation efficiency instead of the traditional exhaustive method. These SIOAs has offered greater efficiency in optimization tasks such as expensive optimization problems [ 32 , 33 ], medical diagnosis [ [34] , [35] , [36] , [37] ], PID optimization control [ [38] , [39] , [40] ], plant disease recognition [ 41 ], feature selection [ [42] , [43] , [44] , [45] ], object tracking [ 46 , 47 ], economic emission dispatch problem [ 48 ], engineering design [ [49] , [50] , [51] ], parameter tuning for machine learning models [ [52] , [53] , [54] ], constrained optimization problems [ 55 , 56 ], combination optimization problems [ 57 ], traveling salesman problem [ 58 ], multi-objective or many optimization problems [ [59] , [60] , [61] ], and scheduling problems [ [62] , [63] , [64] ].…”

A Region Enhanced Discrete Multi-Objective Fireworks Algorithm for Low-Carbon Vehicle Routing Problem

“…Low-carbon VRP is a non-deterministic polynomial hard (NP-hard) problem [13] , and the metaheuristic method is an ideal tool for solving this type of problem [14−20] . For example, Han et al [15] adopted an improved iterated greedy algorithm to solve the distributed flow shop scheduling problem with sequence-dependent setup time. Zhang et al [17] designed a multi-direction update based multi-objective particle swarm optimization for mixed no-idle flowshop scheduling problem.…”