Solving the two-echelon location routing problem by a GRASP reinforced by a learning process and path relinking

DOI10.1016/j.ejor.2011.07.030zbMath1237.90047MaRDI QIDQ421715

Viet-Phuong Nguyen, Caroline Prodhon, Christian Prins

Publication date: 14 May 2012

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2011.07.030

zbMATH Keywords

vehicle routing; GRASP; learning process; facility location; path relinking; two-echelon location-routing problem

Mathematics Subject Classification ID

90B06: Transportation, logistics and supply chain management

90C59: Approximation methods and heuristics in mathematical programming

90B80: Discrete location and assignment

Related Items

Solution approaches for the vehicle routing problem with occasional drivers and time windows, The two‐echelon routing problem with truck and drones, Model and algorithm for bilevel multisized terminal location‐routing problem for the last mile delivery, Location‐routing problem: a classification of recent research, The two-echelon stochastic multi-period capacitated location-routing problem, A two-echelon location routing problem with mobile satellites for last-mile delivery: mathematical formulation and clustering-based heuristic method, A survey of recent research on location-routing problems, Solving the dynamic capacitated location-routing problem with fuzzy demands by hybrid heuristic algorithm, An adaptive large neighborhood search for the two-echelon multiple-trip vehicle routing problem with satellite synchronization, Heuristics for the generalized median graph problem, A solution method for a two-layer sustainable supply chain distribution model, A survey on two-echelon routing problems, A memetic algorithm for the capacitated location-routing problem with mixed backhauls, Lower and upper bounds for the two-echelon capacitated location-routing problem, A large neighbourhood based heuristic for two-echelon routing problems, A multi-depot two-echelon vehicle routing problem with delivery options arising in the last mile distribution, A hybrid GRASP+VND heuristic for the two-echelon vehicle routing problem arising in city logistics, Flexible two-echelon location routing problem, A branch-and-cut algorithm for the two-echelon capacitated vehicle routing problem with grouping constraints, Two-echelon location routing synchronized with production schedules and time windows, Combining facility location and routing decisions in sustainable urban freight distribution under horizontal collaboration: how can shippers be benefited?, Multi-depot two-echelon fuel minimizing routing problem with heterogeneous fleets: model and heuristic, Two-echelon vehicle routing problem with satellite bi-synchronization, A parallelised large neighbourhood search heuristic for the asymmetric two-echelon vehicle routing problem with swap containers for cargo-bicycles, Two-echelon vehicle routing problems: a literature review, A GRASP with penalty objective function for the green vehicle routing problem with private capacitated stations, A waste collection problem with service type option, Designing a two-echelon distribution network under demand uncertainty, Using greedy clustering method to solve capacitated location-routing problem with fuzzy demands, Synchronizing vans and cargo bikes in a city distribution network, A memetic algorithm for a multi-objective obnoxious waste location-routing problem: a case study, Many-to-many location-routing with inter-hub transport and multi-commodity pickup-and-delivery, A survey of variants and extensions of the location-routing problem, A fuzzy correlation based heuristic for dual-mode integrated location routing problem, OPEN PROBLEMS IN COOPERATIVE LOCATION GAMES, A taxonomical analysis, current methods and objectives on location-routing problems, Memory and Learning in Metaheuristics

Uses Software

• Tabu search

Cites Work

• Unnamed Item
• A Branch-and-Cut method for the Capacitated Location-Routing Problem
• A GRASP with evolutionary path relinking for the truck and trailer routing problem
• A branch and bound algorithm for the two-level uncapacitated facility location problem with some side constraints
• The multi-depot vehicle routing problem with inter-depot routes
• Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking
• Formulations and relaxations for a multi-echelon capacitated location-distribution problem
• A GRASP\(\times \)ELS approach for the capacitated location-routing problem
• A probabilistic heuristic for a computationally difficult set covering problem
• A comparative study of heuristics for a two-level routing-location problem
• Lagrangian heuristics for the two-echelon, single-source, capacitated facility location problem
• The periodic vehicle routing problem with intermediate facilities
• Heuristic solutions to multi-depot location-routing problems
• A simple and effective evolutionary algorithm for the vehicle routing problem
• Solving real-life vehicle routing problems efficiently using tabu search
• A tabu search heuristic for the truck and trailer routing problem
• An Exact Algorithm Based on Cut-and-Column Generation for the Capacitated Location-Routing Problem
• A Plant and Warehouse Location Problem
• Variable neighborhood search: Principles and applications