[1]
|
S. Belhaiza, P. Hansen and G. Laporte, A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows, Comput. Oper. Res., 52 (2014), 269-281.
doi: 10.1016/j.cor.2013.08.010.
|
[2]
|
S. Belhaiza and R. M'Hallah, A Pareto non-dominated solution approach for the vehicle routing problem with multiple time windows, in 2016 IEEE Congress on Evolutionary Computation (CEC), (2016), 3515–3524.
doi: 10.1109/CEC.2016.7744235.
|
[3]
|
S. Belhaiza, R. M'Hallah and G. B. Brahim, A new hybrid genetic variable neighborhood search heuristic for the vehicle routing problem with multiple time windows, in 2017 IEEE Congress on Evolutionary Computation (CEC), (2017), 1319–1326.
doi: 10.1109/CEC.2017.7969457.
|
[4]
|
H. Ben Ticha, N. Absi, D. Feillet and A. Quilliot, Multigraph modeling and adaptive large neighborhood search for the vehicle routing problem with time windows, Comput. Oper. Res., 104 (2019), 113-126.
doi: 10.1016/j.cor.2018.11.001.
|
[5]
|
K. Braekers, K. Ramaekers and I. V. Nieuwenhuyse, The vehicle routing problem: State of the art classification and review, Computers & Industrial Engineering, 99 (2016), 300-313.
doi: 10.1016/j.cie.2015.12.007.
|
[6]
|
S. Chen, R. Chen, G.-G. Wang, J. Gao and A. K. Sangaiah, An adaptive large neighborhood search heuristic for dynamic vehicle routing problems, Computers & Electrical Engineering, 67 (2018), 596-607.
doi: 10.1016/j.compeleceng.2018.02.049.
|
[7]
|
H. Chentli, R. Ouafi and W. Ramdane Cherif-Khettaf, A selective adaptive large neighborhood search heuristic for the profitable tour problem with simultaneous pickup and delivery services, RAIRO Oper. Res., 52 (2018), 1295-1328.
doi: 10.1051/ro/2018024.
|
[8]
|
D. Favaretto, E. Moretti and P. Pellegrini, Ant colony system for a VRP with multiple time windows and multiple visits, J. Interdiscip. Math, 10 (2007), 263-284.
doi: 10.1080/09720502.2007.10700491.
|
[9]
|
H. S. Ferreira, E. T. Bogue, T. F. Noronha, S. Belhaiza and C. Prins, Variable neighborhood search for vehicle routing problem with multiple time windows, Electronic Notes in Discrete Mathematics, 66 (2018), 207-214.
doi: 10.1016/j.endm.2018.03.027.
|
[10]
|
E. Glize, N. Jozefowiez and S. U. Ngueveu, An exact column generation-based algorithm for bi-objective vehicle routing problems, Combinatorial Optimization, 208–218, Lecture Notes in Comput. Sci., 10856, Springer, Cham, 2018.
doi: 10.1007/978-3-319-96151-4_18.
|
[11]
|
F. Hammami, M. Rekik and L. C. Coelho, A hybrid adaptive large neighborhood search heuristic for the team orienteering problem, Comput. Oper. Res., 123 (2020), 105034, 18 pp.
doi: 10.1016/j.cor.2020.105034.
|
[12]
|
M. Hoogeboom, W. Dullaert, D. Lai and D. Vigo, Efficient neighborhood evaluations for the vehicle routing problem with multiple time windows, Transportation Science, 54 (2020), 400-416.
doi: 10.1287/trsc.2019.0912.
|
[13]
|
Z. Hu, Z. Wei and H. Sun et al, Optimization of metal rolling control using soft computing approaches: A review, Arch. Computat. Methods Eng., 28 (2021), 405-421.
doi: 10.1007/s11831-019-09380-6.
|
[14]
|
M. N. Kritikos and P. Z. Lappas, Computational Intelligence and Combinatorial Optimization Problems in Transportation Science, In: Tsihrintzis G., Virvou M. (eds) Advances in Core Computer Science-Based Technologies. Learning and Analytics in Intelligent Systems, vol 14. Springer, Cham.
doi: 10.1007/978-3-030-41196-1_15.
|
[15]
|
Y. Li, H. Chen and C. Prins, Adaptive large neighborhood search for the pickup and delivery problem with time windows, profits, and reserved requests, European J. Oper. Res., 252 (2016), 27-38.
doi: 10.1016/j.ejor.2015.12.032.
|
[16]
|
R. Liu, Y. Tao and X. Xie, An adaptive large neighborhood search heuristic for the vehicle routing problem with time windows and synchronized visits, Comput. Oper. Res., 101 (2019), 250-262.
doi: 10.1016/j.cor.2018.08.002.
|
[17]
|
T. Liu, Z. Luo, H. Qin and A. Lim, A branch-and-cut algorithm for the two-echelon capacitated vehicle routing problem with grouping constraints, European J. Oper. Res., 266 (2018), 487-497.
doi: 10.1016/j.ejor.2017.10.017.
|
[18]
|
S. Mirzaei and S. Whlk, A branch-and-price algorithm for two multi-compartment vehicle routing problems, Euro Journal on Transportation & Logs, 8 (2019), 1-33.
|
[19]
|
D. Pisinger and S. Ropke, A general heuristic for vehicle routing problems, Comput. Oper. Res., 34 (2007), 2403-2435.
doi: 10.1016/j.cor.2005.09.012.
|
[20]
|
P. H. Richard, S. Allyson, J. R. Kees and C. C. Leandro, The vehicle routing problem with simultaneous pickup and delivery and handling costs, Computers & Operations Research, 115 (2020), 104858.
|
[21]
|
S. Ropke and D. Pisinger, An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows, Transportation Science, 40 (2006), 455-472.
doi: 10.1287/trsc.1050.0135.
|
[22]
|
V. Schmid, K. F. Doerner and G. Laporte, Rich routing problems arising in supply chain management, European J. Oper. Res., 224 (2013), 435-448.
doi: 10.1016/j.ejor.2012.08.014.
|
[23]
|
P. Shaw, Using constraint programming and local search methods to solve vehicle routing problems, Principles and Practice of Constraint Programming — CP98. CP, 286 (1998), 417-431.
doi: 10.1007/3-540-49481-2_30.
|
[24]
|
T. Vidal, G. Laporte and P. Matl, A concise guide to existing and emerging vehicle routing problem variants, European J. Oper. Res., 286 (2020), 401-416.
doi: 10.1016/j.ejor.2019.10.010.
|
[25]
|
D. Vigo and P. Toth, Vehicle Routing: Problems, Methods, and Applications, 2$^{nd}$ edition, SIAM, 2014.
doi: 10.1137/1.9781611973594.
|
[26]
|
X. Yan, B. Xiao and Z. Zhao, Multi-objective vehicle routing problem with simultaneous pick-up and delivery considering customer satisfaction, in 2019 IEEE International Conference on Smart Manufacturing, Industrial & Logistics Engineering (SMILE), Volume (2019), 93–97.
doi: 10.1109/SMILE45626.2019.8965319.
|