Penentuan Rute Transportasi Kendaraan Umum Kota Medan Dengan Menggunakan Nearest Neighbor Method Dan Closed Insertion Method

ABSTRACT The purpose of this research to arrange the route of the Medan public transportation system into a graph and find the closest route using a graph. The data used are data on travel routes and travel times public transportation for Terminal Pinang Baris to Terminal Amplas. The results obtained are Medan City Public Transport system namely KPUM 64, RMC 120 and U-MORINA 138 can be represented in graph with terminal as a vertex and the walk to connecting each terminal as edge. The calculation results using the nearest neighbor method and closed insertion method can produce different routes between KPUM 48, RMC 120 and U-MORINA 138 which have been operating now. Determining the shortest route by considering the shortest distance does not get jammed. Keywords: Public Transportation, Routing Graph, Nearest Neighbor Method, Closed Insertion Method.

MODELING THE LOT CARGOES TRANSPORTATION SYSTEM IN CITIES

The share of the transport component that is taken into account in the prices formation for final products reaches 50%, so the cost transport services has a great impact on the final goods price, and the need to carry out transportation in a tight time frame, take into account minimal costs require the emergence of new scientifically methods of their organization. The research purpose is to build the lot cargoes automobile transportations in cities system model. The research object is the lot cargoes automobile transportations in cities process. As the analysis result of lot cargoes automobile transportations rational technology formation in the cities, such basic problem at the transportation process organization is allocated - it is irrational transportation routes. It leads to a large overall truck mileage, as well as low transportation speed, which is unacceptable in the current competition. During the literature sources analysis, the most popular existing transportation routing methods were considered, by means of which in research it is planned to carry out transport routes building in cities and it was found out that the routes developed by means of these methods have average links. As the existing criteria analysis result of lot cargoes automobile transportations rational technology formation in the cities the transportations cost is chosen as a criterion. After analyzing the all modeling methods advantages and disadvantages, taking into account the scientific literature recommendations, it was decided to use mathematical modeling due to its results versatility and accuracy. After formalizing the research object, developed a model of "white box", in which for the selected input parameters (delivery points number, car load, the average consignment size delivered to one point) built the lot cargoes automobile transportations rational technology formation in the cities mathematical model, at which the transportation cost will be minimal.

Container truck transportation routing as a Mixed Fleet Heterogeneous Dial-a-Ride Problem

In this paper, a new variant of the Heterogeneous Dial-a-Ride Problem (HDARP) is innovatively applied to a routing problem of trucks picking up and delivering full and empty containers in the logistic chain, including container depots, importers demanding full containers and exporters requesting empty containers. On the route different types of trucks pick-up and deliver full and empty 20- and 40-foot containers. We consider trucks that are operated by alternative fuel, as well as the need for refuelling of trucks in any alternative fuel station to eliminate the risk of running out of fuel during its route. The objective of the paper is to contribute to the optimization of container truck transport routing with multiple pick¬ups and deliveries by providing a mathematical programming model aiming at minimizing the transportation cost as well as the negative environmental impacts.

Building Optimal Routes for Cargo Delivery in Megacities

The main purpose of the study is to develop a method based on the modified ant algorithm and demonstrate the applicability of its use for building of optimal cargo delivery routes, taking into account the real (non-stationary) dynamics of highdensity traffic on the urban road network in megacities. Within the framework of the proposed method the simulation of building optimal routes, by the example of Kiev, was carried out. The results of study indicate the possibility of using the method for the solution to the problems of efficient management of the freight transportation routing process in the conditions of real dynamics of traffic flows (dense traffic, traffic jam, emergency situations, etc.).