期刊名称：Advances in Science and Technology Research Journal
印刷版ISSN：2080-4075
电子版ISSN：2299-8624
出版年度：2019
卷号：13
期号：2
页码：38-45
DOI：10.12913/22998624/105888
语种：English
出版社：Society of Polish Mechanical Engineers and Technicians
摘要：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 frst been introduced by Mandraki and Duskin. They proposed the issue of time-dependentTravelling Salesman Problem (TSP), such that their simplifed 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 usedas a research tool, and in the examined problem, there are a number of demand points with simultaneous deliveryand return. This demand should pass the depot which should be selected from among candid points, and it shouldbe determined that the construction of depot in each of these locations has a specifc fxed cost. In order to sendservice from depot to the demand points, vehicles with special carrying capacity, fxed using costs, and overheadcarrying costs. Given that solving the problem is time-consuming, the MOPSO meta-heuristic algorithm was usedin order to solve the problem. The obtained results were fully presented, and in different repetitions it was observedthat the second vehicle has the highest load carrying.
