A heuristic algorithm to solve the single-facility location routing problem on Riemannian surfaces

DOI10.1007/s10287-014-0226-6zbMath1317.90170OpenAlexW2145218935WikidataQ115384915 ScholiaQ115384915MaRDI QIDQ2355716

Theodore B. Trafalis, Emre Tokgöz, Samir Alwazzi

Publication date: 24 July 2015

Published in: Computational Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10287-014-0226-6

zbMATH Keywords

heuristicsRiemannian manifoldgeodesicWeber problemlogisticslocation routing problem

Mathematics Subject Classification ID

Continuous location (90B85) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Geodesics in global differential geometry (53C22) Local Riemannian geometry (53B20)

Related Items (3)

Location‐routing problem: a classification of recent research ⋮ An exact and a heuristic approach for the transportation-\(p\)-facility location problem ⋮ 2-facility manifold location routing problem

Uses Software

• VRP

Cites Work

• Unnamed Item
• 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
• A hierarchical algorithm for the planar single-facility location routing problem
• Single-source capacitated multi-facility Weber problem-an iterative two phase heuristic algorithm
• 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
• Riemannian geometry and geometric analysis

This page was built for publication: A heuristic algorithm to solve the single-facility location routing problem on Riemannian surfaces