Juan José Miranda-Bront

Comparing league formats from a business oriented view: the case of Argentina’s National Basketball League

  • Nicolas Garcia Aramouni
  • Juan José Miranda-Bront
    • Categories Applications - OR and Management Sciences Tags , , , ,

    During the last decades, the use of advanced optimization algorithms to generate sports timetables has caught the attention of both academics and practitioners. From a managerial standpoint, the competition’s structure and the design of the league’s schedule represent key strategic decisions with a direct impact in terms of revenue and other important indicators. Argentina’s National … Read more

    Solving the Traveling Salesman Problem with release dates via branch-and-cut

  • Isabel Méndez-Díaz
  • Juan José Miranda-Bront
  • Agustín Montero
    • Categories Applications - OR and Management Sciences, Branch and Cut Algorithms

    In this paper we study the Traveling Salesman Problem with release dates (TSP-rd) and completion time minimization. The TSP-rd considers a single vehicle and a set of customers that must be served exactly once with goods that arrive to the depot over time, during the planning horizon. The time at which each requested good arrives … Read more

    A Branch-Cut-and-Price Algorithm for the Time-Dependent Electric Vehicle Routing Problem with Time Windows

  • Gonzalo Lera-Romero
  • Juan José Miranda-Bront
  • Francisco J. Soulignac
    • Categories Applications - OR and Management Sciences, Combinatorial Optimization

    The adoption of electric vehicles (EVs) within last-mile deliveries is considered one of the key transformations towards more sustainable logistics. The inclusion of EVs introduces new operational constraints to the models such as a restricted driving range and the possibility to perform recharges in-route. The discharge of the typical batteries is complex and depends on … Read more

    Dynamic programming for the time-dependent traveling salesman problem with time windows

  • Gonzalo Lera-Romero
  • Juan José Miranda-Bront
  • Francisco J. Soulignac
    • Categories Dynamic Programming, Transportation Tags , , , , ,

    The recent growth of direct-to-consumer deliveries has stressed the importance of last-mile logistics, becoming one of the critical factors in city planning. One of the key factors lies in the last-mile deliveries, reaching in some cases nearly 50% of the overall parcel delivery cost. Different variants of the the well-known Traveling Salesman Problem (TSP) arise … Read more

    A branch and cut algorithm for the time-dependent profitable tour problem with resource constraints

  • Gonzalo Lera-Romero
  • Juan José Miranda-Bront
    • Categories Branch and Cut Algorithms, Transportation

    In this paper we study the time-dependent profitable tour problem with resource con-straints (TDPTPRC), a generalization of the profitable tour problem (PTP) which includes variable travel times to account for road congestion. In this problem, the set of customers to be served is not given and must be determined based on the profit collected when … Read more

    An Enhanced Branch and Price Algorithm for the Time-Dependent Vehicle Routing Problem with Time Windows

  • Gonzalo Lera-Romero
  • Juan José Miranda-Bront
  • Francisco J. Soulignac
    • Categories Applications - OR and Management Sciences, Combinatorial Optimization

    In this paper we implement a branch and price (BP) algorithm for a time dependent vehicle routing problem with time windows (TDVRPTW) in which the goal is to minimize the total route duration (DM-TDVRPTW). The travel time between two customers depends on the departure time and, thus, it need not remain fixed along the planning … Read more

    An Integer Programming approach for the Time-Dependent Traveling Salesman Problem with Time Windows

  • Isabel Méndez-Díaz
  • Juan José Miranda-Bront
  • Agustín Montero
    • Categories Branch and Cut Algorithms, Transportation

    Congestion in large cities and populated areas is one of the major challenges in urban logistics, and should be addressed at different planning and operational levels. The Time-Dependent Travelling Salesman Problem (TDTSP) is a generalization of the well known Traveling Salesman Problem (TSP) where the travel times are not assumed to be constant along the … Read more

    A cluster-first route-second approach for the Swap Body Vehicle Routing Problem

  • Brian Curcio
  • Isabel Méndez-Díaz
  • Juan José Miranda-Bront
  • Agustín Montero
  • Federico Pousa
  • Paula Zabala
    • Categories Combinatorial Optimization, Meta Heuristics, Transportation Tags , , ,

    The Swap Body Vehicle Routing Problem (SB-VRP) is a generalization of the classical Vehicle Routing Problem (VRP) where a particular structure as well as several operational aspects for the trucks composing the fleet are considered. This research has been motivated by the VeRoLog Solver Challenge 2014, organized together by VeRoLog and PTV group, aiming to … Read more

    An ILP-based local search procedure for the VRP with pickups and deliveries

  • Isabel Méndez-Díaz
  • Juan José Miranda-Bront
  • Agustín Montero
    • Categories 0-1 Programming, Combinatorial Optimization, Transportation Tags , ,

    In this paper we address the Vehicle Routing Problem with Pickups and Deliveries (VRPPD), an extension of the classical Vehicle Routing Problem (VRP) where we consider precedences among customers, and develop an Integer Linear Programming (ILP) based local search procedure. We consider the capacitated one-to-one variant, where a particular precedence must be satisfied between pairs … Read more