An introduction to route choice models will be provided. The starting point will be a discussion of behavioral limitations of the shortest path algorithm. The theoretical assumptions necessary to derive behavioral models will be introduced. The complexity of the resulting model will be described, and various algorithmic solutions to deal with that complexity will be explained.