NDLI: Multipoint-based tabu search using proximate optimality principle

Content Provider	IEEE Xplore Digital Library
Author	Miyamoto, K. Yasuda, K.
Copyright Year	2005
Description	Author affiliation: Dept. of Electr. Eng., Tokyo Metropolitan Univ., Japan (Miyamoto, K.)
Abstract	This paper presents a new method for combinatorial optimization problems. Most of the actual problems that have discrete structure can be formulated as combinatorial optimization problems. It is experientially known that proximate optimality principle (POP) holds in most of the actual combinatorial optimization problems. The concept of proximate optimality principle says that good solutions of most real combinatorial optimization problems have the structural similarity in parts of solution. In this paper, we propose a new optimization method based on tabu search. In the proposed algorithm, POP is taken into consideration. The proposed algorithm is applied to some knapsack problems and traveling salesman problems, which are typical combinatorial optimization problems in order to verify the performance of the proposed algorithm.
Starting Page	3094
Ending Page	3099
File Size	185813
Page Count	6
File Format	PDF
ISBN	0780392981
DOI	10.1109/ICSMC.2005.1571621
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2005-10-12
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Optimization methods Constraint optimization Approximation algorithms Traveling salesman problems Mathematical programming Agricultural engineering Agriculture Physics Humans Polynomials Proximate Optimality Principle Optimization Meta-Heuristics Tabu Search
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Proximate optimality principle based Tabu Search

Basic study of proximate optimality principle based combinatorial optimization method

Similarity measure of proximate optimality principle and Multi-Point Tabu Search

Multi-point Tabu Search based on Proximate Optimality Principle

An improved tabu search for solving symmetric traveling salesman problems

Multi-point Search Combinatorial Optimization Method Based on Neighborhood Search Using Evaluation of Big Valley Structure

Population-based guided local search for multidimensional Knapsack problem

Asymmetric Traveling Salesman Path and Directed Latency Problems

CLARANS heuristic based approch for the k-traveling repairman problem

Multipoint-based tabu search using proximate optimality principle

Similar Documents

Proximate optimality principle based Tabu Search

Basic study of proximate optimality principle based combinatorial optimization method

Similarity measure of proximate optimality principle and Multi-Point Tabu Search

Multi-point Tabu Search based on Proximate Optimality Principle

An improved tabu search for solving symmetric traveling salesman problems

Multi-point Search Combinatorial Optimization Method Based on Neighborhood Search Using Evaluation of Big Valley Structure

Population-based guided local search for multidimensional Knapsack problem

Asymmetric Traveling Salesman Path and Directed Latency Problems

CLARANS heuristic based approch for the k-traveling repairman problem

Multipoint-based tabu search using proximate optimality principle