Uncertain Programming Models For Supermarket Logistics Distribution With Time Windows

In recent years, supermarket is developing rapidly over China what bring subsequently is logistics industry boom. For supermarket logistics distribution center, how to schedule the distribution vehicle effectively in an effort to reduce logistics costs is a subject worthy of study.There are lots of uncertain information during the process of logistics distribution. Such as the uncertainty of demand characteristics of the goods, the uncertainty of customer demand time, the uncertainty of road, the uncertainty of vehicles and so on. This thesis studies the problem of the supermarket logistics distribution with time windows in uncertain environment under uncertainty theory. The daily demands of supermarkets and travel times of vehicles are treated as uncertain variables. In order to realize the distribution time shortest or distribution cost at least, two uncertain programming chance constraint models are constructed. Then the proposed models are converted into crisp equivalent models by operational law. Moreover, the algorithm for solving the models are designed. Finally, numerical examples are presented to illustrate each modeling idea.