Solving the vehicle routing problem with time window by using an improved brain strom optimization
Pages 1306 - 1313
Abstract
The vehicle routing problem (VRP) has been researched during recent years, which has also been applied in many industrial fields, such as the logistics system, the industrial production horizons. Many of realistic constraints such as time window for each customer, and different types of vehicles have also been considered in recent literatures. In this study, we consider the two constraints and propose an improved brain storm optimization (BRO) algorithm. In the proposed algorithm, firstly, a novel solution representation is developed considering the synchronized visits constraint. Then, a well-designed decoding method is designed. Experimental comparisons with efficient algorithms on the well-known benchmarks showed that the proposed algorithm is efficient and effective.
References
[1]
M. Ostermeier and A. Hübner, “Vehicle selection for a multi-compartment vehicle routing problem,” Eur. J. Oper. Res., vol. 269, no. 2, pp. 682-694, 2018.
[2]
H. Koch, A. Bortfeldt, and G. J. O. S. Wäscher, “A hybrid algorithm for the vehicle routing problem with backhauls, time windows and three-dimensional loading constraints,” OR Spectrum, pp. 1-47, 2018.
[3]
K. Govindan, A. Jafarian, R. Khodaverdi, and K. Devika, “Two-echelon multiple-vehicle location–routing problem with time windows for optimization of sustainable supply chain network of perishable food,” Int. J. Prod. Econ., vol. 152, pp. 9-28, 2014.
[4]
H. B. 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., 2018.
[5]
Neves-Moreira, F., da Silva, D.P., Guimarães, L., Amorim, P., and Almada-Lobo, B. (2018). The time window assignment vehicle routing problem with product dependent deliveries. Transportation Research Part E: Logistics and Transportation Review, 116, 163-183.
[6]
Liu, R., Tao, Y., and Xie, X. (2018). An adaptive large neighborhood search heuristic for the vehicle routing problem with time windows and synchronized visits. Computers & Operations Research.
[7]
Hojabri, H., Gendreau, M., Potvin, J.Y., and Rousseau, L.M. (2018). Large neighborhood search with constraint programming for a vehicle routing problem with synchronization constraints. Computers & Operations Research, 92, 87-97.
[8]
Li, H., Wang, L., Hei, X., Li, W., and Jiang, Q. (2018). A decomposition-based chemical reaction optimization for multi-objective vehicle routing problem for simultaneous delivery and pickup with time windows. Memetic Computing, 10(1), 103-120.
[9]
Osaba, E., Yang, X.S., Diaz, F., Onieva, E., Masegosa, A.D., and Perallos, A. (2017). A discrete firefly algorithm to solve a rich vehicle routing problem modelling a newspaper distribution system with recycling policy. Soft Computing, 21(18), 5295-5308.
[10]
Ahkamiraad, A., and Wang, Y. (2018). Capacitated and multiple cross-docked vehicle routing problem with pickup, delivery, and time windows. Computers & Industrial Engineering, 119, 76-84.
[11]
Mahmoudi, M., and Zhou, X. (2016). Finding optimal solutions for vehicle routing problem with pickup and delivery services with time windows: A dynamic programming approach based on state–space–time network representations. Transportation Research Part B: Methodological, 89, 19-42.
[12]
Wang, J., Zhou, Y., Wang, Y., Zhang, J., Chen, C.P., and Zheng, Z. (2016). Multiobjective vehicle routing problems with simultaneous delivery and pickup and time windows: formulation, instances, and algorithms. IEEE transactions on cybernetics, 46(3), 582-594.
[13]
J. Q. Li, S. C. Bai, P. Y. Duan, H. Y. Sang, Y. Y. Han, Z. X. Zheng, and D. Y. Bai, “An improved artificial bee colony algorithm for addressing distributed flow shop with distance coefficient in a prefabricated system,” Int. J. Prod. Res., pp. 1-30, 2018.
[14]
H. Liu, B. Xu, D. Lu, and G. Zhang, “A path planning approach for crowd evacuation in buildings based on improved artificial bee colony algorithm,” Appl. Soft. Comput., vol. 68, pp. 360-376, 2018.
[15]
J. Li, P. Duan, H. Sang, S. Wang, Z. Liu, and P. Duan, “An efficient optimization algorithm for resource-constrained steelmaking scheduling problems,” IEEE Access, 2018.
[16]
L. Wang, G. Zhou, Y. Xu, and M. Liu, “An enhanced Pareto-based artificial bee colony algorithm for the multi-objective flexible job-shop scheduling,” Int. J. Adv. Manuf. Technol., vol. 60, no. 9-12, pp. 1111-1123, 2012.
[17]
J. Q. Li, Q. K. Pan, and M. F. Tasgetiren, “A discrete artificial bee colony algorithm for the multi-objective flexible job-shop scheduling problem with maintenance activities,” Appl. Math. Model., vol. 38, no. 3, pp. 1111-1132, 2014.
[18]
Y. Y. Han, J. Liang, Q. K. Pan, J. Q. Li, H. Y. Sang, and N. N. Cao, “Effective hybrid discrete artificial bee colony algorithms for the total flowtime minimization in the blocking flowshop problem,” Int. J. Adv. Manuf. Technol., vol. 67, no. 1-4, pp. 397-414, 2013.
[19]
J. Q. Li and Q. K Pan, “Solving the large-scale hybrid flow shop scheduling problem with limited buffers by a hybrid artificial bee colony algorithm,” Inf. Sci., vol. 316, pp. 487-502, 2015.
[20]
C. Hu, H. Liu, and P. Zhang, “Cooperative co-evolutionary artificial bee colony algorithm based on hierarchical communication model,” Chin. J. Electron., vol. 25, no. 3, pp. 570-576, 2016.
[21]
J. Q. Li, Q. K. Pan, and P. Y. Duan, “An improved artificial bee colony algorithm for solving hybrid flexible flowshop with dynamic operation skipping,” IEEE T. Cybern., vol. 46, no. 6, pp. 1311-1324, 2016.
[22]
L. Wang, G. Zhou, Y. Xu, and M. Liu, “A hybrid artificial bee colony algorithm for the fuzzy flexible job-shop scheduling problem,” Int. J. Prod. Res., vol. 51, no. 12, pp. 3593-3608, 2013.
[23]
P. Y. Duan, J. Q. Li, Y. Wang, H. Y. Sang, and B. X. Jia, “Solving chiller loading optimization problems using an improved teaching-learning-based optimization algorithm,” Optim. Control Appl. Methods, vol. 39, no. 1, pp. 65-77, 2018.
[24]
J. Q. Li, Q. K. Pan, and K. Mao, “A discrete teaching-learning-based optimisation algorithm for realistic flowshop rescheduling problems,” Eng. Appl. Artif. Intell., vol. 37, pp. 279-292, 2015.
[25]
Z. X. Zheng and J. Q. Li, “Optimal chiller loading by improved invasive weed optimization algorithm for reducing energy consumption,” Energy Build, vol. 161, pp. 80-88, 2018.
[26]
Y. Liu, Y. C. Jiao, Y. M. Zhang, and Y. Y. Tan, “Synthesis of phase-only reconfigurable linear arrays using multiobjective invasive weed optimization based on decomposition,” Int. J. Antennas Propag., vol. 2014, 2014.
[27]
H. Y. Sang, Q. K. Pan, P. Y. Duan, and J. Q. Li, “An effective discrete invasive weed optimization algorithm for lot-streaming flowshop scheduling problems,” J. Intell. Manuf., vol. 29, no. 6, pp. 1337-1349, 2018.
[28]
Y. H. Jia, W. N. Chen, T. Gu, H. Zhang, H. Yuan, Y. Lin, and J. Zhang, “A dynamic logistic dispatching system with set-based particle swarm optimization,” IEEE Trans. Syst. Man Cybern. -Syst., vol. 48, no. 9, pp. 1607-1621, 2018.
[29]
H. Liu, L. Gao, and Q. K. Pan, “A hybrid particle swarm optimization with estimation of distribution algorithm for solving permutation flowshop scheduling problem,” Expert Syst. Appl., vol. 38, no. 4, pp. 4348-4360, 2011.
[30]
J. Q. Li, Q. K. Pan, and K. Mao, “A hybrid fruit fly optimization algorithm for the realistic hybrid flowshop rescheduling problem in steelmaking systems,” IEEE Trans. Autom. Sci. Eng., vol. 13, no. 2, pp. 932-949, 2016.
[31]
E. Osaba, X. S. Yang, F. Diaz, E. Onieva, A. D. Masegosa, and A. Perallos, “A discrete firefly algorithm to solve a rich vehicle routing problem modelling a newspaper distribution system with recycling policy,” Soft Comput., vol. 21, no. 18, pp. 5295-5308, 2017.
[32]
Q. K. Pan, H. Y. Sang, J. H. Duan, and L. Gao, “An improved fruit fly optimization algorithm for continuous function optimization problems,” Knowledge-Based Syst., vol. 62, pp. 69-83, 2014.
[33]
T. Meng, Q. K. Pan, J. Q. Li, and H. Y. Sang, “An improved migrating birds optimization for an integrated lot-streaming flow shop scheduling problem,” Swarm Evol. Comput., vol. 38, pp. 64-78, 2018.
[34]
B. Zhang, Q. K. Pan, X. L. Zhang, and P. Y. Duan, “An effective hybrid harmony search-based algorithm for solving multidimensional knapsack problems,” Appl. Soft. Comput., vol. 29, pp. 288-297, 2015.
[35]
Z. X. Zheng, J. Q. Li, and P. Y. Duan, “Optimal chiller loading by improved artificial fish swarm algorithm for energy saving,” Math. Comput. Simul., vol. 155, pp. 227-243, 2019.
[36]
E. Osaba, X. S. Yang, F. Diaz, E. Onieva, A. D. Masegosa, and A. Perallos, “A discrete firefly algorithm to solve a rich vehicle routing problem modelling a newspaper distribution system with recycling policy,” Soft Comput., vol. 21, no. 18, pp. 5295-5308, 2017.
[37]
Q. K. Pan, H. Y. Sang, J. H. Duan, and L. Gao, “An improved fruit fly optimization algorithm for continuous function optimization problems,” Knowledge-Based Syst., vol. 62, pp. 69-83, 2014.
[38]
T. Meng, Q. K. Pan, J. Q. Li, and H. Y. Sang, “An improved migrating birds optimization for an integrated lot-streaming flow shop scheduling problem,” Swarm Evol. Comput., vol. 38, pp. 64-78, 2018.
[39]
B. Zhang, Q. K. Pan, X. L. Zhang, and P. Y. Duan, “An effective hybrid harmony search-based algorithm for solving multidimensional knapsack problems,” Appl. Soft. Comput., vol. 29, pp. 288-297, 2015.
[40]
Z. X. Zheng, J. Q. Li, and P. Y. Duan, “Optimal chiller loading by improved artificial fish swarm algorithm for energy saving,” Math. Comput. Simul., vol. 155, pp. 227-243, 2019.
[41]
W. Zheng, Y. Tan, L. Meng, and H. Zhang, “An improved MOEA/D design for many-objective optimization problems,” Appl. Intell., pp. 1-23, 2018.
[42]
X. Xu, Y. Tan, W. Zheng, and S. Li, “Memory-Enhanced Dynamic Multi-Objective Evolutionary Algorithm Based on Lp Decomposition,” Applied Sciences, vol. 8, no. 9, p. 1673, 2018.
[43]
R. Han, Y. Gao, C. Wu, and D. Lu, “An Effective Multi-Objective Optimization Algorithm for Spectrum Allocations in the Cognitive-Radio-Based Internet of Things,” IEEE Access, vol. 6, pp. 12858-12867, 2018.
[44]
J. Q. Li, H. Y. Sang, Y. Y. Han, C. G. Wang, and K. Z. Gao, “Efficient multi-objective optimization algorithm for hybrid flow shop scheduling problems with setup energy consumptions,” J. Clean Prod., vol. 181, pp. 584-598, 2018.
[45]
X. W. Zheng, D. J. Lu, X. G. Wang, and H. Liu, “A cooperative coevolutionary biogeography-based optimizer,” Appl. Intell., vol. 43, no. 1, pp. 95-111, 2015.
Index Terms
- Solving the vehicle routing problem with time window by using an improved brain strom optimization
Index terms have been assigned to the content through auto-classification.
Recommendations
An improved hybrid algorithm for solving the generalized vehicle routing problem
The generalized vehicle routing problem (GVRP) is a natural extension of the classical vehicle routing problem (VRP). In GVRP, we are given a partition of the customers into groups (clusters) and a depot and we want to design a minimum length collection ...
Comments
Information & Contributors
Information
Published In
Jun 2019
3404 pages
Copyright © 2019.
Publisher
IEEE Press
Publication History
Published: 10 June 2019
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 14 Oct 2024
Other Metrics
Citations
View Options
View options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in