NDLI: Performance of genetic approach using only two individuals

Content Provider	IEEE Xplore Digital Library
Author	Katayama, K. Narihisa, H.
Copyright Year	1999
Description	Author affiliation: Dept. of Inf. & Comput. Eng., Okayama Univ., Japan (Katayama, K.)
Abstract	The combination algorithms of local search heuristics and genetic algorithms are often called "genetic local search" (GLS). The GLS algorithms have been applied to combinatorial optimisation problems, and their effectiveness has been recognized very well so far. Since the GLS algorithms contain many candidate individuals to find very good approximate solutions, it seems to be reasonable to suggest that rather fewer individuals be used. In general, a fixed number of individuals has been set by making good use of researcher's experience or suggestions from the past in most cases. In this paper, we firstly investigate the effectiveness of the GLS algorithm, which contains only two individuals, by comparing with the GLS using many for benchmarks of the traveling salesman problem. It is shown that both GLS algorithms have the same condition except for the number of individuals, and very good costs of solutions obtained by the algorithms are provided. From our experimental results, we demonstrate that the GLS using many individuals has good performance, however, it is not always suitable to use many individuals by secondly comparing with a novel 'genetic' approach that also contains only two solutions.
Starting Page	677
Ending Page	682
File Size	801434
Page Count	6
File Format	PDF
ISBN	0780357310
ISSN	1062922X
DOI	10.1109/ICSMC.1999.814173
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	1999-10-12
Publisher Place	Japan
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Genetic algorithms Traveling salesman problems Genetic mutations Cities and towns Costs Evolution (biology)
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

A new approach to the traveling salesman problem using genetic algorithms with priority encoding

A Polynomial Time Evolution Algorithm for the Traveling Salesman Problem

New crossover operators in genetic algorithms

A multiple heuristic search algorithm for solving traveling salesman problem

Performance enhancement in solving Traveling Salesman Problem using hybrid genetic algorithm

A decomposition approach to colored traveling salesman problems

A Genetic Algorithm Balancing Exploration and Exploitation for the Travelling Salesman Problem

A New Method Based on Genetic Algorithms for Solving Traveling Salesman Problem

An error-tolerant genetic algorithm for traveling salesman problems

Performance of genetic approach using only two individuals

Similar Documents

A new approach to the traveling salesman problem using genetic algorithms with priority encoding

A Polynomial Time Evolution Algorithm for the Traveling Salesman Problem

New crossover operators in genetic algorithms

A multiple heuristic search algorithm for solving traveling salesman problem

Performance enhancement in solving Traveling Salesman Problem using hybrid genetic algorithm

A decomposition approach to colored traveling salesman problems

A Genetic Algorithm Balancing Exploration and Exploitation for the Travelling Salesman Problem

A New Method Based on Genetic Algorithms for Solving Traveling Salesman Problem

An error-tolerant genetic algorithm for traveling salesman problems

Performance of genetic approach using only two individuals