نتایج جستجو برای: depot vehiclerouting problem with inter
تعداد نتایج: 9521156 فیلتر نتایج به سال:
Derived from the well-known Traveling Salesman problem (TSP), the multiple-Traveling Salesman problem (multiple-TSP) with single depot is a straightforward generalization: several salesmen located in a given city (the depot) need to visit a set of interconnected cities, such that each city is visited exactly once (by a single salesman) while the total cost of their tours is minimized. Designed ...
In this paper we consider an extension of the classical facility location problem where besides n customers, a set of p collection depots are also given. In this setting the service of a customer consists of the travel of a server to the customer and return back to the center via a collection depot. We have analyzed the problem and showed that the collection depots problem can be transformed to...
Metabolic Syndrome (MetS) is highly prevalent and has considerable public health impact, but its underlying genetic factors remain elusive. To identify gene networks involved in MetS, we conducted whole-genome expression and genotype profiling on abdominal (ABD) and gluteal (GLU) adipose tissue, and whole blood (WB), from 29 MetS cases and 44 controls. Co-expression network analysis for each ti...
The Multiple-Depot Vehicle Scheduling Problem (MDVSP) is the problem where one wants to assign timetabled tasks to vehicles which are housed in multiple depots. This problem is highly relevant for the public transport domain, as competition grows fierce and companies need to stay competitive to survive. As solving the MDVSP optimally is difficult in practice, the aim of this thesis is to give a...
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...
this paper discusses the multi-depot vehicle routing problem of heterogeneous fleet of vehicles with time windows for perishable commodities. the objective of the problem is to minimize the total time required for servicing all customers that is equivalent to the total cost. commodities are delivered to the customers with defined time windows by a fleet of heterogeneous vehicles, which have lim...
We study the Multi-Depot Multiple Traveling Salesman Problem (MDMTSP), which is a variant of the very well-known Traveling Salesman Problem (TSP). In the MDMTSP an unlimited number of salesmen have to visit a set of customers using routes that can be based on a subset of available depots. The MDMTSP is an NPhard problem because it includes the TSP as a particular case when there is only one dep...
Logistics and supply-chain management may generate notable operational cost savings with increased reliance on shared serving of customer demands by multiple agents. However, traditional logistics planning exhibits an intrinsic limitation in modeling and implementing shared commodity delivery from multiple depots using multiple agents. In this paper, we investigate a centralized model and a heu...
Abstract In this paper, we study the recently introduced time-constrained maximal covering routing problem. problem, are given a central depot, set of facilities, and customers. Each customer is associated with subset facilities which can cover it. A feasible solution consists k Hamiltonian cycles on subsets depot. cycle must contain depot respect distance limit. The goal to maximize number cus...
abstract i the purpose of this study was to launch a thorough investigation concerning the possibility of differing orientations to the writing proficiency construct by native and non-native english speaking teacher raters. it mainly revolved around the international english language testing system (ielts) that is widely administered and employed as a measure of general proficiency in englis...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید