Reasearch on efficient algorithms based on the mathematical programming technique for the vehicle routing problems

点击翻译按钮获取中文摘要

The vehicle routing problem is the problem of minimizing the total cost of a number of vehicles, under various constraints, where every customer must be visited exactly once by a vehicle. One of the effective algorithms for the problem is a local search. It starts from an initial solution and repeats replacing the solution with a better solution in its neighborhood. Metaheuristic algorithms based on local search have been studied. In this research, we proposed efficient algorithms by combining local search and metaheuristics with mathematical programming technique.