نتایج جستجو برای: stochastic demands

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

An integrated model considers all parameters and elements of different deficiencies in one problem. This paper presents a new integrated model of a supply chain that simultaneously considers facility location, vehicle routing and inventory control problems as well as their interactions in one problem, called location-routing-inventory (LRI) problem. This model also considers stochastic demands ...

Journal: :journal of quality engineering and production optimization 2015
nima hamta mohammad fattahi mohsen akbarpour shirazi behrooz karimi

in today’s competitive business environment, the design and management of supply chainnetwork is one of the most important challenges that managers encounter. the supply chain network shouldbe designed for satisfying of customer demands as well as minizing the total system costs. this paper presentsa multi-period multi-stage supply chain network design problem under demand uncertainty. the prob...

Journal: :Operations Research 1993
Dimitris Bertsimas Garrett J. van Ryzin

In [9] we introduced and analyzed a model for stochastic and dynamic vehicle routing in which a single, uncapacitated vehicle traveling at a constant velocity in a Euclidean region must service demands whose time of arrival, location and on-site service are stochastic. The objective is to find a policy to service demands over an infinite horizon that minimizes the expected system time (wait plu...

Journal: :Oper. Res. Lett. 2007
Christian H. Christiansen Jens Lysgaard

This article introduces a new exact algorithm for the capacitated vehicle routing problem with stochastic demands (CVRPSD). The CVRPSD can be formulated as a set partitioning problem and it is shown that the associated column generation subproblem can be solved using a dynamic programming scheme. Computational experiments show promising results. © 2007 Elsevier B.V. All rights reserved.

2007
Christian Holk Christiansen Christian H. Christiansen

This article introduces a new exact algorithm for the Capacitated Vehicle RoutingProblem with Stochastic Demands (CVRPSD). The CVRPSD can be formulated as a SetPartitioning Problem and it is shown that the associated column generation subproblemcan be solved using a dynamic programming scheme. Computational experiments showpromising results.

2001
Brent Heeringa Tim Oates

Stochastic context-free grammars (SCFGs) are often used to represent the syntax of natural languages. Most algorithms for learning them require storage and repeated processing of a sentence corpus. The memory and computational demands of such algorithms are illsuited for embedded agents such as a mobile robot. Two algorithms are presented that incrementally learn the parameters of stochastic co...

2004
Víctor M. Albornoz Luis E. Contesse

In this paper we formulate a two-stage stochastic quadratic optimization problem, that models a production planning problem of multiple products, over several time periods, with uncertain demands. This model considers quadratic inventory holding and demand backlogging recourse costs, which model the saturation phenomenon inherent to the increase of the inventory and/or backlogged demand levels....

Journal: :J. Embedded Computing 2005
Jungkeun Park Minsoo Ryu Seongsoo Hong

This paper presents two classes of admission control schemes for embedded system applications that have real-time constraints but with composite characteristics in request arrivals and resource requirements. First, we present admission control tests using utilization demands to handle a mix of periodic and aperiodic tasks with deterministic execution times. The utilization demand is defined as ...

2015
Benjamin Biesinger Bin Hu Günther R. Raidl

In this work we consider the generalized vehicle routing problem with stochastic demands (GVRPSD) being a combination of the generalized vehicle routing problem, in which the nodes are partitioned into clusters, and the vehicle routing problem with stochastic demands, where the exact demands of the nodes are not known beforehand. It is an NP-hard problem for which we propose a variable neighbor...

Journal: :Applied optics 2002
Oswald Wallner Peter J Winzer Walter R Leeb

We discuss the efficiency with which coherent plane waves can be coupled to single-mode fibers in the presence of deterministic or stochastic misalignments of the fiber relative to the focal point of a lens. We point out how the alignment demands can be relaxed by means of graded-index-lens fiber-pigtailed collimators.

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

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