This paper studies the problem of scheduling a finite set of customers with stochastic service times for a single-server system. The objective is to minimize the waiting time of customers, the idle time of the server, and the lateness of the schedule. Because of the NP-hardness of the problem, the optimal schedule is notoriously hard to derive with reasonable computation times. Therefore, we develop a simulation based K-steps look-ahead selection method which can result in nearly optimal schedules within reasonable computation times. Furthermore, we study the different distributed service times, e.g., Exponential, Weibull and lognormal distribution and the results show that the proposed algorithm can obtain better results than the lag order approximation method proposed by Vink et al. (2015) [Vink, W., Kuiper, A., Kemper, B., & Bhulai, S. (2015). Optimal appointment scheduling in continuous time: The lag order approximation method. European Journal of Operational Research, 240(1), 213-219.]. Finally, a realistic appointment scheduling includes experiments to verify the good performance of the proposed method.

Poor urban planning and traffic congestion lead to excessive delays in workers’ transit times and decrease their quality of life, especially in emerging countries. Several medium and large companies have a need to hire a transport service for their staff. In this type of transportation system, there is a heterogeneous fleet of vehicles, which are assigned to a set of predefined routes. However, the total transport delay can be even greater if the private transportation system is inefficient or not controlled. The approach proposed in this study seeks to optimize the private transport service by defining the best allocation of its fleet to its routes. A mathematical model is proposed to minimize user wait times. This approach is validated using real data obtained from a transport company in Co-lombia. The results demonstrate the quantitative benefits that can be achieved when the proposed approach is implemented, represented by a considerable reduction in user wait times.

Clustering is one of the most common unsupervised data mining classification techniques for splitting objects into a set of meaningful groups. However, the traditional k-means algorithm is not applicable to retrieve useful information / clusters, particularly when there is an overwhelming growth of multidimensional data. Therefore, it is necessary to introduce a new strategy to determine the optimal number of clusters. To improve the clustering task on high dimensional data sets, the distance based k-means algorithm is proposed. The proposed algorithm is tested using eighteen sets of normal and non-normal multivariate simulation data under various combinations. Evidence gathered from the simulation reveal that the proposed algorithm is capable of identifying the exact number of clusters.

In the dynamic field of cybersecurity within intelligent vehicle systems, the sophistication of threats necessitates continual advancements in security technologies. Traditional Network Intrusion Detection Systems (NIDS) often fall short in detecting emerging and sophisticated intrusion methods, primarily due to their reliance on static datasets that fail to capture the nuanced dynamics and complexity of modern network intrusions. This study presents a sophisticated simulation for NIDS tailored to intelligent vehicle environments, utilizing the extensive capabilities of Scapy—a robust network manipulation tool—to generate a highly accurate dataset of network traffic reflective of real-world scenarios. We created a diverse dataset involving 100,000 network flows, covering a wide array of benign, malicious, and anomalous traffic patterns, to thoroughly evaluate the detection capabilities of our proposed system. This dataset was analyzed using a deep learning framework employing a Convolutional Neural Network (CNN), which demonstrated outstanding performance metrics: an accuracy of 99.08%, precision of 98.96%, recall of 99.11%, and an F1 score of 99.03%. These metrics showcase the system's enhanced capability to precisely classify various network flows, emphasizing the importance of realistic synthetic data in boosting the training and accuracy of NIDS in intelligent vehicles. The results of this research are significant, marking a step forward towards more flexible and preemptive security measures for intelligent vehicles, and effectively narrowing the gap between simulation-based testing and real-world network environments.

This paper compares and evaluates the performance of five different conventional job selection dis-patching rules for scheduling of multi-load automatic guided vehicles (AGVs) serving for material handling operations in variable sized flexible manufacturing system (FMS) layout. Four sizes of FMS layout are considered for the performance evaluation of the five types of conventional job se-lection dispatching rules. The FMS layouts under consideration are served by the two multi-load AGVs. The multi-load AGVs cruises under machine initiated the nearest vehicle (NV) dispatching rule for the material handling activities at all work centers (WCs) for all four sizes of FMS layout. Four sizes of FMS layout produce five different types of parts and consist of three, six, nine and twelve work centers and loading-unloading centers, respectively. In the simulation test, it is found that the identical destination first (IDF) job selection rule having selection criterion based on the destination similarity of two picked up jobs outperforms all other job selection dispatching rules for an overall production rate of the FMS (parts/hr) in all four FMS layouts.

Manufacturing systems need to be able to work under the dynamic and uncertain production environment. Machine and routing flexibility combined with preventive maintenance actions can improve the performance of the manufacturing systems under dynamic conditions. This paper evaluates different levels of machine and routing flexibility combined with different degrees of preventive maintenance policy. The performance measures considered are throughput, work in process and throughput. The performance measures are compared with a system without any flexibility and no preventive maintenance actions. Different levels of flexibility and preventive maintenance actions are examined under a simulation environment. The simulation results highlight more important factors for the performance measures and the best combination of the factors to improve the performance.

The research discusses in this paper concerns the improvement allocation policies to reduce the process time in job-shop manufacturing systems. The policies proposed are based on the evaluation of the workload control of the entire manufacturing system. Three policies are proposed: centralized, distributed and proportional. A simulation model is used to test the proposed policies under different conditions as: static and dynamic demand; introduction of machine breakdowns; different level of average manufacturing system utilization. The performance measures are compared to a manufacturing system without policies. The simulation results show that the improvement allocation allows to improve the performance with limited investment (average reduction of process time needed) and how the machine breakdowns and demand changes lead to different better policy. The decision maker can use these results to decide the better policy to use.

One time series model developed to predict economic data is Spatial Vector Autoregressive with Exogenous Variables (SpVARX). This model can accommodate simultaneously the interrelationships between variables, the impact of exogenous variables, and Inter-regional linkages. However, this model has not adjusted the nonlinearity relationships between variables. The relationship between economic variables is usually not linear. Therefore, we introduce the Threshold Spatial Vector Autoregressive with exogenous variables (TSpVARX). This paper assesses the forecasting performance of TSpVARX and compares it with SpVARX models. We conducted a simulation study by generating 100 times the simulation data with twelve scenarios. We found that the forecasting performance of the TSpVARX model is better than SpVARX when there is a nonlinear relationship between variables. In addition, we find that the forecasting performance of TSpVARX models will improve as the sample size increases.

This paper presents the case study of fuzzy statistical process control which has been simulated for variable and discontinuous production within a particular time frame in a key manufacturing work-shop. In order to reduce waste production and increase productivity, dimensional inspection from raw product is categorized into three groups: product of type A, product of type B, and discard. In first part, the appearance characteristics of product is defined as fuzzy membership function as the input of the system in order to allocate the output obtained from fuzzy inference of product to one of the three quality levels. Afterwards, each quality level is assigned to its own group by means of Monte Carlo simulation techniques. In the second part, with fuzzy development of a multinomial p chart, the production process is illustrated as a control chart within the particular period of time.

In this research a new electronic based mechanism for vehicle suspension system is designd. The aims are to improve passengers’ safety and comfort. The proposed system is developed for proactive rapid reaction of suspension system which can readjust the height of chassis while confronting with wrong conditions of driving such as unflatted road, rainy or snowy road profile. The results show that the proposed mechanism can successfully increase the stability of the car by readjusting the height of the the chassis and center of the gravity of vehicle while turning.