Finding and Exploring Promising Search Space for the 0-1 Multidimensional Knapsack Problem

10/08/2022
by   Hongbo Li, et al.
0

The 0-1 multidimensional knapsack problem(MKP) is a classical NP-hard combinatorial optimization problem. In this paper, we propose a novel heuristic algorithm simulating evolutionary computation and large neighbourhood search for the MKP. It maintains a set of solutions and abstracts information from the solution set to generate good partial assignments. To find high-quality solutions, integer programming is employed to explore the promising search space specified by the good partial assignments. Extensive experimentation with commonly used benchmark sets shows that our approach outperforms the state of the art heuristic algorithms, TPTEA and DQPSO, in solution quality. It finds new lower bound for 8 large and hard instances

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/22/2020

Exploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problems

In this article, a novel approach to solve combinatorial optimization pr...
research
04/29/2013

A Discrete State Transition Algorithm for Generalized Traveling Salesman Problem

Generalized traveling salesman problem (GTSP) is an extension of classic...
research
02/01/2017

A Hybrid Evolutionary Algorithm Based on Solution Merging for the Longest Arc-Preserving Common Subsequence Problem

The longest arc-preserving common subsequence problem is an NP-hard comb...
research
01/24/2022

An Effective Iterated Two-stage Heuristic Algorithm for the Multiple Traveling Salesmen Problem

The multiple Traveling Salesmen Problem mTSP is a general extension of t...
research
02/03/2023

Searching Large Neighborhoods for Integer Linear Programs with Contrastive Learning

Integer Linear Programs (ILPs) are powerful tools for modeling and solvi...
research
05/14/2020

Surrogate Assisted Optimisation for Travelling Thief Problems

The travelling thief problem (TTP) is a multi-component optimisation pro...
research
05/31/2017

Diversified Top-k Partial MaxSAT Solving

We introduce a diversified top-k partial MaxSAT problem, a combination o...

Please sign up or login with your details

Forgot password? Click here to reset