• THE MULTIPLE TRAVELLING SALESMAN PROBLEM AND VEHICLE ROUTING PROBLEM FOR DIFFERENT DOMESTIC DRINKS

    Machines. Technologies. Materials., Vol. 8 (2014), Issue 4, pg(s) 17-18

    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

  • THE INTELLIGENT TRANSPORT SYSTEMS – RISKS AND BENEFITS

    Machines. Technologies. Materials., Vol. 8 (2014), Issue 3, pg(s) 25-27

    Effective deployment of ITS technologies depends in part on the knowledge of which technologies will most effectively address the issues of congestion and safety. Thus, it is important to understand the benefits or risks of both existing and emerging technologies. Based on documented experience locally and throughout the country, ITS deployments in urban areas have the potential to offer the following benefits:

    • Arterial management systems can potentially reduce delays with the implementation of advanced control systems and traveler information dissemination.

    • Freeway management systems can reduce the occurrence of crashes, increase capacity, and decrease overall travel times.

    • Freight management systems reduce costs to motor carriers with the implementation of the commercial vehicle information systems and networks.

    • Transit management systems may reduce travel times and increased reliability with automatic vehicle location and transit signal priority implementation.

    • Incident management systems potentially reduce incident duration and offer numerous other benefits.

    There is a wide range of benefits that can be obtained from ITS deployments. For example, fuel consumption, travel time, and delay can be reduced. ITS deployments can also result in higher travel speeds, improved traffic flow, and more satisfied travelers for all modes.

  • THE USING OF SOLVER SOFTWARE AND VEHICLE ROUTING FOR THE TRAVELING SALESMAN PROBLEM

    Machines. Technologies. Materials., Vol. 8 (2014), Issue 3, pg(s) 21-24

    The traveling salesman problem (TSP) is one of the most studied problems in management science. Optimal approaches to solving traveling salesman problems are based on mathematical programming. But in reality, most TSP problems are not solved optimally. When the problem is so large that an optimal solution is impossible to obtain, or when approximate solutions are good enough, heuristics are applied. Two commonly used heuristics for the traveling salesman problem are the nearest neighbor procedure and the Clark and Wright savings heuristic.

    In this paper will be present using of the solver software and principles of TSP for optimal solution of vehicle routing for domestic bottled water and different juices in the different parts of the Republic of Macedonia.