Algoritmos para o problema de localização de uma facilidade com distâncias limitadas e restrições de atendimento

The objective in the facility location problem with limited distances is to minimize the sum of distance functions from the facility to the customers, but with a limit on each distance, after which the corresponding function becomes constant. The problem has applications in situations where the service provided by the facility is insensitive after a given threshold distance (eg. fire station location). In this work, we propose a global optimization algorithm for the case in which there are lower and upper limits on the numbers of customers that can be served

Otimização de escalas de serviço de tripulações estudo de caso em uma empresa de transporte urbano na região metropolitana de Natal/RN

This work aims to "build" rostering urban bus crews to minimize the cost of overtime. For this purpose a mathematical model was developed based on case study in an urban transport company in the metropolitan region of Natal. This problem is usually known in the literature as the Crew Scheduling Problem (CSP) and classified as NP-hard. The mathematical programming takes into account constraints such as: completion of all trips, daily and maximum allowable range of home and / or food. We used the Xpress-MP software to implement and validate the proposed model. For the tested instances the application of the model allowed a reduction in overtime from 38% to 84%