An improved discrete bat algorithm for symmetric and asymmetric Traveling Salesman Problems

Published 2016 View Full Article

  1. Home
  2. Publications
  3. Publication Search
  4. Publication Details
Title
An improved discrete bat algorithm for symmetric and asymmetric Traveling Salesman Problems
Authors
Keywords
Bat algorithm, Traveling Salesman Problem, Genetic algorithms, Combinatorial optimization, Routing problems
Journal
ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE
Volume 48, Issue -, Pages 59-71
Publisher
Elsevier BV
Online
2015-11-19
DOI
10.1016/j.engappai.2015.10.006

Ask authors/readers for more resources

Protocol

Community support

Reagent

Community support

Reprint

Contact the author

Find the ideal target journal for your manuscript

Explore over 38,000 international journals covering a vast array of academic fields.

Search

Become a Peeref-certified reviewer

The Peeref Institute provides free reviewer training that teaches the core competencies of the academic peer review process.

Get Started
Webinars Posters Questions Hubs Funding Journals Articles Connect Collections Reviewers About Us FAQs Mobile App Privacy Policy Terms of Use
© Peeref 2019-2024. All rights reserved.