Uncertain Programming Model For Vehicle Routing Problem

Logistics is an important indicator to measure whether a city or a country is well developed. And the vehicle dispatch, which plays such an important role in the development of logistics, is the core of it. Thus, the vehicle routing problem is always a hot spot in operational research. Since the road condition in the real world is so complex that there may be many uncertain factors. Recent years, many researchers introduced the uncertainty theory in the problem, and built uncertain programming models for it.This thesis is based on the prior study, adding two factors, that customers have di?erent demands and each vehicle has capacity limit, to the problem. Then two new uncertain programming models for it are proposed. Besides, this paper designs a numerical method to solve the problem.This paper first gives a brief introduction to the vehicle routing problem and proposes two new uncertain programming models for it. Then a genetic algorithm for the models is designed. Finally, some numerical examples are presented.The contributions of this paper are:? It proposes two new uncertain programming models for vehicle routing problem, considering the practical factors that di?erent customers have di?erent demands and each vehicle has capacity limit;? It designs a genetic algorithm to solve the two new models proposed in this thesis.