Hostname: page-component-586b7cd67f-dlnhk Total loading time: 0 Render date: 2024-11-20T17:24:40.250Z Has data issue: false hasContentIssue false

Potential of artificial neural networks for resource scheduling

Published online by Cambridge University Press:  27 February 2009

Nabil Kartam
Affiliation:
Department of Civil Engineering, Kuwait University, P.O. Box 5969, Safat, 13060, Kuwait
Tanit Tongthong
Affiliation:
Department of Civil Engineering, Vongchavalitkul University, Muang, Nakhonratchasima, Thailand

Abstract

In a construction project, resource leveling techniques are necessary as a primary schedule-improvement tool to reduce overall project cost by decreasing day-to-day fluctuation in resource usage and resource idleness. There are, however, some limitations in traditional resource leveling techniques. Conventional heuristic approaches cannot guarantee a near-optimum solution for every construction project; a given heuristic may perform well on one project and poorly on another. The existing optimization approaches, such as linear programming and enumeration methods, are best applicable only to small size problems. Recently, there has been success in the use of Artificial Neural Networks (ANNs) for solving some optimization problems. The paper discusses how state-of-the-art ANNs can be a functional alternative to traditional resource leveling techniques. It then investigates the application of different ANN models (such as backpropagation networks, Hopfield networks, Boltzmann machines, and competition ANNs) to resource leveling problems. Because the development of ANNs involves not only science but also experience, the paper presents various intuitive yet effective ways of mapping resource leveling problems on different applicable ANN architectures. To demonstrate the application of ANNs to resource leveling, a simple ANN model is developed using a Hopfield network. The conclusion highlights the usefulness and the limitations of ANNs when applied to resource leveling problems.

Type
Articles
Copyright
Copyright © Cambridge University Press 1997

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

Aarts, E., & Korst, J. (1989). Simulated annealing, and Boltzmann machines. John Wiley & Sons, New York.Google Scholar
Ahuja, H. (1976). Construction performance control by networks. John Wiley & Sons, New York.Google Scholar
Ahuja, H. (1984). Project management: Techniques in planning and controlling construction projects. John Wiley & Sons, New York.Google Scholar
Aiyer, S., et al. (1990). A theoretical investigation into the performance of the Hopfield model. IEEE Trans. Neural Networks 1, 204215.CrossRefGoogle ScholarPubMed
Angeniol, B., et al. (1988). Self-organizing feature maps and the traveling salesman problem. Neural Networks 1, 117124.CrossRefGoogle Scholar
Antill, J., & Woodhead, R. (1982). Critical Path methods in construction practice, 3rd ed.Wiley-Interscience, New York.Google Scholar
Bilbro, G., et al. (1989). Optimization by mean field annealing. Adv. Neural Inf. Process. Syst. 1, 9198.Google Scholar
Bout, D., & Miller, T. (1989). Improving the performance of the Hopfield–Tank neural network through normalization and annealing. Biol. Cybernet. 62, 120139.Google Scholar
Burgess, A., & Killebrew, J. (1962). Variation in activity level in a cyclical arrow diagram. J. Indust. Eng. 13.Google Scholar
Cherneff, J., Logcher, R., & Sriram, D. (1990). Integrating CAD with construction schedule generation. J. Comput. Civil Eng. 4, 6484.Google Scholar
De La Garza, J., & Ibbs, C. (1989). A knowledge elicitation study in the construction scheduling domain. J. Comput. Civil Eng. 3.Google Scholar
Durbin, F., & Willshaw, D. (1987). An analogue approach to the TSP using an elastic net method. Nature 326, 689691.CrossRefGoogle Scholar
Easa, S. (1989). Resource leveling in construction by optimization. J. Constr. Eng. Manage. 115.CrossRefGoogle Scholar
Fang, L., & Li, T. (1990). Design of competitive-based neural networks for combinatorial optimization. Int. J. Neural Syst. 1, 221235.CrossRefGoogle Scholar
Flood, I. (1989). A neural network approach to the sequencing of construction tasks. Proc. 6th Int. Symp. on Automation and Robotics in Construction, 204211.CrossRefGoogle Scholar
Flood, I., & Kartam, N. (1994 a). Neural networks in civil engineering: Principles and understanding. J. Comput. Civil Eng. 8, 131148.CrossRefGoogle Scholar
Flood, I., & Kartam, N. (1994 b). Neural networks in civil engineering: Systems and applications. J. Comput. Civil Eng. 8, 149162.CrossRefGoogle Scholar
Fox, B., & McMahon, M. (1991). Genetic operators for sequencing problems. In Foundations of Genetic Algorithms, Morgan Kaufmann Publishers, Inc., CA.Google Scholar
Galbreath, R. (1965). Computer program for leveling resource usage. J. Constr. Div. 91, 170–124.CrossRefGoogle Scholar
Grossberg, S. (1987). Competitive learning: From interactive activation to adaptive resonance. Cognitive Sci. 11, 2363.CrossRefGoogle Scholar
Harris, R. (1978). Precedence and arrow networking techniques for construction. John Wiley & Sons, New York.Google Scholar
Harris, B. (1990). Packing method for resource leveling. J. Constr. Eng. Manage. 116(2).CrossRefGoogle Scholar
Hecht-Nielsen, R. (1990). Neurocomputing. Addison-Wesley Publishing Co., Reading, Massachusetts.Google Scholar
Hedge, S., et al. (1988). Determination of parameters in a Hopfield/Tank computational network. Proc. IEEE Second Int. Conf. Neural Networks, 333340.CrossRefGoogle Scholar
Hertz, J., Krogh, A., & Palmer, R. (1991). Introduction to the theory of neural computation. Addison-Wesley Publishing Co., Reading, Massachusetts.Google Scholar
Hinton, G., Sejnowski, T., & Ackley, D. (1984). Boltzmann machines: Constraint satisfaction networks that learn. CMU Report No. CMU-CS- 84119.Google Scholar
Hopfield, J., & Tank, D. (1985). “Neural” computation of decisions in optimization problems. Biol. Cybern. 52, 141152.CrossRefGoogle ScholarPubMed
Hugo, D. (1991). Genetic programming: Building artificial nervous systems with genetically programmed neural network modules. In Neural and Intelligent Systems Integration. John Wiley & Sons, New York.Google Scholar
Inger, L. (1989). Very fast simulated re-annealing. Math. Comput. Model. 12, 967973.CrossRefGoogle Scholar
Kartam, N.A., & Levitt, R.E. (1990). Intelligent planning of construction projects. J. Comp. Civ. Eng. 4, 155176.CrossRefGoogle Scholar
Kartam, N., Flood, I., & Tongthong, T. (1995). Integrating knowledgebased systems and artificial neural networks for engineering. AIEDAM 9(1), 1322.CrossRefGoogle Scholar
Kartam, N., & Tongthong, T. (1997). An artificial neural network for resource leveling problems, J. Comp. Civil Eng. 11.Google Scholar
Khanna, T. (1990). Foundations of neural networks. Addison-Wesley Publishing Co., Reading, Massachusetts.Google Scholar
Kirkpatrick, S., Galatt, C., & Vecchi, M. (1983). Optimization by simulated annealing. Science 230, 671680.CrossRefGoogle Scholar
Kohonen, T. (1988). Self-organization and associative memory. Springer-Verlag, New York.CrossRefGoogle Scholar
Kwon, T., & Lu, Y. (1991). A comparative study of the traveling salesman problem. Intelligent Engineering Systems Through Artificial Neural Networks, 889894.Google Scholar
Levitt, R., & Kartam, N. (1990). Expert systems in construction engineering and management: State of the Art. Knowl. Eng. Rev. J. 5(2), 97125.CrossRefGoogle Scholar
Looi, C. (1992). Neural network methods in combinatorial optimization. Comput. Ops. Res. 19, 191208.CrossRefGoogle Scholar
Martinez, J., & Ioannou, P. (1993). Resource leveling based on the modified moment heuristic. Proc. ASCE 5th Int. Conf. Civil Building Eng., 287294.Google Scholar
Miller, G., Todd, P., & Hegde, S. (1989). Design neural networks using genetic algorithms. Proc. Third Int. Conf. Genetic Algorithm, 379384.Google Scholar
Moder, J., Phillips, C., & Davis, E. (1983). Project management with CPM, PERT, and precedence diagramming, 3rd ed. Van Nostrand Reinhold Co., New York.Google Scholar
Navinchandra, D., Sriram, D., & Logcher, R. (1988). GHOST: Project network generator. J. Comput. Civil Eng. 2(3), 239254.CrossRefGoogle Scholar
Phillips, D., & Garcia-Diaz, A. (1981). Fundamentals of network analysis. Prentice-Hall, Inc., Englewood Cliffs, New Jersey.Google Scholar
Ramanujam, J., & Sadayappan, P. (1988). Optimization by neural networks. IEEE International Conf. on Neural Networks, II, 325332.CrossRefGoogle Scholar
Reggia, J., et al. (1991). Recent applications of competition activation mechanisms. In Neural Network: Advances and Applications, pp. 3362. Elsevier Science Publisher, North-Holland.Google Scholar
Shaffer, L., Ritter, J., & Mayer, W. (1965). The critical path method. McGraw-Hill Book Co., New York.Google Scholar
Soukoulis, C., Kelvin, K., & Grest, G. (1983). Irreversibility and metastability in spin-glasses-Ising model. Phys. Rev. B28, 14951509.CrossRefGoogle Scholar
Srinivas, M., & Patnaik, L. (1991). Learning neural network weights using genetic algorithms—Improved performance by search-space reduction. Proc. Joint Conf. on Neural Networks, pp. 23312336. IEEE and INNS, Neuro-Dynamics.Google Scholar
Szu, H. (1986). Fast simulated annealing. In Neural Network for Computing, pp. 420425. American Inst. of Physics, New York.Google Scholar
Tongthong, T. (1993). Solving resource leveling problems using artificial neural networks. Thesis presented to the University of Maryland, College Park, Maryland, in partial fulfillment of the requirements for the degree of Doctor of Philosophy.Google Scholar
Zozaya-Gorostiza, C., Hendrickson, C., & Rehak, D. 1989. A knowledgebased process planning for construction and manufacturing. Academic Press, New York.Google Scholar