Show simple item record

contributor authorGeorge R. Beetle
date accessioned2017-05-08T21:02:40Z
date available2017-05-08T21:02:40Z
date copyrightNovember 1990
date issued1990
identifier other%28asce%290733-947x%281990%29116%3A6%28809%29.pdf
identifier urihttp://yetl.yabesh.ir/yetl/handle/yetl/36539
description abstractUrban development patterns in the United States have made distribution and collection functions in local commerce difficult. Both the geographical spread of commercial activities and local highway traffic interferences complicate efficient operations. The purpose in this paper is to describe computer‐based methods to improve the management of daily movements of vehicles and crews in regional service activities. Data requirements are discussed, and the need to account for traffic volumes in routing decisions is elaborated. Practical considerations from everyday business life present boundary conditions that must be satisfied in operations, and that simplify the classic traveling salesman routing problem. These are matters associated primarily with conditions of access to remote service sites and the times of service that must be honored to satisfy customer requirements or other organizational needs. A set of 12 application programs written for use by schedulers, dispatchers, or operating managers is used as a point of reference in the discussion. A case history illustration taken from collection operations in regional banking is also recounted.
publisherAmerican Society of Civil Engineers
titleComputer‐Based Routing and Scheduling in Metropolitan Regions
typeJournal Paper
journal volume116
journal issue6
journal titleJournal of Transportation Engineering, Part A: Systems
identifier doi10.1061/(ASCE)0733-947X(1990)116:6(809)
treeJournal of Transportation Engineering, Part A: Systems:;1990:;Volume ( 116 ):;issue: 006
contenttypeFulltext


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record