A. M. Rodríguez Chía, I. Espejo, J. M. Muñoz-Ocaña, T. Navarro-Carmona, R. Páez Jiménez
Given a set of cargos (origin/destination) with time windows for loading (at the origin)
and unloading (at the destination) and a set of available drivers/trucks to fully or partially
cover these cargos, this paper addresses the problem of optimally assigning these cargos
to the drivers/trucks. Optimally refers to maximizing benefits taking into account the
feasibility conditions given by the limitations of driving-time imposed by the current
regulation (in our case, the European Union regulation) and the time windows of these
cargos. Observe that several cargos could be assigned to the same driver/truck whenever
the driving limitations and the time windows allow it, but on the contrary one cargo
could be assigned at most to one driver/truck or even not be assigned. This paper
presents a branch-and-bound-and-cut solution method to solve the proposed problem
based on a formulation that models this problem with a relaxation in the computation
of driving-time windows
Palabras clave: mixed-integer linear formulation, times windows, road transportation
Programado
Localización (GELOCA3)
13 de junio de 2025 09:00
Sala 3. Maria Rúbies Garrofé