ACM Home Page
Please provide us with feedback. Feedback
Double-deck elevator system using genetic network programming with genetic operators based on pheromone information
Full text PdfPdf (406 KB)
Source
Genetic And Evolutionary Computation Conference archive
Proceedings of the 2008 GECCO conference companion on Genetic and evolutionary computation table of contents
Atlanta, GA, USA
SESSION: Late-breaking papers table of contents
Pages 2239-2244  
Year of Publication: 2008
ISBN:978-1-60558-131-6
Authors
Lu Yu  Waseda University, Kitakyushu, Japan
Jin Zhou  Waseda University, Kitakyushu, Japan
Fengming Ye  Waseda University, Kitakyushu, Japan
Shingo Mabu  Waseda University, Kitakyushu, Japan
Kaoru Shimada  Waseda University, Kitakyushu, Japan
Kotaro Hirasawa  Waseda University, Kitakyushu, Japan
Sandor Markon  Fujitec Co. Ltd, Hikone, Japan
Sponsors
SIGEVO: ACM Special Interest Group on Genetic and Evolutionary Computation
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 11,   Downloads (12 Months): 39,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1388969.1389052
What is a DOI?

ABSTRACT

Genetic Network Programming (GNP), one of the extended evolutionary algorithms was proposed, whose gene is constructed by the directed graph. GNP is distinguished from other evolutionary techniques in terms of its compact structure and implicit memory function. GNP can perform a global searching, but it lacks of the exploitation ability. Since the behavior of GNP is characterized by the balance between exploitation and exploration in the search space, we proposed a hybrid algorithm in this paper that combines GNP with Ant Colony Optimization (ACO). The genetic operators are operated using the pheromone information in some special generations. 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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
M. Dorigo, V. Maniezzo and A. Colorni, "Ant System: Optimization by a Colony of Cooperating Agents", In IEEE Transactions on Systems, Man and Cybernetics, Part-B, Vol. 126, No. 1, pp. 29--41, 1996.
 
3
M. Dorigo and L. M. Gambardella, "Ant colony system: a cooperative learning approach to the traveling salesman problem", In IEEE Transactions on Evolutionary Computation, Vol. 1, No. 1, pp. 53--66,1997.
 
4
Y.F. Dong; J.H. Gu; N.N. Li; X.D. Hou and W.L. Yan, "Combination of Genetic Algorithm and Ant Colony Algorithm for Distribution Network Planning " In Proc. of Machine Learning and Cybernetics, pp. 999--1002, August 2007.
 
5
K. Hirasawa, T. Eguchi, J.Zhou, L. Yu, J. Hu and S. Markon, "A Double-deck Elevator Group Supervisory Control System using Genetic Network Programming", IEEE Transactions on Systems, Man and Cybernetics, Part-C, (to appear).
 
6
G. Barney and S. dos Santos, Elevator Traffic Analysis, Design and Control, Second Ed, Peter Peregrinus Ltd, 1985.
 
7
J. W. Fortune, "Predestination Hall Call Selection for Double-deck Lifts (3D Encoding)", In , Elevator World, pp. 126--133, August 2005.

Collaborative Colleagues:
Lu Yu: colleagues
Jin Zhou: colleagues
Fengming Ye: colleagues
Shingo Mabu: colleagues
Kaoru Shimada: colleagues
Kotaro Hirasawa: colleagues
Sandor Markon: colleagues