2 research outputs found

    NEURAL NETWORK BASED VEHICULAR LOCATION PREDICTION MODEL FOR COOPERATIVE ACTIVE SAFETY SYSTEMS

    No full text
    Safety systems detect unsafe conditions and provide warnings for travellers to take action and avoid crashes. Estimation of the geographical location of a moving vehicle as to where it will be positioned next with high precision and short computation time is crucial for identifying dangers. To this end, navigational and dynamic data of a vehicle are processed in connection with the data received from neighbouring vehicles and infrastructure in the same vicinity. In this study, a vehicular location prediction model was developed using an artificial neural network for cooperative active safety systems. The model is intended to have a constant, shorter computation time as well as higher accuracy features. The performance of the proposed model was measured with a real-time testbed developed in this study. The results are compared with the performance of similar studies and the proposed model is shown to deliver a better performance than other models

    A modified genetic algorithm for a special case of the generalized assignment problem

    No full text
    Many central examinations are performed nationwide in Turkey. These examinations are held simultaneously throughout Turkey. Examinees attempt to arrive at the examination centers at the same time and they encounter problems such as traffic congestion, especially in metropolises. The state of mind that this situation puts them into negatively affects the achievement and future goals of the test takers. Our solution to minimize the negative effects of this issue is to assign the test takers to closest examination centers taking into account the capacities of examination halls nearby. This solution is a special case of the generalized assignment problem (GAP). Since the scale of the problem is quite large, we have focused on heuristic methods. In this study, a modified genetic algorithm (GA) is used for the solution of the problem since the classical GA often generates infeasible solutions when it is applied to GAPs. A new method, named nucleotide exchange, is designed in place of the crossover method. The designed method is run between the genes of a single parent chromosome. In addition to the randomness, the consciousness factor is taken into consideration in the mutation process. With this new GA method, results are obtained successfully and quickly in large-sized data sets
    corecore