𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A genetic algorithm for the optimal sequential partitioning problem

✍ Scribed by Hajime Araki; Taichi Kaji; Masahito Yamamoto; Keiji Suzuki; Azuma Ohuchi

Publisher
John Wiley and Sons
Year
2001
Tongue
English
Weight
153 KB
Volume
135
Category
Article
ISSN
0424-7760

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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 πŸ‘ 2 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

Hybrid Genetic Algorithms for a Rosterin
Hybrid Genetic Algorithms for a Rostering Problem
✍ A. Monfroglio πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 676 KB

Hybrid Genetic Algorithms are described for a large-size real-life rostering problem (railway workers' job scheduling and roster optimization). The new algorithm uses an order-based representation which encodes as a chromosome the list of job units to schedule. First, a greedy algorithm is considere

MOCell: A cellular genetic algorithm for
MOCell: A cellular genetic algorithm for multiobjective optimization
✍ Antonio J. Nebro; Juan J. Durillo; Francisco Luna; BernabΓ© Dorronsoro; Enrique A πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 298 KB

This paper introduces a new cellular genetic algorithm for solving multiobjective continuous optimization problems. Our approach is characterized by using an external archive to store nondominated solutions and a feedback mechanism in which solutions from this archive randomly replace existing indiv