Falkenauer, E., 1998. Genetic algorithms and grouping prob- lems. John Wiley & Sons, New York.Genetic Algorithms and Grouping Problems - Falkenauer - 1998 () Citation Context ...approach requires a very low computing time compared to the number of local search iterations. It seems to be ...
Among these metaheuristics, Genetic Algorithms (GA) are very popular (Goldberg, 1989). GAs explore the search space by using the Darwinian principles of natural selection. Due to their success in solving a wide variety of problems, several researchers have applied GA on GPP. However, only a ...
A hybrid grouping genetic algorithm for the inventory routing problem with multi-tours of the vehicleMeta-heuristic and heuristics algorithmsIn this paper we analyse the inventory routing model as described recently by Aghezaff et al. in which the work of each vehicle can be organized in multi-...
The problem is solved exactly for up to six demands (12 nodes), and GA is used for larger problems with more than six demands. The proposed GA can solve a pickup and delivery problem in an extremely short time compared with the exact solution procedure. It also produces excellent results ...
This scheduling problem is known to be NP-hard, and methodsbased on heuristic search have been proposed to obtain optimal and suboptimal solutions.Genetic algorithms have recently received much attention as a class of robust stochasticsearch algorithms for various optimization problems. In this paper,...
A genetic algorithm (GA) is a search technique used in computing to find exact or approximate solutions to optimization and search problems. Genetic algorithms are categorized as global search heuristi ...
Knolle and D. S. Spiegel 摘要: The purpose of this paper is to explore the computational performance of several hybrid algorithms that are extensions of a basic genetic algorithm (GA) approach for solving the set covering problem (SCP). We start by making several enhancements to a GA for ...
The present paper describes an adaptation of genetic algorithms in the design of large-scale multidisciplinary optimization problems. A hingeless composite... J Lee,P Hajela - 《Journal of Aircraft》 被引量: 159发表: 1995年 The Design and Manufacture of Biomedical Surfaces Surfaces are the primary...
We formalize the material ordering and cutting problem faced by this industry and propose a grouping genetic algorithm, called CPG EA, for efficiently controlling the relevant costs. We test the quality of CPG EA in various ways. Three sets of simulated problems with known optimal solutions are ...
The simulation results, show that IRRWSGA has better search performance than both IGA and standard genetic algorithms in terms of both time and quality of the schedule. IRRWSGA improves the reliability in the selection process and produces an enhanced solution. Fast reduction of makespan is a ...