Proceedings of the Korean Institute of Intelligent Systems Conference (한국지능시스템학회:학술대회논문집)

Korean Institute of Intelligent Systems (한국지능시스템학회)
권호 표지

Hybrid Genetic Algorithm or Obstacle Location-Allocation Problem

  • Jynichi Taniguchi (Graduate School of Information, Production ＆ Systems, Waseda University) ;
  • Mitsuo Gen (Graduate School of Information, Production ＆ Systems, Waseda University) ;
  • Wang, Xiao-Dong (Department of Industrial ＆ Information Systems Engineering, Ashikaga Institute of Technology) ;
  • Takao Yokota (Department of Industrial ＆ Information Systems Engineering, Ashikaga Institute of Technology)
  • Published : 2003.09.01
Download PDF
⟨ Previous Next ⟩

Abstract

Location-allocation problem is known as one of the important problem faced in Industrial Engineering and Operations Research fielde. There are many variations on this problem for different applications, however, most of them consider no obstacle existing. Since the location-allocation problem with obstacles is very complex and with many infeasible solutions, no direct method is effective to solve it. In this paper we propose a hybrid Genetic Algorithm (hGA) method for solving this problem. The proposed hGA is based on Lagrangian relaxation method and Dijkstra's shortest path algorithm. To enhance the proposed hGA, a Fuzzy Logic Controller (FLC) approach is also adopted to auto-tune the GA parameters.

Keywords