Journal article
A Biobjective Multifacility Minimax Location Problem on a Tree Network
Transportation science, Vol.16(4), pp.407-429
11/01/1982
DOI: 10.1287/trsc.16.4.407
Abstract
In this paper we consider a biobjective multifacility minimax location problem on a tree network, which involves as objectives the maximum of the weighted distances between specified pairs of new and existing facilities, and the maximum of the weighted distances between specified pairs of new facilities. We establish necessary and sufficient conditions for a location vector to be efficient. We also give an algorithm for finding the efficient frontier of the problem, and provide an example illustrating the use of the algorithm. In addition, we consider a broad class of multiobjective location problems and give general necessary and sufficient conditions for a location vector to be efficient.
Details
- Title: Subtitle
- A Biobjective Multifacility Minimax Location Problem on a Tree Network
- Creators
- Barbaros C. Tansel - Georgia Institute of TechnologyRichard L. Francis - University of FloridaTimothy J. Lowe - Purdue University West Lafayette
- Resource Type
- Journal article
- Publication Details
- Transportation science, Vol.16(4), pp.407-429
- DOI
- 10.1287/trsc.16.4.407
- ISSN
- 0041-1655
- eISSN
- 1526-5447
- Number of pages
- 23
- Language
- English
- Date published
- 11/01/1982
- Academic Unit
- Business Analytics
- Record Identifier
- 9984963208802771
Metrics
1 Record Views