A two-stage approach to solving large capacitated task allocation problems (Q614188)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A two-stage approach to solving large capacitated task allocation problems |
scientific article; zbMATH DE number 5829525
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A two-stage approach to solving large capacitated task allocation problems |
scientific article; zbMATH DE number 5829525 |
Statements
A two-stage approach to solving large capacitated task allocation problems (English)
0 references
27 December 2010
0 references
Summary: This paper presents a simple, two-stage method, implemented in the commonly available Excel spreadsheet program, for quickly finding high quality solutions to larger, more difficult instances of the capacitated task allocation problem (CTAP) than have been previously reported. In Stage 1, an innovative modification of the approximation method of Griffith and Stewart is used to reformulate CTAP and find a near-integer solution. Based on the partial solution from Stage 1, the remaining tasks are allocated in a greatly reduced quadratic CTAP solved in Stage 2. Our results show that this approach yields very good solutions relatively quickly to very large problems (1,000 binary variables and 49,500 quadratic terms in the objective function). Ours is the first paper to modify the continuous approximation method of Griffith and Stewart to solve 0/1 problems and the first article to demonstrate the successful use of an Excel-based approach for solving very large CTAP problems.
0 references
task allocation
0 references
integer programming
0 references
heuristics
0 references
approximation programming
0 references
quadratic program
0 references
Excel solver
0 references
spreadsheet modelling
0 references
mathematical modelling
0 references