A hierarchical algorithm for the planar single-facility location routing problem
From MaRDI portal
Publication:1761993
DOI10.1016/j.cor.2011.05.013zbMath1251.90246OpenAlexW1970725601MaRDI QIDQ1761993
Publication date: 15 November 2012
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2011.05.013
Mixed integer programming (90C11) Nonlinear programming (90C30) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items
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 ⋮ A continuous location and maintenance routing problem for offshore wind farms: mathematical models and hybrid methods ⋮ Location‐routing problem: a classification of recent research ⋮ A planar facility location-allocation problem with fixed and/or variable cost structures for rural electrification ⋮ On queueing-inventory-location problems ⋮ A column generation approach for location-routing problems with pickup and delivery ⋮ 2-facility manifold location routing problem ⋮ Single-source capacitated multi-facility Weber problem-an iterative two phase heuristic algorithm ⋮ A taxonomical analysis, current methods and objectives on location-routing problems ⋮ A heuristic algorithm to solve the single-facility location routing problem on Riemannian surfaces ⋮ Using greedy clustering method to solve capacitated location-routing problem with fuzzy demands
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Location-routing: issues, models and methods
- Using clustering analysis in a capacitated location-routing problem
- A heuristic based on multi-exchange techniques for a regional fleet assignment location-routing problem
- Region-rejection based heuristics for the capacitated multi-source Weber problem
- A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem
- Combined location-routing problems -- a neural network approach
- Local improvement in planar facility location using vehicle routing
- Vehicle routing considerations in distribution system design
- The effect of ignoring routes when locating depots
- An exact algorithm for minimizing routing and operating costs in depot location
- Variable neighborhood search
- Restructuring of Swiss parcel delivery services
- Solving real-life vehicle routing problems efficiently using tabu search
- What you should know about the vehicle routing problem
- What you should know about location modeling
- NP-Hard, Capacitated, Balanced p-Median Problems on a Chain Graph with a Continuum of Link Demands
- Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
- Heuristic Methods for Location-Allocation Problems
- Constructive heuristics for the uncapacitated continuous location-allocation problem
- A new enhancement of the Clarke and Wright savings heuristic for the capacitated vehicle routing problem
