THE MULTIPLE TRAVELLING SALESMAN PROBLEM AND VEHICLE ROUTING PROBLEM FOR DIFFERENT DOMESTIC DRINKS
- 1 Faculty of Mechanical Engineering, University “Cyril and Methodius”,Skopje, the Republic of Macedonia
- 2 Faculty of Mechanical Engineering, University “Goce Delcev”, Stip, the Republic of Macedonia
- 3 Faculty of Computer Science, University “Goce Delcev”, Stip, the Republic of Macedonia
- 4 Faculty of Mechanical Engineering, University “Goce Delcev”,Stip, the Republic of Macedonia
- 5 Faculty of Natural and Technical Science, University “Goce Delcev”, Stip, the Republic of Macedonia
The MTSP is a generalization of the traveling salesman problem where there are multiple vehicles and a single depot. In this problem, instead of determining a route for a single vehicle, we wish to construct tours for all M vehicles. The characteristics of the tours are that they begin and end at the depot node. Solution procedures begin by “copying” the depot node M times. The problem is thus reduced to M single-vehicle TSPs, and it can be solved using either the nearest neighbor or Clark and Wright heuristics. The classic VRP (Vehicle Routing Problem) expands the multiple traveling salesman problem to include different service requirements at each node and different capacities for vehicles in the fleet. The objective of these problems is to minimize total cost or distance across all routes. Examples of services that show the characteristics of vehicle routing problems include different Services deliveries, public transportation “pickups” for the handicapped, and the newspaper delivery problem etc.
In this paper will be present using of the principles of MTSP and VRP for optimal solution of vehicle routing for domestic energetic drinks and sparkling water in PET bottles in the different parts of the Republic of Macedonia