2014•IEEJ Transactions on Electronics Information and SystemsOpen access

Proposal of Tabu Search Based Multi-Point Search Method for Multi-Objective Combinatorial Optimization Problems

Shuhei Takamura, Kenichi Tamura, Keiichiro Yasuda

Abstract

It is known that neighborhood search methods such as Tabu Search have the high performances for single-objective combinatorial optimization problems. In this paper, we develop a new method based on Tabu Search for multi-objective combinatorial optimization problems by using multi-point search and interaction among search points. The performance of the developed optimization method is examined using 3 types of 2-objective 0-1 knapsack problems.

Open-access reader

About this research paper

What this paper is about

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Tabu search, Knapsack problem, Guided Local Search, Combinatorial optimization, Mathematical optimization, Combinatorial search, Hill climbing, Point (geometry)