نتایج جستجو برای: stochastic dynamic location

تعداد نتایج: 733250  

2010
David Allingham Robert A.R. King

We investigate analytical cost distributions in the setting of a dynamic stochastic scheduling problem where customers are served from a central location within some given time-frame, for the case where customer locations are uniformly distributed on the boundary of the unit circle. Two distance metrics are considered and analytical expressions for the distribution of the resulting costs are de...

In this paper, a stochastic programming approach is applied to the airline network revenue management problem. The airline network with the arc capacitated single hub location problem based on complete–star p-hub network is considered. We try to maximize the profit of the transportation company by choosing the best hub locations and network topology, applying revenue management techniques to al...

  In this paper, we present the stochastic version of Maximal Covering Location Problem which optimizes both location and allocation decisions, concurrently. It’s assumed that traveling time between customers and distribution centers (DCs) is uncertain and described by normal distribution function and if this time is less than coverage time, the customer can be allocated to DC. In classical mod...

Mahdi Bashiri Mohsen Yahyaei

The hub location problem arises in a variety of domains such as transportation and telecommunication systems. In many real-world situations, hub facilities are subject to disruption. This paper deals with the multiple allocation hub location problem in the presence of facilities failure. To model the problem, a two-stage stochastic formulation is developed. In the proposed model, the number of ...

Journal: :Math. Program. 2004
Michael C. Ferris Meta M. Voelker

Radiotherapy treatment is often delivered in a fractionated manner over a period of time. Emerging delivery devices are able to determine the actual dose that has been delivered at each stage facilitating the use of adaptive treatment plans that compensate for errors in delivery. We formulate a model of the day-to-day planning problem as a stochastic program and exhibit the gains that can be ac...

2006
Tsung-Han Chiang Mehmet Serkan Apaydin Douglas L. Brutlag David Hsu Jean-Claude Latombe

This paper presents a new method for studying protein folding kinetics. It uses the recently introduced Stochastic Roadmap Simulation (SRS) method to estimate the transition state ensemble (TSE) and predict the rates and Φ-values for protein folding. The new method was tested on 16 proteins. Comparison with experimental data shows that it estimates the TSE much more accurately than an existing ...

2007
Seda Tepe Fikri Karaesmen

Demand information can easily be shared in advance with the use of the latest technologies in the supply chain. Advance demand information can be used to compensate demand uncertainty and decrease inventory costs. In order to benefit from advance demand information, it should be effectively integrated into the system. In this paper, we examine a production-inventory system with multiple classes...

Journal: :European Journal of Operational Research 2000
Andrew B. Philpott Mark Craddock Hamish Waterer

Hydro-electric power utilities convert the potential energy of water to electricity through the operation of generation turbines. Each turbine unit has an operating range and incurs a fixed start-up cost. The problem of determining which turbines should be operating at any point during the day whilst ensuring that the demand for electricity is satisfied is known as the unit commitment problem. ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید