References
- S. Binart, P. Dejax, M. Gendreau, and F. Semet, “A 2-stage method for a field service routing problem with stochastic travel and service times,” Elsevier, Computers & Operations Research, 65(2016) 2016.
- W. C. M. Vinicius, R. M. Geraldo, and F. N. Thiago, “Iterated local search heuristics for the Vehicle Routing Problem with Cross-Docking,” Elsevier, Expert Systems with Applications, 41(2014) 7495–7506.
- V. A. Nguyen, J. Jiang, K. M. Ng, and K. M. Teo, “Satisficing measure approach for vehicle routing problem with time windows under uncertainty,” Elsevier, European Journal of Operational Research, 248(2016) 404–414.
- K. Çağrı, B. Tolga, J. Ola, and L. Gilbert, “The fleet size and mix location-routing problem with time windows: Formulations and a heuristic algorithm,” Elsevier, European Journal of Operational Research, 248(2016) 33–51.
- J. Zelenka, and Z. Didekova, “Cost balancing act of vehicle number to solve the Vehicle Routing Problem with time windows,” Intelligent Engineering Systems (INES), IEEE 17th International Conference, pp. 293–299, 2013.
- Cheng, W., A case study of action research on communicative language teaching. Journal of Interdisciplinary Mathematics, 18(2015) 705–717.
- C.M. Chase and G.C. Amanda, “The flying sidekick travelling salesman problem: Optimization of drone-assisted parcel delivery,” Elsevier, Transportation Research Part C: Emerging Technologies, 54(2015) 86–109.