An efficient heuristic for robot acquisition and cell formation

Bernard Han and Jack Cook

Annals of Operations Research, 1998, vol. 77, issue 0, 229-252

Abstract: In this paper, a mathematical model and a solution algorithm are developed for solving a robot acquisition and cell formation problem (RACFP). Our model considers purchasing a proper mix of robots and assigning all given workstations to purchased robots such that each robot cell satisfies its workstations' resource demands while minimizing the total system (acquisition) cost. Specifically, each robot has two capacity constraints - available work envelope and effective machine time. RACFP is formulated as a multi-type two-dimensional bin packing problem, a pure 0-1 integer program which is known to be NP-hard. In this paper, a very efficient (polynomial time bound) heuristic algorithm is developed and implemented. The algorithm consists of two major stages. The first stage employs an LP-based bounding procedure to produce a tight solution bound, whereas the second stage repetitively invokes a random search heuristic using a greedy evaluation function. The algorithm is tested by solving 450 randomly generated problems based on realistic parameter values. Computational results show that the heuristic algorithm has outperformed algorithms using general optimization techniques such as Simulated Annealing and Column Generation. All test problems are solved within an order of magnitude of 10 seconds, with a gap of less than 1% from the optimum. More importantly, over 70% of all solutions are optimal (334 out of 450). The algorithm can be easily modified for other applications such as file placement for a multi-device storage system and job scheduling for a multi-processing system. Copyright Kluwer Academic Publishers 1998

Date: 1998
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://hdl.handle.net/10.1023/A:1018977428236 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:77:y:1998:i:0:p:229-252:10.1023/a:1018977428236

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1023/A:1018977428236

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().