A branch-and-price algorithm for the multi-source Weber problem

DOI10.1504/IJOR.2007.012460MaRDI QIDQ1000170zbMATH OpenOpenAlexFDO

Authors Giovanni Righini, Luca Zaniboni

Publication date 5 February 2009

Published in International Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1504/ijor.2007.012460

zbMATH Keywords

branch-and-boundcolumn generation

Mathematics Subject Classification ID

Continuous location (90B85) Boolean programming (90C09)

Review text

Summary: We present a branch-and-price algorithm for the exact solution of the multi-source Weber problem, a classical \({\mathcal{NP}}\)-hard optimisation problem in location science with binary variables and nonlinear objective. The algorithm is based on a set covering reformulation whose linear relaxation is solved via column generation at every node of a search tree. The pricing subproblem is equivalent to a single-source Weber problem with limited distances. The algorithm solved to optimality several previously unsolved instances with some thousands of points and some hundreds of sources. Computational experiments show that the algorithm is particularly effective at solving instances in which the ratio between the number of sources and the number of points is high.

Recommendations

• The optimal solution set of the multi-source Weber problem
• An algorithm for generalized constrained multi-source Weber problem with demand substations
• An optimal method for solving the (generalized) multi-Weber problem
• scientific article; zbMATH DE number 6466099
• Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem

Cited in

(11)

• Region-rejection based heuristics for the capacitated multi-source Weber problem
• Two algorithms for the multi-Weber problem
• A two-echelon joint continuous-discrete location model
• An algorithm for generalized constrained multi-source Weber problem with demand substations
• A branch-and-price approach for the continuous multifacility monotone ordered median problem
• A solution algorithm for non-convex mixed integer optimization problems with only few continuous variables
• The optimal solution set of the multi-source Weber problem
• A heuristic algorithm for constrained multi-source Weber problem - the variational inequality approach
• A Branch-and-Price Algorithm for the Multiperiod Single-Sourcing Problem
• An agent-based framework for modeling and solving location problems
• Solving a continuous local access network design problem with a stabilized central column generation approach

Describes a project that uses

Uses Software

• TSPLIB

This page was built for publication: A branch-and-price algorithm for the multi-source Weber problem

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