| Tekijä: | Current, J. R. ReVelle, C. S. Cohon, J. L. |
| Otsikko: | The hierarchical network design problem. |
| Lehti: | European Journal of Operational Research
1986 : OCT, VOL. 27:1, p. 57-66 |
| Asiasana: | INTEGER PROGRAMMING TRANSPORT NETWORKS HEURISTIC METHODS |
| Kieli: | eng |
| Tiivistelmä: | The hierarchical network design problem (HNDP) is discussed. The object of the HNDP is to identify the least cost, two-level hierarchical network, which must include a primary path from a predetermined starting node to a predetermined terminus node. Each node not on the primary path must be connected to some node on that path by means of a secondary path. The problem is initially formulated as an integer linear program and then an heuristic one is presented which employs a K shortest path algorithm, and a minimum spanning tree algorithm. Potential applications of the formulation are also discussed. |
SCIMA