Local search heuristics for the mobile facility location problem
From MaRDI portal
Publication:337654
DOI10.1016/J.COR.2014.09.004zbMATH Open1348.90395OpenAlexW2148533339MaRDI QIDQ337654FDOQ337654
S. Raghavan, M. Sahin, Russell Halper
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2014.09.004
Approximation methods and heuristics in mathematical programming (90C59) Integer programming (90C10) Discrete location and assignment (90B80)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A note on solving large p-median problems
- TSPLIB—A Traveling Salesman Problem Library
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- On some techniques useful for solution of transportation network problems
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- Computational study of large-scale \(p\)-median problems
- Minimizing movement
- A dynamic model and parallel tabu search heuristic for real-time ambulance relocation
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
- A Lagrangean heuristic for the maximal covering location problem
- Minimizing movement in mobile facility location problems
- Optimal Location-Relocation Decisions on Stochastic Networks
- An Indirect Method for the Generalized k-Median Problem Applied to Lock-Box Location
- Local search algorithms for the red-blue median problem
Cited In (11)
- Relief aid provision to en route refugees: multi-period mobile facility location with mobile demand
- Serving Online Requests with Mobile Servers
- The capacitated mobile facility location problem
- A Nested Cross Decomposition Algorithm for Power System Capacity Expansion with Multiscale Uncertainties
- Optimized assignment patterns in mobile edge cloud networks
- Mathematical modeling for a \(p\)-mobile hub location problem in a dynamic environment by a genetic algorithm
- Analysis of a Local Search Heuristic for Facility Location Problems
- Optimal charging facility location and capacity for electric vehicles considering route choice and charging time equilibrium
- An active-learning Pareto evolutionary algorithm for parcel locker network design considering accessibility of customers
- Mobile facility location: combinatorial filtering via weighted occupancy
- Tabu Search Heuristic for Competitive Base Station Location Problem
Uses Software
This page was built for publication: Local search heuristics for the mobile facility location problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q337654)
