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

Authors:
M. Hakan Akyüz;Temel Öncan;İ. Kuban Altınel
Affiliations:
-;-;-
Venue:
Computers and Operations Research
Year:
2013

Citing 14
Cited 0

NP-Hard, capacitated, balanced p-median problems on a chain graph with a continuum of link demands

Mathematics of Operations Research
The single machine early/tardy problem

Management Science
A localization and reformulation discrete programming approach for the rectilinear distance location-allocation problem

Discrete Applied Mathematics - Special volume: viewpoints on optimization
Global convergence of a generalized iterative procedure for the minisum location problem with Ip distances

Operations Research
Global Optimization Procedures for the Capacitated Euclidean and lp Distance Multifacility Location-Allocation Problems

Operations Research
The harpy speech recognition system.

The harpy speech recognition system.
Algorithmic approaches for solving the euclidean distance location and location-allocation problems

Algorithmic approaches for solving the euclidean distance location and location-allocation problems
Recovering Beam Search: Enhancing the Beam Search Approach for Combinatorial Optimization Problems

Journal of Heuristics
The Big Triangle Small Triangle Method for the Solution of Nonconvex Facility Location Problems

Operations Research
A General Global Optimization Approach for Solving Location Problems in the Plane

Journal of Global Optimization
Beam search algorithms for the single machine total weighted tardiness scheduling problem with sequence-dependent setups

Computers and Operations Research
Region-rejection based heuristics for the capacitated multi-source Weber problem

Computers and Operations Research
Efficient approximate solution methods for the multi-commodity capacitated multi-facility Weber problem

Computers and Operations Research
Heuristic solution of the multisource Weber problem as a p-median problem

Operations Research Letters

Quantified Score

Hi-index	0.01

Visualization

Abstract

The Multi-facility Weber Problem (MWP) is concerned with locating I uncapacitated facilities in the plane to satisfy the demand of J customers with the minimum total transportation cost of a single commodity. It is a non-convex optimization problem and difficult to solve. In this work, we focus on the capacitated extensions of the MWP which are Capacitated MWP (CMWP) and multi-commodity CMWP (MCMWP). Both the CMWP and MCMWP impose capacity restrictions on facilities. Indeed, the MCMWP is a natural extension of the CMWP and considers the situation where K distinct commodities are shipped subject to limitations on the total amount of goods sent from facilities to the customers. Customer locations, demands and capacities for each commodity are known a priori. The transportation costs, which depend on the commodity type, are proportional to the distance between customers and facilities. We first introduce branch and bound algorithms for both the CMWP and the MCMWP then we propose beam search heuristics for these problems. According to our computational experiments on standard and randomly generated test instances, we can say that the new heuristics perform very well.