A New Method for Generating Initial Solutions of Capacitated Vehicle Routing Problems

Year 2018, Volume: 31 Issue: 2, 489 - 513, 01.06.2018

Kenan Karagül Michael G. Kay Sezai Tokat

Abstract

In vehicle routing problems, the initial solutions of
the routes are important for improving the quality and solution time of the
algorithm. For a better route construction algorithm, the obtained initial
solutions must be basic, fast, and flexible with reasonable accuracy. In this
study, initial solutions improvement for CVRP is introduced based on a method that
is introduced in the literature. Using a different formula for addressing the
gravitational forces, a new method is introduced and compared with the previous
physics inspired algorithm. By using the initial solutions of the proposed
method and using them as RTR and SA initial routes, it is seen that better
results are obtained when compared with various algorithms from the literature.
Also, in order to fairly compare the algorithms executed on different machines,
a new comparison scale for the solution quality of vehicle routing problems is
proposed that depends on the solution time and the deviation from the best
known solution. The obtained initial solutions are then input to Record-to-Record
and Simulated Annealing algorithms to obtain final solutions. Various test
instances and CVRP solutions from the literature are used for comparison. The
comparisons with the proposed method have shown promising results.

Keywords

Constructive Routing Heuristics, Vehicle Routing Problem, Initial Routing Solutions, Physics-Inspired Optimization, Capacitated Vehicle Routing Problem

References

• Baker, B. M., & Ayechew, M. (2003). Agenetic algorithm for the vehicle routing problem. Computers & Operations Research, 787 – 800.
• Battarra, M., Benedettini, S., & Roli, A. (2011). Additional Material for “Leveraging saving-based algorithms by master-slave genetic algorithms”. Engineering Applications of Artificial Intelligence, Appendix A. Supplementary data.
• Battarra, M., Benedettini, S., & Roli, A. (2011). Leveraging saving-based algorithms by master–slave genetic algorithms. Engineering Applications of Artificial Intelligence, 555-566.
• Chatterjee, A., Mahanti, G. K., & Pathak, N. (2010). Comparative Performance of Gravitaional Search Algorithm and Modified Particle Swarm Optimization Algorithm for Synthesis of Thinned Scanned Concentric Ring Array Antenna. Progress In Electromagnetics Research B, 331–348.
• Cordeau, J.-F., Gendreau, M., Laporte, G., Potvin, J.-Y., & Semet, F. (2002). A guide to vehicle routingheuristics. Journal of the Operational Research Society, 512-522.
• Ding, D., Qi, D., Luo, X., Chen, J., Wang, X., & Du, P. (2012). Convergence analysis and performance of an extended central force optimization algorithm. Applied Mathematics and Computation, 2246–2259.
• Duman, S., Güvenç, U., & Yörükeren, N. (2010). Gravitational Search Algorithm for Economic Dispatch with Valve-Point Effects. International Review of Electrical Engineering, 2890-2895.
• Formato, R. A. (2007). Central Force Optimization: A New Metaheuristic with Applications in Applied Electromagnetism. Progress In Electromagnetics Research, 425-491.
• Groer, C. (2015, 5 5). VRPH. Retrieved from COIN-OR Home: http://www.coin-or.org/projects/VRPH.xml
• Groer, C., & Golden, B. (2015, 5 5). Parallel and Serial Algorithms for Vehicle Routing Problems. Retrieved from UMD, PhD Thesis, 2008: http://drum.lib.umd.edu/bitstream/1903/9011/1/Groer_umd_0117E_10068.pdf