Pedro Munari

A variable neighborhood search for the green vehicle routing problem with two-dimensional loading constraints and split delivery

  • Kamyla Ferreira
  • Thiago Alves de Queiroz
  • Pedro Munari
  • Franklina M. B. Toledo
    • Categories Meta Heuristics, Production and Logistics, Transportation Tags , , , ,

    \(\) We address the Green Vehicle Routing Problem with Two-Dimensional Loading Constraints and Split Delivery (G2L-SDVRP), which extends the split delivery vehicle routing problem to include customer demands represented by two-dimensional, rectangular items. We aim to minimize carbon dioxide (CO\(_2\)) emissions instead of travel distance, a critical issue in contemporary logistics activities. The CO\(_2\) emission … Read more

    The Robust Bike Sharing Rebalancing Problem: Formulations and a Branch-and-Cut Algorithm

  • Bruno Petrato Bruck
  • Walton P. Coutinho
  • Pedro Munari
    • Categories Branch and Cut Algorithms, Robust Optimization, Transportation Tags , , ,

    Bike Sharing Systems (BSSs) offer a sustainable and efficient urban transportation solution, bringing flexible and eco-friendly alternatives to city logistics. During their operation, BSSs may suffer from unbalanced bike distribution among stations, requiring rebalancing operations throughout the system. The inherent uncertain demand at the stations further complicates these rebalancing operations, even when performed during downtime. … Read more

    A new family of route formulations for split delivery vehicle routing problems

  • Isaac Balster
  • Teobaldo Bulhões
  • Pedro Munari
  • Artur Alves Pessoa
  • Ruslan Sadykov
    • Categories Combinatorial Optimization, Integer Programming, Transportation Tags , , , ,

    We propose a new family of formulations with route-based variables for the split delivery vehicle routing problem with and without time windows. Each formulation in this family is characterized by the maximum number of different demand quantities that can be delivered to a customer during a vehicle visit. As opposed to previous formulations in the … Read more

    Heuristic approaches for split delivery vehicle routing problems

  • Aldair Álvarez
  • Pedro Munari
    • Categories Branch and Cut Algorithms, Meta Heuristics, Transportation Tags , , , ,

    We propose a matheuristic approach to solve split delivery variants of the vehicle routing problem (VRP). The proposed method is based on the use of several mathematical programming components within an Iterated Local Search metaheuristic framework. In addition to well-known VRP local search heuristics, we include new types of improvement and perturbation strategies that are … Read more

    Metaheuristic, Models and Software for the Heterogeneous Fleet Pickup and Delivery Problem with Split Loads

  • Diogenes Gasque
  • Pedro Munari
    • Categories Meta Heuristics, Optimization Software and Modeling Systems, Transportation Tags , , , ,

    This paper addresses a rich variant of the vehicle routing problem (VRP) that involves pickup and delivery activities, customer time windows, heterogeneous fleet, multiple products and the possibility of splitting a customer demand among several routes. This variant generalizes traditional VRP variants by incorporating features that are commonly found in practice. We present two mixed-integer … Read more

    The vehicle allocation problem: alternative formulation and branch-and-price method

  • Alysson Machado Costa
  • Cesar Alvarez Cruz
  • Reinaldo Morabito
  • Pedro Munari
    • Categories Applications - OR and Management Sciences, Combinatorial Optimization, Linear, Cone and Semidefinite Programming Tags , , , ,

    The Vehicle Allocation Problem (VAP) consists of repositioning empty vehicles across a set of terminals over a given planning horizon so as to maximize the profits generated from serving demand for transportation of goods between pair of terminals. This problem has been classically modeled using an extended space-time network which captures the staging of the … Read more

    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

    Two-stage and one-group two-dimensional guillotine cutting problems with defects: a CP-based algorithm and ILP formulations

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

    We address two variants of the two-dimensional guillotine cutting problem that appear in different manufacturing settings that cut defective objects. Real-world applications include the production of flat glass in the glass industry and the cutting of wooden boards with knotholes in the furniture industry. These variants assume that there are several defects in the object, … Read more

    Three-dimensional guillotine cutting problems with constrained patterns: MILP formulations and a bottom-up algorithm

  • Mateus Martin
  • Reinaldo Morabito
  • Pedro Munari
  • José Fernando Oliveira
  • Elsa Silva
    • Categories Applications - OR and Management Sciences

    In this paper, we address the Constrained Three-dimensional Guillotine Cutting Problem (C3GCP), which consists of cutting a larger cuboid block (object) to produce a limited number of smaller cuboid pieces (items) using orthogonal guillotine cuts only. This way, all cuts must be parallel to the object’s walls and generate two cuboid sub-blocks, and there is … 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