A Low Cost Automated Weather Station for Real Time Local Measurements

In this paper, we present an automated weather station for real time and local measurements, based on an embedded system that continuously measures several weather factors such as temperature, humidity, barometric pressure, wind speed, wind direction, and rainfall. This weather station consists of two parts which are located indoor and outdoor and connected together wirelessly. The outdoor weather station measures the current temperature, humidity, barometric pressure, wind speed, wind direction and recent rain amount. The indoor station displays the outdoor reading as well as the temperature and humidity for the room it is located in, on a graphic liquid crystal display. In addition, this weather information can be accessed from any place through an iOS and Android application called Blynk

Improved Genetic and Simulating Annealing Algorithms to Solve the Traveling Salesman Problem Using Constraint Programming

The Traveling Salesman Problem (TSP) is an integer programming problem that falls into the category of NP-Hard problems. As the problem become larger, there is no guarantee that optimal tours will be found within reasonable computation time. Heuristics techniques, like genetic algorithm and simulating annealing, can solve TSP instances with different levels of accuracy. Choosing which algorithm to use in order to get a best solution is still considered as a hard choice. This paper suggests domain reduction as a tool to be combined with any meta-heuristic so that the obtained results will be almost the same. The hybrid approach of combining domain reduction with any meta-heuristic encountered the challenge of choosing an algorithm that matches the TSP instance in order to get the best results

An Improved Clarke and Wright Algorithm to Solve the Capacitated Vehicle Routing Problem

This paper proposes an effective hybrid approach that combines domain reduction with the Clarke and Wright algorithm to solve the capacitated vehicle routing problem. The hybrid approach is applied to solve 10 benchmark capacitated vehicle routing problem instances. The dimension of the instances was between 21 to 200 customers. The results show that domain reduction can improve the classical Clarke and Wright algorithm by about 18%. The hybrid approach improves the large instances significantly in comparison with the smaller size instances. This paper will not show the time taken to solve each instance, as the Clarke and Wright algorithm and the hybrid approach took almost the same CPU time