Solution Model of Heterogeneous Vehicle Routing Problem with Fixed Vehicle Operating Cost (Case Study: Supply Chain of Arak Dairy Co.)

Mehdi Akbari¹ Mahdi Ghaffari²

IOI Code : XYAH-ZDZHF
Publication : 3rd international conference of Science and Engineering(3icesconf.com)
Abstract :
    Abstract Vehicle routing problem falls into the category of NP-Hard problems. These problems have a polynomial time complexity of higher order, so the exact solution takes much more time as the problem scale increases and thus using approximate solution techniques provided by heuristic and meta-heuristic methods are more recommended. In this article, the heterogeneous fleet vehicle routing problem with fixed vehicle operating cost is examined. After presenting the mathematical model of the problem, a meta-heuristic genetic algorithm has been developed to deal with its NP-Hard nature. To assess the performance of the proposed algorithm, the accuracy and computational time achieved for several numerical examples are compared with those of exact solution obtained by Lingo software. Next, a case study consisting of a central depot and 11 customers is solved. The results indicate that the presented genetic algorithm has an acceptable performance and yields solutions with minimal error and reasonable computation time.

Keywords : heterogeneous vehicle routing problem optimization fixed vehicle operating cost genetic algorithm