An improved discrete bat algorithm for symmetric and asymmetric traveling salesman problems
- Submitting institution
-
Middlesex University
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 339
- Type
- D - Journal article
- DOI
-
10.1016/j.engappai.2015.10.006
- Title of journal
- Engineering Applications of Artificial Intelligence
- Article number
- -
- First page
- 59
- Volume
- 48
- Issue
- -
- ISSN
- 0952-1976
- Open access status
- Out of scope for open access requirements
- Month of publication
- November
- Year of publication
- 2015
- URL
-
http://eprints.mdx.ac.uk/19112/
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
4
- Research group(s)
-
-
- Citation count
- 138
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- The asymmetrical travelling salesman problem (ATSP) is an NP-hard (nondeterministic polynomial) problem. This paper solves, for the first time, such ATSPs using the improved bat algorithm, based on the original bat algorithm by Yang (2010). The work is significant because it solves 37 instances of ATSPs and compares it with five other state-of-the-art methods. Rigorous statistical tests, in terms of Holm’s test and Friedman ranking tests, show that our improved algorithm has significantly outperformed all other methods. The impact is also significant because this method provides an effective alternative for solving real-world vehicle routing problems with asymmetric paths.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -