In many transportation applications it is useful to find multiple paths for an origin-destination pair. This paper presents a non-deterministic approach to generate alternative paths in traffic networks. The algorithm exhibits desirable features in both computational complexity and path quality. Hypothetic examples are provided to evaluate the generated paths in terms of diversity and efficiency. A microscopic traffic simulation is then used to introduce potential applications in transportation practices. Some future works are also discussed.