• 제목/요약/키워드: GA with a constraint

검색결과 36건 처리시간 0.114초

서비스시간 제한이 있는 복합교통망에서의 경로안내 시스템을 위한 유전자 알고리듬 (A Genetic Algorithm for Route Guidance System in Intermodal Transportation Networks with Time - Schedule Constraints)

  • 장인성
    • 대한산업공학회지
    • /
    • 제27권2호
    • /
    • pp.140-149
    • /
    • 2001
  • The paper discusses the problem of finding the Origin-Destination(O-D) shortest paths in internodal transportation networks with time-schedule constraints. The shortest path problem on the internodal transportation network is concerned with finding a path with minimum distance, time, or cost from an origin to a destination using all possible transportation modalities. The time-schedule constraint requires that the departure time to travel from a transfer station to another node takes place only at one of pre-specified departure times. The scheduled departure times at the transfer station are the times when the passengers are allowed to leave the station to another node using the relative transportation modality. Therefore, the total time of a path in an internodal transportation network subject to time-schedule constraints includes traveling time and transfer waiting time. In this paper, a genetic algorithm (GA) approach is developed to deal with this problem. The effectiveness of the GA approach is evaluated using several test problems.

  • PDF

FUZZY TRANSPORTATION PROBLEM WITH ADDITIONAL CONSTRAINT IN DIFFERENT ENVIRONMENTS

  • BUVANESHWARI, T.K.;ANURADHA, D.
    • Journal of applied mathematics & informatics
    • /
    • 제40권5_6호
    • /
    • pp.933-947
    • /
    • 2022
  • In this research, we presented the type 2 fuzzy transportation problem with additional constraints and solved by our proposed genetic algorithm model, and the results are verified using the softwares, genetic algorithm tool in Matlab and Lingo. The goal of our approach is to minimize the cost in solving a transportation problem with an additional constraint (TPAC) using the genetic algorithm (GA) based type 2 fuzzy parameter. We reduced the type 2 fuzzy set (T2FS) into a type 1 fuzzy set (T1FS) using a critical value-based reduction method (CVRM). Also, we use the centroid method (CM) to obtain the corresponding crisp value for this reduced fuzzy set. To achieve the best solution, GA is applied to TPAC in type 2 fuzzy parameters. A real-life situation is considered to illustrate the method.

개선소성힌지해석과 유전자 알고리듬을 이용한 평면 강골조 구조물의 퍼지최적설계 (Fuzzy Optimum Design of Plane Steel Frames Using Refined Plastic Hinge Analysis and a Genetic Algorithm)

  • 이말숙;윤영묵;손수덕
    • 한국강구조학회 논문집
    • /
    • 제18권2호
    • /
    • pp.147-160
    • /
    • 2006
  • 본 논문에서는 개선소성힌지해석과 유전자 알고리듬을 이용한 평면 강골조 구조물의 퍼지최적설계 방법을 제시하였다. 개선소성힌지해석에서는 강골조 구조물의 기하학적 비선형성을 고려하기 위해 보-기둥 요소의 안정함수를 사용하였으며, 재료적 비선형을 고려하기 위해 잔류응력, 소성힌지, 그리고 기하학적 불완전성 등에 의한 점진적인 강성감소모델을 사용하였다. 유전자 알고리듬에서는 토너먼트 선택방법과 마이크로 유전자 알고리즘을 사용하였다. 목적함수로는 구조물의 총중량을 사용하였으며, 제약조건으로는 하중-저항능력, 사용성, 연성도, 그리고 시공성에 관한 기준을 고려하였다. 퍼지최적설계에서는 명확한 목적함수와 퍼지제약을 가지는 경우에 한하여 허용 오차는 제한값의 5%로 선택하고 비소속함수와 레벨컷 방법을 이용하여 0에서 1까지 0.2간격으로 나누어 최적화하였다. 여러 평면 강골조 구조물의 최적설계를 수행하여 일반GA최적설계와 퍼지GA최적설계의 최적값을 비교하였다.

GENETIC ALGORITHMIC APPROACH TO FIND THE MAXIMUM WEIGHT INDEPENDENT SET OF A GRAPH

  • Abu Nayeem, Sk. Md.;Pal, Madhumangal
    • Journal of applied mathematics & informatics
    • /
    • 제25권1_2호
    • /
    • pp.217-229
    • /
    • 2007
  • In this paper, Genetic Algorithm (GA) is used to find the Maximum Weight Independent Set (MWIS) of a graph. First, MWIS problem is formulated as a 0-1 integer programming optimization problem with linear objective function and a single quadratic constraint. Then GA is implemented with the help of this formulation. Since GA is a heuristic search method, exact solution is not reached in every run. Though the suboptimal solution obtained is very near to the exact one. Computational result comprising an average performance is also presented here.

An Optimal Random Carrier Pulse Width Modulation Technique Based on a Genetic Algorithm

  • Xu, Jie;Nie, Zi-Ling;Zhu, Jun-Jie
    • Journal of Power Electronics
    • /
    • 제17권2호
    • /
    • pp.380-388
    • /
    • 2017
  • Since the carrier sequence is not reproducible in a period of the random carrier pulse width modulation (RCPWM) and a higher harmonic spectrum amplitude is likely to affect the quality of the power supply. In addition, electromagnetic interference (EMI) and mechanical vibration will appear. To solve these problems, this paper has proposed an optimal RCPWM based on a genetic algorithm (GA). In the optimal modulation, the range of the random carrier frequency is taken as a constraint and the reciprocal of the maximum harmonic spectrum amplitude is used as a fitness function to decrease the EMI and mechanical vibration caused by the harmonics concentrated at the carrier frequency and its multiples. Since the problems of the hardware make it difficult to use in practical engineering, this paper has presented a hardware system. Simulations and experiments show that the RCPWM is effective. Studies show that the harmonic spectrum is distributed more uniformly in the frequency domain and that there is no obvious peak in the wave spectra. The proposed method is of great value to research on RCPWM and integrated power systems (IPS).

Mass optimization of four bar linkage using genetic algorithms with dual bending and buckling constraints

  • Hassan, M.R.A.;Azid, I.A.;Ramasamy, M.;Kadesan, J.;Seetharamu, K.N.;Kwan, A.S.K.;Arunasalam, P.
    • Structural Engineering and Mechanics
    • /
    • 제35권1호
    • /
    • pp.83-98
    • /
    • 2010
  • In this paper, the mass optimization of four bar linkages is carried out using genetic algorithms (GA) with single and dual constraints. The single constraint of bending stress and the dual constraints of bending and buckling stresses are imposed. From the movement response of the bar linkage mechanism, the analysis of the mechanism is developed using the combination of kinematics, kinetics, and finite element analysis (FEA). A penalty-based transformation technique is used to convert the constrained problem into an unconstrained one. Lastly, a detailed comparison on the effect of single constraint and of dual constraints is presented.

A Case Study of Human Resource Allocation for Effective Hotel Management

  • Murakami, Kayoko;Tasan, Seren Ozmehmet;Gen, Mitsuo;Oyabu, Takashi
    • Industrial Engineering and Management Systems
    • /
    • 제10권1호
    • /
    • pp.54-64
    • /
    • 2011
  • The purpose of this study is to optimally allocate the human resources to tasks while minimizing the total daily human resource costs and smoothing the human resource usage. The human resource allocation problem (hRAP) under consideration contains two kinds of special constraints, i.e. operational precedence and skill constraints in addition to the ordinary constraints. To deal with the multiple objectives and the special constraints, first we designed this hRAP as a network problem and then proposed a Pareto multistage decisionbased genetic algorithm (P-mdGA). During the evolutionary process of P-mdGA, a Pareto evaluation procedure called generalized Pareto-based scale-independent fitness function approach is used to evaluate the solutions. Additionally, in order to improve the performance of P-mdGA, we use fuzzy logic controller for fine-tuning of genetic parameters. Finally, in order to demonstrate the applicability and to evaluate the performance of the proposed approach, P-mdGA is applied to solve a case study in a hotel, where the managers usually need helpful automatic support for effectively allocating hotel staff to hotel tasks.

에너지 효율적인 속도 프로파일 생성을 위한 Simulink 기반 열차 성능 시뮬레이션 (A Train Performance Simulation using Simulink for Generating Energy-efficient Speed Profiles)

  • 강문호;한문섭
    • 전기학회논문지
    • /
    • 제59권10호
    • /
    • pp.1816-1822
    • /
    • 2010
  • In this research TPS (Train Performance Simulation) blocks are designed using Simulink and applied to generate speed profiles for energy-efficient train operation. With a train operation mode of maximum powering, coasting, and maximum breaking, a breaking point is calculated from forward-backward running profiles. Then, GA (Genetic Algorithm) is used to solve a running time constraint, and a coasting point is produced from the searching process of GA. With the breaking point and the coasting point a speed profile is plotted. Train performance under a speed limit and gradient variations is simulated and resultant speed profiles are analyzed.

A Water-saving Irrigation Decision-making Model for Greenhouse Tomatoes based on Genetic Optimization T-S Fuzzy Neural Network

  • Chen, Zhili;Zhao, Chunjiang;Wu, Huarui;Miao, Yisheng
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제13권6호
    • /
    • pp.2925-2948
    • /
    • 2019
  • In order to improve the utilization of irrigation water resources of greenhouse tomatoes, a water-saving irrigation decision-making model based on genetic optimization T-S fuzzy neural network is proposed in this paper. The main work are as follows: Firstly, the traditional genetic algorithm is optimized by introducing the constraint operator and update operator of the Krill herd (KH) algorithm. Secondly, the weights and thresholds of T-S fuzzy neural network are optimized by using the improved genetic algorithm. Finally, on the basis of the real data set, the genetic optimization T-S fuzzy neural network is used to simulate and predict the irrigation volume for greenhouse tomatoes. The performance of the genetic algorithm improved T-S fuzzy neural network (GA-TSFNN), the traditional T-S fuzzy neural network algorithm (TSFNN), BP neural network algorithm(BPNN) and the genetic algorithm improved BP neural network algorithm (GA-BPNN) is compared by simulation. The simulation experiment results show that compared with the TSFNN, BPNN and the GA-BPNN, the error of the GA-TSFNN between the predicted value and the actual value of the irrigation volume is smaller, and the proposed method has a better prediction effect. This paper provides new ideas for the water-saving irrigation decision in greenhouse tomatoes.

Optimum parameterization in grillage design under a worst point load

  • Kim Yun-Young;Ko Jae-Yang
    • 한국항해항만학회지
    • /
    • 제30권2호
    • /
    • pp.137-143
    • /
    • 2006
  • The optimum grillage design belongs to nonlinear constrained optimization problem. The determination of beam scantlings for the grillage structure is a very crucial matter out of whole structural design process. The performance of optimization methods, based on penalty functions, is highly problem-dependent and many methods require additional tuning of some variables. This additional tuning is the influences of penalty coefficient, which depend strongly on the degree of constraint violation. Moreover, Binary-coded Genetic Algorithm (BGA) meets certain difficulties when dealing with continuous and/or discrete search spaces with large dimensions. With the above reasons, Real-coded Micro-Genetic Algorithm ($R{\mu}GA$) is proposed to find the optimum beam scantlings of the grillage structure without handling any of penalty functions. $R{\mu}GA$ can help in avoiding the premature convergence and search for global solution-spaces, because of its wide spread applicability, global perspective and inherent parallelism. Direct stiffness method is used as a numerical tool for the grillage analysis. In optimization study to find minimum weight, sensitivity study is carried out with varying beam configurations. From the simulation results, it has been concluded that the proposed $R{\mu}GA$ is an effective optimization tool for solving continuous and/or discrete nonlinear real-world optimization problems.