Close

1. Identity statement
Reference TypeConference Paper (Conference Proceedings)
Sitemtc-m16b.sid.inpe.br
Holder Codeisadg {BR SPINPE} ibi 8JMKD3MGPCW/3DT298S
Repositorydpi.inpe.br/ce@80/2007/01.15.05.58   (restricted access)
Last Update2007:04.09.14.42.30 (UTC) administrator
Metadata Repositorydpi.inpe.br/ce@80/2007/01.15.05.58.27
Metadata Last Update2018:06.05.03.33.44 (UTC) administrator
Citation KeyNanJianYipi:2007:SiAnAl
TitleA Simulated Annealing Algorithm based on Parallel Cluster for Engineering Layout Design
FormatPrint; CD-ROM; On-line.
Year2007
Access Date2024, Apr. 28
Secondary TypeCI
Number of Files3
Size3059 KiB
2. Context
Author1 Nan, Li
2 Jianzhong, Cha
3 Yiping, Lu
Affiliation1 School of Mechanical Electronic and Control Engineering,Beijing Jiaotong University
2 School of Mechanical Electronic and Control Engineering,Beijing Jiaotong University
3 School of Mechanical Electronic and Control Engineering,Beijing Jiaotong University
Author e-Mail Address1 06116257@bjtu.edu.cn
2 jzcha@center.njtu.edu.cn
3 yplu@center.njtu.edu.cn
EditorLoureiro, Geilson
Curran, Ricky
e-Mail Address06116257@bjtu.edu.cn
Conference NameISPE International Conference on Concurrent Engineering, 14 (CE 2007).
Conference LocationSão Jos¡¡¡§¬¦ dos Campos
Date2007, July 16-20
PublisherInstituto Nacional de Pesquisas Espaciais (INPE)
Publisher CitySão José dos Campos
Pages81-87
Book TitleProceedings
OrganizationInstituto Nacional de Pesquisas Espaciais (INPE)
History (UTC)2007-03-05 12:54:23 :: 06116257@bjtu.edu.cn -> ce2007 ::
2007-03-07 19:15:20 :: ce2007 -> 06116257@bjtu.edu.cn ::
2007-03-20 03:43:47 :: 06116257@bjtu.edu.cn -> ce2007 ::
2007-03-30 13:38:32 :: ce2007 -> 06116257@bjtu.edu.cn ::
2007-04-09 03:50:10 :: 06116257@bjtu.edu.cn -> ce2007 ::
2007-04-12 21:44:38 :: ce2007 -> administrator ::
2007-05-18 15:20:45 :: administrator -> ce2007 ::
2007-05-21 14:36:20 :: ce2007 -> administrator ::
2007-12-04 15:45:44 :: administrator -> 06116257@bjtu.edu.cn ::
2007-12-04 19:49:56 :: 06116257@bjtu.edu.cn -> administrator ::
2018-06-05 03:33:44 :: administrator -> marciana :: 2007
3. Content and structure
Is the master or a copy?is the master
Content Stagecompleted
Transferable1
KeywordsCollaboration engineering
Simulated Annealing Algorithm
Layout
Parallel computing
AbstractAs a kind of heuristic algorithm, simulated annealing algorithm is usually used in engineering layout design. But because of a lot of shortcomings, such as inefficiency, simulated annealing algorithm will spend much time in solving a layout design question to complex mechanical products. Moreover, a lot of professional knowledge and expertise are required in practical layout design. So itfs limited to use simulated annealing algorithm in practical engineering. A Simulated Annealing Algorithm based on parallel cluster, and its application in optimal design for layout is presented. With the thinking of parallel cluster computing, ameliorative algorithm will be superior to the general simulated annealing algorithm. Because of the randomicity, the temperature of simulated annealing algorithm can be divided into small pieces, and each piece can be computed on different computer in LAN. We will collect results on current stage from every computer, so that we can get the best conclusion after comparing them. Then, the condition of computers in LAN will be adjusted in order to continue with a better point. The best number of computers which join in computing in the LAN and the best size of the temperature pieces are discussed, and the conclusion will be given. Mixing Message Passing Interface (MPI) and Visual C++, we will integrate Simulated Annealing Algorithm based on Parallel Cluster and Engineering Layout Design Support System. The layout object model and the process model of layout design are shared. Restraint and space of layout are defined. So the optimal algorithm, knowledge based on engineering and human computer interaction can be integrated in work. A simple object 3D model based on XMLieXtensible Markup Languagejis developed to fit for the message translation. A grid server search strategy about computing resource based on Parallel Cluster is added in the algorithm, and a scheduling strategy based on remanent power of CPU resource is presented. The dynamic scheduling of computing power can fit for various internet environments and different nodes conditions. The cost of waiting time during synchronous process can be reduced. An engineering example about vehicle dynamical cabin layout design is presented to test validity of Simulated Annealing Algorithm based on parallel cluster. The result of testing shows that the computing time can be reduced more than 20%, if appropriate temperature piece is chosen and seemly number of nodes is used. The integration of Simulated Annealing Algorithm based on parallel cluster and Engineering Layout Design Support System works with high efficiency, and it is convenient for engineers to use. The design process can be shortened.
AreaETES
TypeSystems Architecting
doc Directory Contentaccess
source Directory Content
paper.doc 20/03/2007 11:34 1.6 MiB
paper.pdf 20/03/2007 11:34 123.9 KiB 
agreement Directory Contentthere are no files
4. Conditions of access and use
Languageen
Target Filepaper.pdf
User Group06116257@bjtu.edu.cn
administrator
administrator
Visibilityshown
Read Permissiondeny from all and allow from 150.163
5. Allied materials
Host Collectionlcp.inpe.br/ignes/2004/02.12.18.39
cptec.inpe.br/walmeida/2003/04.25.17.12
6. Notes
Mark1
Empty Fieldsarchivingpolicy archivist callnumber contenttype copyholder copyright creatorhistory descriptionlevel dissemination documentstage doi edition group identifier isbn issn label lineage mirrorrepository nextedition nexthigherunit notes numberofvolumes orcid parameterlist parentrepositories previousedition previouslowerunit progress project readergroup resumeid rightsholder schedulinginformation secondarydate secondarykey secondarymark serieseditor shorttitle sponsor tertiarymark tertiarytype url versiontype volume
7. Description control
e-Mail (login)marciana
update 


Close