Abstract—This paper considers a generalized vehicle routing problem in a real application of a chain of convenience stores. The problem is to find the best truck routes, based on bi-criteria, for distributing a variety of products from a distribution center to convenience stores by using non-identical trucks. The distances between two places are asymmetric. This paper proposes multiple local search algorithms. Some of them use single neighborhood structure and some use double neighborhood structures. The aim of this paper is to find the local search algorithm with the specific neighborhood structure that performs very well for the generalized vehicle routing problem proposed in this paper.

Index Terms—bi-criteria optimization problem, local search algorithm, neighborhood structure, vehicle routing problem

Cite: Yuwadee Prakaiphetkul and Pisut Pongchairerks, "Local Search Algorithms for Vehicle Routing Problems of a Chain of Convenience Stores," Journal of Industrial and Intelligent Information, Vol. 3, No. 3, pp. 266-273, September 2015. doi: 10.12720/jiii.3.3.266-273