Hybrid metaheuristic for generalised assignment
by Salim Haddadi
International Journal of Innovative Computing and Applications (IJICA), Vol. 11, No. 1, 2020

Abstract: This paper investigates the classical generalised assignment problem (GAP), a challenging combinatorial optimisation problem that arises in numerous applications and that has attracted a great deal of research. For solving it we propose a hybrid metaheuristic combining guided search (GS), iterated local search (ILS), and very large-scale neighbourhood search (VLSN). The hybrid method is iterative. It starts with a random assignment, and in every iteration it acts in the following way: 1) The best current assignment is perturbed. 2) An exponential size neighbourhood of the perturbed assignment is constructed. It is the feasible solution set of a special GAP where only two fixed machines can execute a job. The neighbourhood construction is guided by a technique penalising poor machine/job selections. 3) The exponential neighbourhood is searched for improvement. Exploring the neighbourhood amounts to solving a monotone binary program (BP) – a monotone BP is one with two non-zero coefficients of opposite sign per column. We prove that the proposed metaheuristic runs in polynomial-time when applied to a variation of GAP. Good computational results in terms of solution quality, as well as of computation speed, are obtained with two new best values on hard instances.

Online publication date: Mon, 24-Feb-2020

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Innovative Computing and Applications (IJICA):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com