A GRASP ELS approach for the capacitated location-routing problem
From MaRDI portal
Publication:976006
DOI10.1016/J.COR.2009.07.004zbMATH Open1188.90026OpenAlexW2043496704MaRDI QIDQ976006FDOQ976006
Philippe Lacomme, Christophe Duhamel, Christian Prins, Caroline Prodhon
Publication date: 11 June 2010
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2009.07.004
Recommendations
- An exact method for the capacitated location-routing problem
- Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking
- A Branch-and-Cut method for the Capacitated Location-Routing Problem
- GRASP with a new local search scheme for vehicle routing problems with time windows
- Lower and upper bounds for the two-echelon capacitated location-routing problem
- The two-echelon stochastic multi-period capacitated location-routing problem
- Formulations and relaxations for a multi-echelon capacitated location-distribution problem
- Solving the capacitated location-routing problem. Abstract of Thesis
- A two-phase hybrid heuristic algorithm for the capacitated location-routing problem
Approximation methods and heuristics in mathematical programming (90C59) Transportation, logistics and supply chain management (90B06)
Cites Work
- The effect of ignoring routes when locating depots
- Combined location-routing problems: A synthesis and future research directions
- Heuristic solutions to multi-depot location-routing problems
- A simple and effective evolutionary algorithm for the vehicle routing problem
- Location-routing: issues, models and methods
- A two-phase tabu search approach to the location routing problem
- Greedy randomized adaptive search procedures
- Title not available (Why is that?)
- 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
- Routing with time windows by column generation
- Competitive memetic algorithms for arc routing problems
- Variable space search for graph coloring
- Title not available (Why is that?)
Cited In (39)
- A taxonomical analysis, current methods and objectives on location-routing problems
- A new formulation approach for location-routing problems
- Selective capacitated location-routing problem with incentive-dependent returns in designing used products collection network
- A multi-start evolutionary local search for the two-dimensional loading capacitated vehicle routing problem
- Exact and metaheuristic approaches to solve the integrated production scheduling, berth allocation and storage yard allocation problem
- An efficient GRASP-like algorithm for the multi-product straight pipeline scheduling problem
- A survey of recent research on location-routing problems
- A GRASP with evolutionary path relinking for the truck and trailer routing problem
- A solution method for a two-layer sustainable supply chain distribution model
- A memetic algorithm for a multi-objective obnoxious waste location-routing problem: a case study
- Solving the dynamic capacitated location-routing problem with fuzzy demands by hybrid heuristic algorithm
- A two-phase hybrid heuristic algorithm for the capacitated location-routing problem
- Variable neighborhood search for location routing
- An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics
- 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
- Solving the two-echelon location routing problem by a GRASP reinforced by a learning process and path relinking
- Multiperiod location-routing with decoupled time scales
- A hybrid evolutionary algorithm for the periodic location-routing problem
- Efficient frameworks for greedy split and new depth first search split procedures for routing problems
- A survey of the standard location-routing problem
- Comments on: Routing problems with loading constraints
- The fleet size and mix location-routing problem with time windows: formulations and a heuristic algorithm
- A memetic algorithm for the capacitated location-routing problem with mixed backhauls
- Skewed general variable neighborhood search for the location routing scheduling problem
- Planning a capacitated road network with flexible travel times: a genetic algorithm
- A simulated annealing heuristic for the open location-routing problem
- 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
- Technical note: Split algorithm in \(O(n)\) for the capacitated vehicle routing problem
- Column generation based heuristics for a generalized location routing problem with profits arising in space exploration
- Hybrid adaptive large neighborhood search for vehicle routing problems with depot location decisions
- A conceptually simple algorithm 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
- Many-to-many location-routing with inter-hub transport and multi-commodity pickup-and-delivery
- An iterated local search for solving a location-routing problem
- 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: A GRASP\(\times \)ELS approach 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 Q976006)
