Search

Coherent states, known as displaced vacuum states, play an important role in quantum information processing, quantum machine learning, and quantum optics. In this article, two ways to digitally prepare coherent states in quantum circuits are introduced. First, we construct the displacement operator by decomposing it into Pauli matrices via ladder operators, i.e., creation and annihilation operators. The high fidelity of the digitally generated coherent states is verified compared with the Poissonian distribution in Fock space. Secondly, by using Variational Quantum Algorithms, we choose different ansatzes to generate coherent states. The quantum resources—such as numbers of quantum gates, layers and iterations—are analyzed for quantum circuit learning. The simulation results show that quantum circuit learning can provide high fidelity on learning coherent states by choosing appropriate ansatzes. [ABSTRACT FROM AUTHOR]

Evolutionary computation has largely exhibited its potential to complement conventional learning algorithms in a variety of machine learning tasks, especially those related to unsupervised (clustering) and supervised learning. It has not been until lately when the computational efficiency of evolutionary solvers has been put in prospective for training reinforcement learning models. However, most studies framed so far within this context have considered environments and tasks conceived in isolation, without any exchange of knowledge among related tasks. In this manuscript we present A-MFEA-RL, an adaptive version of the well-known MFEA algorithm whose search and inheritance operators are tailored for multitask reinforcement learning environments. Specifically, our approach includes crossover and inheritance mechanisms for refining the exchange of genetic material, which rely on the multilayered structure of modern deep-learning-based reinforcement learning models. In order to assess the performance of the proposed approach, we design an extensive experimental setup comprising multiple reinforcement learning environments of varying levels of complexity, over which the performance of A-MFEA-RL is compared to that furnished by alternative nonevolutionary multitask reinforcement learning approaches. As concluded from the discussion of the obtained results, A-MFEA-RL not only achieves competitive success rates over the simultaneously addressed tasks, but also fosters the exchange of knowledge among tasks that could be intuitively expected to keep a degree of synergistic relationship. [ABSTRACT FROM AUTHOR]

The articles in this special section focus on data driven optimization for transportation and smart mobility applications. We live in an era of major societal and technological changes. Transportation de-carbonization and postindustrial demographic trends, such as massive migrations and an aging society, generate new challenges for cities, making the efficient and sustainable management of services and resources more necessary than ever. Cities must evolve, transform, and become smart to cope with these realities. According to the literature, a city can be referred to as smart when investments in human and social capital and traditional (transportation) and modern [information and communications technology (ICT)] communication infrastructure fuel sustainable economic growth and high quality of life, with a wise management of natural resources, through participatory government. [ABSTRACT FROM AUTHOR]

This paper addresses a multiattribute vehicle routing problem, the rich vehicle routing problem, with time constraints, heterogeneous fleet, multiple depots, multiple routes, and incompatibilities of goods. Four different approaches are presented and applied to 15 real datasets. They are based on two meta‐heuristics, ant colony optimization (ACO) and genetic algorithm (GA), that are applied in their standard formulation and combined as hybrid meta‐heuristics to solve the problem. As such ACO‐GA is a hybrid meta‐heuristic using ACO as main approach and GA as local search. GA‐ACO is a memetic algorithm using GA as main approach and ACO as local search. The results regarding quality and computation time are compared with two commercial tools currently used to solve the problem. Considering the number of customers served, one of the tools and the ACO‐GA approach outperforms the others. Considering the cost, ACO, GA, and GA‐ACO provide better results. Regarding computation time, GA and GA‐ACO have been found the most competitive among the benchmark. [ABSTRACT FROM AUTHOR]

This paper capitalizes on the increasingly high relevance gained by data-intensive technologies in the development of intelligent transportation system, which calls for the progressive adoption of adaptive, self-learning methods for solving modeling, simulation, and optimization problems. In this regard, certain mechanisms and processes observed in nature, including the animal brain, have proved themselves to excel not only in terms of efficiently capturing time-evolving stimuli, but also at undertaking complex tasks by virtue of mechanisms that can be extrapolated to computer algorithms and methods. This paper comprehensively reviews the state-of-the-art around the application of bioinspired methods to the challenges arising in the broad field of intelligent transportation system (ITS). This systematic survey is complemented by an initiatory taxonomic introduction to bioinspired computational intelligence, along with the basics of its constituent techniques. A focus is placed on which research niches are still unexplored by the community in different ITS subareas. The open issues and research directions for the practical implementation of ITS endowed with bioinspired computational intelligence are also discussed in detail. [ABSTRACT FROM AUTHOR]

The evolution of the IoT (Internet of Things) paradigm applied to new scenarios as VANETs (Vehicular Ad Hoc Networks) has gained momentum in recent years. Both academia and industry have triggered advanced studies in the IoV (Internet of Vehicles), which is understood as an ecosystem where different types of users (vehicles, elements of the infrastructure, pedestrians) are connected. How to efficiently share the available radio resources among the different types of eligible users is one of the important issues to be addressed. This paper briefly analyzes various concepts presented hitherto in the literature and it proposes an enhanced algorithm for ensuring a robust co-existence of the aforementioned system users. Therefore, this paper introduces an underlay RRM (Radio Resource Management) methodology which is capable of (1) improving cellular spectral efficiency while making a minimal impact on cellular communications and (2) ensuring the different QoS (Quality of Service) requirements of ITS (Intelligent Transportation Systems) applications. Simulation results, where we compare the proposed algorithm to the other two RRM, show the promising spectral efficiency performance of the proposed RRM methodology. [ABSTRACT FROM AUTHOR]

This paper describes a new cooperative Intelligent Transportation System architecture that aims to enable collaborative sensing services. The main goal of this architecture is to improve transportation efficiency and performance. The system, which has been proven within the participation in the ICSI (Intelligent Cooperative Sensing for Improved traffic efficiency) European project, encompasses the entire process of capture and management of available road data. For this purpose, it applies a combination of cooperative services and methods for data sensing, acquisition, processing and communication amongst road users, vehicles, infrastructures and related stakeholders. Additionally, the advantages of using the proposed system are exposed. The most important of these advantages is the use of a distributed architecture, moving the system intelligence from the control centre to the peripheral devices. The global architecture of the system is presented, as well as the software design and the interaction between its main components. Finally, functional and operational results observed through the experimentation are described. This experimentation has been carried out in two real scenarios, in Lisbon (Portugal) and Pisa (Italy). [ABSTRACT FROM AUTHOR]

Bat algorithm is a population metaheuristic proposed in 2010 which is based on the echolocation or bio-sonar characteristics of microbats. Since its first implementation, the bat algorithm has been used in a wide range of fields. In this paper, we present a discrete version of the bat algorithm to solve the well-known symmetric and asymmetric Traveling Salesman Problems. In addition, we propose an improvement in the basic structure of the classic bat algorithm. To prove that our proposal is a promising approximation method, we have compared its performance in 37 instances with the results obtained by five different techniques: evolutionary simulated annealing, genetic algorithm, an island based distributed genetic algorithm, a discrete firefly algorithm and an imperialist competitive algorithm. In order to obtain fair and rigorous comparisons, we have conducted three different statistical tests along the paper: the Student׳s t -test, the Holm׳s test, and the Friedman test. We have also compared the convergence behavior shown by our proposal with the ones shown by the evolutionary simulated annealing, and the discrete firefly algorithm. The experimentation carried out in this study has shown that the presented improved bat algorithm outperforms significantly all the other alternatives in most of the cases. [ABSTRACT FROM AUTHOR]

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. [ABSTRACT FROM PUBLISHER]

Recently, systems have become more flexible and smarter in their implementation and functions. Post-processing involves automatic post editing and the application of various strategies during decoding in the translation process. Park et al. propose a software that can be applied to natural language processing (NLP) by way of pre-processing and post-processing. The purpose of these papers is to share research ideas surrounding algorithm development and data processing and analysis for smart systems. [Extracted from the article]