NDLI: Modeling TSP with Particle Swarm Optimization and Genetic Algorithm

Content Provider	IEEE Xplore Digital Library
Author	Ali Khan, S. Asghar, S. Fong, S.
Copyright Year	2010
Description	Author affiliation: Faculty of Science and Technology, University of Macau, China (Fong, S.) \|\| Center of Research in Data Engineering (CORDE), Mohammad Ali Jinnah University, Islamabad, Pakistan (Ali Khan, S.; Asghar, S.)
Abstract	Traveling Salesman Problem (TSP) is a classical problem of optimization for researchers and its modeling is of great interest for Engineering, Operations Research and Computer Science. For solving TSP, many methods have been proposed, including heuristic ones. Our work extends the hybrid model, based on Particle Swarm Optimization, Genetic Algorithms and Fast Local Search, for the symmetric blind travelling salesman problem proposed by Thiago R. Machado and Heitor S. Lopes. We have replaced the fast local search with mutation to avoid the overhead for finding optimal solution. We have also replaced the one point crossover with uniform crossover as one point crossover is found to generate invalid tours in most of the cases. We argue that this model is more efficient as compared to the model proposed by Thiago R. Machado and Heitor S. We implement a prototype of the model and show its feasibility.
Starting Page	455
Ending Page	459
File Size	877751
Page Count	5
File Format	PDF
ISBN	9781424485994
e-ISBN	9788988678329
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2010-11-30
Publisher Place	Korea (South)
Access Restriction	Subscribed
Rights Holder	AICIT
Subject Keyword	Cross over Local search Pbest Traveling salesman problems Fast Local Search Search problems Encoding Particle swarm optimization Lbest PSO Biological cells Optimization TSP Cities and towns Mutation Genetic Algorithms
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

Particle Swarm Optimization with partial search to solve Traveling Salesman Problem

Chaotic Particle Swarm Optimization Algorithm for Traveling Salesman Problem

Solving TSP via fuzzy dynamic PSO and HNN algorithm

Improved Enhanced Self-Tentative PSO algorithm for TSP

Hybrid Genetic Algorithm for TSP

Adapting TRIBES algorithm for Traveling Salesman Problem

A Novel Genetic Algorithm and Its Application in TSP

Quantitative analysis of separate and combined performance of local searcher and genetic algorithm

Particle Swarn Optimization with Fast Local Search for the Blind Traveling Salesman Problem

Modeling TSP with Particle Swarm Optimization and Genetic Algorithm

Similar Documents

Particle Swarm Optimization with partial search to solve Traveling Salesman Problem

Chaotic Particle Swarm Optimization Algorithm for Traveling Salesman Problem

Solving TSP via fuzzy dynamic PSO and HNN algorithm

Improved Enhanced Self-Tentative PSO algorithm for TSP

Hybrid Genetic Algorithm for TSP

Adapting TRIBES algorithm for Traveling Salesman Problem

A Novel Genetic Algorithm and Its Application in TSP

Quantitative analysis of separate and combined performance of local searcher and genetic algorithm

Particle Swarn Optimization with Fast Local Search for the Blind Traveling Salesman Problem

Modeling TSP with Particle Swarm Optimization and Genetic Algorithm