Winter urban traffic issues and performance present critical problems in large cities and metropolitan areas. In urban areas, there is a critical need for efficient methods for snow removal while considering the impact on the transportation infrastructure of a city. Several proposals and approaches on modeling snow removal that heuristically deals with finding solutions to this wideopen problem have been studied and published in recent years. In this paper, we developed a new mathematical model that uses the Just-In-Time (JIT) method to optimize a transportation problem. The paper’s main objective is to design a model for establishing efficient truck routes for snow removal by optimizing cost and time, which implicitly minimizes the impact on a city’s transportation infrastructure. We applied the network flow problem for snow removal to minimize time and cost of cleaning urban streets just in time. We ran several simulations of the models using the MATLAB®.

No abstract

In [12], the class of compact and extremally dinconnected spaces were studied using several investigative tools such as filters, graphs, functions, multifuctions and subsets of the space. These different approaches of investigation produced significant charecterizations and properties of this important class of spaces. In [3] we introduced three forms of generalized continuous functions by studying the class of u-continuous functions of Joseph, Kwack and Nayar [9] using the concepts of an α-set of Njastad [13]. The generalized continuous forms introduced there are: αu-continuous, semi-αu-contnuous and strongly u-continuous functions. In the present study we investigate the class of compact and extremally disconnected spaces using these generalized continuous functions.