ASSIGNMENT ROUTING PROBLEM

被引：104

作者：

RUSSELL, R

IGO, W

机构：

[1] The University of Tulsa Tulsa, Oklahoma

[2] Amoco Production Co., Tulsa, Oklahoma

来源：

NETWORKS | 1979年 / 9卷 / 01期

关键词：

D O I：

10.1002/net.3230090102

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

ABSTRACT This paper examines a routing design problem in which the objective is to assign customer demand points to days of the week in order to solve the resulting node routing problems over the entire week most effectively. The emphasis is on obtaining approximate solutions for this type of combinatorial problem. Several heuristics are developed and tested on a large scale refuse collection problem. Computational results, as well as a discussion of expected benefits, are presented. Copyright © 1979 Wiley Periodicals, Inc., A Wiley Company

引用

页码：1 / 17

页数：17

共 15 条

[1] Beltrami E., Bodin L., Networks and Vehicle Routing for Municipal Waste Collection, Networks, 4, pp. 65-94, (1974)
[2] Christofides N., Eilon S., An Algorithm for the Vehicle‐Dispatching Problem, Journal of the Operational Research Society, 20, pp. 309-318, (1969)
[3] Clarke G., Wright J., Scheduling of Vehicles from a Central Depot to a Number of Delivery Points, Operations Research, 12, pp. 568-581, (1964)
[4] Foster B.A., Ryan D.M., An Integer Programming Approach to the Vehicle Scheduling Problem, Operational Research Quart., 27, pp. 2-384, (1976)
[5] Gillett B., Johnson T., Multi‐terminal Vehicle‐Dispatch Algorithm, Omega, 4, pp. 711-718, (1976)
[6] Golden B., (1975)
[7] Golden B., Magnanti T., Nguyen H., (1975)
[8] Krolak P., Empirical and Theoretical Bounds on Generalized Vehicle Scheduling Problems, Presented at ORSA/TIMS Meeting, (1975)
[9] Krolak P., Felts W., Nelson J., A Man‐Machine Approach Toward Solving the Generalized Truck‐Dispatching Problem, Transportation Science, 6, pp. 149-169, (1972)
[10] Lin S., Kernighan B., An Effective Heuristic Algorithm for the Traveling Salesman Problem, Operations Research, 21, pp. 2-516, (1973)

← 1 2 →