A Branch-and-Cut method for the Capacitated Location-Routing Problem

DOI10.1016/j.cor.2010.09.019zbMath1205.90172OpenAlexW2055539533MaRDI QIDQ622138

Roberto Wolfler Calvo, José-Manuel Belenguer, Enrique Benavent, Christian Prins, Caroline Prodhon

Publication date: 31 January 2011

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2010.09.019

zbMATH Keywords

vehicle routingfacility locationBranch-and-CutLocation-Routing Problem

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80)

Related Items

A new formulation approach for location-routing problems, Balanced vehicle routing: polyhedral analysis and branch-and-cut algorithm, A survey of recent research on location-routing problems, Solving the dynamic capacitated location-routing problem with fuzzy demands by hybrid heuristic algorithm, Sequential and parallel large neighborhood search algorithms for the periodic location routing problem, A branch-and-cut algorithm for the hub location and routing problem, A survey on two-echelon routing problems, A memetic algorithm for the capacitated location-routing problem with mixed backhauls, Battery swap station location-routing problem with capacitated electric vehicles, Generalized multiple depot traveling salesmen problem -- polyhedral study and exact algorithm, Skewed general variable neighborhood search for the location routing scheduling problem, Solving the bus evacuation problem and its variants, A simple and effective evolutionary algorithm for the capacitated location-routing problem, Multi-commodity location-routing: flow intercepting formulation and branch-and-cut algorithm, A column generation approach for the location-routing problem with time windows, A two-phase hybrid heuristic algorithm for the capacitated location-routing problem, Lower and upper bounds for the two-echelon capacitated location-routing problem, An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics, Evolutionary hyperheuristics for location-routing problem with simultaneous pickup and delivery, Multi-depot multiple TSP: a polyhedral study and computational results, A memetic algorithm for a multi-objective obnoxious waste location-routing problem: a case study, Compact formulations for multi-depot routing problems: theoretical and computational comparisons, The electric location-routing problem with heterogeneous fleet: formulation and Benders decomposition approach, General network design: a unified view of combined location and network design problems, A node current-based 2-index formulation for the fixed-destination multi-depot travelling salesman problem, A fuzzy correlation based heuristic for dual-mode integrated location routing problem, Multi-period location routing: an application to the planning of mobile clinic operations in Iraq, The location routing problem with facility sizing decisions, Using horizontal cooperation concepts in integrated routing and facility‐location decisions, A new bi-objective location-routing problem for distribution of perishable products: evolutionary computation approach, The multi‐depot family traveling salesman problem and clustered variants: Mathematical formulations and branch‐&‐cut based methods, The two-echelon stochastic multi-period capacitated location-routing problem, A two-stage stochastic location-routing problem for electric vehicles fast charging, Electric vehicles fast charger location-routing problem under ambient temperature, Solving the two-echelon location routing problem by a GRASP reinforced by a learning process and path relinking, A hyper-heuristic based artificial bee colony algorithm for \(k\)-interconnected multi-depot multi-traveling salesman problem, A survey of the standard location-routing problem, An Exact Algorithm Based on Cut-and-Column Generation for the Capacitated Location-Routing Problem, Multiperiod location-routing with decoupled time scales, Optimization of a two-echelon location lot-sizing routing problem with deterministic demand, Combined location and routing problems for drug distribution, Solving the capacitated location-routing problem. Abstract of Thesis, A location-inventory-routing problem in forward and reverse logistics network design, Revisiting the Hamiltonian \(p\)-median problem: a new formulation on directed graphs and a branch-and-cut algorithm, Location routing problems on trees, Column generation based approaches for combined routing and scheduling, Multiple depot ring star problem: a polyhedral study and an exact algorithm, A column generation approach for location-routing problems with pickup and delivery, Selective capacitated location-routing problem with incentive-dependent returns in designing used products collection network, Hybrid heuristic for the location‐inventory‐routing problem in closed‐loop supply chain, The Steiner traveling salesman problem and its extensions, A hybrid evolutionary algorithm for the periodic location-routing problem, A branch and cut algorithm for the location-routing problem with simultaneous pickup and delivery, Exact and Heuristic Algorithms for Capacitated Vehicle Routing Problems with Quadratic Costs Structure, Many-to-many location-routing with inter-hub transport and multi-commodity pickup-and-delivery, The location routing problem using electric vehicles with constrained distance, A computational comparison of flow formulations for the capacitated location-routing problem, Asymmetric Multidepot Vehicle Routing Problems: Valid Inequalities and a Branch-and-Cut Algorithm, A relax‐and‐price heuristic for the inventory‐location‐routing problem, An improved branch-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem, A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints, A taxonomical analysis, current methods and objectives on location-routing problems, A location-or-routing problem with partial and decaying coverage, Using greedy clustering method to solve capacitated location-routing problem with fuzzy demands

Uses Software

• VRP
• CVRPSEP
• CVRPSP

Cites Work

• Unnamed Item
• Unnamed Item
• Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking
• Heuristic and lower bound for a stochastic location-routing problem
• The vehicle routing problem. Latest advances and new challenges.
• On the cycle polytope of a binary matroid
• The effect of ignoring routes when locating depots
• Models and exact solutions for a class of stochastic location-routing problems
• An exact algorithm for minimizing routing and operating costs in depot location
• The many-to-many location-routing problem
• Combined location-routing problems: A synthesis and future research directions
• On the capacitated vehicle routing problem
• A branch-and-cut algorithm for the undirected rural postman problem
• Heuristic solutions to multi-depot location-routing problems
• Separating capacity constraints in the CVRP using tabu search
• A two-phase tabu search approach to the location routing problem
• A new branch-and-cut algorithm for the capacitated vehicle routing problem
• A compact model and tight bounds for a combined location-routing problem
• The Vehicle Routing Problem
• A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
• Odd Minimum Cut Sets and b-Matchings Revisited
• Solving a Family of Multi-Depot Vehicle Routing and Location-Routing Problems
• A multiple-depot, multiple-vehicle, location-routing problem with stochastically processed demands