A platform for research: civil engineering, architecture and urbanism
A platform for research: civil engineering, architecture and urbanism
Developing an Efficient Algorithm for Balancing Mass-Haul Diagram
To minimize the total cost of earthwork, a number of Linear and Integer Programming Techniques have been used, through considering the various factors involved in this process. These techniques often ensure a global optimum solution for the problem. However, they require sophisticated formulations besides being computationally expensive. Therefore, these techniques are of limited use in industry practice. Mass-Haul Diagrams (MD) have been an essential tool for planning earthwork construction for many applications. One of the most common heuristics that is used widely by practicing engineers in this field to balance the MD is the "Shortest-Haul- First" strategy. Using this heuristic in balancing the MD is usually carried out either graphically on drawings or manually by computing values from the Mass-Haul Diagram itself. However, performing this approach graphically or manually is fairly tedious and time consuming. Besides that manual and graphical approaches are prone to errors. A robust algorithm that can automatically offer a balance for the MD algorithm is, therefore, needed. This research presents a formal definition of an algorithm that uses a sequential pruning technique for computing balances of Mass-Haul Diagrams automatically. It shows that the new algorithm is more efficient than the existing Integer Programming Techniques as it computationally runs in O(logn) time in most cases.
Developing an Efficient Algorithm for Balancing Mass-Haul Diagram
To minimize the total cost of earthwork, a number of Linear and Integer Programming Techniques have been used, through considering the various factors involved in this process. These techniques often ensure a global optimum solution for the problem. However, they require sophisticated formulations besides being computationally expensive. Therefore, these techniques are of limited use in industry practice. Mass-Haul Diagrams (MD) have been an essential tool for planning earthwork construction for many applications. One of the most common heuristics that is used widely by practicing engineers in this field to balance the MD is the "Shortest-Haul- First" strategy. Using this heuristic in balancing the MD is usually carried out either graphically on drawings or manually by computing values from the Mass-Haul Diagram itself. However, performing this approach graphically or manually is fairly tedious and time consuming. Besides that manual and graphical approaches are prone to errors. A robust algorithm that can automatically offer a balance for the MD algorithm is, therefore, needed. This research presents a formal definition of an algorithm that uses a sequential pruning technique for computing balances of Mass-Haul Diagrams automatically. It shows that the new algorithm is more efficient than the existing Integer Programming Techniques as it computationally runs in O(logn) time in most cases.
Developing an Efficient Algorithm for Balancing Mass-Haul Diagram
Nassar, Khaled (author) / Hosny, Ossama (author) / Aly, Ebrahim A. (author) / Osman, Hesham (author)
International Workshop on Computing in Civil Engineering 2011 ; 2011 ; Miami, Florida, United States
Computing in Civil Engineering (2011) ; 396-404
2011-06-16
Conference paper
Electronic Resource
English
Developing an Efficient Algorithm for Balancing Mass-Haul Diagram
| British Library Conference Proceedings | 2011
Developing an efficient algorithm for balancing mass-haul diagrams
| Online Contents | 2011
Developing an efficient algorithm for balancing mass-haul diagrams
| British Library Online Contents | 2011
| Engineering Index Backfile | 1941
Mass-haul diagram for earthworks
| Engineering Index Backfile | 1933