Elevator group control system using genetic network programming with ACO considering transitions

Lu Yu*, Jin Zhou, Shingo Mabu, Kotaro Hirasawa, Jinglu Hu, Sandor Markon

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution

14 Citations (Scopus)

Abstract

Genetic Programming Network (GNP), a graph-based evolutionary method, has been proposed several years ago as an extension of Genetic Algorithm (GA) and Genetic Programming (GP). The behavior of GNP is characterized by a balance between exploitation and exploration. To improve the evolving speed and efficiency of GNP, we developed a hybrid algorithm that combines GNP with Ant Colony Optimization (ACO). Pheromone information in the algorithm is updated not only by the fitness but also the frequency of the transitions as dynamic updating. We applied the hybrid algorithm to Elevator Group Supervisory Control Systems (EGSCS), a complex real-world problem. Finally, the simulations verified the efficacy of our proposed method.

Original languageEnglish
Title of host publicationSICE Annual Conference, SICE 2007
Pages1330-1336
Number of pages7
DOIs
Publication statusPublished - 2007 Dec 1
EventSICE(Society of Instrument and Control Engineers)Annual Conference, SICE 2007 - Takamatsu, Japan
Duration: 2007 Sept 172007 Sept 20

Publication series

NameProceedings of the SICE Annual Conference

Conference

ConferenceSICE(Society of Instrument and Control Engineers)Annual Conference, SICE 2007
Country/TerritoryJapan
CityTakamatsu
Period07/9/1707/9/20

Keywords

  • Ant colony optimization
  • Elevator group supervisory control system
  • Genetic network programming
  • Hybrid algorithm

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Computer Science Applications
  • Electrical and Electronic Engineering

Fingerprint

Dive into the research topics of 'Elevator group control system using genetic network programming with ACO considering transitions'. Together they form a unique fingerprint.

Cite this