MATHEURISTICS METHODS: AN APPROXIMATION FOR THE STOP NUMBER MINIMIZATION PROBLEM IN AUTONOMOUS VEHICLES- VIPA

Favorite this paper
How to cite this paper?
Details
  • Presentation type: Trabalho completo (oral)
  • Track: 12. L&T – Logística e Transportes
  • Keywords: Stop Number Minimization Problem; Relax-and-fix; Randomized Rounding;
  • 1 Universidade Federal de Ouro Preto
  • 2 Université Clermont Auvergne

MATHEURISTICS METHODS: AN APPROXIMATION FOR THE STOP NUMBER MINIMIZATION PROBLEM IN AUTONOMOUS VEHICLES- VIPA

Williane Cristina Ribeiro

Universidade Federal de Ouro Preto

Abstract

Integer Linear Programming are known for their difficulty to be solved, generally requiring exponential time. In this article, two matheuristics methods are applied to the Unit Stop Number Problem (USNP), a dial-a-ride problem arising from the deployment of autonomous electric vehicles. Such methods are developed with the objective of improving the resolution time of USNP by combining exact methods with heuristic approaches. For this, the matheuristics methods Randomized-Rounding and Relax-and-Fix were studied, adapted and implemented in C++ programming language. Since such methods are mainly based on the decomposition of the general problem into smaller simpler ones, we explore different strategies of decomposition. The computational results obtained allowed us to analyze the impact of each one of these strategies.

Share your ideas or questions with the authors!

Did you know that the greatest stimulus in scientific and cultural development is curiosity? Leave your questions or suggestions to the author!

Sign in to interact

Have a question or suggestion? Share your feedback with the authors!