The maximum covering/shortest path problem: A multiobjective network design and routing formulation
Generate an AI Snapshot to get a quick, structured summary of this paper.
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
With these formulations the authors extend the concept of ‘coverage’ from facility location analysis to network design and routing analysis and possible modifications to, and extensions and applications of both models are presented.
Abstract
In this paper the authors introduce the maximum covering/shortest path problem and the maximum population/shortest path problem, a special case of the former model. Both models are formulated as two objective integer programs. A summary of the results of a sample problem for the latter formulation is given. Possible modifications to, and extensions and applications of both models are also presented. With these formulations the authors extend the concept of 'coverage' from facility location analysis to network design and routing analysis.