✦ LIBER ✦

A simulated annealing and hill-climbing algorithm for the traveling tournament problem

✍ Scribed by A. Lim; B. Rodrigues; X. Zhang

Book ID: 111712867
Publisher: Elsevier Science
Year: 2006
Tongue: English
Weight: 217 KB
Volume: 174
Category: Article
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2005.02.065

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A simulated annealing approach to the tr

A simulated annealing approach to the traveling tournament problem

✍ A. Anagnostopoulos; L. Michel; P. Van Hentenryck; Y. Vergados 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 421 KB

A 2.75-approximation algorithm for the u

A 2.75-approximation algorithm for the unconstrained traveling tournament problem

✍ Shinji Imahori,Tomomi Matsui,Ryuhei Miyashiro 📂 Article 📅 2012 🏛 Springer US 🌐 English ⚖ 395 KB

A simulated annealing algorithm for the

A simulated annealing algorithm for the clustering problem

✍ Shokri Z. Selim; K. Alsultan 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 497 KB

A quantitative analysis of the simulated

A quantitative analysis of the simulated annealing algorithm: A case study for the traveling salesman problem

✍ Emile H. L. Aarts; Jan H. M. Korst; Peter J. M. van Laarhoven 📂 Article 📅 1988 🏛 Springer 🌐 English ⚖ 1013 KB

A Simulated Annealing Genetic Algorithm

A Simulated Annealing Genetic Algorithm for the Electrical Power Districting Problem

✍ Paul K. Bergey; Cliff T. Ragsdale; Mangesh Hoskote 📂 Article 📅 2003 🏛 Springer US 🌐 English ⚖ 371 KB

Productivity model for the cell formatio

Productivity model for the cell formation problem: A simulated annealing algorithm

✍ A.I. Abdelmola; S.M. Taboun 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 265 KB

A mathematical programming model is developed to identify machine groups and part families simultaneously using total productivity and an efficient simulated annealing algorithm is developed to solve large-seale problems. The test problem results showed the superiority of the algorithm over the math