1. Garey, M.R., Johnson, D.S.: Computers and Intractability; a Guide to the Theory of Np-Completeness. W. H. Freeman & Co., New York (1990)
2. Jorgensen, R.M., Larsen, J., Bergvinsdottir, K.B.: Solving the Dial-a-Ride problem using genetic algorithms (2004)
3. Applegate, D.L., Bixby, R.M., Chvátal, V., Cook, W.J.: The Traveling Salesman Problem (2006), ISBN 0691129932
4. Dantzig, G.B., Ramser, J.H.: The Truck Dispatching Problem. Management Science 6(1), 80–91 (1959)
5. Pisinger, D., Ropke, S.: A general heuristic for vehicle routing problems (2005)