Work

List-Based Threshold Accepting Algorithm with Improved Neighbor Operator for 0–1 Knapsack Problem

Year: 2024

Type: article

Abstract: The list-based threshold accepting (LBTA) algorithm is a sophisticated local search method that utilizes a threshold list to streamline the parameter tuning process in the traditional threshold accepting (TA) algorithm. This paper proposes an enhanced local search version of the LBTA algorithm specifically tailored for solving the 0–1 knapsack problem (0–1 KP). To maintain a dynamic threshold list, a feasible threshold updating strategy is designed to accept adaptive modifications during the search process. In addition, the algorithm incorporates an improved bit-flip operator designed to generate a neighboring solution with a controlled level of disturbance, thereby fostering exploration within the solution space. Each trial solution produced by this operator undergoes a repair phase using a hybrid greedy repair operator that incorporates both density-based and value-based add operator to facilitate optimization. The LBTA algorithm’s performance was evaluated against several state-of-the-art metaheuristic approaches on a series of large-scale instances. The simulation results demonstrate that the LBTA algorithm outperforms or is competitive with other leading metaheuristics in the field.

Source: Algorithms

DOI: 10.3390/a17110478

Authors: Liangcheng Wu, Kai Lin, Xiaoyu Lin, Juan Lin

Institution: Fujian Agriculture and Forestry University

Language: English

Topic: Metaheuristic Optimization Algorithms Research

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: gold

Estimated APC paid: $1,819

Funder: Natural Science Foundation of Fujian Province