Problema de ruta de vehículos con capacidades también conocido como Vehicle Routing Problem (VRP), es uno de los problemas más difíciles y demandados de la sociedad actual. Empresas de mensajería, entrega de productos y ventas online resuelven dicho problema a diario.
Algunos algoritmos heurísticos para el Problema de Rutas de Vehículos con Capacidades
In the last few years the resolution of NLP tasks with architectures composed of neural models has taken vogue. There are many advantages to using these approaches especially because there is no need to do features engineering. In this paper, we make a survey of a Deep Learning architecture that propose a resolutive approach to some classical tasks of the NLP. The Deep Learning architecture is based on a cutting-edge model that exploits both word-level and character-level representations through the combination of bidirectional LSTM, CNN and CRF. This architecture has provided cutting-edge performance in several sequential labeling activities for the English language. The architecture that will be treated uses the same approach for the Italian language. The same guideline is extended to perform a multi-task learning involving PoS labeling and sentiment analysis. The results show that the system performs well and achieves good results in all activities. In some cases it exceeds the best systems previously developed for Italian.
How to conceal objects from electromagnetic radiation has been a hot research topic. Radar is an object detection system that uses Radio waves to determine the range, angle, or velocity. A radar transmit radio waves or microwaves that reflect from any object in their path. A receive radar is typically the same system as transmit radar, receives and processes these reflected wave to determine properties of object. Different organizations are working onto hide object from the radar in outer space. Any confidential object can be taken through space without being detected by the enemies. This calls for necessity of devising new method to conceal an object electromagnetically.
Identifying whether a degree matrix has an edge-disjoint realization is an NP-hard problem. In comparison, identifying whether a tree degree matrix has an edge-disjoint realization is easier, but the task is still challenging. In 1975, a sufficient condition for the tree degree matrices with three rows has been found, but the condition has not been improved since. This paper contains an essential part of the proof which improves the sufficient condition.