✦ LIBER ✦

On metaheuristic algorithms for combinatorial optimization problems

✍ Scribed by Mutsunori Yagiura; Toshihide Ibaraki

Publisher: John Wiley and Sons
Year: 2001
Tongue: English
Weight: 288 KB
Volume: 32
Category: Article
ISSN: 0882-1666
DOI: 10.1002/1520-684x(200103)32:3<33::aid-scj4>3.0.co;2-p

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Pareto simulated annealing—a metaheurist

Pareto simulated annealing—a metaheuristic technique for multiple-objective combinatorial optimization

✍ Piotr Czyzżak; Adrezej Jaszkiewicz 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 377 KB 👁 1 views

This paper presents a multiple-objective metaheuristic procedureÐPareto simulated annealing. The goal of the procedure is to find in a relatively short time a good approximation of the set of efficient solutions of a multipleobjective combinatorial optimization problem. The procedure uses a sample,

Particle swarm optimization algorithm fo

Particle swarm optimization algorithm for constrained problems

✍ Jian-Ming Zhang; Lei Xie 📂 Article 📅 2009 🏛 Wiley (John Wiley & Sons) 🌐 English ⚖ 104 KB

Optimization algorithms for bilinear mod

Optimization algorithms for bilinear model–based predictive control problems

✍ H. H. J. Bloemen; T. J. J. van den Boom; H. B. Verbruggen 📂 Article 📅 2004 🏛 American Institute of Chemical Engineers 🌐 English ⚖ 137 KB 👁 1 views

MOSA method: a tool for solving multiobj

MOSA method: a tool for solving multiobjective combinatorial optimization problems

✍ E.L. Ulungu; J. Teghem; P.H. Fortemps; D. Tuyttens 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 189 KB 👁 1 views

The success of modern heuristics (Simulated Annealing (S.A.), Tabu Search, Genetic Algorithms, . . . ) in solving classical combinatorial optimization problems has drawn the attention of the research community in multicriteria methods. In fact, for large-scale problems, the simultaneous difficultie

Radical performance enhancements for com

Radical performance enhancements for combinatorial optimization algorithms based on the dead-end elimination theorem

✍ Gordon, D. Benjamin; Mayo, Stephen L. 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 201 KB 👁 2 views

Recent advances in protein design have demonstrated the effectiveness of optimization algorithms based on the dead-end elimination theorem. The algorithms solve the combinatorial problem of finding the optimal placement of side chains for a set of backbone coordinates. Although they are powerful too

A hybrid genetic/optimization algorithm

A hybrid genetic/optimization algorithm for a task allocation problem

✍ Atidel Ben Hadj-Alouane; James C. Bean; Katta G. Murty 📂 Article 📅 1999 🏛 Springer US 🌐 English ⚖ 117 KB 👁 1 views

We consider the problem of designing a distributed computing system for handling a set of repetitive tasks on a periodic basis. Tasks assigned to di!erent processors need communication link capacity, tasks executing on the same processor do not. The aim is to develop a design of minimum total cost t