Paper Search Console

Home Search Page About Contact

Journal Title

Title of Journal: OR Spectrum

Search In Journal Title:

Abbravation: OR Spectrum

Search In Journal Abbravation:

Publisher

Springer-Verlag

Search In Publisher:

DOI

10.1006/cyto.1999.0556

Search In DOI:

ISSN

1436-6304

Search In ISSN:
Search In Title Of Papers:

A branchandbound algorithm for the singlerow eq

Authors: Gintaras Palubeckis
Publish Date: 2010/03/07
Volume: 34, Issue: 1, Pages: 1-21
PDF Link

Abstract

In this paper we deal with the singlerow equidistant facility layout problem SREFLP which asks to find a onetoone assignment of n facilities to n locations equally spaced along a straight line so as to minimize the sum of the products of the flows and distances between facilities We develop a branchandbound algorithm for solving this problem The lower bound is computed first by performing transformation of the flow matrix and then applying the wellknown Gilmore–Lawler bounding technique The algorithm also incorporates a dominance test which allows to drastically reduce redundancy in the search process The test is based on the use of a tabu search procedure designed to solve the SREFLP We provide computational results for problem instances of size up to 35 facilities For a number of instances the optimal value of the objective function appeared to be smaller than the best value reported in the literature


Keywords:

References


.
Search In Abstract Of Papers:
Other Papers In This Journal:


Search Result: