An exact method for the capacitated location-routing problem

DOI10.1287/OPRE.1110.0989zbMATH Open1233.90060OpenAlexW2120968967MaRDI QIDQ2879523FDOQ2879523

Authors: Roberto Baldacci, Aristide Mingozzi, Roberto Wolfler Calvo 

Publication date: 26 March 2012

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.1110.0989

Recommendations

• A Branch-and-Cut method for the Capacitated Location-Routing Problem
• An exact algorithm based on cut-and-column generation for the capacitated location-routing problem
• A GRASP\(\times \)ELS approach for the capacitated location-routing problem
• A biased-randomized metaheuristic for the capacitated location routing problem
• Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking

zbMATH Keywords

dynamic programmingset partitioninglocation routingdual ascent

Mathematics Subject Classification ID

Dynamic programming (90C39) Transportation, logistics and supply chain management (90B06)

Cited In (45)

• A new formulation approach for location-routing problems
• Title not available (Why is that?)
• Selective capacitated location-routing problem with incentive-dependent returns in designing used products collection network
• A survey of recent research on location-routing problems
• A Branch-and-Cut method for the Capacitated Location-Routing Problem
• Title not available (Why is that?)
• Multi-capacitated Location Problem: A New Resolution Method Combining Exact and Heuristic Approaches Based on Set Partitioning
• A memetic algorithm for a multi-objective obnoxious waste location-routing problem: a case study
• A GRASP\(\times \)ELS approach for the capacitated location-routing problem
• An exact algorithm for the capacitated facility location problems with single sourcing
• A column generation approach for the location-routing problem with time windows
• A branch-and-cut algorithm for the two-echelon capacitated vehicle routing problem with grouping constraints
• Solving the dynamic capacitated location-routing problem with fuzzy demands by hybrid heuristic algorithm
• 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
• Model and algorithm for bilevel multisized terminal location‐routing problem for the last mile delivery
• Evolutionary hyperheuristics for location-routing problem with simultaneous pickup and delivery
• A variable neighborhood search based matheuristic for a waste cooking oil collection network design problem
• A new approach on auxiliary vehicle assignment in capacitated location routing problem
• A concise guide to existing and emerging vehicle routing problem variants
• Sequential and parallel large neighborhood search algorithms for the periodic location routing problem
• Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking
• The two-echelon stochastic multi-period capacitated location-routing problem
• A survey of the standard location-routing problem
• A distribution network design problem in the automotive industry: MIP formulation and heuristics
• A memetic algorithm for the capacitated location-routing problem with mixed backhauls
• Battery swap station location-routing problem with capacitated electric vehicles
• Nonrobust Strong Knapsack Cuts for Capacitated Location Routing and Related Problems
• A unified solution framework for multi-attribute vehicle routing problems
• A simple and effective evolutionary algorithm for the capacitated location-routing problem
• A progressive filtering heuristic for the location-routing problem and variants
• A computational comparison of flow formulations for the capacitated location-routing problem
• A biased-randomized metaheuristic for the capacitated location routing problem
• A location-or-routing problem with partial and decaying coverage
• An exact algorithm based on cut-and-column generation for the capacitated location-routing problem
• A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints
• A column generation approach for location-routing problems with pickup and delivery
• Solving the capacitated location-routing problem. Abstract of Thesis
• Combined location and routing problems for drug distribution
• The location routing problem with facility sizing decisions
• Electric vehicles fast charger location-routing problem under ambient temperature
• Many-to-many location-routing with inter-hub transport and multi-commodity pickup-and-delivery
• Locating depots for capacitated vehicle routing
• A survey of variants and extensions of the location-routing problem
• Optimization of a two-echelon location lot-sizing routing problem with deterministic demand

This page was built for publication: An exact 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 Q2879523)