✦ LIBER ✦

Using Artificial Intelligence Techniques for Large Scale Set Partitioning Problems

✍ Scribed by Musa Peker; Baha Sen; Safak Bayir

Book ID: 116847871
Publisher: Elsevier
Year: 2012
Weight: 369 KB
Volume: 1
Category: Article
ISSN: 2212-0173
DOI: 10.1016/j.protcy.2012.02.010

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A combined Lagrangian, linear programmin

A combined Lagrangian, linear programming, and implication heuristic for large-scale set partitioning problems

✍ A. Atamtürk; G. L. Nemhauser; M. W. P. Savelsbergh 📂 Article 📅 1996 🏛 Springer US 🌐 English ⚖ 685 KB

Given a finite ground set, a set of subsets, and costs on the subsets, the set partitioning problem is to find a minimum cost partition of the ground set. Many combinatorial optimization problems can be formulated as set partitioning problems. We present an approximation algorithm that produces high

An optimal column-generation-with-rankin

An optimal column-generation-with-ranking algorithm for very large scale set partitioning problems in traffic assignment

✍ Celso Carneiro Ribeiro; Michel Minoux; Manoel Camillo Penna 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 633 KB

Fast solution technique for large-scale

Fast solution technique for large-scale unit commitment problem using genetic algorithm

✍ Senjyu, T.; Yamashiro, H.; Shimabukuro, K.; Uezato, K.; Funabashi, T. 📂 Article 📅 2003 🏛 The Institution of Electrical Engineers 🌐 English ⚖ 354 KB

[IEEE Asia Pacific Conference and Exhibi

[IEEE Asia Pacific Conference and Exhibition of the IEEE-Power Engineering Society on Transmission and Distribution - Yokohama, Japan (6-10 Oct. 2002)] IEEE/PES Transmission and Distribution Conference and Exhibition - A fast solution technique for large scale unit commitment problem using genetic algorithm

✍ Senjyu, T.; Yamashiro, H.; Shimabukuro, K.; Uezato, K.; Finabashi, T. 📂 Article 📅 2002 🏛 IEEE 🌐 English ⚖ 354 KB