An efficient hybrid algorithm for the Traveling Car Renter Problem

Silva, André Renato Villela da; Ochi, Luiz Satoru

doi:10.1016/j.eswa.2016.07.038

Cited by 16 publications

(9 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…respectively, the vertices and edges of a given graph G. Da Silva and Ochi [49] designed an Adaptive Local Search Procedure for tackling a travelling salesman problems in which the rented car could be returned or not at the nodes from a graph G. In this sense, the graph could contain dynamic points in which the users might spontaneously decide where to deliver the vehicle regarding a set of stochastic aspects. It is noteworthy that this problem can be adapted for dealing with several rented cars and car sharing systems on urban scenarios.…”

Section: Smart Routing Problems: Multi-objective Optimizationmentioning

confidence: 99%

Mobility, Citizens, Innovation and Technology in Digital and Smart Cities

et al. 2020

View full text Add to dashboard Cite

Cities are constantly transforming and, consequently, attracting efforts from researchers and opportunities to the industry. New transportation systems are being built in order to meet sustainability and efficiency criteria, as well as being adapted to the current possibilities. Moreover, citizens are becoming aware about the power and possibilities provided by the current generation of autonomous devices. In this sense, this paper presents and discusses state-of-the-art transportation technologies and systems, highlighting the advances that the concepts of Internet of Things and Value are providing. Decentralized technologies, such as blockchain, are been extensively investigated by the industry, however, its widespread adoption in cities is still desirable. Aligned with operations research opportunities, this paper identifies different points in which cities’ services could move to. This also study comments about different combinatorial optimization problems that might be useful and important for an efficient evolution of our cities. By considering different perspectives, didactic examples are presented with a main focus on motivating decision makers to balance citizens, investors and industry goals and wishes.

show abstract

Section: Smart Routing Problems: Multi-objective Optimizationmentioning

confidence: 99%

Mobility, Citizens, Innovation and Technology in Digital and Smart Cities

et al. 2020

View full text Add to dashboard Cite

show abstract

“…The Test with the methods proposed also occurred in another set of instances, proposed by Goldbarg et al [11] and used in tests by da Silva and Ochi [3] and Goldbarg et al [12]. Those instances were provided through e-mail by authors.…”

Section: Computational Resultsmentioning

confidence: 99%

“…The instances for this problem follow a euclidean and a non-euclidean pattern in order to define distances between vertices. Consider the euclidean set to assess the heuristic method proposed, in comparison to current state-of-the-art, since the EA algorithm proposed by da Silva and Ochi [3] did not lead to good results when tested in this set.…”

Section: Computational Resultsmentioning

confidence: 99%

An ils-based heuristic applied to the car renter salesman problem

2021

Self Cite

View full text Add to dashboard Cite

The present paper tackles the Car Renter Salesman Problem (CaRS), which is a Traveling Salesman Problem variant. In CaRS, the goal is to travel through a set of cities using rented vehicles at minimum cost. The main aim of the current problem is to establish an optimal route using rented vehicles of different types to each trip. Since CaRS is NP-Hard, we herein present a heuristic approach to tackle it. The approach is based on a Multi-Start Iterated Local Search metaheuristic, where the local search step is based on the Random Variable Neighborhood Descent methodology. An Integer Linear Programming Formulation based on a Quadratic Formulation from literature is also proposed in the current study. Computational results for the proposed heuristic method in euclidean instances outperform current state-of-the-art results. The proposed formulation also has stronger bounds and relaxation when compared to others from literature.

show abstract

“…Na maior parte das vezes, os problemas de aluguel de veículos são discutidos do ponto de vista de uma companhia, que detém uma frota de veículos e cujo objetivoé maximizar o lucro total ou o número de clientes atendidos. Alguns trabalhos consideram também o problema do ponto de vista de um usuário (Goldbarg et al, 2012;da Silva and Ochi, 2016;Rios et al, 2017), que tem um conjunto de opções de aluguel disponíveis e deseja escolher quais serviços contratar para minimizar o seu custo total.…”

Section: Introductionunclassified

“…Seguindo Goldbarg et al (2012), que desenvolveram algoritmos meméticos, outros trabalhos consideraram o problema (da Silva and Ochi, 2016;Rios et al, 2017;Dias et al, 2016). Observamos que, se exigirmos que a solução seja um ciclo sem repetição de cidades, ou permitirmos funções de custo arbitrárias, então o problema não admite aproximação por qualquer função computável, a não ser que o Problema do Caminho Hamiltoniano possa ser resolvido em tempo polinomial.…”

Section: Introductionunclassified

Uma Aproximação Ótima para o Problema do Caixeiro Alugador⇤

Pedrosa¹,

Schouery²

2018

Anais Do Encontro De Teoria Da Computação (ETC)

View full text Add to dashboard Cite

No clássico Problema do Caixeiro Viajante (TSP), queremos encontrar uma rota que passa por um conjunto de n cidades e que minimize a dist ância total percorrida. Uma generalização conhecida é o chamada Problema do Caixeiro Alugador, em que a rota pode ser percorrida alugando-se um subconjunto de véıculos. Cada véıculo tem uma função de dist ância distinta, mas para cada véıculo alugado, paga-se uma taxa de retorno g 0. O objetivo é minimizar a soma das dist âncias percorridas mais as taxas de retorno. Neste trabalho, apresentamos uma O(log n)-aproximação para o problema. Esse algoritmo é assintoticamente ótimo já que também mostramos que n ão há aproximação com fator o(log n), a n ão ser que P = NP.

show abstract

An efficient hybrid algorithm for the Traveling Car Renter Problem

Cited by 16 publications

References 23 publications

Mobility, Citizens, Innovation and Technology in Digital and Smart Cities

Mobility, Citizens, Innovation and Technology in Digital and Smart Cities

An ils-based heuristic applied to the car renter salesman problem

Uma Aproximação Ótima para o Problema do Caixeiro Alugador⇤

Contact Info

Product

Resources

About