Open AccessCity travelling salesman problem with minimizing truck weight in fragile road
Author(s) -
Rio Aurachman
Publication year - 2021
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1836/1/012007
Subject(s) - travelling salesman problem , truck , context (archaeology) , transport engineering , process (computing) , computer science , order (exchange) , quality (philosophy) , operations research , business , automotive engineering , engineering , geography , algorithm , philosophy , archaeology , finance , epistemology , operating system
The process of delivering goods can be modeled in the TSP model; Traveling Salesman Problem. Several existing TSP models try to minimize the mileage so as to minimize transportation costs from vehicles. In the context of city logistics, the quality of the roads used to deliver goods is also used by city residents’ vehicles. The route taken for the first time contains a heavy mass because the cargo being transported still contains all the goods that will be delivered later. Then the mass of the truck cargo will gradually decrease from the heavy mass to the very light mass at the final destination, because the entire load has been delivered. Through this paper, we propose a TSP model development that can choose the order of delivery by considering the road conditions taken, so that a route will be obtained that minimizes the risk of road damage due to the large mass of the load.