✦ LIBER ✦

Speed-up simulated annealing by parallel coordinates

✍ Scribed by Hong Ye; Zhiping Lin

Book ID: 108116930
Publisher: Elsevier Science
Year: 2006
Tongue: English
Weight: 231 KB
Volume: 173
Category: Article
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2005.01.039

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Unit commitment by parallel simulated an

Unit commitment by parallel simulated annealing

✍ Annakkage, U.D.; Numnonda, T.; Pahalawaththa, N.C. 📂 Article 📅 1995 🏛 The Institution of Electrical Engineers 🌐 English ⚖ 724 KB

Speeding up Fault Simulation using Paral

Speeding up Fault Simulation using Parallel Fault Simulation

✍ Jiahua Fan; Zhifeng Zhang 📂 Article 📅 2011 🏛 Elsevier 🌐 English ⚖ 334 KB

Parallel Simulated Annealing by Mixing o

Parallel Simulated Annealing by Mixing of States

✍ King-Wai Chu; Yuefan Deng; John Reinitz 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 109 KB

We report the results of testing the performance of a new, efficient, and highly general-purpose parallel optimization method, based upon simulated annealing. This optimization algorithm was applied to analyze the network of interacting genes that control embryonic development and other fundamental

Trading accuracy for speed in parallel s

Trading accuracy for speed in parallel simulated annealing with simultaneous moves

✍ M.D. Durand; Steve R. White 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 155 KB

A common approach to parallelizing simulated annealing is to generate several perturbations to the current solution simultaneously, requiring synchronization to guarantee correct evaluation of the cost function. The cost of this synchronization may be reduced by allowing inaccuracies in the cost cal

Multi-objective optimization of high-spe

Multi-objective optimization of high-speed milling with parallel genetic simulated annealing

✍ Z. G. Wang; Y. S. Wong; M. Rahman; J. Sun 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 305 KB

Optimization of job scheduling on parall

Optimization of job scheduling on parallel machines by simulated annealing algorithms

✍ Zhen-Ping Lo; B. Bavarian 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 536 KB

ln this paper, we consider the problem of scheduling a set of simultaneously available jobs on several parallel machines. Specifically, the minimization of the time to finish all the jobs assigned to all machines under job deadline constraints for n jobs, m machines problem is formulated in this pap