A Comparative Evaluation of Selected Heuristic Solutions of Vehicle Routing Problems in Supply Chain Management

Authors

  • O. O.Okediran Department of Computer Science & Engineering, Ladoke Akintola University of Technology, P.M. B. 4000, Ogbomoso, Nigeria
  • A. E.Okeyinka Department of Computer Science & Engineering, Ladoke Akintola University of Technology, P.M. B. 4000, Ogbomoso, Nigeria
  • O. T.Arulogun Department of Computer Science & Engineering, Ladoke Akintola University of Technology, P.M. B. 4000, Ogbomoso, Nigeria
  • R. A. Ganiyu Department of Computer Science & Engineering, Ladoke Akintola University of Technology, P.M. B. 4000, Ogbomoso, Nigeria
  • ALO, O. O Department of Computer Science & Engineering, Ladoke Akintola University of Technology, P.M. B. 4000, Ogbomoso, Nigeria

Keywords:

combinatorial optimization, Impractical problem, Heuristics, Asymptotic time complexity and Halsted complexity measure.

Abstract

This work involves evaluation of three heuristics which are often used to solve
the VRP namely; nearest insertion, nearest neighbour, and tour improvement heuristics
using computer execution time, implementation complexity and asymptotic time
complexity. The research findings of this work have established that the nearest neighbour
heuristic is the most efficient in terms of execution time, program volume and
programming effort. The nearest insertion heuristics ranks next while the tour improvement
heuristic is the least efficient. Solution to a thirty-seven-node vehicle routing problem
implemented using the Nigerian State capitals and Abuja was also obtained.

Downloads

Published

2011-04-01

Issue

Vol. 2 No. 2 (2011): Journal of Innovative Research in Engineering and Science

Section

Articles