A Rectilinear Distance Round-Trip Location Problem

Albert W. Chan and Donald W. Hearn
Additional contact information
Albert W. Chan: National Research Council, Ottawa, Canada
Donald W. Hearn: University of Florida, Gainesville, Florida

Transportation Science, 1977, vol. 11, issue 2, 107-123

Abstract: The problem considered is that of finding the location of a facility in the plane so that the maximum weighted rectilinear round-trip distance between the facility and N pairs of existing facilities is minimized. The round-trip distance is the total distance traveled starting from the new facility via a pair of existing facilities and back to the new facility. An efficient one-pass solution procedure is developed for finding all the optimal locations to the problem, and is compared computationally with the simplex method. Two special cases are investigated, namely, when the existing facilities lie on a line, and when all the weights are equal.

Date: 1977
References: Add references at CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.11.2.107 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ortrsc:v:11:y:1977:i:2:p:107-123

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().