Antonio D. Masegosa

A Hybrid Method for Short-Term Traffic Congestion Forecasting Using Genetic Algorithms and Cross Entropy

This paper presents a method of optimizing the elements of a hierarchy of fuzzy-rule-based systems (FRBSs). It is a hybridization of a genetic algorithm (GA) and the cross-entropy (CE) method, which is here called GACE. It is used to predict congestion in a 9-km-long stretch of the I5 freeway in California, with time horizons of 5, 15, and 30 min. A comparative study of different levels of hybridization in GACE is made. These range from a pure GA to a pure CE, passing through different weights for each of the combined techniques. The results prove that GACE is more accurate than GA or CE alone for predicting short-term traffic congestion.

A discrete firefly algorithm to solve a rich vehicle routing problem modelling a newspaper distribution system with recycling policy

A real-world newspaper distribution problem with recycling policy is tackled in this work. To meet all the complex restrictions contained in such a problem, it has been modeled as a rich vehicle routing problem, which can be more specifically considered as an asymmetric and clustered vehicle routing problem with simultaneous pickup and deliveries, variable costs and forbidden paths (AC-VRP-SPDVCFP). This is the first study of such a problem in the literature. For this reason, a benchmark composed by 15 instances has been also proposed. In the design of this benchmark, real geographical positions have been used, located in the province of Bizkaia, Spain. For the proper treatment of this AC-VRP-SPDVCFP, a discrete firefly algorithm (DFA) has been developed. This application is the first application of the firefly algorithm to any rich vehicle routing problem. To prove that the proposed DFA is a promising technique, its performance has been compared with two other well-known techniques: an evolutionary algorithm and an evolutionary simulated annealing. Our results have shown that the DFA has outperformed these two classic meta-heuristics.

GACE: A meta-heuristic based in the hybridization of Genetic Algorithms and Cross Entropy methods for continuous optimization

Abstract Metaheuristics have proven to get a good performance solving difficult optimization problems in practice. Despite its success, metaheuristics still suffers from several problems that remains open as the variability of their performance depending on the problem or instance being solved. One of the approaches to deal with these problems is the hybridization of techniques. This paper presents a hybrid metaheuristic that combines a Genetic Algorithm (GA) with a Cross Entropy (CE) method to solve continuous optimization functions. The algorithm divides the population into two sub-populations, in order to apply GA in one sub-population and CE in the other. The proposed method is tested on 24 continuous benchmark functions, with four different dimension configurations. First, a study to find the best parameter configuration is done. The best configuration found is compared with several algorithms in the literature in order to demonstrate the competitiveness of the proposal. The results shows that GACE is the best performing method for instances with high dimensionality. Statistical tests have been applied, to support the conclusions obtained in the experimentation.

Algorithm portfolio based scheme for dynamic optimization problems

AbstractSince their first appearance in 1997 in the prestigious journal Science, algorithm portfolios have become a popular approach to solve static problems. Nevertheless and despite that success, they have not received much attention in Dynamic Optimization Problems (DOPs). In this work, we aim at showing these methods as a powerful tool to solve combinatorial DOPs. To this end, we propose a new algorithm portfolio for this type of problems that incorporates a learning scheme to select, among the metaheuristics that compose it, the most appropriate solver or solvers for each problem, configuration and search stage. This method was tested over 5 binary-coded problems (dynamic variants of OneMax, Plateau, RoyalRoad, Deceptive and Knapsack) and compared versus two reference algorithms for these problems (Adaptive Hill Climbing Memetic Algorithm and Self Organized Random Immigrants Genetic Algorithm). The results showed the importance of a good design of the learning scheme, the superiority of the algorithm...

Good practice proposal for the implementation, presentation, and comparison of metaheuristics for solving routing problems

Abstract Researchers who investigate in any area related to computational algorithms (both defining new algorithms or improving existing ones) usually find large difficulties to test their work. Comparisons among different researches in this field are often a hard task, due to the ambiguity or lack of detail in the presentation of the work and its results. On many occasions, the replication of the work conducted by other researchers is required, which leads to a waste of time and a delay in the research advances. The authors of this study propose a procedure to introduce new techniques and their results in the field of routing problems. In this paper, this procedure is detailed, and a set of good practices to follow are deeply described. It is noteworthy that this procedure can be applied to any combinatorial optimization problem. Anyway, the literature of this study is focused on routing problems. This field has been chosen because of its importance in real world, and its relevance in the actual literature.

Hybridizing Genetic Algorithm with Cross Entropy for Solving Continuous Functions

In this paper, a metaheuristic that combines a Genetic Algorithm and a Cross Entropy Algorithm is presented. The aim of this work is to achieve a synergy between the capabilities of the algorithms using different population sizes in order to obtain the closest value to the optimal of the function. The proposal is applied to 12 benchmark functions with different characteristics, using different configurations.

Enhancing improved heuristic drift elimination for step-and-heading based pedestrian dead-reckoning systems

Location based services can improve the quality of patient care and increase the efficiency of the healthcare systems. Among the different technologies that provide indoor positioning, inertial sensors based pedestrian dead-reckoning (PDR) is one of the more cost-effective solutions, but its performance is limited by drift problems. Regarding the heading drift, some heuristics make use of the buildings dominant directions in order to reduce this problem. In this paper, we enhance the method known as improved heuristic drift elimination (iHDE) to be implemented in a Step-and-Heading (SHS) based PDR system, that allows to place the inertial sensors in almost any location of the users body. Particularly, wrist-worn sensors will be used. Tests on synthetically generated and real data show that the iHDE method can be used in a SHS-based PDR without losing its heading drift reduction capability.

Short-Term Traffic Congestion Forecasting Using Hybrid Metaheuristics and Rule-Based Methods: A Comparative Study

In this paper, a comparative study between a hybrid technique that combines a Genetic Algorithm with a Cross Entropy method to optimize Fuzzy Rule-Based Systems, and literature techniques is presented. These techniques are applied to traffic congestion datasets in order to determine their performance in this area. Different types of datasets have been chosen. The used time horizons are 5, 15 and 30 min. Results show that the hybrid technique improves those results obtained by the techniques of the state of the art. In this way, the performed experimentation shows the competitiveness of the proposal in this area of application.

A Novel Software Architecture for the Provision of Context-Aware Semantic Transport Information

The effectiveness of Intelligent Transportation Systems depends largely on the ability to integrate information from diverse sources and the suitability of this information for the specific user. This paper describes a new approach for the management and exchange of this information, related to multimodal transportation. A novel software architecture is presented, with particular emphasis on the design of the data model and the enablement of services for information retrieval, thereby obtaining a semantic model for the representation of transport information. The publication of transport data as semantic information is established through the development of a Multimodal Transport Ontology (MTO) and the design of a distributed architecture allowing dynamic integration of transport data. The advantages afforded by the proposed system due to the use of Linked Open Data and a distributed architecture are stated, comparing it with other existing solutions. The adequacy of the information generated in regard to the specific user’s context is also addressed. Finally, a working solution of a semantic trip planner using actual transport data and running on the proposed architecture is presented, as a demonstration and validation of the system.

A New Approach for Information Dissemination in VANETs Based on Covering Location and Metaheuristics

Vehicular Ad-Hoc Networks (VANETs) have attracted a high interest in recent years due to the huge number of innovative applications that they can enable. Some of these applications can have a high impact on reducing Greenhouse Gas emissions produced by vehicles, especially those related to traffic management and driver assistance. Many of these services require disseminating information from a central server to a set of vehicles located in a particular region. This task presents important challenges in VANETs, especially when it is made at big scale. In this work, we present a new approach for information dissemination in VANETs where the structure of the communications is configured using a model based on Covering Location Problems that it is optimized by means of a Genetic Algorithm. The results obtained over a realistic scenario show that the new approach can provide good solutions for very demanding response times and that obtains competitive results with respect to reference algorithms proposed in literature.