UPM Institutional Repository

Harmony search for multi-depot vehicle routing problem


Citation

Misni, F. and Lee, L. S. (2019) Harmony search for multi-depot vehicle routing problem. Malaysian Journal of Mathematical Sciences, 13 (3). pp. 311-328. ISSN 1823-8343

Abstract

This study considers the multi-depot vehicle routing problem in supply chain network design. Vehicle routing is one of the important system in supply chain. The objective is to find the minimum distance travelled by the vehicles, from the depot to the customers. We proposed an improved harmony search algorithm for solving this problem. Firstly, the Clarke & Wright saving algorithm is used for the initialisation of a solution vector in harmony search. Three simple heuristics approaches; swapping, insertion and relocation are proposed as the local optimisation techniques during the implementation of the harmony search. The roulette wheel approach is implemented for the selection procedure. Computational experiments are conducted using the benchmark dataset of Cordeau's problem instances. Computational results show that the proposed harmony search algorithm is comparable to other metaheuristic approaches from the literature.


Download File

Full text not available from this repository.

Additional Metadata

Item Type: Article
Divisions: Faculty of Science
Institute for Mathematical Research
Publisher: Universiti Putra Malaysia, Institute for Mathematical Research
Keywords: Harmony search; Supply chain network design; Multi-depot vehicle routing
Depositing User: Nurul Ainie Mokhtar
Date Deposited: 04 Jul 2023 05:44
Last Modified: 04 Jul 2023 05:44
URI: http://psasir.upm.edu.my/id/eprint/80035
Statistic Details: View Download Statistic

Actions (login required)

View Item View Item