although several papers have studied no-idle scheduling problems, they all focus on flow shops, assuming one processor at each working stage. but, companies commonly extend to hybrid flow shops by duplicating machines in parallel in stages. this paper considers the problem of scheduling no-idle hybrid flow shops. a mixed integer linear programming model is first developed to mathematically form...

in this study, a hybrid intelligent model has been designed to predict groundwater inflow to a mine pit during its advance. novel hybrid method coupling artificial neural network (ann) with genetic algorithm (ga) called ann-ga, was utilised. ratios of pit depth to aquifer thickness, pit bottom radius to its top radius, inverse of pit advance time and the hydraulic head (hh) in the observation w...

in this paper, we have proposed a new algorithm which combines pso and ga in such a way that the new algorithm is more effective and efficient.the particle swarm optimization (pso) algorithm has shown rapid convergence during the initial stages of a global search but around global optimum, the search process will become very slow. on the other hand, genetic algorithm is very sensitive to the in...

in this study, a hybrid algorithm is presented to tackle multi-variables robust design problem. the proposed algorithm comprises neural networks (nns) and co-evolution genetic algorithm (cga) in which neural networks are as a function approximation tool used to estimate a map between process variables. furthermore, in order to make a robust optimization of response variables, co-evolution algor...

We describe a hybrid meta-heuristic algorithm for combinatorial optimization problems with a specific reference to the travelling salesman problem (TSP). The method is a combination of a genetic algorithm (GA) and greedy randomized adaptive search procedure (GRASP). A new adaptive fuzzy a greedy search operator is developed for this hybrid method. Computational experiments using a wide range of...

Scheduling problems play a big role in manufacturing and planning the production for increasing the production efficiency and assigning the resources to operations. Furthermore, in many manufacturing systems there is a physical space between stages that called intermediate buffers. In this study, a model is proposed for minimizing the makespan of a hybrid flow shop scheduling problem with inter...

in this paper, we present an application of evolved neural networks using a real coded genetic algorithm for simulations of monthly groundwater levels in a coastal aquifer located in the shabestar plain, iran. after initializing the model with groundwater elevations observed at a given time, the developed hybrid genetic algorithm-back propagation (ga-bp) should be able to reproduce groundwater ...

‎here‎, ‎we give a two phases algorithm based on integrating differential evolution (de) algorithm with modified hybrid genetic algorithm (mhga) for solving the associated nonlinear programming problem of a nonlinear optimal control problem‎. ‎in the first phase‎, ‎de starts with a completely random initial population where each individual‎, ‎or solution‎, ‎is a random matrix of control input v...

The multiple traveling salesman problem (MTSP) involves scheduling m > 1 salesmen to visit a set of n > m nodes so that each node is visited exactly once. The objective is to minimize the total distance traveled by all the salesmen. The MTSP is an example of combinatorial optimization problems, and has a multiplicity of applications, mostly in the areas of routing and scheduling. In this paper,...