Basic study of proximate optimality principle based combinatorial optimization method

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 combinatori...

Full description

Saved in:
Bibliographic Details
Main Authors: Yaguchi, K., Tamura, K., Yasuda, K., Ishigame, A.
Format: Conference Proceeding
Language:English
Subjects:
Cities and towns
Combinatorial Optimization
Computational complexity
Diversification
Intensification
Meta-Heuristics
Optimization methods
Proximate Optimality Principle
Search problems
Traveling salesman problems
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1062-922X
2577-1655
DOI:10.1109/ICSMC.2011.6083925