F. Perea, M. Cano Gamero, J. Puerto Albandoz

En este trabajo se presenta un modelo de programación no lineal para optimizar el tiempo de recorrido de una carrera de Fórmula 1. Las decisiones considerdas son cuándo parar a cambiar neumáticos y qué neumáticos poner. El modelo se refuerza con diferentes conjuntos de desigualdades válidas. Todo ello se evalúa sobre datos de un circuito real y un conjunto de datos generados aleatoriamente.

Keywords: Transporte; Fórmula 1; Programación No Lineal

Scheduled

SI Transporte
September 2, 2026  5:40 PM
Aula 30


Other papers in the same session


Cookie policy

We use cookies in order to be able to identify and authenticate you on the website. They are necessary for the correct functioning of it, and therefore they can not be disabled. If you continue browsing the website, you are agreeing with their acceptance, as well as our Privacy Policy.

Additionally, we use Google Analytics in order to analyze the website traffic. They also use cookies and you can accept or refuse them with the buttons below.

You can read more details about our Cookie Policy and our Privacy Policy.