We present an optimization procedure for solving the vehicle routing problem with a fixed heterogeneous fleet of vehicle. We want to minimize the passage price. We look and probe these methods: minimal element, Vogel’s Approximation and heuristic. The modeling vehicle routing problem is based on mathematical formulation. This paper present very well known problems – TSP Traveling Salesperson Problem and M-TSP. Vehicle routing problem is liked M-TSP with some specification, vehicle with a fixed carrying capacity must deliver order of goods to n customers from a single depot. Knowing the distance between customers, the problem is to find tours for the vehicles in such a way that: the total distance traveled by the vehicles is minimized, only one vehicle handles the deliveries for a given customer, the total quantity of goods that a single vehicle delivers cannot be larger than cars capacity.
| Identifer | oai:union.ndltd.org:LABT_ETD/oai:elaba.lt:LT-eLABa-0001:E.02~2006~D_20060606_080022-58032 |
| Date | 06 June 2006 |
| Creators | Jusevičienė, Kristina |
| Contributors | Račkauskas, Gediminas, Barauskas, Arūnas, Aksomaitis, Algimantas Jonas, Valakevičius, Eimutis, Sakalauskas, Eligijus, Navickas, Zenonas, Pekarskas, Vidmantas Povilas, Saulis, Leonas, Rudzkis, Rimantas, Janilionis, Vytautas, Kaunas University of Technology |
| Publisher | Lithuanian Academic Libraries Network (LABT), Kaunas University of Technology |
| Source Sets | Lithuanian ETD submission system |
| Language | Lithuanian |
| Detected Language | English |
| Type | Master thesis |
| Format | application/pdf |
| Source | http://vddb.library.lt/obj/LT-eLABa-0001:E.02~2006~D_20060606_080022-58032 |
| Rights | Unrestricted |
Page generated in 0.0018 seconds