Loading...
Search for:
multi-depot-vehicle-routing-problems
0.006 seconds
A new approach to solve MDVRP in lower computation time
, Article 29th Iranian Conference on Electrical Engineering, ICEE 2021, 18 May 2021 through 20 May 2021 ; 2021 , Pages 632-636 ; 9781665433655 (ISBN) ; Zajkani, M. A ; Haeri, M ; Sharif University of Technology
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...
Multi-depot Vehicle Routing Using Predictive Distributed Cooperative Method
, M.Sc. Thesis Sharif University of Technology ; Haeri, Mohammad (Supervisor)
Abstract
Due to conspicuous increases in shopping and goods transportation in this unbridled world, a significant part of companies’ final interest and final cost are related to their distributions of goods. Meanwhile, because of practical constraints of service hours and service distances, logistics companies usually build multiple depots to serve a great number of dispersed customers. Hence, multi-depot vehicle routing problems (MDVRP) win more and more engineers’ and companies’ attention to thrift their cost by using optimization methods. Considering NP-hardness of MDVRP and the lack of optimal solution derived by heuristic and meta-heuristic approaches in the large scale problems, in this...
The Multi-Depot Traveling Purchaser Problem with Shared Resources
, Ph.D. Dissertation Sharif University of Technology ; Eshghi, Kourosh (Supervisor) ; Rafiee, Majid (Supervisor)
Abstract
The Multi-Depot Traveling Purchaser Problem under Shared Resources (MDTPPSR) is a new variant of the Traveling Purchaser Problem (TPP). In this problem, each depot can purchase its products using the shared resources of other depots, and vehicles do not have to return to their starting depots. The routing of this problem is a Multi-Trip, Open Vehicle Routing Problem. A tailored integer programming model is formulated to minimize the total purchasers’ costs. Considering the complexity of the model, we have presented a decomposition-based algorithm that breaks down the problem into two phases. In the first phase, tactical decisions regarding supplier selection and the type of collaboration are...