The quadratic multiple knapsack problem extends the quadratic knapsack problem with K knapsacks, each with its own capacity Ck. A greedy heuristic fills the knapsacks one at a tim...
A problem of assigning cooperating uninhabited aerial vehicles to perform multiple tasks on multiple targets is posed as a new combinatorial optimization problem. A genetic algori...
Tal Shima, Steven J. Rasmussen, Andrew G. Sparks, ...
—Genetic algorithm (GA) is too dependent on the initial population and a lack of local search ability. In this paper, an improved greedy genetic algorithm (IGAA) is proposed to o...
Assembly line balancing problem (ALBP) means assigning a series of task elements to uniform sequential stations under certain restrictions. This paper considers a special type of ...
Abstract. Nowadays genetic algorithms stand as a trend to solve NPcomplete and NP-hard problems. In this paper, we present a new hybrid metaheuristic which uses Parallel Genetic Al...