DHDaniel Harabor

Daniel Harabor

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Daniel Harabor has a total of 10 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Optimal Any-Angle Pathfinding In Practice

    by Daniel Damir Harabor, Alban Grastien, Dindar Öz, Vural Aksakalli


  • Open Access

    Compressing Optimal Paths with Run Length Encoding

    by Ben Strasser, Adi Botea, Daniel Harabor, Nicta Sydney

    We introduce a novel approach to Compressed Path Databases, space efficient oracles used to very quickly identify the first edge on a shortest path. Our algorithm achieves query running times on the 100 nanosecond scale, being significantly faster than state-of-the-art first-move oracles from the literature. Space consumption is competitive, due to a compression approach that rearranges rows and columns in a first-move matrix and then performs run length encoding (RLE) on the contents of the matrix. One variant of our implemented system was, by a convincing margin, the fastest entry in the 2014 Grid-Based Path Planning Competition. We give a first tractability analysis for the compression scheme used by our algorithm. We study the complexity of computing a database of minimum size for general directed and undirected graphs. We find that in both cases the problem is NP-complete. We also show that, for graphs which can be decomposed along articulation points, the problem can be decomposed into independent parts, with a corresponding reduction in its level of difficulty. In particular, this leads to simple and tractable algorithms with linear running time which yield optimal compression results for trees.


  • Open Access

    Simulation and Analysis of Container Freight Train Operations at Port Botany

    by Daniel Guimarans, Daniel Harabor, Pascal van Hentenryck

    Over two million containers crossed the docks at Sydney's Port Botany in 2011/12; a figure that is forecast increase more than threefold by the end of the next decade. To cope with such large growth in volumes the NSW Government plans to double rail mode share at the port by the year 2020. Conventional wisdom from industry and the media says that existing infrastructure cannot handle such volumes. In this paper we use a combination of data analytics and simulation to examine operations at the port and evaluate the efficacy of current infrastructure to handle projected growth in volumes. Contrary to conventional wisdom we find that current rail resources appear distinctly under-utilised. Moreover: (i) the peak rail capacity of Port Botany is 1.78 million TEU per annum; over six times higher than 2011/12 rail volumes; (ii) there are no infrastructural impediments to the achievement of peak rail capacity; (iii) operational changes, not infrastructural investment, are the key to unlocking the potential of the port; (iv) Port Botany is well positioned to handle projected increases in container volumes over the next decade and beyond, including the 28% rail mode share target established by the New South Wales State Government.

  • Open Access

    Informed Heuristics for Guiding Stem-and-Cycle Ejection Chains

    by Daniel Harabor, Philip Kilby

    The state of the art in local search for the Traveling Salesman Problem is dominated by ejection chain methods utilising the Stem-and-Cycle reference structure. Though effective such algorithms employ very little information in their successor selection strategy, typically seeking only to minimise the cost of a move. We propose an alternative approach inspired from the AI literature and show how an admissible heuristic can be used to guide successor selection. We undertake an empirical analysis and demonstrate that this technique often produces better results than less informed strategies albeit at the cost of running in higher polynomial time.