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...

in this paper, we develop a freight transportation model for railway network considering hazmat transportation issue. in the transportation system considered, different customers can request for carrying hazmat and non- hazmat boxes. it is assumed that the sequence of the trains in the network is known. the objective is assigning the non-hazmat boxes and hazmat boxes to wagons of the trains so ...

Current network modeling practices usually assess the network performance at specified time interval, i.e. every 5 or 10 years time horizon. Furthermore, they are usually based on partially predictable data, which are being generated through various stochastic procedures. In this research, a new quantitative based methodology which combines combinatorial optimization modeling and transportation...

Changing the design aspects of urban form is a positive approach to improving transportation. Land use and urban design strategies have been proposed to not only to bring about changes in travel behavior but as a way of providing a better quality of life to the residents. While the research on the relationship between urban form and travel behavior has been pretty extensive, there is a clear ga...

Facility location-network design (FLND) problem, which determines the location of facilities and also communication links between the demand and facility nodes, is arisen from the combination of the facility location and network design problems. This paper deals with fuzzy capacitated facility location-network design model which aims to select the facilities and candidate links in a way that yi...