A tree search algorithm for the multi-commodity location problem

DOI10.1016/0377-2217(85)90007-4MaRDI QIDQ1058962zbMATH OpenOpenAlexFDO

Authors Richard Laundy

Publication date 1985

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

Full work available at URL https://doi.org/10.1016/0377-2217(85)90007-4

zbMATH Keywords

boundsdual heuristicLagrangean relaxationmulti-commodity location problemtree search algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Inventory, storage, reservoirs (90B05) Integer programming (90C10)

Review text

The multi-commodity location problem is an extension of the simple plant location problem. The problem is to decide on locations of facilities to meet customer demands for several commodities in such a way that total fixed plus variable costs are minimized. Only one commodity may be supplied from any location. In this paper a primal and a dual heuristic for producing good bounds are presented. A method of improving these bounds by using a new Lagrangean relaxation for the problem is also presented. Computational results with problems taken from the literature are provided.

Recommendations

• The many-commodity location problem (the branch-and-bound method)
• Lower and upper bounds for a capacitated plant location problem with multicommodity flow
• A multiperiod two-echelon multicommodity capacitated plant location problem
• A branch-and-bound method for multicommodity location with balancing requirements
• scientific article; zbMATH DE number 4010185

Cites work

• A cost operator approach to multistage location-allocation
• A Dual-Based Procedure for Uncapacitated Facility Location
• An analysis of approximations for maximizing submodular set functions—I
• An Efficient Branch and Bound Algorithm for the Warehouse Location Problem
• An Improved Algorithm for the Multi-Commodity Location Problem
• Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
• scientific article; zbMATH DE number 3729871 (Why is no real title available?)
• scientific article; zbMATH DE number 3568354 (Why is no real title available?)
• scientific article; zbMATH DE number 3614502 (Why is no real title available?)
• Multi-Dimensional Location Problems
• Multicommodity Distribution System Design by Benders Decomposition
• The Multi-Commodity Facilities Location Problem
• Validation of subgradient optimization

Cited in

(9)

• Lower and upper bounds for a capacitated plant location problem with multicommodity flow
• A branch-and-bound method for multicommodity location with balancing requirements
• Heuristic methods and applications: A categorized survey
• A Lagrangian heuristic for the multicommodity capacitated location problem with balancing requirements
• MULTI-FACILITY LOCATION PROBLEM WITH NONINCREASING PIECEWISE LINEAR DEMAND ON A TREE
• The many-commodity location problem (the branch-and-bound method)
• An effective algorithm for the two-stage location problem on a tree-like network
• A Heuristic Procedure For Path Location With Multisource Demand
• A method for solving to optimality uncapacitated location problems

This page was built for publication: A tree search algorithm for the multi-commodity location problem

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