Article1982

A Trajectory Approach to the Round-Trip Location Problem

27 citations0/0 files storedTransportation Science

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Facility Location and Emergency Management Complexity and Algorithms in Graphs Computational Geometry and Mesh Generation

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 (lp) distances.

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 27 citations exist upstream.

References

1978A New Method for the Multifacility Minimax Location Problem 1978A Trajectory Method for the Optimization of the Multi-Facility Location Problem With lp Distances 1977A Rectilinear Distance Round-Trip Location Problem

Cited by

2007The multiple location of transfer points 2011Stochastic models for transfer point location problem

Explore the map →

Papers that cite the same references — the relational fallback while embeddings are still backfilling.

Imported from OpenAlex (CC0) — nothing here is generated.