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

DOI10.1016/J.COR.2013.07.013zbMATH Open1348.90394OpenAlexW1989258712MaRDI QIDQ336701FDOQ336701

Authors: 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

Recommendations

• Efficient approximate solution methods for the multi-commodity capacitated multi-facility Weber problem
• New heuristic methods for the capacitated multi-facility Weber problem
• Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem
• Efficient heuristics for the rectilinear distance capacitated multi-facility Weber problem
• scientific article

zbMATH Keywords

transportationbranch and boundbeam searchlocation-allocation

Mathematics Subject Classification ID

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

Cites Work

• Heuristic solution of the multisource Weber problem as a \(p\)-median problem
• Location-Allocation Problems
• Heuristic Methods for Location-Allocation Problems
• Region-rejection based heuristics for the capacitated multi-source Weber problem
• Efficient approximate solution methods for the multi-commodity capacitated multi-facility Weber problem
• The Minisum and Minimax Location Problems Revisited
• GBSSS: The generalized big square small square method for planar single- facility location
• The gradual covering problem
• The Big Triangle Small Triangle Method for the Solution of Nonconvex Facility Location Problems
• Location Theory, Dominance, and Convexity
• A reformulation-linearization technique for solving discrete and continuous nonconvex problems
• On the Set of Optimal Points to the Weber Problem: Further Results
• 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
• Location with acceleration-deceleration distance
• Parametric distance functions vs. nonparametric neural networks for estimating road travel distances
• A localization and reformulation discrete programming approach for the rectilinear distance location-allocation problem
• Some Properties of Location Problems with Block and Round Norms
• New heuristic methods for the capacitated multi-facility Weber problem
• Title not available (Why is that?)
• 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
• NP-Hard, Capacitated, Balanced p-Median Problems on a Chain Graph with a Continuum of Link Demands
• The Single Machine Early/Tardy Problem
• Technical Note—Location Theory, Dominance, and Convexity: Some Further Results
• A squared-euclidean distance location-allocation problem
• Title not available (Why is that?)
• Global Convergence of a Generalized Iterative Procedure for the Minisum Location Problem with lp Distances
• The Transportation-Location Problem
• A perturbation-based heuristic for the capacitated multisource Weber problem
• A general global optimization approach for solving location problems in the plane

Cited In (5)

• Application of heuristic and metaheuristic algorithms in solving constrained Weber problem with feasible region bounded by arcs
• Efficient heuristics for the rectilinear distance capacitated multi-facility Weber problem
• Optimal number and location of storage hubs and biogas production reactors in farmlands with allocation of multiple feedstocks
• Single-source capacitated multi-facility Weber problem-an iterative two phase heuristic algorithm
• Efficient approximate solution methods for the multi-commodity capacitated multi-facility Weber problem

This page was built for publication: Beam search heuristics for the single and multi-commodity capacitated multi-facility Weber problems

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