The objective of vehicle routing problem (VRP) is to deliver a set of customers with known demands on minimum-cost routes originating and terminating at the same depot. Similar to most GA that a chromosome S is a permutation of n positive integers, such that each integer is corresponding to a customer without trip delimiters. Christian Prins proposed an optimal splitting procedure to get the best solution, respecting to a given chromosome. In this paper, application of this splitting procedure to get the best solution, respecting to a sequence of vertices, produced by the heuristic approaches(or a new chromosome produced by the mutation procedure), is considered.
Keyword: vehicle routing
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