Using injection points in reformulation local search for solving continuous location problems

DOI10.2298/YJOR160517018BzbMath1474.90270OpenAlexW2531881412MaRDI QIDQ4987696

Said Salhi, Jack Brimberg, Zvi Drezner, Nenad Mladenović

Publication date: 3 May 2021

Published in: Yugoslav Journal of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2298/yjor160517018b

zbMATH Keywords

continuous locationvariable neighborhood searchWeber problemformulation space searchreformulation descent

Mathematics Subject Classification ID

Continuous location (90B85) Nonconvex programming, global optimization (90C26)

Related Items

A planar facility location-allocation problem with fixed and/or variable cost structures for rural electrification ⋮ Planar multifacility location problems with tree structure and finite dominating sets ⋮ A memetic algorithm based on reformulation local search for minimum sum-of-squares clustering in networks

Uses Software

• TSPLIB

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• New local searches for solving the multi-source Weber problem
• The \(p\)-median problem: a survey of metaheuristic approaches
• A GA based heuristic for the vehicle routing problem with multiple trips
• Attraction probabilities in variable neighborhood search
• Heuristic solution of the multisource Weber problem as a \(p\)-median problem
• A projection method for \(l_ p\) norm location-allocation problems
• A genetic algorithm based approach for the uncapacitated continuous location-allocation problem
• A new local search for continuous location problems
• On the Complexity of Some Common Geometric Location Problems
• Location-Allocation Problems
• A Dual-Based Procedure for Uncapacitated Facility Location
• TSPLIB—A Traveling Salesman Problem Library
• Heuristic Methods for Location-Allocation Problems
• Heuristics for Location Models