A RIGOROUS COMPUTATIONAL COMPARISON OF ALTERNATIVE SOLUTION METHODS FOR THE GENERALIZED ASSIGNMENT PROBLEM

Authors
Citation
Mm. Amini et M. Racer, A RIGOROUS COMPUTATIONAL COMPARISON OF ALTERNATIVE SOLUTION METHODS FOR THE GENERALIZED ASSIGNMENT PROBLEM, Management science, 40(7), 1994, pp. 868-890
Citations number
36
Categorie Soggetti
Management,"Operatione Research & Management Science
Journal title
ISSN journal
00251909
Volume
40
Issue
7
Year of publication
1994
Pages
868 - 890
Database
ISI
SICI code
0025-1909(1994)40:7<868:ARCCOA>2.0.ZU;2-S
Abstract
Statistical experimental design and analysis is a cornerstone for scie ntific inquiry that is rarely applied in reporting computational testi ng. This approach is employed to study the relative performance charac teristics of the four leading algorithmic and heuristic alternatives t o solve the Linear Cost Generalized Assignment Problem (LCGAP) against a newly developed heuristic, Variable-Depth Search Heuristic (VDSH). In assessing the relative effectiveness of the prominent solution meth odologies and VDSH under the effects of various problem characteristic s, we devise a carefully designed experimentation of state-of-the-art implementations; through a rigorous statistical analysis we identify t he most efficient method(s) for commonly studied LCGAPs, and determine the effect on solution time and quality of problem class and size.