Beam search heuristics for the single and multi-commodity capacitated multi-facility Weber problems

DOI10.1016/j.cor.2013.07.013zbMath1348.90394OpenAlexW1989258712MaRDI QIDQ336701

M. Hakan Akyüz, Temel Öncan, Ị. Kuban Altınel

Publication date: 10 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2013.07.013

zbMATH Keywords

transportationbranch and boundbeam searchlocation-allocation

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)

Related Items

Application of heuristic and metaheuristic algorithms in solving constrained Weber problem with feasible region bounded by arcs ⋮ Optimal number and location of storage hubs and biogas production reactors in farmlands with allocation of multiple feedstocks

Cites Work

• Unnamed Item
• Unnamed Item
• A perturbation-based heuristic for the capacitated multisource Weber problem
• A general global optimization approach for solving location problems in the plane
• Region-rejection based heuristics for the capacitated multi-source Weber problem
• Location with acceleration-deceleration distance
• GBSSS: The generalized big square small square method for planar single- facility location
• Parametric distance functions vs. nonparametric neural networks for estimating road travel distances
• Heuristic solution of the multisource Weber problem as a \(p\)-median problem
• A reformulation-linearization technique for solving discrete and continuous nonconvex problems
• A localization and reformulation discrete programming approach for the rectilinear distance location-allocation problem
• Efficient approximate solution methods for the multi-commodity capacitated multi-facility Weber problem
• Recovering beam search: Enhancing the beam search approach for combinatorial optimization problems
• Beam search algorithms for the single machine total weighted tardiness scheduling problem with sequence-dependent setups
• A recovering beam search algorithm for the single machine just-in-time scheduling problem
• The gradual covering problem
• Some Properties of Location Problems with Block and Round Norms
• New heuristic methods for the capacitated multi-facility Weber problem
• Efficient heuristics for the rectilinear distance capacitated multi-facility Weber problem
• Global Optimization Procedures for the Capacitated Euclidean and l_p Distance Multifacility Location-Allocation Problems
• The Big Triangle Small Triangle Method for the Solution of Nonconvex Facility Location Problems
• The Minisum and Minimax Location Problems Revisited
• NP-Hard, Capacitated, Balanced p-Median Problems on a Chain Graph with a Continuum of Link Demands
• The Single Machine Early/Tardy Problem
• Location-Allocation Problems
• Technical Note—Location Theory, Dominance, and Convexity: Some Further Results
• A squared-euclidean distance location-allocation problem
• Global Convergence of a Generalized Iterative Procedure for the Minisum Location Problem with lp Distances
• On the Set of Optimal Points to the Weber Problem: Further Results
• Heuristic Methods for Location-Allocation Problems
• The Transportation-Location Problem
• Location Theory, Dominance, and Convexity