Comparing The Performance of Simulated Annealing and Genetic Algorithm Metaheuristics in The Solving of Vehicle Routing Problem Variants
Solving the variants of the Vehicle Routing Problem (VRP) is invaluable to a huge range of businesses today. It allows for the calculation of efficient logistics routing which can drastically improve a firm’s competitiveness. As NP-hard combinatorial optimisation problems, they cannot be solved by e...
| Main Author: | |
|---|---|
| Format: | Dissertation (University of Nottingham only) |
| Language: | English |
| Published: |
2014
|
| Online Access: | https://eprints.nottingham.ac.uk/27177/ |