A GRASP\(\times \)ELS approach for the capacitated location-routing problem

From MaRDI portal
Publication:976006

DOI10.1016/j.cor.2009.07.004zbMath1188.90026OpenAlexW2043496704MaRDI QIDQ976006

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



Related Items

A new formulation approach for location-routing problems, A survey of recent research on location-routing problems, Solving the dynamic capacitated location-routing problem with fuzzy demands by hybrid heuristic algorithm, A survey of variants and extensions of the location-routing problem, The fleet size and mix location-routing problem with time windows: formulations and a heuristic algorithm, A solution method for a two-layer sustainable supply chain distribution model, A memetic algorithm for the capacitated location-routing problem with mixed backhauls, Skewed general variable neighborhood search for the location routing scheduling problem, A simple and effective evolutionary algorithm for the capacitated location-routing problem, A simulated annealing heuristic for the open location-routing problem, Variable neighborhood search for location routing, A two-phase hybrid heuristic algorithm for the capacitated location-routing problem, An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics, Technical note: Split algorithm in \(O(n)\) for the capacitated vehicle routing problem, 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 multi-start evolutionary local search for the two-dimensional loading capacitated vehicle routing problem, Column generation based heuristics for a generalized location routing problem with profits arising in space exploration, Efficient frameworks for greedy split and new depth first search split procedures for routing problems, Hybrid adaptive large neighborhood search for vehicle routing problems with depot location decisions, Planning a capacitated road network with flexible travel times: a genetic algorithm, Model and algorithm for bilevel multisized terminal location‐routing problem for the last mile delivery, Exact and metaheuristic approaches to solve the integrated production scheduling, berth allocation and storage yard allocation problem, Solving the two-echelon location routing problem by a GRASP reinforced by a learning process and path relinking, A survey of the standard location-routing problem, A GRASP with evolutionary path relinking for the truck and trailer routing problem, Multiperiod location-routing with decoupled time scales, Optimization of a two-echelon location lot-sizing routing problem with deterministic demand, Selective capacitated location-routing problem with incentive-dependent returns in designing used products collection network, A hybrid evolutionary algorithm for the periodic location-routing problem, Unnamed Item, Many-to-many location-routing with inter-hub transport and multi-commodity pickup-and-delivery, Comments on: Routing problems with loading constraints, A taxonomical analysis, current methods and objectives on location-routing problems, A location-or-routing problem with partial and decaying coverage, An efficient GRASP-like algorithm for the multi-product straight pipeline scheduling problem, Using greedy clustering method to solve capacitated location-routing problem with fuzzy demands



Cites Work