The University of Southampton
University of Southampton Institutional Repository

Local search algorithms for the min-max loop layout problem

Local search algorithms for the min-max loop layout problem
Local search algorithms for the min-max loop layout problem
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.
loop layout, insertion algorithm, local search, iterated descent, tabu search
0160-5682
1109-1117
Bennell, J.A.
38d924bc-c870-4641-9448-1ac8dd663a30
Potts, C.N.
58c36fe5-3bcb-4320-a018-509844d4ccff
Whitehead, J.D.
5ddc4b76-a666-4820-8e00-79d85ca79d40
Bennell, J.A.
38d924bc-c870-4641-9448-1ac8dd663a30
Potts, C.N.
58c36fe5-3bcb-4320-a018-509844d4ccff
Whitehead, J.D.
5ddc4b76-a666-4820-8e00-79d85ca79d40

Bennell, J.A., Potts, C.N. and Whitehead, J.D. (2002) Local search algorithms for the min-max loop layout problem. Journal of the Operational Research Society, 53 (10), 1109-1117. (doi:10.1057/palgrave.jors.2601269).

Record type: Article

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.

Full text not available from this repository.

More information

Published date: 2002
Keywords: loop layout, insertion algorithm, local search, iterated descent, tabu search
Organisations: Operational Research

Identifiers

Local EPrints ID: 35781
URI: http://eprints.soton.ac.uk/id/eprint/35781
ISSN: 0160-5682
PURE UUID: b0aab4eb-565b-48a5-9ac6-2ad0ccbd0f3a

Catalogue record

Date deposited: 22 May 2006
Last modified: 15 Jul 2019 19:05

Export record

Altmetrics

Contributors

Author: J.A. Bennell
Author: C.N. Potts
Author: J.D. Whitehead

University divisions

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×