نتایج جستجو برای: depot multi
تعداد نتایج: 468814 فیلتر نتایج به سال:
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...
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...
ID: I935 Timothy W. Duket and Seokcheon Lee School of Industrial Engineering, Purdue University West Lafayette, IN 47906
This article addresses an extension of the multi-depot vehicle routing problem in which vehicles may be replenished at intermediate depots along their route. It proposes a heuristic combining the adaptative memory principle, a tabu search method for the solution of subproblems, and integer programming. Tests are conducted on randomly generated instances.
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...
The Vehicle Scheduling Problem (VSP) is the task of building an optimal set of rotations (vehicle schedule), such that each trip of a given timetable is covered by exactly one rotation. The restrictions and optimization criteria may differ from one problem setting to another. For multi-depot, multi-vehicle-type VSP for bus transit, each one-day rotation must end at the depot of start and is to ...
Inspired by a real-life case in the Brussels Capital Region, Belgium, this paper provides Memetic Algorithm with Sequential Split procedure (MASS) for solving large variety of waste collection problems multiple depots, restricted vehicle fleet at each depot, (intermediate) processing facilities, capacity restrictions per facility and partial pick-ups. MASS first generates satisfactory initial s...
In this paper, we present a methodology for solving a multi-product, multi-depot periodic vehicle routing problem. The problem focuses on allocating products and assigning appropriate delivery days to a set of customers, and designing a set of delivery routes for every day of the planning period. A tabu-search based heuristic is proposed to find the best allocation and routing plan that would g...
Among numerous NP-hard problems, the Traveling Salesman Problem (TSP) has been one of the most explored, yet unknown one. Even a minor modification changes the problem’s status, calling for a different solution. The Generalized Traveling Salesman Problem (GTSP) expands the TSP to a much more complicated form, replacing single nodes with a group or cluster of nodes, where the objective is to fin...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید