NDLI: Solving the Traveling Salesman Problem through Iterative Extended Changing Crossover Operators

Content Provider	IEEE Xplore Digital Library
Author	Takahashi, R.
Copyright Year	2011
Abstract	The subject of the Genetic Algorithm (GA) is to devise methodologies that can efficiently locate the optimum solution which must satisfy the contrary requirements of preserving population diversity and speeding up convergence on the optimum solution. In this paper, a new hybrid method iterative Extended Changing Crossover Operators (i-ECXO) combining Edge Assembly Crossover (EAX) and Ant Colony Optimization (ACO) is proposed to solve the Traveling Salesman Problem (TSP). In EAX, parent A's edge EA is exchanged for parent B's edge EB finally to generate new off spring, where EA and EB alternate in forming so-called A-B cycles. ACO simulates swarm intelligence in ants' feeding behavior. In ACO, ants tend to create various kinds of cyclic paths with different sequences of visiting cities in early stage of generations. In this paper, the diversity of generations is strictly measured by the entropy H in Thermo Dynamical Genetic Algorithm (TDGA). With the measure H, the validity of i-ECXO is experimentally verified by using medium sized TSP data.
Starting Page	253
Ending Page	258
File Size	318695
Page Count	6
File Format	PDF
ISBN	9781457721342
DOI	10.1109/ICMLA.2011.129
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2011-12-18
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Measurement Hybrid method Optimized production technology Entropy ACO TDGA Biological cells Convergence Genetic algorithms TSP Cities and towns iterative ECXO GA EAX
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

Quantitative evaluation of iterative extended changing crossover operators to solve the traveling salesman problem: Diversity measurement and its application to selection strategies in genetic algorithms

A Methodology of Extended Changing Crossover Operators to Solve the Traveling Salesman Problem

Solving the traveling salesman problem through genetic algorithms with changing crossover operators

Improving the Solution of Traveling Salesman Problem Using Genetic, Memetic Algorithm and Edge assembly Crossover

PMACO: A pheromone-mutation based ant colony optimization for traveling salesman problem

Solving the Traveling Salesman Problem through Extended Changing Crossover Operators

Optimization and improvement of Genetic Algorithms solving Traveling Salesman Problem

Entropy-based genetic algorithm for solving TSP

An Effective Hybrid Ant Colony Algorithm for Solving the Traveling Salesman Problem

Solving the Traveling Salesman Problem through Iterative Extended Changing Crossover Operators

Similar Documents

Quantitative evaluation of iterative extended changing crossover operators to solve the traveling salesman problem: Diversity measurement and its application to selection strategies in genetic algorithms

A Methodology of Extended Changing Crossover Operators to Solve the Traveling Salesman Problem

Solving the traveling salesman problem through genetic algorithms with changing crossover operators

Improving the Solution of Traveling Salesman Problem Using Genetic, Memetic Algorithm and Edge assembly Crossover

PMACO: A pheromone-mutation based ant colony optimization for traveling salesman problem

Solving the Traveling Salesman Problem through Extended Changing Crossover Operators

Optimization and improvement of Genetic Algorithms solving Traveling Salesman Problem

Entropy-based genetic algorithm for solving TSP

An Effective Hybrid Ant Colony Algorithm for Solving the Traveling Salesman Problem

Solving the Traveling Salesman Problem through Iterative Extended Changing Crossover Operators