Local search heuristics for the mobile facility location problem

DOI10.1016/J.COR.2014.09.004MaRDI QIDQ337654zbMATHOpenAlexFDO

Authors Russell Halper, S. Raghavan, M. Sahin

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

zbMATH Keywords

local searchinteger programmingfacility location\(p\)-Medianmobile facility location

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Integer programming (90C10) Discrete location and assignment (90B80)

Recommendations

• The capacitated mobile facility location problem
• Local-search based approximation algorithms for mobile facility location problems (extended abstract)
• Minimizing movement in mobile facility location problems
• Neighborhood search heuristics for the uncapacitated facility location problem
• Mobile facility location: combinatorial filtering via weighted occupancy

Cites work

• scientific article; zbMATH DE number 821272 (Why is no real title available?)
• scientific article; zbMATH DE number 3231692 (Why is no real title available?)
• A Lagrangean heuristic for the maximal covering location problem
• A dynamic model and parallel tabu search heuristic for real-time ambulance relocation
• A note on solving large p-median problems
• An Indirect Method for the Generalized k-Median Problem Applied to Lock-Box Location
• Computational study of large-scale \(p\)-median problems
• Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
• Local search algorithms for the red-blue median problem
• Minimizing movement
• Minimizing movement in mobile facility location problems
• On some techniques useful for solution of transportation network problems
• Optimal Location-Relocation Decisions on Stochastic Networks
• TSPLIB—A Traveling Salesman Problem Library
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• The matroid median problem
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems

Cited in

(12)

• Mobile facility location: combinatorial filtering via weighted occupancy
• An active-learning Pareto evolutionary algorithm for parcel locker network design considering accessibility of customers
• Mathematical modeling for a \(p\)-mobile hub location problem in a dynamic environment by a genetic algorithm
• Relief aid provision to en route refugees: multi-period mobile facility location with mobile demand
• Analysis of a Local Search Heuristic for Facility Location Problems
• Minimizing movement in mobile facility location problems
• Local-search based approximation algorithms for mobile facility location problems (extended abstract)
• Optimal charging facility location and capacity for electric vehicles considering route choice and charging time equilibrium
• Optimized assignment patterns in mobile edge cloud networks
• The capacitated mobile facility location problem
• A Nested Cross Decomposition Algorithm for Power System Capacity Expansion with Multiscale Uncertainties
• Tabu Search Heuristic for Competitive Base Station Location Problem

Describes a project that uses

Uses Software

• TSPLIB
• OR-Library

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)