✦ LIBER ✦

Nature inspired genetic algorithms for hard packing problems

✍ Scribed by Philipp Rohlfshagen; John A. Bullinaria

Publisher: Springer US
Year: 2008
Tongue: English
Weight: 670 KB
Volume: 179
Category: Article
ISSN: 0254-5330
DOI: 10.1007/s10479-008-0464-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Algorithms for packing and scheduling pr

Algorithms for packing and scheduling problems

✍ Michele Monaci 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 37 KB

Comparing online algorithms for bin pack

Comparing online algorithms for bin packing problems

✍ Leah Epstein; Lene M. Favrholdt; Jens S. Kohrt 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 415 KB

A genetic algorithm for a 2D industrial

A genetic algorithm for a 2D industrial packing problem

✍ E. Hopper; B. Turton 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 415 KB

On genetic algorithms for the packing of

On genetic algorithms for the packing of polygons

✍ Stefan Jakobs 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 868 KB

Genetic algorithms for flowshop scheduli

Genetic algorithms for flowshop scheduling problems

✍ Tadahiko Murata; Hisao Ishibuchi; Hideo Tanaka 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 759 KB

Genetic algorithms for ambiguous labelli

Genetic algorithms for ambiguous labelling problems

✍ Richard Myers; Edwin R. Hancock 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 684 KB

Consistent labelling problems frequently have more than one solution. Most work in the "eld has aimed at disambiguating early in the interpretation process, using only local evidence. This paper starts with a review of the literature on labelling problems and ambiguity. Based on this review, we prop