Capaciated vehicle routing problem- Family mart case study

Abstract

This thesis will focus on resolving the Vehicle routing problem or Traveling salesman problem, a topic of interest for various researchers and universities in recent years. An extension of VRP, called MTCVRPTW or Multi Trip Capacitated Vehicle Routing Problem with Time Window is implemented in the case study of Family Mart. The main goal of this thesis is to resolve the company’s dynamic vehicle routing problems with the use of meta heuristics algorithm to minimizing the total cost used by the operation while sastify time- window constrain of each store and maximize the efficiency of vehicle usage. This goal is solved by applying genetic algorithm model. The results generated from the Family Mart data are analyzed and recommendation are made in regards to Family mart stores’ demand. Keywords: Vehicle routing problem, MTVRPTW, genetic algorithm, Matlab, Dynamic capacitated vehicle routing with time-window