Proposta de Otimização da Roteirização dos Distritos dos Carteiros:um Estudo de Caso no Centro de Entrega de Encomendas de Fortaleza.

Abstract

The Vehicle Routing Problem (VRP) involves determining a set of routes to be traveled, noting the lower cost of transport for a specified number of vehicles. Each route must start and finish in the warehouse, so as each point has to be visited by one vehicle and only once. Many versions of the problem are found in the literature, depending on the various possible restrictions such as vehicle capacity and time window. The ECT (Mail and Telegraph Company) although it is one of the world's largest companies in the business of delivering parcels and letters. Does not have an efficient computer system that performs this function, i.e. a system able to offer daily routes to distribution. In her field, she has a system capable of showing the actual and the amount and type of vehicles to be used in the distribution of their orders. This work proposes routing algorithms to be applied in order distribution of the Post. The algorithms make the division of orders into groups and then route. Was drawn up two heuristics for the group division and three heuristics for the routing phase. The heuristics are split groups were applied to a real problem, from the districts of the Center for Delivery Orders (EEC), in Fortaleza-CE, conducted in 2009. The routing heuristics were applied to two routes taken by postmen in the same EEC, with the results obtained and compared with the route taken by postmen. The results showed that the proposed algorithms supply the deficiency of routing mail, because the division of groups was satisfactory and heuristics routing paths were smaller than those proposed by postmen in 7 of 8 assessments.