A discrete firefly algorithm to solve a rich vehicle routing problem modelling a newspaper distribution system with recycling policy
- Submitting institution
-
Middlesex University
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 338
- Type
- D - Journal article
- DOI
-
10.1007/s00500-016-2114-1
- Title of journal
- Soft Computing
- Article number
- -
- First page
- 5295
- Volume
- 21
- Issue
- 18
- ISSN
- 1432-7643
- Open access status
- Out of scope for open access requirements
- Month of publication
- March
- Year of publication
- 2016
- URL
-
http://eprints.mdx.ac.uk/19286/
- 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
-
5
- Research group(s)
-
-
- Citation count
- 53
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- Vehicle routing is a challenging combinatorial problem. This paper is significant because it demonstrates for the first time that such difficult rich vehicle routing problems can be solved using our proposed discrete firefly algorithm (DFA), with pickups and deliveries, varying costs and forbidden paths. The impact is significant because the DFA has been applied to a newspaper distribution system with a recycling policy in a real-world setting for real geographical data and routes in northern Spain (Basque region), which provides new insights for solving asymmetrical vehicle routing problems with dynamic traffic information.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -