Pedro Munari

A top-down cutting approach for modeling the constrained two- and three-dimensional guillotine cutting problems

  • Mateus Martin
  • Reinaldo Morabito
  • Pedro Munari
    • Categories Applications - OR and Management Sciences Tags , ,

    In this paper, we address the Constrained Two-dimensional Guillotine Cutting Problem (C2GCP) and the Constrained Three-dimensional Guillotine Cutting Problem (C3GCP). These problems consist of cutting a rectangular two-/three-dimensional object with orthogonal guillotine cuts to produce ordered rectangular two-/three-dimensional items seeking the most valuable subset of items cut. They often appear in manufacturing settings that cut … Read more

    A Column Generation Based Heuristic for the Split Delivery Vehicle Routing Problem with Time Windows

  • Pedro Munari
  • Martin Savelsbergh
    • Categories Applications - OR and Management Sciences, Combinatorial Optimization, Integer Programming

    The vehicle routing problem with time windows (VRPTW) is one of the most studied variants of routing problems. We consider the Split Delivery VRPTW (SDVRPTW), an extension in which customers can be visited multiple times, if advantageous. While this additional flexibility can result in significant cost reductions, it also results in additional modeling and computational … Read more

    A branch-and-price method for the vehicle allocation problem

  • Cesar Alvarez Cruz
  • Reinaldo Morabito
  • Pedro Munari
    • Categories Applications - OR and Management Sciences, Integer Programming, Transportation Tags , , , ,

    The Vehicle Allocation Problem (VAP) consists of allocating a fleet of vehicles to attend to the expected demand for freight transportation between terminals along a finite multiperiod planning horizon. The objective is to maximize the profits generated for the completed services. The previous deterministic and stochastic approaches used heuristic procedures and approximations for solving large-scale … Read more

    The heterogeneous multicrew scheduling and routing problem in road restoration

  • Douglas Alem
  • Pedro Munari
  • Michel Gendreau
  • Alfredo Moreno
    • Categories Applications - OR and Management Sciences, Combinatorial Optimization

    This paper introduces the heterogeneous multicrew scheduling and routing problem (MCSRP) in road restoration. The MCSRP consists of identifying the schedule and route of heterogeneous crews that must perform the restoration of damaged nodes used in the paths to connect a source node to demand nodes in a network affected by extreme events. The objective … Read more

    Exact and heuristic approaches to reschedule helicopter flights for personnel transportation in the oil industry

  • Yan Bastos
  • Jonathan De La Vega
  • Reinaldo Morabito
  • Pedro Munari
  • Roberto Tavares
  • Paulo César Ribas
  • Thiago Vieira
    • Categories Transportation Tags , , , , ,

    This paper addresses a real-life short-term rescheduling problem of helicopter flights from one onshore airport to several maritime units in the context of the oil industry. This is a complex and challenging problem to solve because of the particular characteristics observed in practice, such as pending flights transferred from previous days with different recovering priorities, … Read more

    An Integer L-shaped algorithm for the vehicle routing problem with time windows and stochastic demands

  • Jonathan De La Vega
  • Reinaldo Morabito
  • Pedro Munari
  • Fernando Ordóñez
  • Michel Gendreau
    • Categories Transportation

    This paper addresses the vehicle routing problem with time windows and stochastic demands (VRPTWSD). The problem is modeled as a two-stage stochastic program with recourse, in which routes are designed in the first stage and executed in the second. A failure occurs if the load of the vehicle is insufficient to meet the observed demand … Read more

    Decomposition-based algorithms for the crew scheduling and routing problem in road restoration

  • Douglas Alem
  • Pedro Munari
  • Alfredo Moreno
    • Categories Branch and Cut Algorithms

    The crew scheduling and routing problem (CSRP) consists of determining the best route and schedule for a single crew to repair damaged nodes in a network affected by extreme events. The problem also involves the design of paths to connect a depot to demand nodes that become accessible only after the damaged nodes in these … Read more

    Compact Formulations for Split Delivery Routing Problems

  • Pedro Munari
  • Martin Savelsbergh
    • Categories Branch and Cut Algorithms, Production and Logistics, Transportation Tags , , ,

    Split delivery routing problems are concerned with serving the demand of a set of customers with a fleet of capacitated vehicles at minimum cost, where a customer can be served by more than one vehicle if beneficial. They generalize traditional variants of routing problems and have applications in commercial as well as humanitarian logistics. Previously, … Read more

    Exact approaches to the robust vehicle routing problem with time windows and multiple deliverymen

  • Jonathan De La Vega
  • Reinaldo Morabito
  • Pedro Munari
    • Categories Production and Logistics, Transportation

    This paper addresses the vehicle routing problem with time windows and multiple deliverymen (VRPTWMD) under uncertain demand as well as uncertain travel and service times. This variant is faced by logistics companies that deliver products to retailers located in congested urban areas, where service times are relatively long compared to travel times. In addition to … Read more

    A Robust Optimization Approach for the Unrelated Parallel Machine Scheduling Problem

  • Jonathan De La Vega
  • Reinaldo Morabito
  • Pedro Munari
  • Alfredo Moreno
    • Categories Applications - OR and Management Sciences, Scheduling

    In this paper, we address the Unrelated Parallel Machine Scheduling Problem (UPMSP) with sequence- and machine-dependent setup times and job due-date constraints. Different uncertainties are typically involved in real-world production planning and scheduling problems. If ignored, they can lead to suboptimal or even infeasible schedules. To avoid this, we present two new robust optimization models … Read more