A simple tabu search for warehouse location
From MaRDI portal
Publication:703910
DOI10.1016/S0377-2217(03)00247-9zbMath1067.90054MaRDI QIDQ703910
Laurent Michel, Pascal Van Hentenryck
Publication date: 12 January 2005
Published in: European Journal of Operational Research (Search for Journal in Brave)
Search theory (90B40) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items
A study on the budget constrained facility location model considering inventory management cost, Advanced greedy randomized adaptive search procedure for the obnoxious \(p\)-median problem, Contraint-based combinators for local search, The minimum weighted covering location problem with distance constraints, An improved approximation algorithm for squared metric \(k\)-facility location, Tactical network planning for food aid distribution in Kenya, A hybrid multistart heuristic for the uncapacitated facility location problem, Meta-heuristic approaches with memory and evolution for a multi-product production/distribution system design problem, An auxiliary function method for global minimization in integer programming, Analyses of location-price game on networks with stochastic customer behavior and its heuristic algorithm, Parameter-free filled function method for nonlinear integer program, A variable neighborhood search heuristic for the design of multicommodity production-distribution networks with alternative facility configurations, An improved particle swarm optimization for the automobile spare part warehouse location problem, An exact cooperative method for the uncapacitated facility location problem, Solving the uncapacitated facility location problem using tabu search, A simple filter-and-fan approach to the facility location problem, A simple and deterministic competitive algorithm for online facility location, A critical review of discrete filled function methods in solving nonlinear discrete optimization problems, An acceleration of Erlenkotter-Körkel's algorithms for the uncapacitated facility location problem, Parallel and distributed local search in COMET, Solving large-scale uncapacitated facility location problems with evolutionary simulated annealing, Improved approximation algorithms for solving the squared metric \(k\)-facility location problem, Metaheuristic applications on discrete facility location problems: a survey, Maintaining longest paths incrementally
Uses Software
Cites Work
- A Lagrangean dual ascent algorithm for simple plant location problems
- A projection method for the uncapacitated facility location problem
- On the exact solution of large-scale simple plant location problems
- A tabu search approach to the uncapacitated facility location problem
- Uncapacitated facility location: General solution procedure and computational experience
- Obtaining test problems via Internet
- Bounded incremental computation
- Experiments with primal - dual decomposition and subgradient methods for the uncapacitatied facility location problem
- Solving the simple plant location problem by genetic algorithm
- A Dual-Based Procedure for Uncapacitated Facility Location
- Local search heuristic for k-median and facility location problems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
