The maximum covering/shortest path problem: A multiobjective network design and routing formulation |
| |
Authors: | J.R. Current C.S. Re Velle J.L. Cohon |
| |
Affiliation: | The Ohio State University, Columbus, Ohio 43210, U.S.A.;The Johns Hopkins University, Baltimore, Maryland 21218, U.S.A. |
| |
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. |
| |
Keywords: | General transportation networks integer programming multiple criteria programming |
本文献已被 ScienceDirect 等数据库收录! |