摘要:

AbstractWe consider the cost allocation problem faced by a large scale supplier (the telephone company) who rents telephone circuits to its customers. A number of possible allocation rate structures are analyzed, as are some of the criteria that they may be measured by. Finally, we draw conclusions and make recommendations for cost allocation in these circumstances.

ISSN:0028-3045    

DOI:10.1002/net.3230040103

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1974

数据来源: WILEY

摘要:

AbstractThis paper deals with the problem of minimizing the present worth of expenditures needed to enlarge the capacity of a communications network over time so as to meet rising traffic demands. Eight general “tests” are given for improving network solutions. The tests require only a moderate amount of computation and have the property that they will improve a wide class of non‐optimal solutions. It is observed that for a large subclass of practical problems, the dynamic problem of building a network over time may be converted to a static problem for most of the computations. This suggests a strong similarity between the optimal solutions to both pro

ISSN:0028-3045    

DOI:10.1002/net.3230040104

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1974

数据来源: WILEY

摘要:

AbstractAn important but difficult combinatorial problem, in general, is to find the optimal route for a single vehicle on a given network. This paper defines a problem type, called the General Routing Problem, and gives an algorithm for its solution. The classical Traveling Salesman Problem and the Chinese Postman Problem are shown to be special limiting cases of the General Routing Problem. The algorithm provides a unified approach to both node and arc oriented routing problems, and exploits special properties of most real transportation networks such as sparsity of the associated adjacency matrix, and the tendency for arc symmetry at many nodes. For node oriented routing problems, this approach tends to produce large reduction in effective problem size.

ISSN:0028-3045    

DOI:10.1002/net.3230040105

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1974

数据来源: WILEY

摘要:

AbstractVehicle routing for municipal waste collection encompasses a variety of problems. In this paper, we explore the techniques we have developed for solving some of these problems.

ISSN:0028-3045    

DOI:10.1002/net.3230040106

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1974

数据来源: WILEY

ISSN:0028-3045    

DOI:10.1002/net.3230040102

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1974

数据来源: WILEY