1. E.H.L. Aarts, J.H.M. Korst and P.J.M. van Laarhoven, A quantitative analysis of the simulated annealing algorithm: A case study for the traveling salesman problem, J. Statist. Phys. 50(1988)189–206.
2. J.D. Bagley, The behavior of adaptive systems which employ genetic and correlation algorithms, Doctoral Dissertation, University of Michigan, Dissertation Abstracts International 28(12), 5106B (1967).
3. J. Bentley, Fast algorithms for geometric salesman problems, ORSA J. Comp. 4(1992)387–411.
4. J.L. Blanton and R.L. Wainwright, Multiple vehicle routing with time and capacity constraints using genetic algorithms, in:Proc. 5th Int. Conf. on Genetic Algorithms (ICGA '93), University of Illinois at Urbana-Champaign, Champaign, IL (1993) pp. 452–459.
5. L. Bodin, B.L. Golden, A. Assad and M. Ball, Routing and scheduling of vehicles and crews: The state of the art, Comp. Oper. Res. 10(1983)63–211.