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

DOI10.2298/YJOR160517018BMaRDI QIDQ4987696zbMATH OpenOpenAlexFDO

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

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

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

Recommendations

• A new local search for continuous location problems
• scientific article; zbMATH DE number 5501651
• Continuous reformulations and heuristics for the Euclidean travelling salesperson problem
• A new heuristic for solving the \(p\)-median problem in the plane
• scientific article; zbMATH DE number 2114492

Cites work

• scientific article; zbMATH DE number 5501651 (Why is no real title available?)
• scientific article; zbMATH DE number 4123493 (Why is no real title available?)
• scientific article; zbMATH DE number 3395637 (Why is no real title available?)
• A Dual-Based Procedure for Uncapacitated Facility Location
• A GA based heuristic for the vehicle routing problem with multiple trips
• A genetic algorithm based approach for the uncapacitated continuous location-allocation problem
• A new local search for continuous location problems
• A projection method for \(l_ p\) norm location-allocation problems
• Attraction probabilities in variable neighborhood search
• Heuristic Methods for Location-Allocation Problems
• Heuristic solution of the multisource Weber problem as a \(p\)-median problem
• Heuristics for location models
• Location-Allocation Problems
• New local searches for solving the multi-source Weber problem
• On the Complexity of Some Common Geometric Location Problems
• TSPLIB—A Traveling Salesman Problem Library
• The \(p\)-median problem: a survey of metaheuristic approaches

Cited in

(4)

• A new local search for continuous location problems
• 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
• A planar facility location-allocation problem with fixed and/or variable cost structures for rural electrification

Describes a project that uses

Uses Software

• TSPLIB

This page was built for publication: Using injection points in reformulation local search for solving continuous location problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4987696)