Local search algorithms for the min-max loop layout problem

J A Bennell, C N Potts and J D Whitehead
Additional contact information
J A Bennell: University of Southampton
C N Potts: University of Southampton
J D Whitehead: University of Southampton

Journal of the Operational Research Society, 2002, vol. 53, issue 10, 1109-1117

Abstract: Abstract In the min-max loop layout problem, machines are to be arranged around a loop of conveyor belt. The ordering of the machines dictates the number of circuits of the conveyor belt required to manufacture each of several products. The goal is to find an ordering of the machines that minimises the maximum number of circuits required for the manufacture of any of the products. Since the problem is strongly NP-hard, the study of heuristic methods is of interest. This paper proposes iterated descent and tabu search algorithms, and a randomised insertion algorithm. Results of extensive computational tests show that all of our algorithms outperform a previously known algorithm that applies a greedy heuristic to the solution of a linear programming relaxation. The best quality solutions are obtained with iterated descent. This adds further evidence to the belief that iterated descent can produce high quality solutions to a variety of combinatorial optimisation problems. Moreover, unlike some other local search algorithms, iterated descent does not require much tuning in order to be competitive.

Keywords: loop layout; insertion algorithm; local search; iterated descent; tabu search (search for similar items in EconPapers)
Date: 2002
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1057/palgrave.jors.2601269 Abstract (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:pal:jorsoc:v:53:y:2002:i:10:d:10.1057_palgrave.jors.2601269

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/41274

DOI: 10.1057/palgrave.jors.2601269

Access Statistics for this article

Journal of the Operational Research Society is currently edited by Tom Archibald and Jonathan Crook

More articles in Journal of the Operational Research Society from Palgrave Macmillan, The OR Society
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().