A new local search for continuous location problems
From MaRDI portal
Publication:2255938
DOI10.1016/j.ejor.2013.06.022zbMath1305.90267OpenAlexW2068197938MaRDI QIDQ2255938
Zvi Drezner, Said Salhi, Nenad Mladenović, Jack Brimberg
Publication date: 18 February 2015
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://kar.kent.ac.uk/34400/1/Jack%28FSS-March2013%29.pdf
Related Items (27)
The planar multifacility collection depots location problem ⋮ A continuous location and maintenance routing problem for offshore wind farms: mathematical models and hybrid methods ⋮ Optimization of facility location and size problem based on bi-level multi-objective programming ⋮ Continuous multifacility ordered median location problems ⋮ A formulation space search heuristic for packing unequal circles in a fixed size circular container ⋮ A distance-limited continuous location-allocation problem for spatial planning of decentralized systems ⋮ New heuristic algorithms for solving the planar \(p\)-median problem ⋮ Packing unequal rectangles and squares in a fixed size circular container using formulation space search ⋮ An adaptive perturbation-based heuristic: an application to the continuous \(p\)-centre problem ⋮ Single facility siting involving allocation decisions ⋮ Solving the planar \(p\)-Median problem by variable neighborhood and concentric searches ⋮ A voltage drop limited decentralized electric power distribution network ⋮ Incorporating neighborhood reduction for the solution of the planar \(p\)-median problem ⋮ Integrated optimization model for distribution network design: a case study of the clothing industry ⋮ The continuous single source location problem with capacity and zone-dependent fixed cost: models and solution approaches ⋮ A planar facility location-allocation problem with fixed and/or variable cost structures for rural electrification ⋮ \(k\)-means genetic algorithms with greedy genetic operators ⋮ New local searches for solving the multi-source Weber problem ⋮ Planar multifacility location problems with tree structure and finite dominating sets ⋮ Optimal number and location of storage hubs and biogas production reactors in farmlands with allocation of multiple feedstocks ⋮ Genetic Algorithms with the Crossover-Like Mutation Operator for the k-Means Problem ⋮ A memetic algorithm based on reformulation local search for minimum sum-of-squares clustering in networks ⋮ Improved starting solutions for the planar p-median problem ⋮ Using injection points in reformulation local search for solving continuous location problems ⋮ The incorporation of fixed cost and multilevel capacities into the discrete and continuous single source capacitated facility location problem ⋮ Packing a fixed number of identical circles in a circular container with circular prohibited areas ⋮ A branch-and-price approach for the continuous multifacility monotone ordered median problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new heuristic for solving the \(p\)-median problem in the plane
- A continuous location-allocation problem with zone-dependent fixed cost
- The \(p\)-median problem: a survey of metaheuristic approaches
- Variable neighbourhood search: methods and applications
- Attraction probabilities in variable neighborhood search
- Discrete approximation heuristics for the capacitated continuous location-allocation problem with probabilistic customer locations
- Analytical models for locating undesirable facilities
- An optimal method for solving the (generalized) multi-Weber problem
- Heuristic solution of the multisource Weber problem as a \(p\)-median problem
- A multi-level composite heuristic for the multi-depot vehicle fleet mix problem
- A projection method for \(l_ p\) norm location-allocation problems
- Variable neighborhood search
- Heuristic methods for large centroid clustering problems
- A cellular heuristic for the multisource Weber problem.
- Reformulation descent applied to circle packing problems
- Generating good starting solutions for the p-median problem in the plane
- A Fast Algorithm For The Greedy Interchange For Large-Scale Clustering And Median Location Problems
- Location Theory
- On the Complexity of Some Common Geometric Location Problems
- New heuristic methods for the capacitated multi-facility Weber problem
- Efficient heuristics for the rectilinear distance capacitated multi-facility Weber problem
- Using Block Norms for Location Modeling
- Location-Allocation Problems
- A Dual-Based Procedure for Uncapacitated Facility Location
- Technical Note—A New Norm for Measuring Distance Which Yields Linear Location Problems
- Technical Note—Location Theory, Dominance, and Convexity: Some Further Results
- TSPLIB—A Traveling Salesman Problem Library
- Heuristic Methods for Location-Allocation Problems
- Constructive heuristics for the uncapacitated continuous location-allocation problem
- The multi-source Weber problem with constant opening cost
- An efficient General Variable Neighborhood Search for large Travelling Salesman Problem with Time Windows
- Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
- Exact and approximate solutions to the multisource weber problem
This page was built for publication: A new local search for continuous location problems
