Home  |  Contact Us  
     About MMLab.
     Square (members only)
1.제목: Multiobjective Genetic Algorithms for Network Design Problems

2.연사:  Mitsuo Gen (Kwang Nam Hyun)
          Graduate School of Information Production and System, Waseda University, Japan

1971.4 - 1974.3: Ph.D. degree, Dept. of Information Engineering, Graduate School of Eng.

                Kogakuin University, Tokyo, Japan

1969.4 - 1971.3: M.S. degree, Dept. of Electronic Engineering, Graduate School of Eng.

                Kogakuin University, Tokyo, Japan

1965.4 - 1969.3: B.S. degree, Dept. of Electronic Engineering, Kogakuin University, Tokyo, Japan

3.일시: 2004년 10월 27일(수요일) 오후 3:30

4.장소: 서울대학교 302동 317-2호

        Network design problems are fundamental issue in the various fields such as applied mathematics, computer science, engineering, management, and operations research. Networks provide a useful way to modeling real world problems and are extensively used in many different types of systems: communications, hydraulic, mechanical, electronic and logistics. At the same time, Genetic Algorithm (GA) has received one of great deal of attention regarding their potential as optimization techniques for network design problems and is often used to solve many real world problems, including the effective approaches on the multiobjective optimization problems.

        In this talk I will review the recent network design techniques using GAs and introduce a new Multiobjective Genetic Algorithm (MOGA) approach for designing a Bicriteria Network Design (BND) Problem. The objectives are to maximize flow and minimize cost in the BND model. The proposed method adopts priority-based encoding method to represent a path in the network. Different from other encoding methods, such as path oriented encoding method, priority-based encoding method can be applied for different network design problems, i.e., Shortest Path Problem (SPP), Maximum Flow Problem (MXF), Minimum Cost Flow Problem (MCF), etc. In the proposed method, while weighted-sum approach is employed to evaluate solutions found in the search process, nondominated sorting technique is used to obtain Pareto optimal solutions. Numerical experiments shows the efficiency and effectiveness of the MOGA approach on the BND problem when comparing with several traditional methods.

List of Articles
번호 제목 글쓴이 날짜 조회 수
428 [소식] 정태중 - 득녀 file WebMaster 2019-03-27 215
427 [Paper Accepted] ACM/IEEE Fourth International Conference on Internet-of-Things Design and Implementation (IoTDI '19) WebMaster 2019-02-21 514
426 [Paper Accepted] IEEE International Conference on Blockchain and Cryptocurrency (ICBC '19) WebMaster 2019-02-13 2370
425 [Paper Accepted] Elsevier Journal of Network and Computer Applications (JNCA '19) WebMaster 2019-02-09 561
424 [Paper Accepted] IEEE Consumer Communications & Networking Conference (CCNC '19) WebMaster 2018-11-19 2216
423 [Paper Accepted] Network and Distributed System Security Symposium (NDSS '19) WebMaster 2018-11-17 2748
422 [소식] 류지호 - 결혼소식 WebMaster 2018-10-29 6478
421 [소식] Wei Cai - 교수 임용 소식 WebMaster 2018-08-21 5495
420 [소식] 조은상 - 결혼소식 WebMaster 2018-05-01 15976
419 2018년 스승의 날 행사 안내 WebMaster 2018-05-01 15990
418 [소식] 최대진 - 득남 file WebMaster 2018-04-09 7940
417 [소식] 정태중 - 교수 임용 소식 WebMaster 2018-04-07 8407
416 [소식] 백상헌 - 젊은 정보과학자상 수상 WebMaster 2017-12-18 17328
415 2017년 연구실 송년회 안내 WebMaster 2017-11-23 34363
414 [Award] SIGCOMM 2017, Best Paper Award 수상 WebMaster 2017-08-31 21109
413 [소식] 한진영 박사님 - 득남 file WebMaster 2017-07-21 16167
412 [소식] 손동현 - 결혼소식 WebMaster 2017-05-24 20040
411 [소식] 최대진 - 결혼소식 WebMaster 2017-05-24 13841
410 2017년 스승의날 행사 안내 WebMaster 2017-04-25 23014
409 [Award] WiNTECH 2016 Test-of-Time Award WebMaster 2017-02-14 13885