A Trajectory Approach to the Round-Trip Location Problem

Z. Drezner and G. O. Wesolowsky
Additional contact information
Z. Drezner: University of Michigan, Dearborn, Michigan
G. O. Wesolowsky: McMaster University, Hamilton, Ontario

Transportation Science, 1982, vol. 16, issue 1, 56-66

Abstract: This paper treats the round-trip location problem proposed by Chan and Hearn. The object of the problem is to find the facility location that minimizes the maximum weighted round-trip distance between the facility and N pairs of demand points. The algorithm proposed here is based on the numerical solution of differential equations. Unlike the Chan and Hearn algorithm, which is based on linear programming and is applicable only to rectangular distances, this method is equally applicable to Euclidean and general ( l p ) distances.

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

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.16.1.56 (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:16:y:1982:i:1:p:56-66

Access Statistics for this article

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