We propose a novel static primary routing algorithm, called ALB Dijkstra (Adaptive Load Balancing Dijkstra), which introduces new concepts and methods into the traditional Dijkstra algorithm to improve its performance with respect to burst drop probability in optical burst switching networks. This new algorithm has a basic version and an extended version, which are applicable to networks with and without wavelength converters, respectively. By introducing two new concepts of virtual link cost and virtual link-wavelength cost, the new algorithm is able to take account of the influence of actual topology and traffic load distribution in its adaptive searching procedure. ALB Dijkstra offers a fast approach to optimized path selection so that link resources can be utilized efficiently. Numerical simulations show that the overall network performance is significantly improved over the ordinary shortest-path routing strategy.