Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
A New Crossover Technique to Improve Genetic Algorithm and Its Application to TSP
International Islamic University, Chittagong, Bangladesh.
University of Chittagong, Bangladesh.
University of Chittagong, Bangladesh.ORCID iD: 0000-0002-7473-8185
Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.ORCID iD: 0000-0003-0244-3561
2019 (English)In: Proceedings of 2019 International Conference on Electrical, Computer and Communication Engineering (ECCE), IEEE, 2019, article id 18566123Conference paper, Published paper (Refereed)
Abstract [en]

Optimization problem like Travelling Salesman Problem (TSP) can be solved by applying Genetic Algorithm (GA) to obtain perfect approximation in time. In addition, TSP is considered as a NP-hard problem as well as an optimal minimization problem. Selection, crossover and mutation are the three main operators of GA. The algorithm is usually employed to find the optimal minimum total distance to visit all the nodes in a TSP. Therefore, the research presents a new crossover operator for TSP, allowing the further minimization of the total distance. The proposed crossover operator consists of two crossover point selection and new offspring creation by performing cost comparison. The computational results as well as the comparison with available well-developed crossover operators are also presented. It has been found that the new crossover operator produces better results than that of other cross-over operators.

Place, publisher, year, edition, pages
IEEE, 2019. article id 18566123
Keywords [en]
TSP, GA, crossover operator, offspring, chromosome, substring
National Category
Computer Sciences
Research subject
Pervasive Mobile Computing
Identifiers
URN: urn:nbn:se:ltu:diva-72626DOI: 10.1109/ECACE.2019.8679367Scopus ID: 2-s2.0-85064611070ISBN: 978-1-5386-9111-3 (electronic)OAI: oai:DiVA.org:ltu-72626DiVA, id: diva2:1280530
Conference
International Conference on Electrical, Computer and Communication Engineering (ECCE 2019), 07-09 February, 2019, Cox's Bazar, Bangladesh.
Projects
A belief-rule-based DSS to assess flood risks by using wireless sensor networks
Funder
Swedish Research Council, 2014-4251Available from: 2019-01-19 Created: 2019-01-19 Last updated: 2019-05-15Bibliographically approved

Open Access in DiVA

fulltext(269 kB)119 downloads
File information
File name FULLTEXT01.pdfFile size 269 kBChecksum SHA-512
16e91b8487d50dbbbab249e292ad7b7cc780cec90e42d3aff250d3e4ae6c6253db0c3ffa1c6f74b3ff011227943917ae3b6845e9a35450347a3a2a5695e05805
Type fulltextMimetype application/pdf

Other links

Publisher's full textScopus

Authority records BETA

Andersson, Karl

Search in DiVA

By author/editor
Hossain, Mohammad ShahadatAndersson, Karl
By organisation
Computer Science
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar
Total: 119 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 369 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf