Railway scheduling is a complex task of rail operators that involves the generation of a conflict-free train timetable. This paper presents a discrete-event simulation-based optimization approach for solving the train timetabling problem to minimize total weighted unplanned stop time in a hybrid single and double track railway networks. The designed simulation model is used as a platform for ge...

in the new production systems, finding a way to improving the product and system reliability in design is a very important. the reliability of the products and systems may improve using different methods. one of this methods is redundancy allocation problem. in this problem by adding redundant component to sub-systems under some constraints, the reliability improved. in this paper we worked on ...

Optimization of machining parameters is a vital task for increasing machining efficiency and economics. Selection of optimal machining parameters is often performed by integrating empirical models with traditional mathematical and meta-heuristic algorithms. Ability to deal with complex and multi-dimensional optimization problems resulted in growing interest on the application of meta-heuristic ...

Airport gate assignment is to appoint a gate for the arrival or leave flight and to ensure that the flight is on schedule. Assigning the airport gate with high efficiency is a key task among the airport ground busywork. As the core of airport operation, aircraft gate assignment is known as a kind of complicated combinatorial optimization problem. This paper proposed robust assignment model to m...

barrel vaults are attractive space structures that cover large area without intermediate supports. in this paper, the charged search system (css) optimization algorithm is employed for optimal design of barrel vaults. this method utilizes the governing laws of coulomb and gauss from electrostatics and the newtonian law of mechanics. the results demonstrate the efficiency of the discrete css alg...

Meta-heuristics are methods that sit on top of local search algorithms. They perform the function of avoiding or escaping a local optimum and/or premature convergence. The aim of this paper is to survey, compare and contrast meta-heuristics for local search. First, we present the technique of local search (or hill climbing as it is sometimes known). We then present a table displaying the attrib...

Traveling salesman problem is of the known and classical problems at Research in Operations. Many scientific activities can be solved as traveling salesman problem. Existing methods for solving hard problems (such as the traveling salesman problem) consists of a large number of variables and constraints which reduces their practical efficiency in solving problems with the original size. In rece...

Abstract The aerodynamic efficiency in airfoil theory is defined as the ratio between lift and drag force, which main objective function to be maximized a wide kind of vehicle design due its strong relationship fuel consumption range. This work employs 4-digits NACA parameterization, recently developed 6-parameters method, PARSEC technique with correction matrices available literature, compare ...

We present a general picture of the parallel meta-heuristic search for optimization. We recall the main concepts and strategies in designing parallel metaheuristics, pointing to a number of contributions that instantiated them for neighborhoodand populationbased meta-heuristics, and identify trends and promising research directions. We focus on cooperation-based strategies, which display remark...

In textile industry, marker planning is one of the main operations in the cutting fabric stage. Marker packing is usually used to maximize cloth exploitation and minimize its waste. In this research, a method is used based on new found meta-heuristic imperialist competitive algorithm (ICA) and Bottom-Left-Fill Algorithm (BLF) to achieve optimal marker packing. Function of the proposed method wa...