نتایج جستجو برای: relief depot routing

تعداد نتایج: 91145  

Vehicle Routing Problem (VRP) is addressed to a class of problems for determining a set of vehicle routes, in which each vehicle departs from a given depot, serves a given set of customers, and returns back to the same depot. On the other hand, simultaneous delivery and pickup problems have drawn much attention in the past few years due to its high usage in real world cases. This study, therefo...

Journal: :مهندسی صنایع 0
مصطفی ستاک دانشکده مهندسی صنایع- دانشگاه صنعتی خواجه نصیرالدین طوسی سهیل جلیلی بوالحسنی دانشکده مهندسی صنایع- دانشگاه صنعتی خواجه نصیرالدین طوسی حسین کریمی دانشکده مهندسی صنایع- دانشگاه صنعتی خواجه نصیرالدین طوسی بهارک قربانی دانشکده مهندسی صنایع- دانشگاه صنعتی خواجه نصیرالدین طوسی

in this paper, we study the multi-depot vehiclerouting problem with inter-depot routes, in which the vehicles can replenish atintermediate depots. vehicles leave the origin depot with load on-board andserve customers until out of load. they may visit an intermediate depot toreplenish and finally return to the origin depot, completing their route. weinitiate a mathematical mixed integer programm...

In this work, the capacitated location-routing problem with simultaneous pickup and delivery (CLRP-SPD) is considered. This problem is a more realistic case of the capacitated location-routing problem (CLRP) and belongs to the reverse logistics of the supply chain. The problem has many real-life applications of which some have been addressed in the literature such as management of liquid petrol...

In the recent decade, special attention is paid to reverse logistic due to economic benefits of recovery and recycling of used products as well as environmental legislation and social concerns. On the other hand، many researches claim that separately and sequential planning of forward and reverse logistic causes sub-optimality. Effective transport activities are also one of the most important c...

  The Vehicle Routing Problem (VRP) is one of the most important combinational optimization problems that has nowadays received much attention of researchers and scientists. In this problem, the objective is to minimize the cost traveled by several vehicles that start to move simultaneously from depot and come back to depot after visiting customers if at first each node is visited only once by ...

In this paper, we study the location routing problem with replenishment facilities (LRPRF), an extension of the location routing problem (LRP) where the vehicles can replenish at some replenishment facilities. Vehicles leave the depot with load on-board, serve customers until out of load, and then either return to a replenishment facility to reload or return to the depot, completing their route...

The location-routing problem is one of the combined problems in the area of supply chain management that simultaneously make decisions related to location of depots and routing of the vehicles. In this paper, the single-depot capacitated location-routing problem under uncertainty is presented. The problem aims to find the optimal location of a single depot and the routing of vehicles to serve th...

Journal: :international journal of industrial engineering and productional research- 0
mehrdad mirzabaghi college of industrial engineering, tehran south branch, islamic azad university, tehran, iran alireza rashidi komijan department of industrial engineering, firoozkooh branch, islamic azad university, firoozkooh, iran amir h. sarfaraz college of industrial engineering, tehran south branch, islamic azad university, tehran, iran

in the recent decade, special attention is paid to reverse logistic due to economic benefits of recovery and recycling of used products as well as environmental legislation and social concerns. on the other hand، many researches claim that separately and sequential planning of forward and reverse logistic causes sub-optimality. effective transport activities are also one of the most important c...

Location-Routing Problem (LRP) emerges as one of the hybrid optimization problems in distribution networks in which, total cost of the system would be reduced significantly by simultaneous optimization of locating a set of facilities among candidate locations and routing vehicles. In this paper, a mixed integer linear programming model is presented for a two-echelon location-routing problem wit...

Journal: :IEEE Access 2021

This paper focuses on a modified Multi-Depot Unmanned Aerial Vehicle Routing Problem (MMDUAVRP). Comparing to classic multi-depot vehicle routing problem, our studied problem has no constraints restrict the depot where (UAV) departs and returns. work aims minimize number of UAVs total distance traveled by all UAVs. is mathematically formulated in this heuristic-assignment based hybrid large nei...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید