Models and local search algorithms for vehicle routing with returns and time windows
The Bulletin of Irkutsk State University. Series Mathematics, Tome 48 (2024), pp. 95-110 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

A vehicle routing problem for servicing objects with the possibility of distributing work between vehicle taking into account time windows is considered. We discuss approaches to constructing integer linear programming models and their modifications. A large neighborhood search algorithm is proposed to find approximate solutions. Here an improving solution is constructed using the “destroy” and “repair” methods at each step. A series of instances with various structures are proposed, in particular demonstrating the reason of returns to objects for vehicles. The results of an experimental evaluation of models and algorithms are presented.
Keywords: vehicle routing, local search, integer programming, model.
@article{IIGUM_2024_48_a6,
     author = {Lidia A. Zaozerskaya and Yulia V. Zakharova},
     title = {Models and local search algorithms for vehicle routing with returns and time windows},
     journal = {The Bulletin of Irkutsk State University. Series Mathematics},
     pages = {95--110},
     year = {2024},
     volume = {48},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/IIGUM_2024_48_a6/}
}
TY  - JOUR
AU  - Lidia A. Zaozerskaya
AU  - Yulia V. Zakharova
TI  - Models and local search algorithms for vehicle routing with returns and time windows
JO  - The Bulletin of Irkutsk State University. Series Mathematics
PY  - 2024
SP  - 95
EP  - 110
VL  - 48
UR  - http://geodesic.mathdoc.fr/item/IIGUM_2024_48_a6/
LA  - ru
ID  - IIGUM_2024_48_a6
ER  - 
%0 Journal Article
%A Lidia A. Zaozerskaya
%A Yulia V. Zakharova
%T Models and local search algorithms for vehicle routing with returns and time windows
%J The Bulletin of Irkutsk State University. Series Mathematics
%D 2024
%P 95-110
%V 48
%U http://geodesic.mathdoc.fr/item/IIGUM_2024_48_a6/
%G ru
%F IIGUM_2024_48_a6
Lidia A. Zaozerskaya; Yulia V. Zakharova. Models and local search algorithms for vehicle routing with returns and time windows. The Bulletin of Irkutsk State University. Series Mathematics, Tome 48 (2024), pp. 95-110. http://geodesic.mathdoc.fr/item/IIGUM_2024_48_a6/

[1] Eremeev A.V., Zaozerskaya L.A., Zakharova Yu.V., Investigation of integer programming models for rig routing problem with returns and time windows, PREPRINTS.RU, 2022 (in Russian) | DOI

[2] Kulachenko I.N., Kononova P.A., “A hybrid algorithm for the drilling rig routing problem”, Journal of Applied and Industrial Mathematics, 15:2 (2021), 261–276 | DOI | MR | Zbl

[3] Bezerra S. N., Souza M. J. F., de Souza S. R., “A variable neighborhood search-based algorithm with adaptive local search for the Vehicle Routing Problem with Time Windows and multi-depots aiming for vehicle fleet reduction”, Comp. Oper. Res., 149 (2023), 106016 | DOI | MR | Zbl

[4] Blum C., Eremeev A. V., Zakharova Y. V., “Hybridizations of evolutionary algorithms with Large Neighborhood Search”, Comp. Sci. Rev., 46 (2022), 100512 | DOI | MR

[5] P. Borisovsky, A. Eremeev, Y. Kovalenko, L. Zaozerskaya, “Rig routing with possible returns and stochastic drilling times”, Proc. of Mathematical Optimization Theory and Operations Research. MOTOR, LNCS, 12755, 2021, 51–66 | DOI | MR

[6] Borisovsky P., “A parallel greedy approach enhanced by genetic algorithm for the stochastic rig routing problem”, Opt. Let. OnLine-First, 2023, 235–255 | DOI | MR

[7] Groer C., Golden B., Wasil E., “A library of local search heuristics for the vehicle routing problem”, Math. Prog. Comp., 2 (2010), 79–101 | DOI | MR | Zbl

[8] V. S. Nguyen, Q. D. Pham, T. H. Nguyen, Q. T. Bui, “Modeling and solving a multi-trip multi-distribution center vehicle routing problem with lower-bound capacity constraints”, Comp. and Ind. Eng. Part A, 172 (2022), 108597 | DOI

[9] Sadati M. E. H., Akbari V., Çatay B., “Electric vehicle routing problem with flexible deliveries”, Int. Jour. of Prod. Res, 60:13 (2022), 4268–4294 | DOI

[10] Q. Shang, Y. Huang, Y. Wang et al., “Solving vehicle routing problem by memetic search with evolutionary multitasking”, Memetic Comp., 14 (2022), 31–44 | DOI

[11] V. F. Yu, H. Susanto, P. Jodiawan, T.-W. Ho, S.-W. Lin, Y.-T. Huang, “A simulated annealing algorithm for the vehicle routing problem with parcel lockers”, IEEE Access, 10 (2022), 20764–20782 | DOI | MR