NDLI: Using adaptive operator scheduling on problem domains with an operator manifold: applications to the travelling salesman problem

Content Provider	IEEE Xplore Digital Library
Author	Boomsma, W.
Copyright Year	2003
Description	Author affiliation: Dept. of Comput. Sci., Aarhus Univ., Denmark (Boomsma, W.)
Abstract	A growing problem in the field of evolutionary computation is the large amount of genetic operators available for certain problem domains. This tendency is especially pronounced in areas where heuristics are used to create highly specialised operators. Even within the same problem domain, the performance of such operators often depends on the specific problem instance at hand. This results in a tedious and time-consuming process of comparing individual operator performances every time a new problem is to be solved. We investigate the use of adaptive operator scheduling to automate the operator selection process. The approach is tested on instances of the travelling salesman problem - a problem for which a long list of operators exists. Results show that benefits are twofold: Operator selection is achieved automatically and an overall performance improvement is observed.
Sponsorship	Air Force Iffice of Sci. Res. Asian Office of Aerospace Res and Development Army Res. Office - Far East CISCO Evoluationary Programming Soc. IEE Inst. of Engineers, Australia IEEE Neural Networks Soc. Univ. of New South Wales
Starting Page	1274
Ending Page	1279
File Size	348366
Page Count	6
File Format	PDF
ISBN	0780378040
DOI	10.1109/CEC.2003.1299815
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2003-12-08
Publisher Place	Australia
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Adaptive scheduling Traveling salesman problems Genetic algorithms Application software Programming profession Benchmark testing Processor scheduling Computer science Uncertainty Neural networks
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

An argument for abandoning the travelling salesman problem as a neural-network benchmark

Using adaptive operator scheduling on problem domains with an operator manifold: Applications to the travelling salesman problem

An adaptive discrete particle swarm optimization for TSP problem

Genetic algorithm for Traveling Salesman Problem: Using modified Partially-Mapped Crossover operator

A perspective view on Travelling Salesman Problem using genetic algorithm

Natural Computation for the Traveling Salesman Problem

A neural network approach to job-shop scheduling

An Ant Colony Optimization Algorithm for Multiple Travelling Salesman Problem

A 2opt-DPX genetic local search for solving symmetric traveling salesman problem

Using adaptive operator scheduling on problem domains with an operator manifold: applications to the travelling salesman problem

Similar Documents

An argument for abandoning the travelling salesman problem as a neural-network benchmark

Using adaptive operator scheduling on problem domains with an operator manifold: Applications to the travelling salesman problem

An adaptive discrete particle swarm optimization for TSP problem

Genetic algorithm for Traveling Salesman Problem: Using modified Partially-Mapped Crossover operator

A perspective view on Travelling Salesman Problem using genetic algorithm

Natural Computation for the Traveling Salesman Problem

A neural network approach to job-shop scheduling

An Ant Colony Optimization Algorithm for Multiple Travelling Salesman Problem

A 2opt-DPX genetic local search for solving symmetric traveling salesman problem

Using adaptive operator scheduling on problem domains with an operator manifold: applications to the travelling salesman problem