Local search heuristics for the mobile facility location problem

DOI10.1016/j.cor.2014.09.004zbMath1348.90395OpenAlexW2148533339MaRDI QIDQ337654

Mohammad Hasan, M. Dambrine

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

integer programminglocal searchfacility location\(p\)-Medianmobile facility location

Mathematics Subject Classification ID

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

Related Items (7)

Relief aid provision to en route refugees: multi-period mobile facility location with mobile demand ⋮ An active-learning Pareto evolutionary algorithm for parcel locker network design considering accessibility of customers ⋮ A Nested Cross Decomposition Algorithm for Power System Capacity Expansion with Multiscale Uncertainties ⋮ Optimized assignment patterns in mobile edge cloud networks ⋮ The capacitated mobile facility location problem ⋮ Mathematical modeling for a \(p\)-mobile hub location problem in a dynamic environment by a genetic algorithm ⋮ Optimal charging facility location and capacity for electric vehicles considering route choice and charging time equilibrium

Uses Software

• TSPLIB
• OR-Library

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Local search algorithms for the red-blue median problem
• Computational study of large-scale \(p\)-median problems
• A note on solving large p-median problems
• A Lagrangean heuristic for the maximal covering location problem
• Minimizing movement
• 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
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• TSPLIB—A Traveling Salesman Problem Library
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
• On some techniques useful for solution of transportation network problems
• A dynamic model and parallel tabu search heuristic for real-time ambulance relocation

This page was built for publication: Local search heuristics for the mobile facility location problem