نتایج جستجو برای: objective vehicle routing problem vrp is studied based on observations in real
تعداد نتایج: 19783189 فیلتر نتایج به سال:
Vehicle Routing Problem (VRP) has become an integral part in logistic operations which determines optimal routes for several vehicles to serve customers. The basic version of VRP is Capacitated VRP (CVRP) which considers equal capacities for all vehicles. The objective of CVRP is to minimize the total traveling distance of all vehicles to serve all the customers. Various methods are used to sol...
In this paper, a novel methodology is proposed to solve a cooperative multi-depot vehicle routing problem. We establish a mathematical model for multi-owner VRP in which each owner (i.e. player) manages single or multiple depots. The basic idea consists of offering an option that owners cooperatively manage the VRP to save their costs. We present cooperative game theory techniques for cost savi...
in the area of automotive engineering there is a tendency to more electrification of power train. in this work control of an induction machine for the application of electric vehicle is investigated. through the changing operating point of the machine, adapting the rotor magnetization current seems to be useful to increase the machines efficiency. in the literature there are many approaches wh...
A key element of many distribution systems is the routing and scheduling of vehicles through a set of nodes requiring service. The Vehicle Routing Problem (VRP) can be defined as a problem of finding the optimal routes of delivery or collection from one or several depots to a number of cities or customers, while satisfying some constraints. In many practical situations, however, the vehicle is ...
growing demands and requires of high data rate systems cause significant increase of high frequency systems for wideband communication applications. as mixers are one of the main blocks of each receivers and its performance has great impact on receiver’s performance; in this thesis, a new solution for ku-band (12-18 ghz) mixer design in tsmc 0.18 µm is presented. this mixer has high linearity a...
This paper introduces the Spaceelling Curve with Optimal Partitioning (SFC OP) heuristic strategy for producing solutions to the Vehicle Routing Problem (VRP). This heuristic has the property that it generates good routes extremely quickly and the time required increases nearly linearly with problem size. Additionally, the SFC OP heuristic can easily be modiied to generate routes to VRP formula...
despite the different criticisms on contrastive analysis it has been proved that the results of it(when processed) can be useful in a tefl environment, specially at the level of phonology.this study is an attempt to compare and contrast the sound systems of kurdish and english for pedagogical aims.the consonants,vowels,stress and intonation of the two languages are described by the same model...
The competitive vehicle routing problem is one of the important issues in transportation area. In this paper a new method for competitive VRP with time windows and stochastic demand is introduced. In the presented method a three time bounds are given and the probability of arrival time between each time bound is assumed to be uniform. The demands of each customer are different in each time wind...
In our previous research, we compared the actual route recorded by a GPS device “PhotoTrackr” and the optimal vehicle route derived by using ArcGIS Network Analyst tool. VRP is the fundamental problem in the research fields of transportation, we focus on variations of CVRPTW (Capacitated VRP with Time Windows). Various types of VRP are studied to determine the optimal route under various constr...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید