A two-phase hybrid heuristic algorithm for the capacitated location-routing problem
From MaRDI portal
Publication:339543
DOI10.1016/j.cor.2012.05.008zbMath1349.90141OpenAlexW2075334523MaRDI QIDQ339543
Rodrigo Linfati, John Willmer Escobar, Paolo Toth
Publication date: 11 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2012.05.008
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
A survey of recent research on location-routing problems, Solving the dynamic capacitated location-routing problem with fuzzy demands by hybrid heuristic algorithm, Evaluating two new heuristics for constructing customer clusters in a VRPTW with multiple service workers, Sequential and parallel large neighborhood search algorithms for the periodic location routing problem, The latency location-routing problem, A memetic algorithm for the capacitated location-routing problem with mixed backhauls, Solving the bus evacuation problem and its variants, A simple and effective evolutionary algorithm for the capacitated location-routing problem, The multi-zone location-routing problem with pricing: a flow-based formulation and two heuristic approaches, Evolutionary hyperheuristics for location-routing problem with simultaneous pickup and delivery, A memetic algorithm for a multi-objective obnoxious waste location-routing problem: a case study, A progressive filtering heuristic for the location-routing problem and variants, The electric location-routing problem with heterogeneous fleet: formulation and Benders decomposition approach, Hybrid adaptive large neighborhood search for vehicle routing problems with depot location decisions, A fuzzy correlation based heuristic for dual-mode integrated location routing problem, Effective metaheuristics for the latency location routing problem, Model and algorithm for bilevel multisized terminal location‐routing problem for the last mile delivery, An iterated local search algorithm for latency vehicle routing problems with multiple depots, Designing granular solution methods for routing problems with time windows, A survey of the standard location-routing problem, A two-phase heuristic algorithm for the problem of scheduling and vehicle routing for delivery of medication to patients, Optimization of two-stage location-routing-inventory problem with time-windows in food distribution network, A bi-level model and memetic algorithm for arc interdiction location-routing problem, Selective capacitated location-routing problem with incentive-dependent returns in designing used products collection network, Granular tabu search for the pickup and delivery problem with time windows and electric vehicles, Two-echelon vehicle routing problem with satellite bi-synchronization, Many-to-many location-routing with inter-hub transport and multi-commodity pickup-and-delivery, Multi-depot vehicle routing problem with time windows considering delivery and installation vehicles, The effects of the tractor and semitrailer routing problem on mitigation of carbon dioxide emissions, 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
Cites Work
- A Branch-and-Cut method for the Capacitated Location-Routing Problem
- A library of local search heuristics for the vehicle routing problem
- A heuristic lagrangean algorithm for the capacitated plant location problem
- Location-routing: issues, models and methods
- Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking
- Using clustering analysis in a capacitated location-routing problem
- A GRASP\(\times \)ELS approach for the capacitated location-routing problem
- The effect of ignoring routes when locating depots
- Combined location-routing problems: A synthesis and future research directions
- A heuristic solution to the warehouse location-routing problem
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- A two-phase tabu search approach to the location routing problem
- A compact model and tight bounds for a combined location-routing problem
- A tabu search heuristic for the multi-depot vehicle routing problem
- Very large-scale vehicle routing: new test problems, algorithms, and results
- A metaheuristic to solve a location-routing problem with nonlinear costs
- The Granular Tabu Search and Its Application to the Vehicle-Routing Problem
- An Exact Algorithm Based on Cut-and-Column Generation for the Capacitated Location-Routing Problem
- A Lagrangian Relaxation Heuristic for Capacitated Facility Location with Single-Source Constraints
- Parallel iterative search methods for vehicle routing problems
- A Tabu Search Heuristic for the Vehicle Routing Problem
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
