𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A hybrid genetic/optimization algorithm for a task allocation problem

✍ Scribed by Atidel Ben Hadj-Alouane; James C. Bean; Katta G. Murty

Publisher
Springer US
Year
1999
Tongue
English
Weight
117 KB
Volume
2
Category
Article
ISSN
1094-6136

No coin nor oath required. For personal study only.

✦ Synopsis

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 that can handle all the tasks. We compare the performances of a genetic algorithm, a commercial 0}1 integer programming software and a hybrid approach from the literature, in solving real instances of the problem.

πŸ“œ SIMILAR VOLUMES

Solving a timetabling problem using hybr
Solving a timetabling problem using hybrid genetic algorithms
✍ Lars Vestergaard Kragelund πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 179 KB πŸ‘ 2 views

All over the world, human resources are used on all kinds of different scheduling problems, many of which are time-consuming and tedious. Scheduling tools are thus very welcome. This paper presents a research project, where Genetic Algorithms (GAs) are used as the basis for solving a timetabling pro

FDTD genetic algorithm for antenna optim
FDTD genetic algorithm for antenna optimization
✍ D. Eclercy; A. Reineix; B. Jecko πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 140 KB πŸ‘ 1 views

reflections of y18 to y24 dB were observed for cases 1 and 2, and y16 and y20 dB for case 3. Our results indicate that the effect of RF microwave loss of the metal structures for the three cases above is clearly negligible. ## III. CONCLUSION In summary, a TirAurTi structure was found, by compari

A genetic algorithm methodology for comp
A genetic algorithm methodology for complex scheduling problems
✍ Bryan A. Norman; James C. Bean πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 79 KB πŸ‘ 2 views

This paper considers the scheduling problem to minimize total tardiness given multiple machines, ready times, sequence dependent setups, machine downtime and scarce tools. We develop a genetic algorithm based on random keys representation, elitist reproduction, Bernoulli crossover and immigration ty

Multi-objective highway alignment optimi
Multi-objective highway alignment optimization using a genetic algorithm
✍ Avijit Maji; Manoj K. Jha πŸ“‚ Article πŸ“… 2009 πŸ› Institute for Transportation Inc. 🌐 English βš– 167 KB

## Abstract The available highway alignment optimization algorithms use the total cost as the objective function. This is a single objective optimization process. In this process, travel‐time, vehicle operation accident earthwork land acquisition and pavement construction costs are the basic compon

A genetic algorithm for sequencing type
A genetic algorithm for sequencing type problems in engineering design
✍ Min-Wei Huang; Ching C. Hsieh; Jasbir S. Arora πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 165 KB πŸ‘ 1 views

A genetic algorithm for engineering applications that involve sequencing of operations is proposed and demonstrated. Such applications are known as travelling salesman problems in operations research literature. The proposed algorithm uses some new operators that are different from those typically u