Capacitated location-allocation problems on a line

Moshe Eben‐Chaime

doi:10.1016/S0305-0548(00)00084-8

Return

Capacitated location-allocation problems on a line

2002-04-01

PRE

Moshe Eben‐Chaime *

Abraham Mehrez

Gad Markovich

DOI：10.1016/S0305-0548(00)00084-8

Original

Original request for help

Save

Abstract

En 中文

For economic and other reasons, distribution networks are often constructed in hierarchies, where, due to high costs, high-level distribution channels are built in straight lines from which low-level channel branch. Branching facilities, too, may incur high costs and thus, their number, locations along the lines, and allocation of destinations to them are important components in system design, which can be accomplished by solving a series of capacitated location-allocation problems on a line. This problem is studied here and its properties are discussed, and appropriate mathematical optimization models formulated and their properties and complexity are also considered. Heuristic solution schemes and lower bounds on objective values are proposed for the models. The efficiency and effectiveness of these schemes are evaluated and more insight into the models is gained through a numerical study. The major conclusion is that the hierarchical structure considered is highly restrictive and imposes high costs. Therefore, its use must be properly justified.

Keywords:

location-allocation

mixed integer programming

distribution

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.