• Aucun résultat trouvé

18 résultats avec le mot-clé: 'solving simple plant location problem genetic algorithm'

Solving the simple plant location problem by genetic algorithm

The randomly generated large-scale SPLP instances MO, MP, MQ, MR, MS and MT are produced by authors. The sum S i denotes a cumulative cost of all customer demands only from

Protected

N/A

16
0
0
2022
Book Creator. Connection avec Google Chrome en tant qu enseignant(e):

Ils pourront lire tous les livres de la bibliothèque, mais ils ne pourront pas modifier un livre créé par un prof. Ils pourront créer un

Protected

N/A

6
0
0
2022
Discrete facility location with nonlinear facility costs

KÖRKEL, On the Exact Solution of Large-Scale Simple Plant Location Prob- lems, European Journal of Operational Research, 1989, 39, pp. PRUZAN, The Simple Plant Location Problem:

Protected

N/A

14
0
0
2022
Solving the Periodic Timetabling Problem using a Genetic Algorithm

Odijk (1996) proposes the PCG (PESP Cut Generation) algorithm to generate timetables for train operations using a mathematical model consisting of periodic

Protected

N/A

16
0
0
2021
Both experimental study and numerical modelling of the effect of temperature gradient on CO2 injection

Jérôme Corvisier, Vincent Lagneau, Emmanuel Jobard, Jérôme Sterpenich, Jacques Pironon.. To cite

Protected

N/A

2
0
0
2021
Simulation, optimization and visualization of transportation data

Another popular biologically-inspired algorithm for solving the optimization problem in the traffic light systems concerns the GA (genetic algorithms) approaches [56]. Authors

Protected

N/A

152
0
0
2021
Identification et motivations des pratiques de lissages des entreprises françaises cotées en bourse.

L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des

Protected

N/A

20
0
0
2022
Identification et motivations des pratiques de lissages des entreprises françaises cotées en bourse.

L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des

Protected

N/A

20
0
0
2021
FINITE ELEMENT APPROXIMATION OF AN OPTIMAL DESIGN PROBLEM

To avoid the shape differential calculus needed in a gradient like method for solving a shape optimization problem, we used a numerical algorithm based on genetic algorithm

Protected

N/A

9
0
0
2021
Metaheuristics for the Vehicle  Routing Problem and its

Genetic algorithm approach for multiple depot capacitated vehicle routing problem solving with heuristic improvements.. International Journal of Modeling and Simulation,

Protected

N/A

27
0
0
2022
791 III BRÈVES III

Le tissu lymphoïde associé au tractus digestif est consti- tué de tissu lymphoïde organisé (les plaques de Peyer et les follicules lymphoïdes) et de lymphocytes T mémoires

Protected

N/A

1
0
0
2021
Clone/création : suivi de, Clone/critique

Textes des formai iste s russes réunis, présentés et traduits par Tzvetan Todorov.. Préfac e de Roman

Protected

N/A

145
0
0
2021
A Randomized Local Search   Algorithm for the Machine-Part   Cell Formation Problem

[7] Tunnukij T., Hicks C., An Enhanced Grouping Genetic Algorithm for solving the cell formation problem, International Journal of Production Research (2010).. [8] Zolfaghari S.,

Protected

N/A

13
0
0
2022
Genetic algorithms for the scheduling of multiproduct batch plants within uncertain environment

This study proposed a Genetic Algorithm for the optimisation of the multiproduct batch plant scheduling problem under uncertainty. The adaptation of GA’s internal

Protected

N/A

7
0
0
2021
On the use of linear theory to estimate bottom pressure distribution under nonlinear surface waves

The red curve corresponds to the temporal bottom pressure evolution obtained in the framework of the fully nonlinear potential equations, while the green and yellow curves correspond

Protected

N/A

21
0
0
2021
An Oriented Convergent Mutation Operator for Solving a Scalable Convergent Demand Responsive Transport Problem

This paper presents a method for solving the convergence demand responsive transport problem, by using a stochastic approach based on a steady state genetic algorithm for enumerating

Protected

N/A

7
0
0
2021

Télécharger plus de documents et télécharger des études de documentation immédiatement !