Loading...
A new approach to solve MDVRP in lower computation time
Rahimi Baghbadorani, R ; Sharif University of Technology | 2021
319
Viewed
- Type of Document: Article
- DOI: 10.1109/ICEE52715.2021.9544126
- Publisher: Institute of Electrical and Electronics Engineers Inc , 2021
- Abstract:
- Vehicle routing problem is one of the complex and NP-hard problems, which plays a crucial role in this hectic world regarding people's lifestyle. Nowadays, many people provide their stuff online, so a logistic problem has been outstripped for companies to reduce their transportation costs. In this article, a novel approach has been introduced, which can solve the multi-depot vehicle routing problem in shorter time. By using clustering and decomposing the main problem into smaller ones, solution time has been dropped dramatically. In addition, this approach obtains a reasonable cost, which can be considered as fuel consumption, distance, or so forth. This method could reduce the solution time drastically. © 2021 IEEE
- Keywords:
- Clusterings ; Computation time ; Logistics problems ; Multi-depot vehicle routing problems ; New approaches ; NP-hard ; Solution time ; Transportation cost ; Vehicle Routing Problems ; VRP ; Vehicle routing
- Source: 29th Iranian Conference on Electrical Engineering, ICEE 2021, 18 May 2021 through 20 May 2021 ; 2021 , Pages 632-636 ; 9781665433655 (ISBN)
- URL: https://ieeexplore.ieee.org/document/9544126