期刊文献+
共找到95篇文章
< 1 2 5 >
每页显示 20 50 100
Scheduling on tractor and trailer transportation considering the influence of disrupted events based on the contract net and simulated annealing algorithm
1
作者 Qi Xu Yongmei Zhong +2 位作者 Hailun Deng Xiang Wang Xingyue Chen 《Digital Transportation and Safety》 2024年第3期155-168,共14页
To provide a much more resilient transport scheme for tractor and trailer transportation systems,this paper explores the generation method of tractor and trailer transport schemes considering the influence of disrupte... To provide a much more resilient transport scheme for tractor and trailer transportation systems,this paper explores the generation method of tractor and trailer transport schemes considering the influence of disrupted events.Three states of tractors including towing loaded trailers,towing empty trailers,and idle driving are taken into account.Based on the disruption management theory,a scheduling model is constructed to minimize the total deviation cost including transportation time,transportation path,and number of used vehicles under the three states of tractors.A heuristics based on the contract net and simulated annealing algorithm is designed to solve the proposed model.Through comparative analysis of examples with different numbers of newly added transportation tasks and different types of road networks,the performance of the contract net algorithm in terms of deviations in idle driving paths,empty trailer paths,loaded trailer paths,time,number of used vehicles,and total deviation cost are analyzed.The results demonstrate the effectiveness of the model and algorithm,highlighting the superiority of the disruption management model and the contract net annealing algorithm.The study provides a reference for handling unexpected events in the tractor and trailer transportation industry. 展开更多
关键词 Tractor and trailer transportation Disrupted event Hub-and-spoke network Disruption management Contract net and simulated annealing algorithm
在线阅读 下载PDF
Study on Multi-stream Heat Exchanger Network Synthesis with Parallel Genetic/Simulated Annealing Algorithm 被引量:13
2
作者 魏关锋 姚平经 +1 位作者 LUOXing ROETZELWilfried 《Chinese Journal of Chemical Engineering》 SCIE EI CAS CSCD 2004年第1期66-77,共12页
The multi-stream heat exchanger network synthesis (HENS) problem can be formulated as a mixed integer nonlinear programming model according to Yee et al. Its nonconvexity nature leads to existence of more than one opt... The multi-stream heat exchanger network synthesis (HENS) problem can be formulated as a mixed integer nonlinear programming model according to Yee et al. Its nonconvexity nature leads to existence of more than one optimum and computational difficulty for traditional algorithms to find the global optimum. Compared with deterministic algorithms, evolutionary computation provides a promising approach to tackle this problem. In this paper, a mathematical model of multi-stream heat exchangers network synthesis problem is setup. Different from the assumption of isothermal mixing of stream splits and thus linearity constraints of Yee et al., non-isothermal mixing is supported. As a consequence, nonlinear constraints are resulted and nonconvexity of the objective function is added. To solve the mathematical model, an algorithm named GA/SA (parallel genetic/simulated annealing algorithm) is detailed for application to the multi-stream heat exchanger network synthesis problem. The performance of the proposed approach is demonstrated with three examples and the obtained solutions indicate the presented approach is effective for multi-stream HENS. 展开更多
关键词 multi-stream heat exchanger network synthesis non-isothermal mixing mixed integer nonlinear programming model genetic algorithm simulated annealing algorithm hybrid algorithm
在线阅读 下载PDF
Simulated annealing algorithm for the optimal translation sequence of the jth agent in rough communication 被引量:5
3
作者 Wang Hongkai Guan Yanyong Xue Peijun 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2008年第3期507-512,共6页
In rough communication, because each agent has a different language and cannot provide precise communication to each other, the concept translated among multi-agents will loss some information and this results in a le... In rough communication, because each agent has a different language and cannot provide precise communication to each other, the concept translated among multi-agents will loss some information and this results in a less or rougher concept. With different translation sequences, the problem of information loss is varied. To get the translation sequence, in which the jth agent taking part in rough communication gets maximum information, a simulated annealing algorithm is used. Analysis and simulation of this algorithm demonstrate its effectiveness. 展开更多
关键词 rough sets rough communication translation sequence OPTIMAL simulated annealing algorithm.
在线阅读 下载PDF
Using genetic/simulated annealing algorithm to solve disassembly sequence planning 被引量:5
4
作者 Wu Hao Zuo Hongfu 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2009年第4期906-912,共7页
Disassembly sequence planning (DSP) plays a significant role in maintenance planning of the aircraft. It is used during the design stage for the analysis of maintainability of the aircraft. To solve product disassem... Disassembly sequence planning (DSP) plays a significant role in maintenance planning of the aircraft. It is used during the design stage for the analysis of maintainability of the aircraft. To solve product disassembly sequence planning problems efficiently, a product disassembly hybrid graph model, which describes the connection, non-connection and precedence relationships between the product parts, is established based on the characteristic of disassembly. Farther, the optimization model is provided to optimize disassembly sequence. And the solution methodology based on the genetic/simulated annealing algorithm with binaxy-tree algorithm is given. Finally, an example is analyzed in detail, and the result shows that the model is correct and efficient. 展开更多
关键词 disassembly sequence planning disassembly hybrid graph connection matrix precedence matrix binary-tree algorithms simulated annealing algorithm genetic algorithm.
在线阅读 下载PDF
Simulated annealing algorithm for detecting graph isomorphism 被引量:4
5
作者 Geng Xiutang Zhang Kai 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2008年第5期1047-1052,共6页
Evolutionary computation techniques have mostly been used to solve various optimization problems, and it is well known that graph isomorphism problem (GIP) is a nondeterministic polynomial problem. A simulated annea... Evolutionary computation techniques have mostly been used to solve various optimization problems, and it is well known that graph isomorphism problem (GIP) is a nondeterministic polynomial problem. A simulated annealing (SA) algorithm for detecting graph isomorphism is proposed, and the proposed SA algorithm is well suited to deal with random graphs with large size. To verify the validity of the proposed SA algorithm, simulations are performed on three pairs of small graphs and four pairs of large random graphs with edge densities 0.5, 0.1, and 0.01, respectively. The simulation results show that the proposed SA algorithm can detect graph isomorphism with a high probability. 展开更多
关键词 graph isomorphism problem simulated annealing algorithm nondeterministic polynomial problem local search.
在线阅读 下载PDF
Parametric optimization and performance comparison of organic Rankine cycle with simulated annealing algorithm 被引量:3
6
作者 王志奇 周乃君 +2 位作者 张家奇 郭静 王晓元 《Journal of Central South University》 SCIE EI CAS 2012年第9期2584-2590,共7页
Taking the ratio of heat transfer area to net power and heat recovery efficiency into account, a multi-objective mathematical model was developed for organic Rankine cycle (ORC). Working fluids considered were R123,... Taking the ratio of heat transfer area to net power and heat recovery efficiency into account, a multi-objective mathematical model was developed for organic Rankine cycle (ORC). Working fluids considered were R123, R134a, R141b, R227ea and R245fa. Under the given conditions, the parameters including evaporating and condensing pressures, working fluid and cooling water velocities were optimized by simulated annealing algorithm. The results show that the optimal evaporating pressure increases with the heat source temperature increasing. Compared with other working fluids, R123 is the best choice for the temperature range of 100--180℃ and R141 b shows better performance when the temperature is higher than 180 ℃. Economic characteristic of system decreases rapidly with the decrease of heat source temperature. ORC system is uneconomical for the heat source temperature lower than 100℃. 展开更多
关键词 parametric optimization organic Rankine cycle simulated annealing algorithm working fluid low-temperature source
在线阅读 下载PDF
Optimization of the seismic processing phase-shift plus finite-difference migration operator based on a hybrid genetic and simulated annealing algorithm 被引量:2
7
作者 Luo Renze Huang Yuanyi +2 位作者 Liang Xianghao Luo Jun Cao Ying 《Petroleum Science》 SCIE CAS CSCD 2013年第2期190-194,共5页
Although the phase-shift seismic processing method has characteristics of high accuracy, good stability, high efficiency, and high-dip imaging, it is not able to adapt to strong lateral velocity variation. To overcome... Although the phase-shift seismic processing method has characteristics of high accuracy, good stability, high efficiency, and high-dip imaging, it is not able to adapt to strong lateral velocity variation. To overcome this defect, a finite-difference method in the frequency-space domain is introduced in the migration process, because it can adapt to strong lateral velocity variation and the coefficient is optimized by a hybrid genetic and simulated annealing algorithm. The two measures improve the precision of the approximation dispersion equation. Thus, the imaging effect is improved for areas of high-dip structure and strong lateral velocity variation. The migration imaging of a 2-D SEG/EAGE salt dome model proves that a better imaging effect in these areas is achieved by optimized phase-shift migration operator plus a finite-difference method based on a hybrid genetic and simulated annealing algorithm. The method proposed in this paper is better than conventional methods in imaging of areas of high-dip angle and strong lateral velocity variation. 展开更多
关键词 Migration operator phase-shift plus finite-difference hybrid algorithm genetic andsimulated annealing algorithm optimization coefficient
在线阅读 下载PDF
Structural optimization and segregation behavior of quaternary alloy nanoparticles based on simulated annealing algorithm 被引量:1
8
作者 陆欣泽 邵桂芳 +2 位作者 许两有 刘暾东 文玉华 《Chinese Physics B》 SCIE EI CAS CSCD 2016年第5期151-158,共8页
Alloy nanoparticles exhibit higher catalytic activity than monometallic nanoparticles, and their stable structures are of importance to their applications. We employ the simulated annealing algorithm to systematically... Alloy nanoparticles exhibit higher catalytic activity than monometallic nanoparticles, and their stable structures are of importance to their applications. We employ the simulated annealing algorithm to systematically explore the stable structure and segregation behavior of tetrahexahedral Pt–Pd–Cu–Au quaternary alloy nanoparticles. Three alloy nanoparticles consisting of 443 atoms, 1417 atoms, and 3285 atoms are considered and compared. The preferred positions of atoms in the nanoparticles are analyzed. The simulation results reveal that Cu and Au atoms tend to occupy the surface, Pt atoms preferentially occupy the middle layers, and Pd atoms tend to segregate to the inner layers. Furthermore, Au atoms present stronger surface segregation than Cu ones. This study provides a fundamental understanding on the structural features and segregation phenomena of multi-metallic nanoparticles. 展开更多
关键词 alloy nanoparticle simulated annealing algorithm structural stability SEGREGATION
在线阅读 下载PDF
Optimal design of hydraulic manifold blocks based on niching genetic simulated annealing algorithm 被引量:1
9
作者 贾春强 Yu Ling +1 位作者 Tian Shujun Gao Yanming 《High Technology Letters》 EI CAS 2007年第4期363-368,共6页
To solve the combinatorial optimization problem of outer layout and inner connection integrated schemes in the design of hydraulic manifold blocks ( HMB), a hybrid genetic simulated annealing algo- rithm based on ni... To solve the combinatorial optimization problem of outer layout and inner connection integrated schemes in the design of hydraulic manifold blocks ( HMB), a hybrid genetic simulated annealing algo- rithm based on niche technology is presented. This hybrid algorithm, which combines genetic algorithm, simulated annealing algorithm and niche technology, has a strong capability in global and local search, and all extrema can be found in a short time without strict requests for preferences. For the complex restricted solid spatial layout problems in HMB, the optimizing mathematical model is presented. The key technologies in the integrated layout and connection design of HMB, including the realization of coding, annealing operation and genetic operation, are discussed. The framework of HMB optimal design system based on hybrid optimization strategy is proposed. An example is given to testify the effectiveness and feasibility of the algorithm. 展开更多
关键词 hydraulic manifold blocks (HMB) NICHE genetic annealing algorithm optimization design
在线阅读 下载PDF
An Improved Multi-Objective Hybrid Genetic-Simulated Annealing Algorithm for AGV Scheduling under Composite Operation Mode
10
作者 Jiamin Xiang Ying Zhang +1 位作者 Xiaohua Cao Zhigang Zhou 《Computers, Materials & Continua》 SCIE EI 2023年第12期3443-3466,共24页
This paper presents an improved hybrid algorithm and a multi-objective model to tackle the scheduling problem of multiple Automated Guided Vehicles(AGVs)under the composite operation mode.The multi-objective model aim... This paper presents an improved hybrid algorithm and a multi-objective model to tackle the scheduling problem of multiple Automated Guided Vehicles(AGVs)under the composite operation mode.The multi-objective model aims to minimize the maximum completion time,the total distance covered by AGVs,and the distance traveled while empty-loaded.The improved hybrid algorithm combines the improved genetic algorithm(GA)and the simulated annealing algorithm(SA)to strengthen the local search ability of the algorithm and improve the stability of the calculation results.Based on the characteristics of the composite operation mode,the authors introduce the combined coding and parallel decoding mode and calculate the fitness function with the grey entropy parallel analysis method to solve the multi-objective problem.The grey entropy parallel analysis method is a combination of the grey correlation analysis method and the entropy weighting method to solve multi-objective solving problems.A task advance evaluation strategy is proposed in the process of crossover and mutation operator to guide the direction of crossover and mutation.The computational experiments results show that the improved hybrid algorithm is better than the GA and the genetic algorithm with task advance evaluation strategy(AEGA)in terms of convergence speed and solution results,and the effectiveness of the multi-objective solution is proved.All three objectives are optimized and the proposed algorithm has an optimization of 7.6%respectively compared with the GA and 3.4%compared with the AEGA in terms of the objective of maximum completion time. 展开更多
关键词 AGV scheduling composite operation mode genetic algorithm simulated annealing algorithm task advance evaluation strategy
在线阅读 下载PDF
Application of simulated annealing algorithm to improve work roll wear model in plate mills
11
作者 LinSun QingdongZhang 《Journal of University of Science and Technology Beijing》 CSCD 2002年第3期224-227,共4页
Employing Simulated Annealing Algorithm (SAA) and many measured data, acalculation model of work roll wear was built in the 2 800 mm 4-high mill of Wuhan Iron and Steel(Group) Co. (WISCO). The model was a semi-theory ... Employing Simulated Annealing Algorithm (SAA) and many measured data, acalculation model of work roll wear was built in the 2 800 mm 4-high mill of Wuhan Iron and Steel(Group) Co. (WISCO). The model was a semi-theory practical formula. Its pattern and magnitude werestill hardly defined with classical optimization methods. But the problem could be resolved by SAA.It was pretty high precision to predict the values for the wear profiles of work roll in a rollingunit. After one-year application, the results show that the model is feasible in engineering, and itcan be applied to predict the wear profiles of work roll in other mills. 展开更多
关键词 plate mill work roll wear simulated annealing algorithm profile andflatness
在线阅读 下载PDF
Research on the Applications of Cyclic Water Quality Model and Simulated Annealing Algorithm for Water Pollution Control and Planning
12
作者 Dong Jinping 《International Journal of Technology Management》 2015年第7期1-3,共3页
With the progress of computer technology, water pollution control and planning has been a hot topic in the scientific community. This paper discusses corresponding research on the applications of cyclic water quality ... With the progress of computer technology, water pollution control and planning has been a hot topic in the scientific community. This paper discusses corresponding research on the applications of cyclic water quality model and simulated annealing algorithm for water pollution control and planning. Environmental engineering education has been the focus of much attention in recent years. Teaching methods of water pollution control and sustainable teaching innovation and creation was explored by many scholars, and the majority of workers engaged in teaching the course. The simulation result proves the effectiveness of the method. We plan to conduct more research in the future research to obtain better research result. 展开更多
关键词 Cyclic Water Quality Simulated annealing algorithm Water Pollution Control.
在线阅读 下载PDF
Effects of T-Factor on Quantum Annealing Algorithms for Integer Factoring Problem
13
作者 Zhiqi Liu Shihui Zheng +2 位作者 Xingyu Yan Ping Pan Licheng Wang 《Journal of Quantum Computing》 2023年第1期41-54,共14页
The hardness of the integer factoring problem(IFP)plays a core role in the security of RSA-like cryptosystems that are widely used today.Besides Shor’s quantum algorithm that can solve IFP within polynomial time,quan... The hardness of the integer factoring problem(IFP)plays a core role in the security of RSA-like cryptosystems that are widely used today.Besides Shor’s quantum algorithm that can solve IFP within polynomial time,quantum annealing algorithms(QAA)also manifest certain advantages in factoring integers.In experimental aspects,the reported integers that were successfully factored by using the D-wave QAA platform are much larger than those being factored by using Shor-like quantum algorithms.In this paper,we report some interesting observations about the effects of QAA for solving IFP.More specifically,we introduce a metric,called T-factor that measures the density of occupied qubits to some extent when conducting IFP tasks by using D-wave.We find that T-factor has obvious effects on annealing times for IFP:The larger of T-factor,the quicker of annealing speed.The explanation of this phenomenon is also given. 展开更多
关键词 Quantum annealing algorithm integer factorization problem T-factor D-WAVE
在线阅读 下载PDF
A Gradient-Simulated Annealing Algorithm of Pre-location-Based Best Fitting of Blank to Complex Surfaces Machining
14
作者 MALi-ming JIANGHong WANGXiao-chun 《Computer Aided Drafting,Design and Manufacturing》 2004年第2期57-63,共7页
The algorithm is divided into two steps. The first step pre-locates the blank by aligning its centre of gravity and approximate normal vector with those of destination surfaces, with largest overlap of projections... The algorithm is divided into two steps. The first step pre-locates the blank by aligning its centre of gravity and approximate normal vector with those of destination surfaces, with largest overlap of projections of two objects on a plane perpendicular to the normal vector. The second step is optimizing an objective function by means of gradient-simulated annealing algorithm to get the best matching of a set of distributed points on the blank and destination surfaces. An example for machining hydroelectric turbine blades is given to verify the effectiveness of algorithm. 展开更多
关键词 sculptured surface gradient-simulated annealing algorithm pre-location of blank best fitting
在线阅读 下载PDF
CNOP-P-based parameter sensitivity for double-gyre variation in ROMS with simulated annealing algorithm 被引量:3
15
作者 YUAN Shijin ZHANG Huazhen +1 位作者 LI Mi MU Bin 《Journal of Oceanology and Limnology》 SCIE CAS CSCD 2019年第3期957-967,共11页
Reducing the error of sensitive parameters by studying the parameters sensitivity can reduce the uncertainty of the model,while simulating double-gyre variation in Regional Ocean Modeling System(ROMS).Conditional Nonl... Reducing the error of sensitive parameters by studying the parameters sensitivity can reduce the uncertainty of the model,while simulating double-gyre variation in Regional Ocean Modeling System(ROMS).Conditional Nonlinear Optimal Perturbation related to Parameter(CNOP-P)is an effective method of studying the parameters sensitivity,which represents a type of parameter error with maximum nonlinear development at the prediction time.Intelligent algorithms have been widely applied to solving Conditional Nonlinear Optimal Perturbation(CNOP).In the paper,we proposed an improved simulated annealing(SA)algorithm to solve CNOP-P to get the optimal parameters error,studied the sensitivity of the single parameter and the combination of multiple parameters and verified the effect of reducing the error of sensitive parameters on reducing the uncertainty of model simulation.Specifically,we firstly found the non-period oscillation of kinetic energy time series of double gyre variation,then extracted two transition periods,which are respectively from high energy to low energy and from low energy to high energy.For every transition period,three parameters,respectively wind amplitude(WD),viscosity coefficient(VC)and linear bottom drag coefficient(RDRG),were studied by CNOP-P solved with SA algorithm.Finally,for sensitive parameters,their effect on model simulation is verified.Experiments results showed that the sensitivity order is WD>VC>>RDRG,the effect of the combination of multiple sensitive parameters is greater than that of single parameter superposition and the reduction of error of sensitive parameters can effectively reduce model prediction error which confirmed the importance of sensitive parameters analysis. 展开更多
关键词 parameter sensitivity DOUBLE GYRE Regional Ocean Modeling System(ROMS) CONDITIONAL Nonlinear Optimal Perturbation(CNOP-P) simulated annealing(SA)algorithm
在线阅读 下载PDF
Estimation of Mutual Coupling Coefficient of the Array by Simulated Annealing Algorithm 被引量:1
16
作者 GAO Huo-tao ZHENG Xia LI Yong-xu 《Wuhan University Journal of Natural Sciences》 CAS 2005年第6期1000-1004,共5页
We propose a method for estimating the mutual coupling coefficient among antennas in this paper which is based on the principle of signal subspace and the simulated annealing (SA) algorithm. The computer simulation ... We propose a method for estimating the mutual coupling coefficient among antennas in this paper which is based on the principle of signal subspace and the simulated annealing (SA) algorithm. The computer simulation has been conducted to illustrate the' excellent performance of this method and to demonstrate that it is statistically efficient. The benefit of this new method is that calibration signals and unknown signals can be received simultaneously, during the course of calibration. 展开更多
关键词 mutual coupling coefficient from array estimation of mutual coupling coefficient simulated annealing(SA) algorithm
在线阅读 下载PDF
Coherent Doppler lidar wind retrieval for a typhoon based on the genetic simulated annealing algorithm
17
作者 刘珍 原禄城 +6 位作者 汤杰 张云鹏 刘继桥 竹孝鹏 杨巨鑫 时伟 陈卫标 《Chinese Optics Letters》 SCIE EI CAS CSCD 2024年第4期1-7,共7页
A method of spectrum estimation based on the genetic simulated annealing(GSA)algorithm is proposed,which is applied to retrieve the three-dimensional wind field of typhoon Nangka observed by our research group.Compare... A method of spectrum estimation based on the genetic simulated annealing(GSA)algorithm is proposed,which is applied to retrieve the three-dimensional wind field of typhoon Nangka observed by our research group.Compared to the genetic algorithm(GA),the GSA algorithm not only extends the detection range and guarantees the accuracy of retrieval results but also demonstrates a faster retrieval speed.Experimental results indicate that both the GA and GSA algorithms can enhance the detection range by 35%more than the least squares method.However,the convergence speed of the GSA algorithm is 17 times faster than that of the GA,which is more beneficial for real-time data processing. 展开更多
关键词 coherent Doppler lidar three-dimensional wind field retrieval genetic simulated annealing algorithm spectrum estimation TYPHOON
原文传递
Compound Genetics Annealing Optimal Algorithm for Realization of Locus Deduction of a Plane Link 被引量:1
18
作者 林晓通 林晓辉 +1 位作者 黄卫 王宁生 《Journal of Southeast University(English Edition)》 EI CAS 2002年第4期310-314,共5页
A compound algorithm of genetic annealing is designed for optimizing the luffing mechanism locus of a plane link by means of random optimal algorithm, genetic and annealing algorithm. The computing experiment shows th... A compound algorithm of genetic annealing is designed for optimizing the luffing mechanism locus of a plane link by means of random optimal algorithm, genetic and annealing algorithm. The computing experiment shows that the algorithm has much better steady convergence performance of optimal process and can hunt out the global optimal solution by biggish probability for objective function of multi peak value. 展开更多
关键词 genetic annealing algorithm luffing mechanism optimal algorithm
在线阅读 下载PDF
Low Power Polarity Conversion Based on the Whole Annealing Genetic Algorithm 被引量:4
19
作者 汪鹏君 陆金刚 +1 位作者 陈恳 徐建 《Journal of Semiconductors》 EI CAS CSCD 北大核心 2008年第2期298-303,共6页
For an n-variable logic function,the power dissipation and area of the REED-MULLER (RM) circuit corresponding to each polarity are different. Based on the propagation algorithm of signal probability,the decompositio... For an n-variable logic function,the power dissipation and area of the REED-MULLER (RM) circuit corresponding to each polarity are different. Based on the propagation algorithm of signal probability,the decomposition algorithm of a multi-input XOR/AND gate,and the multiple segment algorithm of polarity conversion,this paper successfully applies the whole annealing genetic algorithm (WAGA) to find the best polarity of an RM circuit. Through testing eight large-scale circuits from the Microelectronics Center North Carolina (MCNC) Benchmark, the SYNOPSYS synthesis results show that the RM circuits corresponding to the best polarity found using the proposed algorithm attain average power,area,and max delay savings of 77.2% ,62.4% ,and 9.2% respectively,compared with those under polarity 0. 展开更多
关键词 whole annealing genetic algorithm REED-MULLER low power polarity conversion
在线阅读 下载PDF
A modified simulated annealing algorithm and an excessive area model for floorplanning using fixed-outline constraints 被引量:5
20
作者 De-xuan ZOU Gai-ge WANG +1 位作者 Gai PAN Hong-wei QI 《Frontiers of Information Technology & Electronic Engineering》 SCIE EI CSCD 2016年第11期1228-1244,共17页
Outline-free floorplanning focuses on area and wirelength reductions, which are usually meaningless, since they can hardly satisfy modern design requirements. We concentrate on a more difficult and useful issue, fixed... Outline-free floorplanning focuses on area and wirelength reductions, which are usually meaningless, since they can hardly satisfy modern design requirements. We concentrate on a more difficult and useful issue, fixed-outline floorplanning. This issue imposes fixed-outline constraints on the outline-free floorplanning, making the physical design more interesting and challenging. The contributions of this paper are primarily twofold. First, a modified simulated annealing(MSA) algorithm is proposed. In the beginning of the evolutionary process, a new attenuation formula is used to decrease the temperature slowly, to enhance MSA's global searching capacity. After a period of time, the traditional attenuation formula is employed to decrease the temperature rapidly, to maintain MSA's local searching capacity. Second, an excessive area model is designed to guide MSA to find feasible solutions readily. This can save much time for refining feasible solutions. Additionally, B*-tree representation is known as a very useful method for characterizing floorplanning. Therefore, it is employed to perform a perturbing operation for MSA. Finally, six groups of benchmark instances with different dead spaces and aspect ratios—circuits n10, n30, n50, n100, n200, and n300—are chosen to demonstrate the efficiency of our proposed method on fixed-outline floorplanning. Compared to several existing methods, the proposed method is more efficient in obtaining desirable objective function values associated with the chip area, wirelength, and fixed-outline constraints. 展开更多
关键词 Fixed-outline floorplanning Modified simulated annealing algorithm Global search Excessive area model B*-tree representation
原文传递
上一页 1 2 5 下一页 到第
使用帮助 返回顶部