Through the analysis of the relationship between current intelligence transportation and large data, after the theory of granular computing concepts involved in preliminary studies, For the current data mining of intelligent transportation ,we presents a Data Mining Model Of Intelligent Transportation Based on Granular Computing. Utilizing granular computing in data mining theory advantages, th...

this paper proposes a new mathematical model for designing and planning postal parcels carriage and postal networks. the objective of postal network designing is to determine the location, size and connection between the postal stations in a city, province or country. in this paper, a kind of multiple locations-allocations hub problem with limited capacity in collecting, distributing and broadc...

In Iran, more than 94% of transportation is road transportation. The goal this article to assess and rate companies 31 country provinces determine the effect integrating six sigma DMAIC cycle dynamic data envelopment analysis (DDEA) on effective inputs outputs. BCC output-oriented has been changed model. According conducted sensitivity in improvement phase, it determined what changes should be ...

hub covering location problem, network design,   single machine scheduling, genetic algorithm,   shuffled frog leaping algorithm   hub location problems (hlp) are synthetic optimization problems that appears in telecommunication and transportation networks where nodes send and receive commodities (i.e., data transmissions, passengers transportation, express packages, postal deliveries, etc.) th...

Walking, as an important transportation mode, plays a large part in urban transportation systems. This mode is of great importance for planners and decision-makers because of its impact on environmental and health aspects of communities. However, this mode is so complex in nature that makes it difficult to study or model. On the other hand, chaos theory studies complex dynamical nonlinear syste...

In this paper, we study the fixed charge transportation problem with uncertain variables. The fixed charge transportation problem has two kinds of costs: direct cost and fixed charge. The direct cost is the cost associated with each source-destination pair, and the fixed charge occurs when the transportation activity takes place in the corresponding source-destination pair. The uncertain fixed ...

This thesis extends the previous literature on urban subcenter formation by introducing congestion cost of transportation. A new model is constructed to analyze the efficiency of private decision about firm decentralization with the presence of unpriced transportation congestion. The model features a linear city with provision of transportation infrastructure oriented toward carrying workers to...

in this article we present an algorithm for converting a network problem with several sources and several sinks including several transfer nodes and condition of supplying the demand of any sink from a particular source to the transportation problem.  towards this end, and considering the very special structure of transportation algorithm, after implementing the shortest path algorithm or solvi...

This paper studies the modeling theories and simulation methods for railway transportation system. The railway transportation system is a typical temporal-spatial dynamic system. Recently the method with temporal-spatial computation characteristics, Cellular Automata, is often used for road traffic flow research, but it’s homogeneity restricting make it impossible to modeling railway transporta...

This paper investigates an uncertain bicriteria solid transportation problem. The supplies, demands, conveyance capacities, transportation cost and transportation time are regarded as uncertain variables. According to two types of methods to rank the uncertain variables, expected value goal programming model and chance-constrained goal programming model for the bicriteria solid transportation p...