A survey of the standard location-routing problem
From MaRDI portal
Publication:1698292
DOI10.1007/s10479-017-2509-0zbMath1380.90059OpenAlexW2114345197MaRDI QIDQ1698292
Michael Drexl, Michael Schneider
Publication date: 15 February 2018
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-017-2509-0
Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80)
Related Items
A survey of variants and extensions of the location-routing problem, A variable neighborhood search based matheuristic for a waste cooking oil collection network design problem, An urban transportation problem solved by parallel programming with hyper-heuristics, A continuous location and maintenance routing problem for offshore wind farms: mathematical models and hybrid methods, A nonlinear integer programming model for integrated location, inventory, and routing decisions in a closed-loop supply chain, A waste collection problem with service type option, A large neighbourhood search metaheuristic for the contagious disease testing problem, Bifactor approximation for location routing with vehicle and facility capacities, Decomposition-based hyperheuristic approaches for the bi-objective cold chain considering environmental effects, A progressive filtering heuristic for the location-routing problem and variants, The electric location-routing problem with heterogeneous fleet: formulation and Benders decomposition approach, Optimizing the changing locations of mobile parcel lockers in last-mile distribution, A concise guide to existing and emerging vehicle routing problem variants, Hybrid adaptive large neighborhood search for vehicle routing problems with depot location decisions, The location routing problem with facility sizing decisions, Effective metaheuristics for the latency location routing problem, Cooperative game‐theoretic features of cost sharing in location‐routing, Location‐routing problem: a classification of recent research, Route efficiency implications of time windows and vehicle capacities in first- and last-mile logistics, Introduction of an underground waste container system-model and solution approaches, A simultaneous facility location and vehicle routing problem arising in health care logistics in the Netherlands, A blood bank network design problem with integrated facility location, inventory and routing decisions, A robust location-arc routing problem under uncertainty: mathematical model with lower and upper bounds, Objectives and methods in multi-objective routing problems: a survey and classification scheme, Shared resources in collaborative vehicle routing, Asymmetric Multidepot Vehicle Routing Problems: Valid Inequalities and a Branch-and-Cut Algorithm, A location-or-routing problem with partial and decaying coverage
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A survey of recent research on location-routing problems
- A survey on two-echelon routing problems
- 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
- A Branch-and-Cut method for the Capacitated Location-Routing Problem
- A library of local search heuristics for the vehicle routing problem
- The multiple depot, multiple traveling salesmen facility-location problem: Vehicle range, service frequency, and heuristic implementations
- Location-routing: issues, models and methods
- Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking
- Using clustering analysis in a capacitated location-routing problem
- The Hamiltonian p-median problem
- The vehicle routing problem. Latest advances and new challenges.
- The effective application of a new approach to the generalized orienteering problem
- A GRASP\(\times \)ELS approach for the capacitated location-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
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- Heuristic solutions to multi-depot location-routing problems
- A two-phase tabu search approach to the location routing problem
- A simple and effective evolutionary algorithm for the capacitated location-routing problem
- A computational comparison of flow formulations for the capacitated location-routing problem
- A simple and effective evolutionary algorithm for the vehicle routing problem
- A compact model and tight bounds for a combined location-routing problem
- Approximating minimum-cost graph problems with spanning tree edges
- A unified exact method for solving different classes of vehicle routing problems
- A particle swarm optimization algorithm with path relinking for the location routing problem
- Very large-scale vehicle routing: new test problems, algorithms, and results
- Expanding neighborhood GRASP for the traveling salesman problem
- A survey of variants and extensions of the location-routing problem
- The capacitated arc routing problem with intermediate facilities
- A taxonomical analysis, current methods and objectives on location-routing problems
- An Exact Method for the Capacitated Location-Routing Problem
- The Granular Tabu Search and Its Application to the Vehicle-Routing Problem
- Vehicle Routing
- An Exact Algorithm Based on Cut-and-Column Generation for the Capacitated Location-Routing Problem
- Cost-effective designs of fault-tolerant access networks in communication systems
- Experimental Methods for the Analysis of Optimization Algorithms
- A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling
- Solving the Multi-Depot Location-Routing Problem with Lagrangian Relaxation
- Parallel iterative search methods for vehicle routing problems
- A tabu search heuristic for periodic and multi-depot vehicle routing problems
- An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
- A guide to vehicle routing heuristics
- Efficient heuristics for Median Cycle Problems
- A General Approximation Technique for Constrained Forest Problems
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- Use of Representative Operation Counts in Computational Testing of Algorithms
- Adaptive memory programming: a unified view of metaheuristics
- The Pickup And Delivery Problem With Time Windows And Transshipment
