نتایج جستجو برای: time windows
تعداد نتایج: 1912785 فیلتر نتایج به سال:
This report examines the time windows used for linear prediction (LP) analysis of speech. The goal of windowing is to create frames of data each of which will be used to calculate an autocorrelation sequence. Several factors enter into the choice of window. The time and spectral properties of Hamming and Hann windows are examined. We also consider windows based on Discrete Prolate Spherical Seq...
A unified method for statistical anomaly detection in intrusion detection systems is theoretically introduced. It is based on estimating a dispersion measure of numerical or symbolic data on successive moving windows in time and finding the times when a relative change of the dispersion measure is significant. Appropriate dispersion measures, relative differences, moving windows, as well as tec...
This paper introduces a time efficient deep learning-based solution to the traveling salesman problem with window (TSPTW). Our goal is reduce total tour length traveled by -*the agent without violating any limitations. will aid in decreasing required supply type of service, as well lowering emissions produced automobiles, allowing our planet recover from air pollution emissions. The proposed mo...
Time-of-day modelling is an additional step to the conventional four-step Travel Demand Models (TDMs). Here, target obtain more detailed outputs over temporal dimension. With this step, daily (24-hour) travel demand distributed into a discrete number of time-windows.This paper aims identify most precise time windows that maximise trips fall within given time-window and minimise trip-tailing ass...
in this paper, we introduce a model to optimization of milk run system that is one of vrp problem with time window and uncertainty in inventory. this approach led to the routes with minimum cost of transportation while satisfying all inventory in a given bounded set of uncertainty .the problem is formulated as a robust optimization problem. since the resulted problem illustrates that grows up ...
a hybrid meta-heuristic approach for the capacitated location-routing problem with hard time windows
the capacitated location-routing problem (clrp) is a new research area in logistics and distribution management. this problem combines two difficult problems: the facility location problem (flp) and vehicle routing problem (vrp). the goal of the clrp is to open a subset of depots, assign the customers into open facilities, and then design vehicle tours in order to minimize the total cost. the t...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید