DocumentCode
2996303
Title
Heuristic algorithms for public sector problems
Author
Altman, S.M. ; Beltrami, E.J. ; Bodin, L.D.
Author_Institution
SUNY at Stony Brook, Stony Brook, New York
fYear
1971
fDate
15-17 Dec. 1971
Firstpage
10
Lastpage
15
Abstract
Many large scale problems which arise from real-life situations simply do not fit into classical molds and one must be satisfied with near optimal solutions as obtained by combining formal arguments with heuristic reasoning. For example practically nothing is known about nonlinear integer programs and yet one of the first problems we encountered was of this type. What was there to do? Similarly, when faced with problems of routing trucks and barges for waste disposal, it became apparent that the usual graph theoretic arguments were not directly applicable. Nevertheless, a workable approach was formulated. Analogous problems exist in airline crew scheduling, in the design of gas or sewer pipeline networks, and in legislative committee assignments. Another area which has responded well to heuristics is in the scheduling of employees who work for public services. The personnel requirements vary with each day and shift. Nevertheless, rotating schedules have been devised which meet the work demands in a satisfactory way while guaranteeing a minimum number of days off.
Keywords
Boats; Cities and towns; Heuristic algorithms; Large-scale systems; Personnel; Pipelines; Protection; Routing; Waste disposal; Waste materials;
fLanguage
English
Publisher
ieee
Conference_Titel
Decision and Control, 1971 IEEE Conference on
Conference_Location
Miami Beach, FL, USA
Type
conf
DOI
10.1109/CDC.1971.270941
Filename
4044702
Link To Document