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

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.

---

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