Operations Research, Systems Engineering and Industrial Engineering Commons^™

An Efficient Solution To The Mixed Shop Scheduling Problem Using A Modified Genetic Algorithm, V. Nguyen, H. P. Bao

Mechanical & Aerospace Engineering Faculty Publications

The mixed job shop scheduling problem is one in which some jobs have fixed machine orders and other jobs may be processed in arbitrary orders. In past literature, optimal solutions have been proposed based on adaptations of classical solutions such as by Johnson, Thompson and Giffler among many others, by pseudopolynomial algorithms, by simulation, and by Genetic Algorithms (GA). GA based solutions have been proposed for flexible Job shops. This paper proposes a GA algorithm for the mixed job shop scheduling problem. The paper starts with an analysis of the characteristics of the so-called mixed shop problem. Based on those …

Performance Based Contracting For The Manufacturing Industry By Using Integrated Platform And Dynamic Pricing Model, Lindawati, Aldy Gunawan

Research Collection Lee Kong Chian School Of Business

Although Performance Based Contracting (PBC) concept is not totally new, the PBC adaptation in Industrial Machinery and Components (IMC) manufacturing, which produces high-value and long life machineries, is rather slow and it is done with extra caution. Three main concerns for manufacturers to implement PBC are the investment cost, the maintenance cost and possible revenue loss. To handle these concerns and accelerate the PBC implementation, we propose an integrated platform that consists of three components: dynamic pricing, sensor data feeding and machinery monitoring. We model the dynamic pricing as an optimization problem and propose Genetic Algorithm to solve the problem. …

Comparison Of Optimization Techniques In Large Scale Transportation Problems, Tapojit Kumar

Journal of Undergraduate Research at Minnesota State University, Mankato

The Transportation Problem is a classic Operations Research problem where the objective is to determine the schedule for transporting goods from source to destination in a way that minimizes the shipping cost while satisfying supply and demand constraints. Although it can be solved as a Linear Programming problem, other methods exist. Linear Programming makes use of the Simplex Method, an algorithm invented to solve a linear program by progressing from one extreme point of the feasible polyhedron to an adjacent one. The algorithm contains tactics like pricing and pivoting. For a Transportation Problem, a simplified version of the regular Simplex …

Study Of The Use Of A Genetic Algorithm To Improve Networked System-Of-Systems Resilience, Charles O. Adler, Cihan H. Dagli

Engineering Management and Systems Engineering Faculty Research & Creative Works

Large scale failures or degradation resulting from smaller initial failures or disruptions in networked system-of-systems are an issue in multiple areas - for example cascading failures in electrical power grids or large disruptions in national air traffic due to local or regional weather conditions. The system architecture can have a significant impact on system-of-systems susceptibility to large scale failures. The study presented in this paper uses a simple interdependent networked system-of-systems failure model, integrated into a unique objective function that addresses both the overall level of failure and the rate of failure progression, and a genetic algorithm to demonstrate an …

Understanding System Of Systems Development Using An Agent-Based Wave Model, Paulette Acheson, Louis Pape, Cihan H. Dagli, Nil Kilicay-Ergin, John Columbi, Khaled Haris

Engineering Management and Systems Engineering Faculty Research & Creative Works

System of Systems (SoS) development is a complex process that depends on the cooperation of various independent Systems [1]. SoS acquisition and development differs from that typical for a single System; it has been shown to follow a wave paradigm known as the Wave Model [2]. Agent based models (ABMs) consist of a set of abstracted entities referred to as agents, and a framework using simplified rules for simulating agent decisions and interactions. Agents have their own goals and are capable of perceiving changes in the environment. Systemic (global) behavior emerges from the decisions and interactions of the agents. This …

A Hybrid Lehmer Code Genetic Algorithm And Its Application On Traveling Salesman Problems, Jun Zhang

Engineering Management & Systems Engineering Theses & Dissertations

Traveling Salesman Problems (TSP) is a widely studied combinatorial optimization problem. The goal of the TSP is to find a tour which begins in a specific city, visits each of the remaining cities once and returns to the initial cities such that the objective functions are optimized, typically involving minimizing functions like total distance traveled, total time used or total cost.

Genetic algorithms were first proposed by John Holland (1975). It uses an iterative procedure to find the optimal solutions to optimization problems.

This research proposed a hybrid Lehmer code Genetic Algorithm. To compensate for the weaknesses of traditional genetic …

Development Of A Genetic Algorithm Based Search Strategy Suited For Design Optimisation Of Internal Combustion Engines, Nalitolela G

Tanzania Journal of Engineering and Technology (TJET)

Engine design optimisation is a multi-objective, multi-domain problem in a discontinuous design space. The state of the art of optimisation techniques shows that only methods of direct and adaptive search are appropriate for this type of problem. These include, adaptive random search, simulated annealing, evolution strategies and genetic algorithms. Of these methods, the genetic algorithms have been shown to be the most suited for the optimisation of multi-modal response functions in a discontinuous design space. This paper considers the important characteristics of genetic algorithms and their adaptation for use in parametric design optimisation of internal combustion engines. In order to …

Qos Routing Optimization Strategy Using Genetic Algorithm In Optical Fiber Communication Networks, Zhaoxia Wang, Zengqiang Chen, Zhuzhi Yuan

Research Collection School Of Computing and Information Systems

This paper describes the routing problems in optical fiber networks, defines five constraints, induces and simplifies the evaluation function and fitness function, and proposes a routing approach based on the genetic algorithm, which includes an operator [OMO] to solve the QoS routing problem in optical fiber communication networks. The simulation results show that the proposed routing method by using this optimal maintain operator genetic algorithm (OMOGA) is superior to the common genetic algorithms (CGA). It not only is robust and efficient but also converges quickly and can be carried out simply, that makes it better than other complicated GA.