Combinatorial Optimization Method Based on Proximate Optimality Principle Using Neighborhood Search

• Yaguchi Kota

  Tokyo Metropolitan University

• Tamura Kenichi

  Tokyo Metropolitan University

• Yasuda Keiichiro

  Tokyo Metropolitan University

• Ishigame Atsushi

  Osaka Prefecture University

Bibliographic Information

Other Title

• 近接最適性原理を用いた近傍探索に基づく組合せ最適化手法

Abstract

This paper proposes a new neighborhood search method for solving combinatorial optimization problems based on Proximate Optimality Principle (POP). The proposed combinatorial optimization method has higher optimality and lower computational complexity than conventional neighborhood search methods. The proposed method is applied to several typical combinatorial optimization problems in order to verify the performance of the proposed method.

Journal

• IEEJ Transactions on Electronics, Information and Systems

  IEEJ Transactions on Electronics, Information and Systems 132 (5), 813-814, 2012

  The Institute of Electrical Engineers of Japan

Keywords

• Meta-Heuristics
• Combinatorial Optimization
• Proximate Optimality Principle
• Intensification
• Diversification

Details

• CRID: 1390001204609488896
• NII Article ID: 10030606257
• NII Book ID: AN10065950
• DOI: 10.1541/ieejeiss.132.813
• BIBCODE: 2012ITEIS.132..813Y
• ISSN: 13488155
• ISSN: 03854221
• Web Site: https://www.jstage.jst.go.jp/article/ieejeiss/132/5/132_5_813/_pdf
• Text Lang: ja
• Data Source:
  • JaLC
  • Crossref
  • CiNii Articles
  • KAKEN
• Abstract License Flag: Disallowed