A heuristic algorithm enhanced with probability-based incremental learning and local search for dynamic facility layout problems
by T.G. Pradeepmon; Vinay V. Panicker; R. Sridharan
International Journal of Applied Decision Sciences (IJADS), Vol. 11, No. 4, 2018

Abstract: The dynamic facility layout problem (DFLP) involves finding an arrangement of facilities that minimises the sum of material handling cost and rearrangement cost over multiple periods. In this paper, the DFLP is modelled as a multiple quadratic assignment problem (QAP), one for each period. Probability-based incremental learning algorithm with a pair-wise exchange local search (PBILA-PWX) is proposed for solving the QAP for each period. The proposed heuristic and 16 algorithms available in the literature are applied for solving a set of 48 benchmark instances of the DFLP. For most of the problem instances, the proposed heuristic provides better results in comparison with an existing robust algorithm. The deviations of the solutions for the proposed heuristic are found to be within 5% of the best known solutions. A case study conducted for determining the machine shop layout of firm manufacturing printing machines is also presented.

Online publication date: Tue, 02-Oct-2018

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Applied Decision Sciences (IJADS):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com