Design and implementation of a population and neighborhood based metaheuristic algorithm for vehicle routing problems

TIn this thesis study, a population and neighborhood search based metaheuristic algorithm isproposed for capacity and distance restricted Vehicle Routing Problem, which is usuallyencountered during logistic planning in companies. When developing this method, populationbased techniques? diversification and local search based techniques? intensification strategiesare taken into account. Initial solutions are produced using classical heuristics and individualsare selected from solution pool with Binary Tournament sense. New generation is created byscanning neighborhood solutions randomly, considering ?distance between solutions in searchspace? concept introduced in this study. In this manner, search can be driven in solutionspace?s most promising regions and solutions quality is enhanced. Furthermore, algorithmprocess has a stochastic structure providing to set fairly few parameters. Proposed method isput into practice for several problems in literature and produce successful outputs.Keywords: Vehicle Routing Problem, Metaheuristic Algorithms