Automatic dynamic generation of drill sequences for tunneling
Master thesis
Permanent lenke
http://hdl.handle.net/11250/2616140Utgivelsesdato
2018Metadata
Vis full innførselSamlinger
Sammendrag
Tunneling is an important part of building infrastructure in most countries. It is importantthat tunneling production is done efficiently to reduce the cost of infrastructure projects.In tunneling, multiple holes are drilled for explosives with a tunneling rig. The tunnelingrig has multiple booms that drills holes simultaneously. Analysis of drill logs in this thesisprovides an understanding of the current efficiency and how it can be improved. Themethod for drilling a sequence in this thesis discusses an even allocation between boomsand dynamically updating this. The optimal path for the allocated holes is calculated bysolving the traveling salesman problem using integer programming. The optimal path isconstrained so that collisions between booms are avoided. The optimal path is recalculatedwhenever the allocation changes. The method is tested in a simulator and is estimated tosave eight percent of the total drilling time for a sequence from current practice.