This study introduces a variant of the Traveling Salesman Problem, named Traveling Salesman Problem with Optional Bonus Collection, Pickup Time and Passengers (PCVP-BoTc). It is a variant that incorporates elements of the Prize Collecting Traveling Salesman Problem and Ridesharing into the PCV. The objective is to optimize the revenue of the driver, which selectively defines which delivery or collection tasks to perform along the route. The economic effect of the collection is modeled by a bonus. The model can be applied to the solution of hybrid routing systems with route tasks and solidary transport. The driver, while performing the selected tasks, can give rides to persons who share route costs with him. Passengers are protected by restrictions concerning the maximum value they agree to pay for a ride and maximum travel duration. The activity of collecting the bonus in each locality demands a specific amount of time, affects the route duration, and is interconnected with the embarkment of passengers. Two mathematical formulations are presented for the problem and validated by a computational experiment using a solver. We propose four heuristic algorithms; three of them are hybrid metaheuristics. We tested the mathematical formulation implementations for 24 instances and the heuristic algorithms for 48.
The increasing number of forest fires in Brazil, allied to the difficulty of fire fighting in vegetation areas, becomes a motivation to apply technological resources to support the fire fighting in forest areas. Therefore, this work proposes the development of software able to collect data from different data sources and provide useful information to fire brigades, supporting the strategic planning as well as assisting the firefighters involved in fire fighting.
Este artigo tem como objetivo apresentar um novo problema no contexto do transporte colaborativo denominado Problema do Passeio Lucrativo com Passageiros e Restrições de Tempo e Custo. O problema consiste em determinar a melhor rota de um courier que precisa realizar serviços em diversos locais. O courier realiza seu percurso em um veículo. Para reduzir custos, o courier pode levar passageiros que compartilham com ele os custos de viagem. Um modelo matemático é proposto o qual é implementado em um solver e aplicado a instâncias do problema. São apresentados algoritmos heurísticos segundo as meta-heurísticas Variable Neighborhood Search e Greedy Randomized Adaptive Search Procedure. São relatados resultados de um experimento computacional com 36 instâncias com até 150 vértices.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.