• DocumentCode
    2381014
  • Title

    Basic study of proximate optimality principle based combinatorial optimization method

  • Author

    Yaguchi, Kouta ; Tamura, Kenichi ; Yasuda, Keiichiro ; Ishigame, Atsushi

  • Author_Institution
    Dept. of Electr. & Electron. Eng., Tokyo Metropolitan Univ., Hachioji, Japan
  • fYear
    2011
  • fDate
    9-12 Oct. 2011
  • Firstpage
    1753
  • Lastpage
    1758
  • Abstract
    This paper proposes a new method for solving combinatorial optimization problems on the basis of Proximate Optimality Principle (POP). The proposed method has higher optimality and lower computational complexity than conventional methods. The proposed method is applied to several typical combinatorial optimization problems in order to verify the performance of the proposed method.
  • Keywords
    computational complexity; optimisation; combinatorial optimization method; computational complexity; proximate optimality principle; Cities and towns; Computational complexity; Optimization methods; Search problems; Traveling salesman problems; Combinatorial Optimization; Computational Complexity; Diversification; Intensification; Meta-Heuristics; Proximate Optimality Principle;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Systems, Man, and Cybernetics (SMC), 2011 IEEE International Conference on
  • Conference_Location
    Anchorage, AK
  • ISSN
    1062-922X
  • Print_ISBN
    978-1-4577-0652-3
  • Type

    conf

  • DOI
    10.1109/ICSMC.2011.6083925
  • Filename
    6083925
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2381014