1. Badeau, P., Guertin, F., Gendreau, M., Potvin, J.-Y., & Taillard, E. (1997). A parallel tabu search heuristic for the vehicle routing problem with time windows. Transportation Research – Part C: Emerging Technologies, 5(2), 109–122. https://doi.org/10.1016/S0968-090X(97)00005-3.
2. Beasley, D., Bull, D. R., & Martin, R. R. (1993). An Overview of Genetic Algorithms : Part 1, Fundamentals.
3. Benhida, S., & Mir, A. (2018). Generating subtour elimination constraints for the Traveling Salesman Problem. IOSR Journal of Engineering, 08(7), 17–21. https://www.iosrjen.org/Papers/vol8_issue7/Version-1/D0807011721.pdf.
4. Berger, J., Salois, M., & Begin, R. A. (1998). Hybrid Genetic Algorithm for the Vehicle Routing Problem with Time Windows. Lecture Notes in Artificial Intelligence, 1418, 114–127. https://www.scirp.org/(S(oyulxb452alnt1aej1nfow45))/reference/ReferencesPapers.aspx?ReferenceID=1516703.
5. Blanton, J. L., & Wainwright, R. L. (1993). Multiple Vehicle Routing with Time and Capacity Constraints Using Genetic Algorithms. In S. Forrest (Ed.), Proceedings of the 5th International Conference on Genetic Algorithms (pp. 452–459). Morgan Kaufmann Publishing.