1. G. B. Dantzig, & J. H.Ramser, “The truck dispatching problem.” Management science 6(1), 80-91, 1959 2. E. K. Baker, & J. R.Schaffer, “Solution improvement heuristics for the vehicle routing and scheduling problem with time window constraints.” American Journal of Mathematical and Management Sciences 6(3-4), 261-300, 1986 3. S. Belhaiza, P. Hansen, & G. Laporte, “A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows.” Computers & Operations Research 52, 269-281, 2014 4. F. Liberatore, G. Righini, & M. Salani, “A column generation algorithm for the vehicle routing problem with soft time windows.” 4OR 9(1), 49-82, 2011 5. D. Skrlec, M., Filipec, & S.Krajcar, “A heuristic modification of genetic algorithm used for solving the single depot capacited vehicle routing problem.” In Proceedings Intelligent Information Systems 184-188, 1997 6. H. Min, J. Current, & D. Schilling, “The multiple depot vehicle routing problem with backhauling.” Journal of Business Logistics 13(1), 259, 1992 7. R. Cuda, G. Guastaroba, & M. G.Speranza, “A survey on two-echelon routing problems.” Computers & Operations Research 55, 185-199, 2015 8. K. Fleszar, I. H. Osman, & K. S.Hindi, “A variable neighbourhood search algorithm for the open vehicle routing problem.” European Journal of Operational Research 195(3), 803-809, 2009 9. M. Setak, S. Jalili Bolhassani, H. Karimi, & B. Ghorbani, “Capacitated Multi-depot Vehicle Routing Problem with Inter-depot Routes.” Advances in Industrial Engineering 48(Special Issue), 11-18, 2014 10. M. C. Bolduc, J. Renaud, F. Boctor, & G. Laporte, “A perturbation metaheuristic for the vehicle routing problem with private fleet and common carriers.” Journal of the Operational Research Society 59(6), 776-787, 2008 11. Li F., Golden B., & E. Wasil, “A record-to-record travel algorithm for solving the heterogeneous fleet vehicle routing problem.” Computers & Operations Research 34(9), 2734-2742, 2007 12. J. Lysgaard, A. N. Letchford, & R. W.W. Eglese, “A new branch-and-cut algorithm for the capacitated vehicle routing problem.” Mathematical Programming 100(2), 423-445, 2004 13. C. K. Y. Lin, “A vehicle routing problem with pickup and delivery time windows,coordination of transportable resources.” Computers & Operations Research 38(11), 1596-1609, 2011 14. P. Kabcome, & T. Mouktonglang, “Vehicle routing problem for multiple product types, compartments, and trips with soft time windows.” International Journal of Mathematics and Mathematical Sciences 2015 15. V. W. Morais, G. R. Mateus, & T. F. Noronha, “Iterated local search heuristics for the vehicle routing problem with cross-docking.” Expert Systems with Applications 41(16), 7495-7506, 2014 16. G. Poonthalir, & R. Nadarajan, “A fuel efficient green vehicle routing problem with varying speed constraint (F-GVRP).” Expert Systems with Applications 100, 131-144, 2018 17. C. I. Hsu, S. F. Hung, & H. C.Li, “Vehicle routing problem with time-windows for perishable food delivery.” Journal of food engineering 80(2), 465-475, 2007 18. N. Radojičić, A. Djenić, & M. Marić, “Fuzzy GRASP with path relinking for the Risk-constrained Cash-in-Transit Vehicle Routing Problem.” Applied Soft Computing 72, 486-497, 2018 19. R. Gupta, B. Singh, & D. Pandey, “Fuzzy vehicle routing problem with uncertainty in service time.” International Journal of Contemporary Mathematical Sciences 5(11), 497-507, 2010 20. A. Haghani, & S. Jung, “A dynamic vehicle routing problem with time-dependent travel times.” Computers & operations research 32(11), 2959-2986, 2005 21. G. Reinelt, “TSPLIB—A traveling salesman problem library.” ORSA journal on computing 1991; 3(4): 376-384. 22. E. Pitzer, & Affenzeller, M. “A comprehensive survey on fitness landscape analysis.” In Recent advances in intelligent engineering systems 161-191, 2012 23. S. Verel, P. Collard, & M. Clergue, “Measuring the evolvability landscape to study neutrality.” In Proceedings of the 8th annual conference on Genetic and evolutionary computation 613-614, 2006 24. M. Ventresca, B., Ombuki-Berman, & A.Runka, “Predicting genetic algorithm performance on the vehicle routing problem using information theoretic landscape measures.” In European Conference on Evolutionary Computation in Combinatorial Optimization 214-225, 2013 25. Z. J. Czech, “Statistical measures of a fitness landscape for the vehicle routing problem.” In2008 IEEE International Symposium on Parallel and Distributed Processing 1-8, 2008 26. P. Merz, & B. Freisleben, “Memetic algorithms for the traveling salesman problem.” Complex Systems 13(4), 297-346, 2001 27. E. Pitzer, “Applied Fitness Landscape Analysis” PhD dissertation, JOHANNES KEPLER UNIVERSITÄT LINZ, Technisch-Naturwissenschaftliche Fakultät, 2013 28. L. Kovács, A. Agárdi, & T. Bányai, “Fitness Landscape Analysis and Edge Weighting-Based Optimization of Vehicle Routing Problems.” Processes, 8(11), 1363, 2020 29. A. Agárdi, L. Kovács, & T. Bányai, “An Attraction Map Framework of a Complex Multi-Echelon Vehicle Routing Problem with Random Walk Analysis.” Applied Sciences, 11(5), 2100, 2021 30. S. Verel, “Fitness landscapes and graphs: multimodularity, ruggedness and neutrality.” In Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference3593-3656, 2009 31. E. Pitzer, & M. Affenzeller, “A comprehensive survey on fitness landscape analysis.” In Recent advances in intelligent engineering systems 161-191, 2012 32. X. Chen, Y. Zhou, Z. Tang, & Q. Luo, “A hybrid algorithm combining glowworm swarm optimization and complete 2-opt algorithm for spherical travelling salesman problems.” Applied Soft Computing 58, 104-114, 2017 33. A. Hussain, Y. S. Muhammad, M. Nauman Sajid, I. Hussain, A. Mohamd Shoukry, & S. Gani, “Genetic algorithm for traveling salesman problem with modified cycle crossover operator.” Computational intelligence and neuroscience 2017 34. K. Q. Zhu, “A diversity-controlling adaptive genetic algorithm for the vehicle routing problem with time windows.” In Proceedings.15th IEEE International Conference on Tools with Artificial Intelligence 176-183, 2003 35. K. P. Wang, L. Huang, C. G. Zhou, & W. Pang, “Particle swarm optimization for traveling salesman problem.” In Proceedings of the2003 international conference on machine learning and cybernetics 3, 1583-1585, 2003 |