Citation
Nazif, Habibeh and Lee, Lai Soon
(2012)
Optimised crossover genetic algorithm for capacitated vehicle routing problem.
Applied Mathematical Modelling, 36 (5).
pp. 2110-2117.
ISSN 0307-904X; ESSN: 1872-8480
Abstract
This paper presents a genetic algorithm for solving capacitated vehicle routing problem, which is mainly characterised by using vehicles of the same capacity based at a central depot that will be optimally routed to supply customers with known demands. The proposed algorithm uses an optimised crossover operator designed by a complete undirected bipartite graph to find an optimal set of delivery routes satisfying the requirements and giving minimal total cost. We tested our algorithm with benchmark instances and compared it with some other heuristics in the literature. Computational results showed that the proposed algorithm is competitive in terms of the quality of the solutions found.
Download File
|
Additional Metadata
| Item Type: | Article |
|---|---|
| Divisions: | Faculty of Science Institute for Mathematical Research |
| DOI Number: | https://doi.org/10.1016/j.apm.2011.08.010 |
| Publisher: | Elsevier |
| Keywords: | Genetic algorithm; Vehicle routing problem; Combinatorial optimisation; Network; Heuristics |
| Depositing User: | Nur Farahin Ramli |
| Date Deposited: | 25 Nov 2013 07:57 |
| Last Modified: | 16 Jan 2018 08:59 |
| Altmetrics: | http://www.altmetric.com/details.php?domain=psasir.upm.edu.my&doi=10.1016/j.apm.2011.08.010 |
| URI: | http://psasir.upm.edu.my/id/eprint/25245 |
| Statistic Details: | View Download Statistic |
Actions (login required)
 |
View Item |