Routing of Vehicles from Depot in Two-Level Supply Chain with a Meta-Heuristic Algorithm

• Autorzy: Hosseini Zahra Sadat , Kamali Iman

Identyfikatory

DOI

10.12913/22998624/105888

• Języki publikacji: EN

Abstrakty

EN

The present study aimed at routing vehicles from a depot in two-level supply chain with a meta-heuristic algorithm. This study is an analytical type of research. The issue of routing which includes time, travel duration dependent on the day, has first been introduced by Mandraki and Duskin. They proposed the issue of time-dependent Travelling Salesman Problem (TSP), such that their simplified issue was a VRP issue and service should be provided to all customers, and each customer should only be visited by one vehicle. Mathematical modeling was used as a research tool, and in the examined problem, there are a number of demand points with simultaneous delivery and return. This demand should pass the depot which should be selected from among candid points, and it should be determined that the construction of depot in each of these locations has a specific fixed cost. In order to send service from depot to the demand points, vehicles with special carrying capacity, fixed using costs, and overhead carrying costs. Given that solving the problem is time-consuming, the MOPSO meta-heuristic algorithm was used in order to solve the problem. The obtained results were fully presented, and in different repetitions it was observed that the second vehicle has the highest load carrying.

Słowa kluczowe

EN

routing; vehicles; depot; metaheuristic algorithm

PL

trasy; pojazdy; zajezdnia; algorytm metaheurystyczny

• Wydawca: Lublin University of Technology ; Polish Society of Ecological Engineering (PTIE), Branch of PTIE in Lublin
• Czasopismo: Advances in Science and Technology. Research Journal
• Rocznik: 2019
• Tom: Vol. 13, no 2
• Strony: 38--45
• Opis fizyczny: Bibliogr. 14 poz., fig., tab.

Twórcy

autor

Hosseini Zahra Sadat

• B.S. of Industrial Engineering, Faculty of Industrial Engineering, Sabzevar University of New Technology, Iran

autor

Kamali Iman

• B.S. of Industrial Engineering, Faculty of Industrial Engineering, Sabzevar University of New Technology, Iran

Bibliografia

• 1. Rahmani H.A., Asghar A. and Kiani K., (2016), Using improved gravity algorithm for solving open vehicle routing problem. Second International Conference on New Research Findings in Electrical Engineering and Computer Sciences, Kasra Non- Profit Institution of Higher Education, Ramsar.
• 2. Sattak M., Habibi M., Karimi H. and Abedzadeh M., (2013), Modeling and solving time-dependent vehicle routing problem with semi-soft Time Windows in Multiple Graphs; Transportation Research Journal. 10(3).
• 3. Sargardan F., Kia V.R. and Ghaffari M., (2015), Modeling vehicle routing problem considering multiple depots, simultaneous delivery and loading, hard and soft time window, cost and depreciation depending on the amount of load existing on the vehicle and the route type. International Conference on New Researches in Management and Industrial Engineering, Tehran, Modiran Ide Parazan Paytakht Ilia Co.
• 4. Salamatbakhsh, A., Moghaddam R.T. and Nowroozi N., (2016), Open vehicle routing problem considering drivers’ satisfaction: multi-objective evolutionary algorithm based on analysis. Quarterly of Transport Engineering, 7(3).
• 5. Yousefi Khoshbakht M. and Rahmati F. (2011), An improved algorithm for ants population for solving vehicle routing problem, along with simultaneous receiving and delivering of goods. Quarterly of Transportation, 8th Year, 2, 183–198.
• 6. Chen, H.K., Hsueh, C.F. and Chang, M.S. (2006) The real-time time-dependent vehicle routing problem. Transportation Research Part E, 42, 383–408.
• 7. Hashimoto, H., Yagiura, M., and Ibaraki, T. (2008), An iterated local search algorithm for the time-dependent vehicle routing problem with time windows. Discrete Optimization, 5, 434–456
• 8. Kok, A.L., Hans, E.W., and Schutten, J.M.J. (2012), Vehicle routing under time-dependent travel times: the impact of congestion avoidance. Computers & Operations Research, 39(5), 910–918.
• 9. Kok, A.L., Hans, E.W., Schutta, J.M.J. and Zijm, W.H.M. (2010), A dynamic programming heuristic for vehicle routing with time-dependent travel times and required breaks. Flexible Services and Manufacturing Journal, 22, 83–108.
• 10. Kumar, M, Narasimha, K.V., Kivelevitch, E., Sharma, B. (2013), An ant colony optimization technique for solving min–max multi-depot vehicle routing problem. Swarm and Evolutionary Computation, 13, 63–73.
• 11. Kuo, Y. (2010), Using simulated annealing to minimize fuel consumption for the timedependent vehicle routing problem. Computers & Industrial Engineering, 59, 157–165.
• 12. Kuo, Y., Wang, C.C. and Chuang, P.Y. (2009), Optimizing goods assignment and the vehicle routing problem with time-dependent travel speeds.Computers & Industrial Engineering, 57, 1385–1392
• 13. Schneider, M., Stenger, A. and Goeke, D. (2014), The electric vehicle-routing problem with time windows and recharging stations. Transportation Science, 48(4), 500–520.
• 14. Wang, Z. and Wang, Z. (2009), A novel two-phase heuristic method for vehicle routing problem with backhauls. Computers and Mathematics with Applications, 57, 1923–1928.

Uwagi

Opracowanie rekordu w ramach umowy 509/P-DUN/2018 ze środków MNiSW przeznaczonych na działalność upowszechniającą naukę (2019).