Repository logo

Browsing by Author "Łebkowski, Piotr Jerzy"

Filter results by typing the first few letters
Now showing 1 - 1 of 1
  • thumbnail.journal.alt
    Item type:Doctoral Dissertation, Access status: Open Access ,
    Sterowanie dyskretnymi procesami dystrybucji w logistyce
    (Data obrony: 2012) Woch, Marcin
    Wydział Inżynierii Mechanicznej i Robotyki
    The aim of the dissertation is to design an algorithm to calculate least cost routes from one central depot to a set of geographically scattered points, so called clients. Each point on the routes has to be visited only once by exactly one vehicle. All routes start and end at the central depot and the total demand of all the clients on one route must not exceed vehicle capacity. The Vehicle Routing Problem with Time Windows (VRPTW) is a generalization of the VRP involving the additional constraint that every customer must be served within a given time window. Time window requirement does not prevent any vehicle from arriving before the allowed start of service at a customer location. The fleet of vehicles is homogenous. The primary objective is minimization of the number of routes, total travelled distance and total duration of routes are considered as secondary aim. Thus the VRPTW is a bi-criterion optimization problem. The practical application of the VRPTW includes school bus routing, deliveries of goods to department stores, newspaper, mail distribution, maintenance services, etc. This dissertation presents a simulated annealing algorithm to solve the VRPTW. The objective is to find the best possible solutions to some Solomon and Cordeau (Multi Depot Vehicle Routing Problem with Time Windows) instances.