Un modelo para resolver el problema dinámico de despacho de vehículos con incertidumbre de clientes y con tiempos de viaje en arcos

Indexación: Web of Science; ScieloIn a real world case scenario, customer demands are requested at any time of the day requiring services that are not known in advance such as delivery or repairing equipment. This is called Dynamic Vehicle Routing (DVR) with customer uncertainty environment. The link travel time for the roadway network varies with time as traffic fluctuates adding an additional component to the dynamic environment. This paper presents a model for solving the DVR problem while combining these two dynamic aspects (customer uncertainty and link travel time). The proposed model employs Greedy, Insertion, and Ant Colony Optimization algorithms. The Greedy algorithm is utilized for constructing new routes with existing customers, and the remaining two algorithms are employed for rerouting as new customer demands appear. A real world application is presented to simulate vehicle routing in a dynamic environment for the city of Taipei, Taiwan. The simulation shows that the model can successfully plan vehicle routes to satisfy all customer demands and help managers in the decision making process.En un escenario real, los pedidos de los clientes son solicitados a cualquier hora del día requiriendo servicios que no han sido planificados con antelación tales como los despachos o la reparación de equipos. Esto es llamado ruteo dinámico de vehículos (RDV) considerando un ambiente con incertidumbre de clientes. El tiempo de viaje en una red vial varía con el tiempo a medida que el tráfico vehicular fluctúa agregando una componente adicional al ambiente dinámico. Este artículo propone un modelo para resolver el problema RDV combinando estos dos aspectos dinámicos. El modelo propuesto utiliza los algoritmos Greedy, Inserción y optimización basada en colonias de hormigas. El algoritmo Greedy es utilizado para construir nuevas rutas con los clientes existentes y los otros dos algoritmos son usados para rutear vehículos a medida que surjan nuevos clientes con sus respectivos pedidos. Además, se presenta una aplicación real para simular el ruteo vehicular en un ambiente dinámico para la ciudad de Taipei, Taiwán. Esta simulación muestra que el modelo es capaz de planificar exitosamente las rutas vehiculares satisfaciendo los pedidos de los clientes y de ayudar los gerentes en el proceso de toma de decisiones.http://ref.scielo.org/3ryfh

Neuro-evolution search methodologies for collective self-driving vehicles

Recently there has been an increasing amount of research into autonomous vehicles for real-world driving. Much progress has been made in the past decade with many automotive manufacturers demonstrating real-world prototypes. Current predictions indicate that roads designed exclusively for autonomous vehicles will be constructed and thus this thesis explores the use of methods to automatically produce controllers for autonomous vehicles that must navigate with each other on these roads. Neuro-Evolution, a method that combines evolutionary algorithms with neural networks, has shown to be effective in reinforcement-learning, multi-agent tasks such as maze navigation, biped locomotion, autonomous racing vehicles and fin-less rocket control. Hence, a neuro-evolution method is selected and investigated for the controller evolution of collective autonomous vehicles in homogeneous teams. The impact of objective and non-objective search (and a combination of both, a hybrid method) for controller evolution is comparatively evaluated for robustness on a range of driving tasks and collection sizes. Results indicate that the objective search was able to generalise the best on unseen task environments compared to all other methods and the hybrid approach was able to yield desired task performance on evolution far earlier than both approaches but was unable to generalise as effectively over new environments

Data analytics in SDN and NFV: Techniques and Challenges

Software defined networking and network function virtualization are drawing huge attention from researchers both in industry and academia. NFV reduces the capital and opera- tional expenditure of the organization by decoupling the network functions from physical hardware on which they run, which poses new challenges in the perspective of network management such as data management, resource management and performance analysis. Consequentially, novel techniques and strategies are required to address these challenges in efficient way. This paper discusses the most widely used data analytics techniques like machine learning and time series data analysis. Further it describes the review of data mining tools and frameworks. Machine learning helps to overcome the challenges of network management by providing intelligence in network. Hence, in this paper we describe an overview of high level architecture of machine learning analysis framework, the challenges of applying machine learning algorithms in virtual environment and also some of the interesting problems of network management which can be solved by using machine learning

A Survey of Prediction and Classification Techniques in Multicore Processor Systems

In multicore processor systems, being able to accurately predict the future provides new optimization opportunities, which otherwise could not be exploited. For example, an oracle able to predict a certain application\u27s behavior running on a smart phone could direct the power manager to switch to appropriate dynamic voltage and frequency scaling modes that would guarantee minimum levels of desired performance while saving energy consumption and thereby prolonging battery life. Using predictions enables systems to become proactive rather than continue to operate in a reactive manner. This prediction-based proactive approach has become increasingly popular in the design and optimization of integrated circuits and of multicore processor systems. Prediction transforms from simple forecasting to sophisticated machine learning based prediction and classification that learns from existing data, employs data mining, and predicts future behavior. This can be exploited by novel optimization techniques that can span across all layers of the computing stack. In this survey paper, we present a discussion of the most popular techniques on prediction and classification in the general context of computing systems with emphasis on multicore processors. The paper is far from comprehensive, but, it will help the reader interested in employing prediction in optimization of multicore processor systems