in order to recognize isfahan weather types, in this research 22 variables including temperature, precipitation, atmospheric humidity and wind were studied in isfahan synoptic station from dey,11th,1339(january,1st,1960) to dey,11th,1383 (december,31st,2004). a cluster analysis on the euclidean distance of standardized matrix of data and linking days on the basis of ward method showed that isfa...

15 Rice cleaning I 16 Wheat grinding Strong on left 28th, 29th; windy 30th. High wind 6th, 10th, llth; calm 12th. Calm weather. Ditto. Nov. 29th windy ; 30tli calm. Windy two days previously. Calm after wind on llth, 12tli Feb. Windy on 14th, 15th, 16th. 2nd Mar. windy; 3rd fine; 4th windy. Ditto. May 4th?6th very windy. May 24th, 25th windy. May 2dth, windy. June 3rd, 4th sultry ; June 5th, hi...

The windy postman problem is the NP-hard problem of finding the minimum cost of a tour traversing all edges of an undirected graph, where the cost of traversal of an edge depends on the direction. Given an undirected graph G, we consider the polyhedron O(G) induced by the linear programming relaxation of a well-known integer programming formulation of the problem. We say that G is windy postman...

We provide a flexible graph architecture, and an implementation of solvers to some of the most ubiquitous problems in the field of Arc Routing, (The Chinese Postman Problem on undirected, directed, mixed, and windy graphs, as well as the Rural Postman Problem on directed and windy graphs). The project is completed in java, is open source, and is hosted at https://github.com/Olibear/ArcRoutingLi...

Given the edges of a graph, the postman problem consists of determining for a vehicle (postman) a shortest route that traverses all edges at least once. Each edge can be traversed in either direction and, when an edge is traversed more than once, the vehicle is said to be deadheading after its first traversal. The rural postman problem is the same as the postman problem except that the edges ar...

On the premise that urban heat islands are strongest in calm conditions but are largely absent in windy weather, daily minimum and maximum air temperatures for the period 1950–2000 at a worldwide selection of land stations are analyzed separately for windy and calm conditions, and the global and regional trends are compared. The trends in temperature are almost unaffected by this subsampling, i...

In this paper we deal with the Windy Rural Postman Problem. This problem generalizes several important Arc Routing Problems and has interesting real-life applications. Here, we present several heuristics whose study has lead to the design of a Scatter Search algorithm for the Windy Rural Postman Problem. Extensive computational experiments over different sets of instances, with sizes up to 988 ...