A two-phase hybrid heuristic algorithm for the capacitated location-routing problem
From MaRDI portal
Publication:339543
DOI10.1016/J.COR.2012.05.008zbMATH Open1349.90141OpenAlexW2075334523MaRDI QIDQ339543FDOQ339543
Authors: John Willmer Escobar, Rodrigo Linfati, 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
Recommendations
- Two-stage heuristic algorithm for the large-scale capacitated location routing problem
- scientific article; zbMATH DE number 1189252
- An effective hybrid approach to the two-stage capacitated facility location problem
- An LP-based heuristic for two-stage capacitated facility location problems
- A two-phase tabu search approach to the location routing problem
- A hybrid heuristic for the uncapacitated hub location problem
- Two phased hybrid local search for the periodic capacitated arc routing problem
- A two-phase metaheuristic for the cumulative capacitated vehicle routing problem
Approximation methods and heuristics in mathematical programming (90C59) Transportation, logistics and supply chain management (90B06)
Cites Work
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- A library of local search heuristics for the vehicle 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
- A compact model and tight bounds for a combined location-routing problem
- A metaheuristic to solve a location-routing problem with nonlinear costs
- A Branch-and-Cut method for the Capacitated Location-Routing Problem
- Location-routing: issues, models and methods
- Using clustering analysis in a capacitated location-routing problem
- A GRASP\(\times \)ELS approach for the capacitated location-routing problem
- A two-phase tabu search approach to the location routing problem
- A Lagrangian Relaxation Heuristic for Capacitated Facility Location with Single-Source Constraints
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking
- Very large-scale vehicle routing: new test problems, algorithms, and results
- An exact algorithm based on cut-and-column generation for the capacitated location-routing problem
- Parallel iterative search methods for vehicle routing problems
- A Tabu Search Heuristic for the Vehicle Routing Problem
- A tabu search heuristic for the multi-depot vehicle routing problem
- The granular tabu search and its application to the vehicle-routing problem
- A heuristic lagrangean algorithm for the capacitated plant location problem
Cited In (41)
- A taxonomical analysis, current methods and objectives on location-routing problems
- Selective capacitated location-routing problem with incentive-dependent returns in designing used products collection network
- Optimization of two-stage location-routing-inventory problem with time-windows in food distribution network
- Granular tabu search for the pickup and delivery problem with time windows and electric vehicles
- A hybrid clonal selection algorithm for the location routing problem with stochastic demands
- A survey of recent research on location-routing problems
- 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
- The effects of the tractor and semitrailer routing problem on mitigation of carbon dioxide emissions
- Solving the dynamic capacitated location-routing problem with fuzzy demands by hybrid heuristic algorithm
- Model and algorithm for bilevel multisized terminal location‐routing problem for the last mile delivery
- Effective metaheuristics for the latency location routing problem
- Evolutionary hyperheuristics for location-routing problem with simultaneous pickup and delivery
- Multi-depot vehicle routing problem with time windows considering delivery and installation vehicles
- Evaluating two new heuristics for constructing customer clusters in a VRPTW with multiple service workers
- Two-echelon vehicle routing problem with satellite bi-synchronization
- Sequential and parallel large neighborhood search algorithms for the periodic location routing problem
- The multi-zone location-routing problem with pricing: a flow-based formulation and two heuristic approaches
- A survey of the standard location-routing problem
- The capacitated multi-facility location–allocation problem with probabilistic customer location and demand: two hybrid meta-heuristic algorithms
- The latency location-routing problem
- A memetic algorithm for the capacitated location-routing problem with mixed backhauls
- A bi-level model and memetic algorithm for arc interdiction location-routing problem
- A metaheuristic to solve a location-routing problem with nonlinear costs
- The electric location-routing problem with heterogeneous fleet: formulation and Benders decomposition approach
- A simple and effective evolutionary algorithm for the capacitated location-routing problem
- Using greedy clustering method to solve capacitated location-routing problem with fuzzy demands
- A progressive filtering heuristic for the location-routing problem and variants
- A fuzzy correlation based heuristic for dual-mode integrated location routing problem
- Hybrid adaptive large neighborhood search for vehicle routing problems with depot location decisions
- A conceptually simple algorithm for the capacitated location-routing problem
- A biased-randomized metaheuristic for the capacitated location routing problem
- Two-stage heuristic algorithm for the large-scale capacitated location routing problem
- A location-or-routing problem with partial and decaying coverage
- Solving the capacitated location-routing problem. Abstract of Thesis
- Designing granular solution methods for routing problems with time windows
- Many-to-many location-routing with inter-hub transport and multi-commodity pickup-and-delivery
- Solving the bus evacuation problem and its variants
- An iterated local search algorithm for latency vehicle routing problems with multiple depots
- A two-phase heuristic algorithm for the problem of scheduling and vehicle routing for delivery of medication to patients
Uses Software
This page was built for publication: A two-phase hybrid heuristic algorithm 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 Q339543)
