An LP-based hybrid heuristic procedure for the generalized assignment problem with special ordered sets

Authors:
Alan P. French;John M. Wilson
Affiliations:
Business School, Loughborough University, Loughborough, England;Business School, Loughborough University, Loughborough, England
Venue:
HM'05 Proceedings of the Second international conference on Hybrid Metaheuristics
Year:
2005

Citing 5
Cited 0

A dynamic tabu search for large-scale generalised assignment problems

Computers and Operations Research
Solving the Generalized Assignment Problem: An Optimizing and Heuristic Approach

INFORMS Journal on Computing
An Ejection Chain Approach for the Generalized Assignment Problem

INFORMS Journal on Computing
An Algorithm for the Generalized Assignment Problem with Special Ordered Sets

Journal of Heuristics
A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem

Discrete Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

The generalized assignment problem with special ordered sets (GAPS2), is the problem of allocating n tasks to m time-periods, where each task must be assigned to a time-period, or shared between two consecutive time-periods. For large values of m and n the NP-hard combinatorial problem GAPS2 becomes intractable for standard mathematical programming software such as CPLEX or XPRESSMP and it is unlikely that a proven optimal solution can be obtained. There is thus a need for heuristic algorithms to solve such problems. It will be shown how a combination of linear programming techniques and two heuristics forming a hybrid can be used to solve GAPS2. Good results, in terms of speed and accuracy, on large problem instances have been obtained. In particular when compared to an existing heuristic for GAPS2, the results look particularly promising.