Zobrazeno 1 - 10
of 44
pro vyhledávání: '"Marc Gravel"'
Publikováno v:
Advances in Evolutionary Algorithms
In many industrial sectors, decision makers are faced with large and complex problems that are often multi-objective. Many of these problems may be expressed as a combinatorial optimization problem in which we define one or more objective functions t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ad803ed4ad87ae97f718fad08ad03e27
http://www.intechopen.com/articles/show/title/design_of_an_efficient_genetic_algorithm_to_solve_the_industrial_car_sequencing_problem
http://www.intechopen.com/articles/show/title/design_of_an_efficient_genetic_algorithm_to_solve_the_industrial_car_sequencing_problem
Publikováno v:
Revue générale de droit. 17:259-270
Le système d’arbitrage de différends, chez les policiers et pompiers en particulier, a été l’objet de sévères critiques ces dernières années. Malgré le stoïcisme derrière lequel les arbitres se sont jusqu’ici retranchés, pour ne pas
Publikováno v:
Heuristics for Optimization and Learning ISBN: 9783030589295
Hybridization metaheuristics can enhance algorithm performance by combining the advantages of several strategies in order to profit from the resulting synergy. Multi-objective optimization is no exception to this trend. In this paper we develop a new
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d01ea9c8b91c22f02a2b54d4841a5efa
https://doi.org/10.1007/978-3-030-58930-1_12
https://doi.org/10.1007/978-3-030-58930-1_12
Publikováno v:
Computers & Operations Research. 39:2415-2424
This paper presents a hybrid approach based on the integration between a genetic algorithm (GA) and concepts from constraint programming, multi-objective evolutionary algorithms and ant colony optimization for solving a scheduling problem. The main c
Publikováno v:
Computers & Operations Research. 39:1951-1968
In this paper, we propose a new Pareto generic algorithm, called GISMOO, which hybridizes genetic algorithm and artificial immune systems. GISMOO algorithm is generic in the sense that it can be used to solve both combinatorial and continuous optimiz
Publikováno v:
INFOR: Information Systems and Operational Research. 48:23-37
In this paper, we present three new integrative approaches for solving the classical car-sequencing problem. These hybrid approaches are essentially based on a genetic algorithm which incorporates ...
Publikováno v:
European Journal of Operational Research. 197:1185-1191
This paper studies the learning process in an ant colony optimization algorithm designed to solve the problem of ordering cars on an assembly line (car-sequencing problem). This problem has been shown to be NP-hard and evokes a great deal of interest
Publikováno v:
Journal of the Operational Research Society. 59:1077-1090
This paper compares different ant colony optimization algorithms for solving the NP-hard car-sequencing problem, which is of great practical interest. The five algorithms that are compared are the Ant System (AS), the Elitist AS, the Rank-Based AS, t
Publikováno v:
Revue d'intelligence artificielle. 22:209-235
In this paper we propose two forms of hybridization between a metaheuristic (Ant Colony Optimization or Genetic Algorithm) and an exact method (ILP) for the solution of the car sequencing problem. We examine whether such hybridizations can improve so
Publikováno v:
Journal of Heuristics. 14:313-333
Multiple objective combinatorial optimization problems are difficult to solve and often, exact algorithms are unable to produce optimal solutions. The development of multiple objective heuristics was inspired by the need to quickly produce acceptable