A dual‐based optimization procedure for the two‐echelon uncapacitated facility location problem

A dual‐based optimization procedure for the two‐echelon uncapacitated facility location problem The two‐echelon uncapacitated facility location problem (TUFLP) is a generalization of the uncapacitated facility location problem (UFLP) and multiactivity facility location problem (MAFLP). In TUFLP there are two echelons of facilities through which products may flow in route to final customers. The objective is to determine the least‐cost number and locations of facilities at each echelon in the system, the flow of product between facilities, and the assignment of customers to supplying facilities. We propose a new dual‐based solution procedure for TUFLP that can be used as a heuristic or incorporated into branch‐and‐bound procedures to obtain optimal solutions to TUFLP. The algorithm is an extension of the dual ascent and adjustment procedures developed by Erlenkotter for UFLP. We report computational experience gained by solving over 420 test problems. The largest problems solved have 25 possible facility locations at each echelon and 35 customer zones, implying 650 integer variables and 21,875 continuous variables. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Naval Research Logistics: An International Journal Wiley

A dual‐based optimization procedure for the two‐echelon uncapacitated facility location problem

Loading next page...
 
/lp/wiley/a-dual-based-optimization-procedure-for-the-two-echelon-uncapacitated-m00LAjxP0U
Publisher
Wiley
Copyright
Copyright © 1992 Wiley Periodicals, Inc., A Wiley Company
ISSN
0894-069X
eISSN
1520-6750
DOI
10.1002/1520-6750(199203)39:2<191::AID-NAV3220390205>3.0.CO;2-T
Publisher site
See Article on Publisher Site

Abstract

The two‐echelon uncapacitated facility location problem (TUFLP) is a generalization of the uncapacitated facility location problem (UFLP) and multiactivity facility location problem (MAFLP). In TUFLP there are two echelons of facilities through which products may flow in route to final customers. The objective is to determine the least‐cost number and locations of facilities at each echelon in the system, the flow of product between facilities, and the assignment of customers to supplying facilities. We propose a new dual‐based solution procedure for TUFLP that can be used as a heuristic or incorporated into branch‐and‐bound procedures to obtain optimal solutions to TUFLP. The algorithm is an extension of the dual ascent and adjustment procedures developed by Erlenkotter for UFLP. We report computational experience gained by solving over 420 test problems. The largest problems solved have 25 possible facility locations at each echelon and 35 customer zones, implying 650 integer variables and 21,875 continuous variables.

Journal

Naval Research Logistics: An International JournalWiley

Published: Mar 1, 1992

References

You’re reading a free preview. Subscribe to read the entire article.


DeepDyve is your
personal research library

It’s your single place to instantly
discover and read the research
that matters to you.

Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.

All for just $49/month

Explore the DeepDyve Library

Search

Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly

Organize

Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.

Access

Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals.

Your journals are on DeepDyve

Read from thousands of the leading scholarly journals from SpringerNature, Wiley-Blackwell, Oxford University Press and more.

All the latest content is available, no embargo periods.

See the journals in your area

DeepDyve

Freelancer

DeepDyve

Pro

Price

FREE

$49/month
$360/year

Save searches from
Google Scholar,
PubMed

Create folders to
organize your research

Export folders, citations

Read DeepDyve articles

Abstract access only

Unlimited access to over
18 million full-text articles

Print

20 pages / month