Recent developments in location-routing problems. Deterministic single-echelon, single-objective, single-period problems
From MaRDI portal
Cites work
- 2-facility manifold location routing problem
- A biased random-key genetic algorithm for the two-level hub location routing problem with directed tours
- A branch and cut algorithm for the location-routing problem with simultaneous pickup and delivery
- A branch-and-cut algorithm for the one-commodity pickup and delivery location routing problem
- A Branch-and-Cut method for the Capacitated Location-Routing Problem
- A column generation approach for location-routing problems with pickup and delivery
- A column generation approach for the location-routing problem with time windows
- A computational comparison of flow formulations for the capacitated location-routing problem
- A conceptually simple algorithm for the capacitated location-routing problem
- A continuous approximation approach to the planar hub location-routing problem: modeling and solution algorithms
- A GRASP\(\times \)ELS approach for the capacitated location-routing problem
- A heuristic algorithm to solve the single-facility location routing problem on Riemannian surfaces
- A hybrid evolutionary algorithm for heterogeneous fleet vehicle routing problems with time windows
- A hybrid guided local search for the vehicle-routing problem with intermediate replenishment facilities
- A literature review on hub location-routing models and their solution techniques
- A location-or-routing problem with partial and decaying coverage
- A location-routing problem in glass recycling
- A memetic algorithm for the capacitated location-routing problem with mixed backhauls
- A new formulation and an exact approach for the many-to-many hub location-routing problem
- A profit-maximization location-routing-pricing problem: a branch-and-price algorithm
- A progressive filtering heuristic for the location-routing problem and variants
- A reinforcement learning guided hybrid evolutionary algorithm for the latency location routing problem
- A simple and effective evolutionary algorithm for the capacitated location-routing problem
- A simulated annealing heuristic for the open location-routing problem
- A survey of recent research on location-routing problems
- A survey of the standard location-routing problem
- A survey of variants and extensions of the location-routing problem
- A survey on two-echelon routing problems
- A tabu search heuristic for periodic and multi-depot vehicle routing problems
- A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
- A taxonomical analysis, current methods and objectives on location-routing problems
- A two-phase tabu search approach to the location routing problem
- A unifying framework for selective routing problems
- Adaptive large neighborhood decomposition search algorithm for multi-allocation hub location routing problem
- An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- An efficient heuristic for a hub location routing problem
- An exact algorithm based on cut-and-column generation for the capacitated location-routing problem
- An exact method for the capacitated location-routing problem
- An iterated local search algorithm for latency vehicle routing problems with multiple depots
- Bifactor approximation for location routing with vehicle and facility capacities
- Consistency and robustness in location-routing
- Cooperative game‐theoretic features of cost sharing in location‐routing
- Effective metaheuristics for the latency location routing problem
- Evolutionary hyperheuristics for location-routing problem with simultaneous pickup and delivery
- Formulation and a heuristic approach for the orienteering location-routing problem
- scientific article; zbMATH DE number 2084694 (Why is no real title available?)
- scientific article; zbMATH DE number 3340881 (Why is no real title available?)
- Hybrid adaptive large neighborhood search for vehicle routing problems with depot location decisions
- Hybrid genetic search for the CVRP: open-source implementation and SWAP* neighborhood
- Knowledge-guided local search for the vehicle routing problem
- Locating depots for capacitated vehicle routing
- Locating median cycles in networks
- Location routing problems on trees
- Location science
- Location-routing: issues, models and methods
- Location‐routing problem: a classification of recent research
- Mathematical modeling of a bi-objective hub location-routing problem for rapid transit networks
- Multiperiod location-routing with decoupled time scales
- New formulations and solution approaches for the latency location routing problem
- New mixed integer-programming model for the pickup-and-delivery problem with transshipment
- New route relaxation and pricing strategies for the vehicle routing problem
- Node-ejection chains for the vehicle routing problem: Sequential and parallel algorithms
- Nonrobust Strong Knapsack Cuts for Capacitated Location Routing and Related Problems
- Round-trip hub location problem
- Selective capacitated location-routing problem with incentive-dependent returns in designing used products collection network
- Skewed general variable neighborhood search for the location routing scheduling problem
- Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking
- Stabilized column generation
- Sur le point pour lequel la somme des distances de \(n\) points donnés est minimum.
- The fleet size and mix location-routing problem with time windows: formulations and a heuristic algorithm
- The fleet size and mix vehicle routing problem with time windows
- The green location-routing problem
- The Hamiltonian p-median problem
- The hub location and routing problem
- The latency location-routing problem
- The location routing problem with facility sizing decisions
- The location routing problem with time windows and load-dependent travel times for cargo bikes
- The many-to-many location-routing problem
- The multi-zone location-routing problem with pricing: a flow-based formulation and two heuristic approaches
- The p-hub centre routing problem with emissions budget: formulation and solution procedure
- Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms
- Two echelon location routing problem with simultaneous pickup and delivery: mixed integer programming formulations and comparative analysis
- Using clustering analysis in a capacitated location-routing problem
- Using horizontal cooperation concepts in integrated routing and facility‐location decisions
Cited in
(2)
This page was built for publication: Recent developments in location-routing problems. Deterministic single-echelon, single-objective, single-period problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7233945)
