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

DOI10.1016/J.COR.2010.09.019MaRDI QIDQ622138zbMATH OpenOpenAlexFDO

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

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

facility locationvehicle routingBranch-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)

Recommendations

• An exact method for the capacitated location-routing problem
• An exact algorithm based on cut-and-column generation for the capacitated location-routing problem
• A branch and cut algorithm for the location-routing problem with simultaneous pickup and delivery
• A survey of recent research on location-routing problems
• A GRASP\(\times \)ELS approach for the capacitated location-routing problem

Cites work

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

Cited in

(76)

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

Describes a project that uses

Uses Software

• VRP
• CVRPSEP
• CVRPSP

This page was built for publication: A Branch-and-Cut method for the Capacitated Location-Routing Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q622138)