Abstract
In this paper, machines are allocated in horizontal rows along sides of an automated guided vehicle path so that the total cost of material transportation between machines is optimised. The problems of locating machines in single, double and multi-row layouts are addressed. Different layout arrangements as well as random permutations of machines are obtained using a simple construction algorithm, then the search for optimal solution and the best machine arrangements is obtained by implementing both Ant Colony and Simulated Annealing algorithms. Computational test examples show that the proposed method provides the best-known solutions for the single-row and double-row layout problems. Furthermore, experimental results demonstrate that both algorithms provide identical solutions for the single and multi-row layout problems.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Computer Integrated Manufacturing
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
