IDEAS home Printed from https://ideas.repec.org/a/igg/jamc00/v8y2017i3p53-65.html
   My bibliography  Save this article

A Hybrid Particle Swarm Optimization Method for Traveling Salesman Problem

Author

Listed:
  • Yong Wang

    (School of Renewable Energy, North China Electric University, Beijing, China)

  • Ning Xu

    (School of Renewable Energy, North China Electric University, Beijing, China)

Abstract

Traveling salesman problem (TSP) is one well-known NP-Complete problem. The objective is to search the optimal Hamiltonian circuit (OHC) in a tourist map. The particle swarm optimization (PSO) integrated with the four vertices and three lines inequality is introduced to detect the OHC or approximate OHC. The four vertices and three lines inequality is taken as local heuristics to find the local optimal paths composed of four vertices and three lines. Each of this kind of paths in the OHC or approximate OHC conforms to the inequality. The particle swarm optimization is used to search an initial approximation. The four vertices and three lines inequality is applied to convert all the paths in the approximation into the optimal paths. Then a better approximation is obtained. The method is tested with several Euclidean TSP instances. The results show that the much better approximations are searched with the hybrid PSO. The convergence rate is also faster than the traditional PSO under the same preconditions.

Suggested Citation

  • Yong Wang & Ning Xu, 2017. "A Hybrid Particle Swarm Optimization Method for Traveling Salesman Problem," International Journal of Applied Metaheuristic Computing (IJAMC), IGI Global, vol. 8(3), pages 53-65, July.
    • Handle: RePEc:igg:jamc00:v:8:y:2017:i:3:p:53-65
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJAMC.2017070104
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:igg:jamc00:v:8:y:2017:i:3:p:53-65. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.