NDLI: An estimation of parameters in an energy function used in a simulated annealing method

Content Provider	IEEE Xplore Digital Library
Author	Igarashi, H.
Copyright Year	1992
Description	Author affiliation: ATR Auditory & Visual Perception Res. Lab., Kyoto, Japan (Igarashi, H.)
Abstract	When a combinatorial optimization problem such as the traveling salesman problem is solved by a simulated annealing method, it is common to use an energy function that consists of two kinds of terms: a cost term which should be minimized and a constraint term which expresses constraints imposed on solutions. The author proposes a method for determining appropriate values of weights of constraint terms in the annealing process. If appropriate values of parameters expressing the weights of the constraint terms are not given, only solutions which do not satisfy all constraints, or high-cost solutions, can be found. A method is presented that leads to appropriate values of these parameters and finds an optimal solution in a systematic manner. The method was applied to 10-city traveling salesman problems, and the experiments showed the effectiveness of the method.
Starting Page	480
Ending Page	485
File Size	371577
Page Count	6
File Format	PDF
ISBN	0780305590
DOI	10.1109/IJCNN.1992.227298
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	1992-06-07
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Parameter estimation Simulated annealing Traveling salesman problems Stationary state Cost function Neural networks Visual perception Laboratories Constraint optimization Computational modeling
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

Determination of parameters in relaxation-search neural networks for optimization problems

Dual-mode dynamics neural network (D2NN) for the traveling salesman problem

A Columnar Competitive Model with Simulated Annealing for Solving Combinatorial Optimization Problems

Rescaled simulated annealing

Augmented Lagrange chaotic simulated annealing for combinatorial optimization problems

Simulated Annealing with Iterative Improvement

A new method of improving Wang and Smith's chaotic neural network

A direct neural approach for the traveling salesman problem

Sub-optimal solution screening in optimization by neural networks

An estimation of parameters in an energy function used in a simulated annealing method

Similar Documents

Determination of parameters in relaxation-search neural networks for optimization problems

Dual-mode dynamics neural network (D2NN) for the traveling salesman problem

A Columnar Competitive Model with Simulated Annealing for Solving Combinatorial Optimization Problems

Rescaled simulated annealing

Augmented Lagrange chaotic simulated annealing for combinatorial optimization problems

Simulated Annealing with Iterative Improvement

A new method of improving Wang and Smith's chaotic neural network

A direct neural approach for the traveling salesman problem

Sub-optimal solution screening in optimization by neural networks

An estimation of parameters in an energy function used in a simulated annealing method