This paper concerns the search of tours along a number of clients from a point of distribution using mathematical techniques. Contrary to most current mathematical models, dependence on time is taken with. In the network of roads the cost of the section of a road can vary over the day. Algorithms are developed to find the cheapest time-dependent tour if loadtime, unloadtimes and starting time are given. The second aspect is the weighing of travel time and unsafeness. Every tour has a certain travel time and a certain unsafeness. When costs are composed of travel time and unsafeness, tours are found that can be usefull in practice. A method is developed to find this usefull tours in an efficient way. When the model was applied to a real network of roads, the dependence of time had not a great influence upon the choice of the best tour. The weighing of travel time and unsafenessproduced interesting results. (Author/publisher)
Samenvatting