English  |  正體中文  |  简体中文  |  Items with full text/Total items : 26091/26686 (98%)
Visitors : 10073761      Online Users : 456
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version

    Please use this identifier to cite or link to this item: http://ir.lib.ksu.edu.tw/handle/987654321/13510

    Title: Particle Swarm Optimization Techniques for the Traveling Routing Problem
    Authors: 羅仕堂
    Keywords: Routing problem
    Combination problem
    Discrete particle swarm
    Date: 2011-03-24
    Issue Date: 2011-04-27 15:44:02 (UTC+8)
    Abstract: This research employs the meta-heuristic method of discrete particle swarm optimization (DPSO) to an application of traveling routing problems (TRP). The optimization procedure simulates the decision-making processes of swarm. And it is similar to other adaptive learning and artificial intelligence techniques such as ant colony optimization, simulated annealing and genetic algorithms. The objective is minimizing the total routing path and time of a trip. Experimentation results show that the algorithm is successful in finding solutions while applying discrete particle swarm. And the continues variable particle swarm optimization (CPSO) also be implement in this paper, the simulation results also show CPSO is a better method in solving combination problems.
    Relation: The 2010 International Conference on Innovation and Management, Penang, Malaysia, July 7- 10, 2010.
    Appears in Collections:[資訊管理系所] 會議論文

    Files in This Item:

    File Description SizeFormat
    羅仕堂-Particle Swarm Optimization Techniques for the Traveling.pdf168KbAdobe PDF365View/Open

    All items in KSUIR are protected by copyright, with all rights reserved.

    ©Kun Shan University Library and Information Center
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback