Citation :

Ajay Bhaktharahalli Nagesh Hemambika, Rajashiva Ramalingam, "Evolutionary Local Search in Vehicle Scheduling: Cost Architecture, Constraint Modeling, and the Divide Among Theory and Enterprise Practice," International Journal of Computer Trends and Technology (IJCTT), vol. 74, no. 7, pp. 43-51, 2026. Crossref, https://doi.org/10.14445/22312803/IJCTT-V74I7P104

Abstract

Freight routing at enterprise scale is a combinatorial decision problem whose solution space is too large for human planners to search manually and too complex for simple heuristics to navigate reliably. This paper studies Vehicle Scheduling and Routing (VSR) optimization, an algorithm-based approach used in modern ERP-integrated transportation systems to automate the search for optimal solutions. The paper traces the problem from its roots in the Vehicle Routing Problem with Time Windows (VRPTW) through the mechanics of evolutionary local search, paying particular attention to how cost functions are constructed, how hard and soft constraints interact, and how the semantics of distance-cost calculation differ between route-based and destination-based models. The paper draws on operations research literature for theoretical grounding while concentrating on practical questions: why does the optimizer behave as it does, how does configuration drive that behavior, and what does a logistics professional need to understand to deploy VSR optimization effectively? Field observations show that miscalibrated cost parameters are the leading cause of suboptimal optimizer output in production deployments.

Keywords

Supply Chain Planning, Combinational Optimization, Freight Consolidation, Vehicle Routing Problem with Time Windows, VSR Optimization.

References

[1] Gilbert Laporte, “The Vehicle Routing Problem: An Overview of Exact and Approximate Algorithms,” European Journal of Operational Research, vol. 59, no. 3, pp. 345-358, 1992.
[CrossRef] [Google Scholar] [Publisher Link]

[2] G.B. Dantzig, and J.H. Ramser, “The Truck Dispatching Problem,” Management Science, vol. 6, no. 1, pp. 80-91, 1959.
[CrossRef] [Google Scholar] [Publisher Link]

[3] Paolo Toth, and Daniele Vigo, Vehicle Routing: Problems, Methods, and Applications, 2^nd ed., SIAM, Philadelphia, 2014.
[CrossRef] [Google Scholar] [Publisher Link]

[4] J.K. Lenstra, and A.H.G. Rinnooy Kan, “Complexity of Vehicle Routing and Scheduling Problems,” Networks an International Journal, vol. 11, no. 2, pp. 221-227, 1981.
[CrossRef] [Google Scholar] [Publisher Link]

[5] N. Christofides, A. Mingozzi, and P. Toth, “Exact Algorithms for the Vehicle Routing Problem,” Mathematical Programming, vol. 20, no. 1, pp. 255-282, 1981.
[CrossRef] [Google Scholar] [Publisher Link]

[6] Marius M. Solomon, “Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints,” Operations Research, vol. 35, no. 2, pp. 166-324, 1987.
[CrossRef] [Google Scholar] [Publisher Link]

[7] Martin W.P. Savelsbergh, “The Vehicle Routing Problem with Time Windows: Minimizing Route Duration,” ORSA Journal on Computing, vol. 4, no. 2, pp. 146-154, 1992.
[CrossRef] [Google Scholar] [Publisher Link]

[8] Olli Braysy, and Michel Gendreau, “Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms,” Transportation Science, vol. 39, no. 1, pp. 104-118, 2005.
[CrossRef] [Google Scholar] [Publisher Link]

[9] Olli Braysy, and Michel Gendreau, “Vehicle Routing Problem with Time Windows, Part II: Metaheuristics,” Transportation Science, vol. 39, no. 1, pp. 119-139, 2005.
[CrossRef] [Google Scholar] [Publisher Link]

[10] UNECE, Agreement Concerning the International Carriage of Dangerous Goods by Road (ADR), UNECE, 2023. [Online]. Available: https://unece.org/transport/dangerous-goods/adr-2023

[11] Guy Desaulniers, Jacques Desrosiers, and Marius M. Solomon, Column Generation, 1^st ed., Springer, New York, 2005.
[CrossRef] [Google Scholar] [Publisher Link]

[12] Thibaut Vidal et al., “A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems,” Operations Research, vol. 60, no. 3, pp. 611-624, 2012.
[CrossRef] [Google Scholar] [Publisher Link]

[13] Michel Gendreau, and Jean-Yves Potvin, Handbook of Metaheuristics, 3^rd ed., Springer, New York, 2019.
[CrossRef] [Google Scholar] [Publisher Link]

[14] David Pisinger, and Stefan Ropke, “A General Heuristic for Vehicle Routing Problems,” Computers and Operations Research, vol. 34, no. 8, pp. 2403-2435, 2007.
[CrossRef] [Google Scholar] [Publisher Link]

[15] J-F. Cordeau, G. Laporte, and A. Mercier, “A Unified Tabu Search Heuristic for Vehicle Routing Problems with Time Windows,” Journal of the Operational Research Society, vol. 52, no. 8, pp. 928-936, 2001.
[CrossRef] [Google Scholar] [Publisher Link]

[16] Michael Schneider, Andreas Stenger, and Dominik Goeke, “The Electric Vehicle Routing Problem with Time Windows and Recharging Stations,” Transportation Science, vol. 48, no. 4, pp. 500-520, 2014.
[CrossRef] [Google Scholar] [Publisher Link]

[17] Stefan Ropke, and David Pisinger, “An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows,” Transportation Science, vol. 40, no. 4, pp. 455-472, 2006.
[CrossRef] [Google Scholar] [Publisher Link]

[18] David Mester, and Olli Braysy, “Active Guided Evolution Strategies for Large-Scale Vehicle Routing Problems with Time Windows,” Computers and Operations Research, vol. 32, no. 6, pp. 1593-1614, 2005.
[CrossRef] [Google Scholar] [Publisher Link]

[19] Bruce Golden, S. Raghavan, and Edward Wasil, The Vehicle Routing Problem: Latest Advances and New Challenges, 1^st ed., Springer, New York, pp. 1-589, 2008.
[CrossRef] [Google Scholar] [Publisher Link]

[20] Gerardo Berbeglia, Jean-Francois Cordeau, and Gilbert Laporte, “Dynamic Pickup and Delivery Problems,” European Journal of Operational Research, vol. 202, no. 1, pp. 8-15, 2010.
[CrossRef] [Google Scholar] [Publisher Link]

[21] Nasreddine Ouertani, Hajer Ben-Romdhane, and Saoussen Krichen, The Dynamic Vehicle Routing Problem: A Comprehensive Survey, Advances in Computational Logistics and Supply Chain Analytics, Springer, pp. 1-36, 2024.
[CrossRef] [Google Scholar] [Publisher Link]

[22] Peter Nielsen et al., “A Systematic Review of Vehicle Routing Problems and Models in Multi-Echelon Distribution Networks,” Supply Chain Analytics, vol. 7, pp. 1-12, 2024.
[CrossRef] [Google Scholar] [Publisher Link]

[23] Mirko Cavecchia et al., “A Real-World Multi-Depot, Multi-Period, and Multi-Trip Vehicle Routing Problem with Time Windows,” Proceedings of the 14^th International Conference on Operations Research and Enterprise Systems (ICORES), vol. 1, pp. 112-122, 2025.
        [CrossRef] [Google Scholar] [Publisher Link]