• Title/Summary/Keyword: Cellular genetic algorithm

Search Result 46, Processing Time 0.022 seconds

3D Neighborhood Relationships of Cellular Genetic Algorithms for the Tour Guide Assignment Problem

  • Setiyani, Lina;Okazaki, Takeo
    • IEIE Transactions on Smart Processing and Computing
    • /
    • v.6 no.3
    • /
    • pp.151-157
    • /
    • 2017
  • Management optimization is very important in tourism, especially when it is related to productivity. One of the problems in management optimization is tour guide assignment. Well-arranged tour guide assignment will increase productivity while maintaining service quality. A cellular genetic algorithm is one of the methods that can be used to solve this problem. Furthermore, previous study has shown that a cellular dimension increase can lead to promising benefits for certain problems. The objective of this research is to give a clear understanding of the advantages of increasing cellular dimensionality on the tour guide assignment problem by using a cellular genetic algorithm.

Design of Cellular Layout based on Genetic Algorithm (유전 알고리즘에 기초한 셀 배치의 설계)

  • Lee, Byung-Uk;Cho, Kyu-Kap
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.16 no.6
    • /
    • pp.197-208
    • /
    • 1999
  • This paper presents an operation sequence-based approach for determining machine cell layout in a cellular manufacturing environment. The proposed model considers the sequence of operations in evaluating the intercell and intracell movements. In this paper, design of cellular layout has an objective of minimization of total material flow among facilities, where the total material flow is defined as a weighted sum of both intercell and intracell part movements. The proposed algorithm is developed by using genetic algorithm and can be used to design an optimal cellular layout which can cope with changes of shop floor situation by considering constraints such as the number of machine cells and the number of machines in a machine cell.

  • PDF

A Study on Implementation of Evolving Cellular Automata Neural System (진화하는 셀룰라 오토마타 신경망의 하드웨어 구현에 관한 연구)

  • 반창봉;곽상영;이동욱;심귀보
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2001.12a
    • /
    • pp.255-258
    • /
    • 2001
  • This paper is implementation of cellular automata neural network system which is a living creatures' brain using evolving hardware concept. Cellular automata neural network system is based on the development and the evolution, in other words, it is modeled on the ontogeny and phylogeny of natural living things. The proposed system developes each cell's state in neural network by CA. And it regards code of CA rule as individual of genetic algorithm, and evolved by genetic algorithm. In this paper we implement this system using evolving hardware concept Evolving hardware is reconfigurable hardware whose configuration is under the control of an evolutionary algorithm. We design genetic algorithm process for evolutionary algorithm and cells in cellular automata neural network for the construction of reconfigurable system. The effectiveness of the proposed system is verified by applying it to time-series prediction.

  • PDF

Optimal lay-up of hybrid composite beams, plates and shells using cellular genetic algorithm

  • Rajasekaran, S.;Nalinaa, K.;Greeshma, S.;Poornima, N.S.;Kumar, V. Vinoop
    • Structural Engineering and Mechanics
    • /
    • v.16 no.5
    • /
    • pp.557-580
    • /
    • 2003
  • Laminated composite structures find wide range of applications in many branches of technology. They are much suited for weight sensitive structures (like aircraft) where thinner and lighter members made of advanced fiber reinforced composite materials are used. The orientations of fiber direction in layers and number of layers and the thickness of the layers as well as material of composites play a major role in determining the strength and stiffness. Thus the basic design problem is to determine the optimum stacking sequence in terms of laminate thickness, material and fiber orientation. In this paper, a new optimization technique called Cellular Automata (CA) has been combined with Genetic Algorithm (GA) to develop a different search and optimization algorithm, known as Cellular Genetic Algorithm (CGA), which considers the laminate thickness, angle of fiber orientation and the fiber material as discrete variables. This CGA has been successfully applied to obtain the optimal fiber orientation, thickness and material lay-up for multi-layered composite hybrid beams plates and shells subjected to static buckling and dynamic constraints.

A Genetic Approach to Transmission Rate and Power Control for Cellular Mobile Network (ICEIC'04)

  • Lee YoungDae;Park SangBong
    • Proceedings of the IEEK Conference
    • /
    • summer
    • /
    • pp.10-14
    • /
    • 2004
  • When providing flexible data transmission for future CDMA(Code Division Multiple Access) cellular networks, problems arise in two aspects: transmission rate. This paper has proposed an approach to maximize the cellular network capacity by combining the genetic transmission rate allocation and a rapid power control algorithm. We present a genetic chromosome representation to express call drop numbers and transmission rate to control mobile's transmission power levels while handling their flexible transmission rates. We suggest a rapid power control algorithm, which is based on optimal control theory and Steffenson acceleration technique comparing with the existing algorithms. Computer simulation results showed effectiveness and efficiency of the proposed algorithm Conclusively, our proposed scheme showed high potential for increasing the cellular network capacity and it can be the fundamental basis of future research.

  • PDF

A Cellular Learning Strategy for Local Search in Hybrid Genetic Algorithms (복합 유전자 알고리즘에서의 국부 탐색을 위한 셀룰러 학습 전략)

  • Ko, Myung-Sook;Gil, Joon-Min
    • Journal of KIISE:Software and Applications
    • /
    • v.28 no.9
    • /
    • pp.669-680
    • /
    • 2001
  • Genetic Algorithms are optimization algorithm that mimics biological evolution to solve optimization problems. Genetic algorithms provide an alternative to traditional optimization techniques by using directed random searches to locate optimal solutions in complex fitness landscapes. Hybrid genetic algorithm that is combined with local search called learning can sustain the balance between exploration and exploitation. The genetic traits that each individual in the population learns through evolution are transferred back to the next generation, and when this learning is combined with genetic algorithm we can expect the improvement of the search speed. This paper proposes a genetic algorithm based Cellular Learning with accelerated learning capability for function optimization. Proposed Cellular Learning strategy is based on periodic and convergent behaviors in cellular automata, and on the theory of transmitting to offspring the knowledge and experience that organisms acquire in their lifetime. We compared the search efficiency of Cellular Learning strategy with those of Lamarckian and Baldwin Effect in hybrid genetic algorithm. We showed that the local improvement by cellular learning could enhance the global performance higher by evaluating their performance through the experiment of various test bed functions and also showed that proposed learning strategy could find out the better global optima than conventional method.

  • PDF

A Channel Borrowing Scheme using Genetic Algorithm in Cellular Mobile Computing Environment (셀룰라 이동 컴퓨팅 환경에서 유전 알고리즘을 이용한 채널차용 기법)

  • Lee, Seong-Hoon;Lee, Dong-Woo;Lee, Sang-Gu
    • Journal of KIISE:Information Networking
    • /
    • v.29 no.2
    • /
    • pp.165-173
    • /
    • 2002
  • In the static channel assignment scheme for cellular mobile computing environment, each cell has a fixed number of channels and supports a service for a user′s request entering to the cell. This scheme has an advantage of simplicity. However, this scheme has a disadvantage that can′t control far hot cell problem. Therefore, to solve this problem, the "channel borrowing" concept is needed. In this paper, we propose a load balancing(channel borrowing, channel reassignment) approach using genetic algorithm. The purposes of using genetic algorithm in this paper are ${\circled1}$ to find early a cell including an available channel and ${\circled2}$ to decrease a number of probings and ${\circled3}$ to migrate to the cell after searching an available channel near upon optimality. To represent effectiveness of the proposed algorithm, we simulated various experiments.

A Method of Component-Machine Cell Formation for Design of Cellular Manufacturing Systems (셀제조시스템 설계를 위한 부품-기계 셀의 형성기법)

  • Cho, Kyu-Kab;Lee, Byung-Uk
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.13 no.4
    • /
    • pp.143-151
    • /
    • 1996
  • The concept of cellular manufacturing is to decompose a manufacturing system into subsystems, which are easier to manage than the entire manufacturing system. The objective of cellular manufacturing is to group parts with similar processing requirements into part families and machines into cells which meet the processing needs of part families assigned to them. This paper presents a methodology for cell formation based on genetic algorithm which produces improved cell formation in terms of total moves, which is a weighted sum of both intercell moves and intracell moves. A sample problem is solved for two, three and four cells with an approach based on genetic algorithms.

  • PDF

Hierarchical Cellular Network Design with Channel Allocation Using Genetic Algorithm (유전자 알고리즘을 이용한 다중계층 채널할당 셀룰러 네트워크 설계)

  • Lee, Sang-Heon;Park, Hyun-Soo
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2005.10a
    • /
    • pp.321-333
    • /
    • 2005
  • With the limited frequency spectrum and an increasing demand for cellular communication services, the problem of channel assignment becomes increasingly important. However, finding a conflict free channel assignment with the minimum channel span is NP hard. As demand for services has expanded in the cellular segment, sever innovations have been made in order to increase the utilization of bandwidth. The innovations are cellular concept, dynamic channel assignment and hierarchical network design. Hierarchical network design holds the public eye because of increasing demand and quality of service to mobile users. We consider the frequency assignment problem and the base station placement simultaneously. Our model takes the candidate locations emanating from this process and the cost of assigning a frequency, operating and maintaining equipment as an input. In addition, we know the avenue and demand as an assumption. We propose the network about the profit maximization. This study can apply to GSM(Global System for Mobile Communication) which has 70% portion in the world. Hierarchical network design using GA(Genetic Algorithm) is the first three-tier (Macro, Micro, Pico) model, We increase the reality through applying to EMC (Electromagnetic Compatibility Constraints). Computational experiments on 72 problem instances which have 15${\sim}$40 candidate locations demonstrate the computational viability of our procedure. The result of experiments increases the reality and covers more than 90% of the demand.

  • PDF