Affiliation:
1. DOKUZ EYLÜL ÜNİVERSİTESİ, FEN BİLİMLERİ ENSTİTÜSÜ
2. DOKUZ EYLÜL ÜNİVERSİTESİ, MÜHENDİSLİK FAKÜLTESİ
Abstract
The vehicle routing problem with time windows and simultaneous pick-ups and deliveries (VRPTWSPD) is one of the main distribution planning problems. VRPTWSPD aims to find the best distribution plan that minimizes the number of vehicle used and the total travelled distance. Due to the NP-Hard nature of the VRPTWSPD, practical large-scale instances cannot be solved to optimality within acceptable computational times. Therefore, it is necessary to develop approximation algorithms to tackle the VRPTWSPD as effectively as possible, as we try to do within the context of this study. Accordingly, a Grey Wolf Optimizer (GWO) algorithm is designed to solve the VRPTWSPD. The designed algorithm starts its search with a group of solutions constructed through the K-means algorithm. Additionally, the algorithm has been enhanced by incorporating the Variable Neighbourhood Search (VNS) algorithm as a local search algorithm. The performance evaluation tests of the developed GWO algorithm was done on the standard benchmark sets which is taken from the related literature. Computational results indicate that the proposed GWO algorithm has a satisfactory performance in solving VRPTWSPD instances.
Publisher
Journal of Industrial Engineering
Reference22 articles.
1. Angelelli, E., & Mansini, R. (2002). The vehicle routing problem with time windows and simultaneous pick-up and delivery. In Quantitative approaches to distribution logistics and supply chain management (pp. 249-267). Springer, Berlin, Heidelberg. Doi: https://doi.org/10.1007/978-3-642-56183-2_15
2. Angelelli, E., & Mansini, R. (2003). A branch-and-price algorithm for a simultaneous pick-up and delivery problem. In Quantitative approaches to distribution logistics and supply chain management (pp. 249-267). Springer, Berlin, Heidelberg. Retrieved from: https://www.academia.edu/es/29065016/A_Branch_and_Price_Algorithm_for_a_Simultaneous_Pick_up_and_Delivery_Problem.
3. Barbosa, N. D. P., Christo, E. D. S., & Costa, K. A. (2015). Demand forecasting for production planning in a food company. ARPN Journal of Engineering and Applied Sciences, 10(16), 7137-7141. Retrieved from: http://www.arpnjournals.com/jeas/research_papers/rp_2015/jeas_0915_2531.pdf.
4. Boubahri, L., Addouche, S. A., & El Mhamedi, A. (2011, March). Multi-ant colonies algorithms for the VRPSPDTW. In 2011 International Conference on Communications, Computing and Control Applications (CCCA) (pp. 1-6). IEEE. Doi: https://doi.org/10.1109/CCCA.2011.6031488.
5. Cao, E., & Lai, M. (2007, August). An improved differential evolution algorithm for the vehicle routing problem with simultaneous delivery and pick-up service. In Third international conference on natural computation (ICNC 2007) (Vol. 3, pp. 436-440). IEEE. Doi: https://doi.org/10.1109/ICNC.2007.209