نتایج جستجو برای: capacitated transportation network
تعداد نتایج: 721778 فیلتر نتایج به سال:
In this study, we introduce the urban recharging infrastructure design problem with stochastic demands and capacitated recharging stations. Stochastic recharge demands shaped by daily transportation/logistics activity cycles, capacity limitations of recharging stations and users’ route preferences need to be considered simultaneously to address this urgent problem that focus on the inner city t...
nowadays, the environmental impact of transportation project and, especially air pollution impacts, are major concerns in evaluating transportation projects. based on this concern, beside definition of traditional objective functions like total travel time and total investment cost, different type of environmental related function is considered as objective function in urban network design. in ...
The objective of this work is to study optimal Vendor-Managed Inventory policies in distributions systems in which demand and delivery processes are characterized by a discreteevent dynamics. In Vendor-Managed Inventory policies, the supplier organizes the deliveries to the customer in order to satisfy its demand by minimizing transportation costs and holding costs of the customer. In the consi...
This paper presents a comprehensive survey of models and algorithms for multicommodity capacitated network design problems, which are mostly encountered in telecommunications and transportation network planning. These problems are important not only due to the major relevance of their applications, but also because they pose considerable modeling and algorithmic challenges. We present a general...
This paper deals with hub-and-spoke network design in the liner shipping sector. It introduces a capacitated directed cycle hub location and cargo routing problem under congestion. The involves four decisions: of ports; allocation non-hub ports to construction cyclic route at port level; between all origin-destination demand pairs network. objective is minimize cost which includes fixed opening...
This paper describes a Benders decomposition algorithm capable of efficiently solving large-scale instances of the well-known multi-commodity capacitated network design problem with demand uncertainty. The problem is important because it models many real-world applications, including telecommunications, transportation, and logistics. This problem has been tackled in the literature with meta-heu...
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 ...
The hub-and-spoke distribution paradigm has been a fundamental principle in geographic network design for more than 40 years. One of the primary advantages that such networks possess is their ability to exploit economies of scale in transportation by aggregating network flows through common sources. In this paper, we consider the problem of designing an optimal hub-and-spoke network in continuo...
We want to find a location of capacitated transshipment facilities which minimizes the expected total cost when the generalized transportation costs are random variables. Each generalized transportation cost is given by the sum of a deterministic transportation cost and a random transshipment facility throughput cost, whose probability distribution is unknown. A two-stage stochastic program wit...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید