Search

Automobile security became an essential theme over the last years, and some automakers invested much money for collision avoidance systems, but personalization of their driving systems based on the user's behavior was not explored in detail. Furthermore, efficiency gains could be had with tailored systems. In Mexico, 80% of automobile accidents are caused by human beings; the remaining 20% are related to other issues such as mechanical problems. Thus, 80% represents a significant opportunity to improve safety and explore driving efficiency gains. Moreover, when driving aggressively, it could be connected with mental health as a post-traumatic stress disorder. This paper proposes a Tailored Collision Mitigation Braking System, which evaluates the driver's personality driving treats through signal detection theory to create a cognitive map that understands the driving personality of the driver. In this way, aggressive driving can be detected; the system is then trained to recognize the personality trait of the driver and select the appropriate stimuli to achieve the optimal driving output. As a result, when aggressive driving is detected continuously, an automatic alert could be sent to the health specialists regarding particular risky behavior linked with mental problems or drug consumption. Thus, the driving profile test could also be used as a detector for health problems. [ABSTRACT FROM AUTHOR]

We propose an approximation algorithm for scheduling jobs with release and delivery times on a single machine with the objective to minimize the makespan. The algorithm is based on an implicit enumeration of the set of complete solutions in a search tree. By analyzing specific structural properties of the solutions created in each branch of the solution tree, a certain approximation factor of each solution from that branch is calculated. Our algorithm guarantees approximation factor 1 + 1 / κ for a generated solution if there are κ jobs with a specified property in that solution (typically, the longer the length of the path from the root to the node representing that solution in the solution tree, the larger the κ value). We have carried out an extensive computational study to verify the practical performance of our algorithm and the effectiveness of the approximation factor provided by us. While our problem instances are generated randomly, we have discarded a considerable number of the instances, ones which were already solved optimally by the earlier known dominance rules. For the vast majority of the tested problem instances, within a short running time of our algorithm parameter κ becomes sufficiently large so that the approximation factor which the algorithm guarantees becomes better than that provided by the earlier known approximation algorithms. [ABSTRACT FROM AUTHOR]

The Traveling Salesman Problem (TSP) aims at finding the shortest trip for a salesman, who has to visit each of the locations from a given set exactly once, starting and ending at the same location. Here, we consider the Euclidean version of the problem, in which the locations are points in the two-dimensional Euclidean space and the distances are correspondingly Euclidean distances. We propose simple, fast, and easily implementable heuristics that work well, in practice, for large real-life problem instances. The algorithm works on three phases, the constructive, the insertion, and the improvement phases. The first two phases run in time O (n 2) and the number of repetitions in the improvement phase, in practice, is bounded by a small constant. We have tested the practical behavior of our heuristics on the available benchmark problem instances. The approximation provided by our algorithm for the tested benchmark problem instances did not beat best known results. At the same time, comparing the CPU time used by our algorithm with that of the earlier known ones, in about 92% of the cases our algorithm has required less computational time. Our algorithm is also memory efficient: for the largest tested problem instance with 744,710 cities, it has used about 50 MiB, whereas the average memory usage for the remained 217 instances was 1.6 MiB. [ABSTRACT FROM AUTHOR]