Kernel Search for the Generalized Assignment Problem

The generalized assignment problem is a classical optimization problem. Its modifications and extensions occur frequently in practical problems in the area of industry, telecommunications, computer networks, logistics, and many others. It is a hard problem, thus an optimal solution to practical inst...

Full description

Saved in:
Bibliographic Details
Published in:2021 IEEE 25th International Conference on Intelligent Engineering Systems (INES) pp. 000145 - 000150
Main Author: Janosikova, L'Udmila
Format: Conference Proceeding
Language:English
Published: IEEE 07.07.2021
Subjects:
Benchmark testing
Conferences
Generalized assignment problem
heuristics
Industries
Kernel
kernel search
Linear programming
mathematical programming
Search problems
Telecommunications
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The generalized assignment problem is a classical optimization problem. Its modifications and extensions occur frequently in practical problems in the area of industry, telecommunications, computer networks, logistics, and many others. It is a hard problem, thus an optimal solution to practical instances cannot be calculated in an acceptable amount of time. That is why approximate methods must be applied. The kernel search is one of the recently developed heuristics that exploit a mathematical programming formulation of the problem. It is a general and simple heuristic framework based on the idea of decomposition of the original problem into smaller sub-problems and using a mathematical programming solver as a black-box to solve them. In this paper we propose an implementation of the kernel search algorithm for the general assignment problem and evaluate the efficiency of the algorithm on benchmark instances.
DOI:10.1109/INES52918.2021.9512916