NDLI: Application of improved simulated annealing algorithm in facility layout design

Content Provider	IEEE Xplore Digital Library
Author	Qi Ji-Yang
Copyright Year	2010
Description	Author affiliation: School of Mechanical Engineering, Jiangsu University of Science and Technology, Zhenjiang 212003, China (Qi Ji-Yang)
Abstract	The design of the facility layout is an important part of the design of a manufacturing system. Whether the facility layout is proper or not has a very important effect on the performance of the manufacturing system. But for a long time, we design the facility layout based on the subjective experiences, which leads to low efficiency and high expenses. The facility layout problem is an NP-complete one, it's very difficult to find its optimum in the reasonable time, so heuristic algorithms have been proposed to solve the problem. Unfortunately, few heuristic algorithms can solve the facility layout problem efficiently. First, the paper analyzes the possibility of solving the facility layout problem using simulated annealing algorithm, points out that the efficiency of the traditional simulated annealing algorithm is low and its solution is not good because of its repeated searching. Then the traditional simulated annealing algorithm is improved through adding memory function in the searching process and is used to solve the facility layout problem. The improved simulated annealing algorithm can effectively avoid repeated searching, so the solution is better and the efficiency is higher, which is proved to be true through an example. The example also demonstrates that the improved simulated annealing algorithm is very useful in solving the combinatorial optimization problems such as the facility layout problem.
Starting Page	5224
Ending Page	5227
File Size	180002
Page Count	4
File Format	PDF
ISBN	9781424462636
e-ISBN	9787894631046
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2010-07-29
Publisher Place	China
Access Restriction	Subscribed
Rights Holder	Chinese Association of Aut
Subject Keyword	Algorithm design and analysis Simulated Annealing Algorithm Cooling Facility Layout Layout Simulated annealing Markov processes Improved Simulated Annealing Algorithm NP-complete Problem Manufacturing systems
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Combining Metaheuristics and CSP Algorithms to Solve Sudoku

A meta-heuristic approach for the facility layout design problem.

Optimal Layout Design for Agricultural Facility Using Simulated Annealing

Improved Simulated Annealing Algorithm Solving for 0/1 Knapsack Problem

Convergence and finite-time behavior of simulated annealing

A Particle Swarm Optimization for the Single Row Facility Layout Problem

Accelerating simulated annealing for the permanent and combinatorial counting problems (2006).

Accelerating simulated annealing for the permanent and combinatorial counting problems.

Accelerating Simulated Annealing for the Permanent and Combinatorial Counting Problems

Application of improved simulated annealing algorithm in facility layout design

Similar Documents

Combining Metaheuristics and CSP Algorithms to Solve Sudoku

A meta-heuristic approach for the facility layout design problem.

Optimal Layout Design for Agricultural Facility Using Simulated Annealing

Improved Simulated Annealing Algorithm Solving for 0/1 Knapsack Problem

Convergence and finite-time behavior of simulated annealing

A Particle Swarm Optimization for the Single Row Facility Layout Problem

Accelerating simulated annealing for the permanent and combinatorial counting problems (2006).

Accelerating simulated annealing for the permanent and combinatorial counting problems.

Accelerating Simulated Annealing for the Permanent and Combinatorial Counting Problems

Application of improved simulated annealing algorithm in facility layout design