✦ LIBER ✦

An efficient solution method for Weber problems with barriers based on genetic algorithms

✍ Scribed by M. Bischoff; K. Klamroth

Book ID: 108118055
Publisher: Elsevier Science
Year: 2007
Tongue: English
Weight: 357 KB
Volume: 177
Category: Article
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2005.10.061

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Ant colony algorithm based on genetic me

Ant colony algorithm based on genetic method for continuous optimization problem

✍ Jing-wei Zhu; Pei-sheng Meng; Cheng Wang 📂 Article 📅 2007 🏛 Chinese Electronic Periodical Services 🌐 English ⚖ 987 KB

An efficient solution algorithm for solv

An efficient solution algorithm for solving multi-class reliability-based traffic assignment problem

✍ Bi Yu Chen; William H.K. Lam; Agachai Sumalee; Hu Shao 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 449 KB

An efficient genetic algorithm for hybri

An efficient genetic algorithm for hybrid flow shop scheduling with multiprocessor task problems

✍ Orhan Engin; Gülşad Ceran; Mustafa K. Yilmaz 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 219 KB

Genetic algorithm based on simplex metho

Genetic algorithm based on simplex method for solving linear-quadratic bilevel programming problem

✍ Guangmin Wang; Zhongping Wan; Xianjia Wang; Yibing Lv 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 257 KB

An agent-based parallel approach for the

An agent-based parallel approach for the job shop scheduling problem with genetic algorithms

✍ Leila Asadzadeh; Kamran Zamanifar 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 599 KB

An agent-based parallel approach for the

An agent-based parallel approach for the job shop scheduling problem with genetic algorithms

✍ Leila Asadzadeh; Kamran Zamanifar 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 599 KB

The job shop scheduling problem is one of the most important and complicated problems in machine scheduling. This problem is characterized as NP-hard. The high complexity of the problem makes it hard to find the optimal solution within reasonable time in most cases. Hence searching for approximate s