Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking
From MaRDI portal
Publication:862819
DOI10.1007/S10288-006-0001-9zbMath1125.90316OpenAlexW2029350737MaRDI QIDQ862819
Christian Prins, Roberto Wolfler Calvo, Caroline Prodhon
Publication date: 24 January 2007
Published in: 4OR (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10288-006-0001-9
Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80)
Related Items (51)
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 ⋮ Sequential and parallel large neighborhood search algorithms for the periodic location routing problem ⋮ New formulations and solution approaches for the latency location routing problem ⋮ The fleet size and mix location-routing problem with time windows: formulations and a heuristic algorithm ⋮ The latency location-routing problem ⋮ Location-arc routing problem: heuristic approaches and test instances ⋮ A solution method for a two-layer sustainable supply chain distribution model ⋮ 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 ⋮ 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 ⋮ Lower and upper bounds for the two-echelon capacitated location-routing problem ⋮ An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics ⋮ Evolution-inspired local improvement algorithm solving orienteering problem ⋮ Evolutionary hyperheuristics for location-routing problem with simultaneous pickup and delivery ⋮ Bifactor approximation for location routing with vehicle and facility capacities ⋮ Modeling and solving profitable location and distribution problems ⋮ A progressive filtering heuristic for the location-routing problem and variants ⋮ 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 ⋮ The location routing problem with facility sizing decisions ⋮ Using horizontal cooperation concepts in integrated routing and facility‐location decisions ⋮ Cooperative game‐theoretic features of cost sharing in location‐routing ⋮ A Branch-and-Cut method for the Capacitated Location-Routing 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 ⋮ An Exact Algorithm Based on Cut-and-Column Generation for the Capacitated Location-Routing Problem ⋮ Optimization of a two-echelon location lot-sizing routing problem with deterministic demand ⋮ Solving the capacitated location-routing problem. Abstract of Thesis ⋮ Optimization of two-stage location-routing-inventory problem with time-windows in food distribution network ⋮ A Metaheuristic for the Periodic Location-Routing Problem ⋮ Selective capacitated location-routing problem with incentive-dependent returns in designing used products collection network ⋮ Hybrid heuristic for the location‐inventory‐routing problem in closed‐loop supply chain ⋮ A hybrid evolutionary algorithm for the periodic location-routing problem ⋮ A particle swarm optimization algorithm with path relinking for the location routing problem ⋮ Solving a bi-objective transportation location routing problem by metaheuristic algorithms ⋮ A comparative study of two hybrid grouping evolutionary techniques for the capacitated P-median problem ⋮ A path relinking approach for the team orienteering problem ⋮ A GRASP\(\times \)ELS approach for the capacitated location-routing problem ⋮ Distribution systems design with two-level routing considerations ⋮ A branch and cut algorithm for the location-routing problem with simultaneous pickup and delivery ⋮ A heuristic two-phase solution approach for the multi-objective dial-a-ride problem ⋮ Comments on: Routing problems with loading constraints ⋮ A relax‐and‐price heuristic for the inventory‐location‐routing problem ⋮ A taxonomical analysis, current methods and objectives on location-routing problems ⋮ Using greedy clustering method to solve capacitated location-routing problem with fuzzy demands
Cites Work
- Unnamed Item
- Unnamed Item
- The effect of ignoring routes when locating depots
- Models and exact solutions for a class of stochastic location-routing problems
- Combined location-routing problems: A synthesis and future research directions
- GRASP and path relinking for the matrix bandwidth minimization.
- Heuristic solutions to multi-depot location-routing problems
- A two-phase tabu search approach to the location routing problem
- Greedy randomized adaptive search procedures
- A compact model and tight bounds for a combined location-routing problem
- Solving a Family of Multi-Depot Vehicle Routing and Location-Routing Problems
- Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment
- GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization
- Improved Constructive Multistart Strategies for the Quadratic Assignment Problem Using Adaptive Memory
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- A multiple-depot, multiple-vehicle, location-routing problem with stochastically processed demands
This page was built for publication: Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking
