Shortest path based simulated annealing algorithm for dynamic facility layout problem under dynamic business environment
Authors:
- Ming DongMDMing Dong
- Chang WuCWChang Wu
- Forest HouFHForest Hou
- 1 October 2009
- journal article
- Published by Elsevier in Expert Systems with Applications
- Vol. 36 (8) , 11221-11232
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- Dynamic Programming Algorithms for Generating Optimal Strip LayoutsComputational Optimization and Applications, 2005
- A hybrid genetic algorithm for the dynamic plant layout problemInternational Journal of Production Economics, 2003
- Next Generation Factory Layouts: Research Challenges and Recent ProgressInterfaces, 2002
- A simulated annealing algorithm for dynamic layout problemComputers & Operations Research, 2001
- Genetic search and the dynamic layout problemComputers & Operations Research, 2000
- Genetic search and the dynamic facility layout problemComputers & Operations Research, 1994
- A facility layout method for flexible manufacturing systems∗International Journal of Production Research, 1993
- Zoning in Forest Management: a Quadratic Assignment Problem Solved by Simulated AnnealingJournal of Environmental Management, 1993
- An Auction Algorithm for Shortest PathsSIAM Journal on Optimization, 1991
- A Heuristic Algorithm and Simulation Approach to Relative Location of FacilitiesManagement Science, 1963