Double-deck elevator group supervisory control system using genetic network programming with ant colony optimization

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

9 Citations (Scopus)

Abstract

Recently, Artificial Intelligence (AI) technology has been applied to many applications. As an extension of Genetic Algorithm (GA) and Genetic Programming (GP), Genetic Network Programming (GNP) has been proposed, whose gene is constructed by directed graphs. GNP can perform a global searching, but its evolving speed is not so high and its optimal solution is hard to obtain in some cases because of the lack of the exploitation ability of it. To alleviate this difficulty, we developed a hybrid algorithm that combines Genetic Network Programming (GNP) with Ant Colony Optimization (ACO). Our goal is to introduce more exploitation mechanism into GNP. In this paper, we applied the proposed hybrid algorithm to a complicated real world problem, that is, Elevator Group Supervisory Control System (EGSCS). The simulation results showed the effectiveness of the proposed algorithm.

Original languageEnglish
Title of host publication2007 IEEE Congress on Evolutionary Computation, CEC 2007
Pages1015-1022
Number of pages8
DOIs
Publication statusPublished - 2007 Dec 1
Event2007 IEEE Congress on Evolutionary Computation, CEC 2007 - , Singapore
Duration: 2007 Sept 252007 Sept 28

Publication series

Name2007 IEEE Congress on Evolutionary Computation, CEC 2007

Conference

Conference2007 IEEE Congress on Evolutionary Computation, CEC 2007
Country/TerritorySingapore
Period07/9/2507/9/28

ASJC Scopus subject areas

  • Artificial Intelligence
  • Software
  • Theoretical Computer Science

Fingerprint

Dive into the research topics of 'Double-deck elevator group supervisory control system using genetic network programming with ant colony optimization'. Together they form a unique fingerprint.

Cite this