• Title/Summary/Keyword: Population management genetic algorithm

Search Result 45, Processing Time 0.031 seconds

A Synchronized Job Assignment Model for Manual Assembly Lines Using Multi-Objective Simulation Integrated Hybrid Genetic Algorithm (MO-SHGA) (다목적 시뮬레이션 통합 하이브리드 유전자 알고리즘을 사용한 수동 조립라인의 동기 작업 모델)

  • Imran, Muhammad;Kang, Changwook
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.40 no.4
    • /
    • pp.211-220
    • /
    • 2017
  • The application of the theoretical model to real assembly lines has been one of the biggest challenges for researchers and industrial engineers. There should be some realistic approach to achieve the conflicting objectives on real systems. Therefore, in this paper, a model is developed to synchronize a real system (A discrete event simulation model) with a theoretical model (An optimization model). This synchronization will enable the realistic optimization of systems. A job assignment model of the assembly line is formulated for the evaluation of proposed realistic optimization to achieve multiple conflicting objectives. The objectives, fluctuation in cycle time, throughput, labor cost, energy cost, teamwork and deviation in the skill level of operators have been modeled mathematically. To solve the formulated mathematical model, a multi-objective simulation integrated hybrid genetic algorithm (MO-SHGA) is proposed. In MO-SHGA each individual in each population acts as an input scenario of simulation. Also, it is very difficult to assign weights to the objective function in the traditional multi-objective GA because of pareto fronts. Therefore, we have proposed a probabilistic based linearization and multi-objective to single objective conversion method at population evolution phase. The performance of MO-SHGA is evaluated with the standard multi-objective genetic algorithm (MO-GA) with both deterministic and stochastic data settings. A case study of the goalkeeping gloves assembly line is also presented as a numerical example which is solved using MO-SHGA and MO-GA. The proposed research is useful for the development of synchronized human based assembly lines for real time monitoring, optimization, and control.

A Hybrid Genetic Algorithm for the Multiobjective Vehicle Scheduling Problems with Service Due Times (서비스 납기가 주어진 다목적차량일정문제를 위한 혼성유전알고리듬의 개발)

    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.24 no.2
    • /
    • pp.121-134
    • /
    • 1999
  • In this paper, I propose a hybrid genetic algorithm(HGAM) incorporating a greedy interchange local optimization procedure for the multiobjective vehicle scheduling problems with service due times where three conflicting objectives of the minimization of total vehicle travel time, total weighted tardiness, and fleet size are explicitly treated. The vehicle is allowed to visit a node exceeding its due time with a penalty, but within the latest allowable time. The HGAM applies a mixed farming and migration strategy in the evolution process. The strategy splits the population into sub-populations, all of them evolving independently, and applys a local optimization procedure periodically to some best entities in sub-populations which are then substituted by the newly improved solutions. A solution of the HCAM is represented by a diploid structure. The HGAM uses a molified PMX operator for crossover and new types of mutation operator. The performance of the HGAM is extensively evaluated using the Solomons test problems. The results show that the HGAM attains better solutions than the BC-saving algorithm, but with a much longer computation time.

  • PDF

Genetic Algorithm based Pathfinding System for Analyzing Networks (네트워크 분석을 위한 유전 알고리즘 기반 경로탐색 시스템)

  • Kim, Jun-Woo
    • Journal of the Korea Society of Computer and Information
    • /
    • v.19 no.1
    • /
    • pp.119-130
    • /
    • 2014
  • This paper proposes GAPS, a practical genetic algorithm based pathfinding system for conveniently analyzing various networks. To this end, the GAPS is developed through integration of the intuitive graphic user interface for network modeling, the database management system for managing the data generated in modeling and exploring procedures, and a simple genetic algorithm for analyzing a wide range of networks. Especially, previous genetic algorithms are not appropriate for analyzing the networks with many dead-ends where there are few feasible paths between the given two nodes, however, GAPS is based on the genetic algorithm with the fitness function appropriate for evaluating both feasible and infeasible paths, which enables GAPS to analyze a wide range of networks while maintaining the diversity of the population. The experiment results reveal that GAPS can be used to analyze both networks with many dead-ends and networks with few dead-ends conveniently, and GAPS has several advantages over the previous genetic algorithms for pathfinding problems.

A Genetic Algorithm for Trip Distribution and Traffic Assignment from Traffic Counts in a Stochastic User Equilibrium

  • Sung, Ki-Seok;Rakha, Hesham
    • Management Science and Financial Engineering
    • /
    • v.15 no.1
    • /
    • pp.51-69
    • /
    • 2009
  • A network model and a Genetic Algorithm (GA) is proposed to solve the simultaneous estimation of the trip distribution and traffic assignment from traffic counts in the congested networks in a logit-based Stochastic User Equilibrium (SUE). The model is formulated as a problem of minimizing a non-linear objective function with the linear constraints. In the model, the flow-conservation constraints are utilized to restrict the solution space and to force the link flows become consistent to the traffic counts. The objective of the model is to minimize the discrepancies between two sets of link flows. One is the set of link flows satisfying the constraints of flow-conservation, trip production from origin, trip attraction to destination and traffic counts at observed links. The other is the set of link flows those are estimated through the trip distribution and traffic assignment using the path flow estimator in the logit-based SUE. In the proposed GA, a chromosome is defined as a real vector representing a set of Origin-Destination Matrix (ODM), link flows and route-choice dispersion coefficient. Each chromosome is evaluated by the corresponding discrepancies. The population of the chromosome is evolved by the concurrent simplex crossover and random mutation. To maintain the feasibility of solutions, a bounded vector shipment technique is used during the crossover and mutation.

Development of Genetic Algorithm for Production and Distribution Management in Multiple Supplier Network Environment of Robot Engineering Industry (로봇 산업의 다중 공급망 환경을 고려한 생산 및 분배 관리를 위한 유전 알고리듬 개발)

  • Jo, Sung-Min;Kim, Tai-Young;Hwang, Seung-June
    • Journal of Information Technology Applications and Management
    • /
    • v.20 no.2
    • /
    • pp.147-160
    • /
    • 2013
  • Today, the management environments of intelligence firm are changing the way of production planning and logistics management, and are changing the process of supply chain management system. This paper shows the development of information system software for intelligence enterprises is used in supply chain management for robot engineering industry. Specifically, supply chain management system in this paper has been developed to analyze the impact of multi plant and multi distribution environment, showing the process analysis and system development of hierarchical assembly manufacturing industry. In this paper we consider a production planning and distribution management system of intelligence firm in the supply chain. We focus on a capacitated production resource and distribution volume allocation problem, develop a mixed integer programming model, and propose an efficient heuristic procedure using a genetic algorithm to solve it efficiently. This method makes it possible for the population to reach the feasible approximate solution easily. The proposed regeneration procedures, which evaluate each infeasible chromosome, makes the solution converge to the feasible approximate solution quickly.

COST BENEFIT ANALYSIS OF HIGHWAY SYSTEMS

  • Darren Thompson;Don Chen;Nick Walker;Neil Mastin
    • International conference on construction engineering and project management
    • /
    • 2013.01a
    • /
    • pp.494-496
    • /
    • 2013
  • Cost-Benefit Analysis (CBA) is a systematic optimization process that allows users to compare different alternatives and to determine if a project is a solid investment. Many state DOTs have included CBA in their pavement management systems (PMSs) to help allocate state funds for maintenance, rehabilitation, resurfacing, and reconstruction of pavements. In a typical CBA, each pavement type has an assigned weight factor which represents the level of importance of this pavement type. To conduct an accurate CBA, it is essential to select appropriate weight factors. Arbitrarily assigning weights factors to pavements can lead to biased and inaccurate funding allocation decisions. The purpose for this paper is to outline a method to develop an ideal set of weight factors that can be utilized to conduct more accurate CBA. To this end, a matrix of all possible weight factors sets was developed. CBA was conducted for each set of weight factors to obtain a population of possible optimization solutions. Then a regression analysis was performed to establish the relationship between benefit and weight factors. Finally, a multi-objective genetic algorithm was applied to select the optimal set of weight factors. The findings from this study can be used by state DOTs to strategically manage their roadway systems in a cost effective manner.

  • PDF

Optimizing Assembly Line Balancing Problems with Soft Constraints (소프트 제약을 포함하는 조립라인 밸런싱 문제 최적화)

  • Choi, Seong-Hoon;Lee, Geun-Cheol
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.41 no.2
    • /
    • pp.105-116
    • /
    • 2018
  • In this study, we consider the assembly line balancing (ALB) problem which is known as an very important decision dealing with the optimal design of assembly lines. We consider ALB problems with soft constraints which are expected to be fulfilled, however they are not necessarily to be satisfied always and they are difficult to be presented in exact quantitative forms. In previous studies, most researches have dealt with hard constraints which should be satisfied at all time in ALB problems. In this study, we modify the mixed integer programming model of the problem introduced in the existing study where the problem was first considered. Based on the modified model, we propose a new algorithm using the genetic algorithm (GA). In the algorithm, new features like, a mixed initial population selection method composed of the random selection method and the elite solutions of the simple ALB problem, a fitness evaluation method based on achievement ratio are applied. In addition, we select the genetic operators and parameters which are appropriate for the soft assignment constraints through the preliminary tests. From the results of the computational experiments, it is shown that the proposed algorithm generated the solutions with the high achievement ratio of the soft constraints.

A GENETIC ALGORITHM BY USE OF VIRUS EVOLUTIONARY THEORY FOR SCHEDULING PROBLEM

  • Saito, Susumu
    • Proceedings of the Korea Society for Simulation Conference
    • /
    • 2001.10a
    • /
    • pp.365-370
    • /
    • 2001
  • The genetic algorithm that simulates the virus evolutionary theory has been developed applying to combinatorial optimization problems. The algorithm in this study uses only one individual and a population of viruses. The individual is attacked, inflected and improved by the viruses. The viruses are composed of flour genes (a pair of top gene and a pair of tail gene). If the individual is improved by the attacking, the inflection occurs. After the infection, the tail genes are mutated. If the same virus attacks several times and fails to inflect, the top genes of the virus are mutated. By this mutation, the individual can be improved effectively. In addition, the influence of the immunologic mechanism on evolution is simulated.

  • PDF

Domain Knowledge Based Approach for Design Optimization of Arch Dams Using Genetic Algorithms

  • Dongsu Kim;Sangik Lee;Jonghyuk Lee;Byung-hun Seo;Yejin Seo;Dongwoo Kim;Yerim Jo;Won Choi
    • International conference on construction engineering and project management
    • /
    • 2024.07a
    • /
    • pp.1321-1321
    • /
    • 2024
  • Concrete arch dams, unlike conventional concrete gravity dams, have thin arch-shaped cross sections and must be designed considering a three-dimensional shape. In particular, double-curvature arch dams, which have arch-shaped vertical and horizontal sections, require careful consideration during design due to their unique shape. Although stress analysis is complex, and various factors need to be considered during the design, these dams offer economic advantages as they require less material. Consequently, numerous double-curvature arch dams have been constructed worldwide, and ongoing research focuses on optimizing their shapes. In this study, an efficient optimization algorithm was developed for the shape optimization of concrete arch dams with double-curvature using genetic algorithms and improved population initializing technique. The developed technique utilized domain knowledge in the field of arch dams to generate an excellent initial population. To assess the relevance of domain knowledge, an investigation was conducted on the accumulated knowledge and empirical formulas from literature. Two pieces of domain knowledge can be gleaned from the iterative structural design experiences associated with arch dams. First, it concerns the thickness of the central cantilever of an arch dam. For minimum tensile stress, it is best to make the thickness as thin as possible at the dam crest and gradually become thicker as it goes down. The second aspect concerns the sliding stability of the arch dam, which depends on the central angle of the horizontal section. This angel is important for stability because the plane arch serves to transfer the hydraulic load from the reservoir to both abutments. Also, preliminary design formulas for arch dams from a manual written by the United States Bureau of Reclamation (USBR) were used. On the other hand, since domain knowledge is based on engineering experiences and data from existing dams, its usability should be verified by comparing it with the results of design optimization performed by classic genetic algorithms. To validate the performance of the optimization algorithm with the improved population initialization technique, a test site with an existing dam was selected, and algorithmic application tests were conducted. Stress analysis is performed for each design iteration, evaluating constraints and calculating fitness as the objective function. The results confirmed that the algorithm developed in this study exhibits superior performance in terms of average fitness and convergence rate compared to classic genetic algorithms.

Multiobjective Genetic Algorithm for Scheduling Problems in Manufacturing Systems

  • Gen, Mitsuo;Lin, Lin
    • Industrial Engineering and Management Systems
    • /
    • v.11 no.4
    • /
    • pp.310-330
    • /
    • 2012
  • Scheduling is an important tool for a manufacturing system, where it can have a major impact on the productivity of a production process. In manufacturing systems, the purpose of scheduling is to minimize the production time and costs, by assigning a production facility when to make, with which staff, and on which equipment. Production scheduling aims to maximize the efficiency of the operation and reduce the costs. In order to find an optimal solution to manufacturing scheduling problems, it attempts to solve complex combinatorial optimization problems. Unfortunately, most of them fall into the class of NP-hard combinatorial problems. Genetic algorithm (GA) is one of the generic population-based metaheuristic optimization algorithms and the best one for finding a satisfactory solution in an acceptable time for the NP-hard scheduling problems. GA is the most popular type of evolutionary algorithm. In this survey paper, we address firstly multiobjective hybrid GA combined with adaptive fuzzy logic controller which gives fitness assignment mechanism and performance measures for solving multiple objective optimization problems, and four crucial issues in the manufacturing scheduling including a mathematical model, GA-based solution method and case study in flexible job-shop scheduling problem (fJSP), automatic guided vehicle (AGV) dispatching models in flexible manufacturing system (FMS) combined with priority-based GA, recent advanced planning and scheduling (APS) models and integrated systems for manufacturing.