نتایج جستجو برای: dynamic expansion planning

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

2012
Russell Bent Carleton Coffrin David Judi Tim McPherson Pascal van Hentenryck

In recent years, the water distribution expansion planning (WDEP) problem has become increasingly complex as the demands on water distribution systems have evolved to meet modern requirements. This paper describes an algorithm that combines the strengths of local search with global search to flexibly handle these difficult problems. The algorithm decomposes a WDEP problem into sub problems usin...

The increasing consumption of electricity over time forces different countries to establishnew power plants and transmission lines. There are various crisp single-objective mathematicalmodels in the literature for the long-term power generation and transmission expansion planning tohelp the decision makers to make more reasonable decisions. But, in practice, most of the parametersassociated wit...

Generally ordering policies are done by two methods, including fix order quantity (FOQ) and fix order period (FOP). These methods are static and either the quantity of ordering or the procedure of ordering is fixing in throughout time horizon. In real environments, demand is varying in any period and may be considered as uncertainty. When demand is variable in any period, the traditional and st...

In this paper, free and forced vibration of simply-supported Single-walled carbon nanotube is investigated under the moving nanoparticle by considering nonlocal cylindrical shell model. To validate the theoretical results, modal analysis of nanotube is conducted using ANSYS commercial software. Excellent agreement is exhibited between the results of two different methods. Furthermore, the dynam...

Journal: :I. J. Robotics Res. 2013
Sebastien Lengagne Joris Vaillant Eiichi Yoshida Abderrahmane Kheddar

We propose a method to plan optimal whole-body dynamic motion in multi-contact non-gaited transitions. Using a B-spline time parameterization for the active joints, we turn the motion-planning problem into a semi-infinite programming formulation that is solved by nonlinear optimization techniques. Our main contribution lies in producing constraintsatisfaction guaranteed motions for any time gri...

Journal: :journal of advances in computer engineering and technology 0
hossein barghi jond ahar branch, islamic azad university, ahar, iran adel akbarimajd faculty of electrical engineering, university of mohaghegh ardabili, ardabil, iran nurhan gürsel özmen department of mechanical engineering, karadeniz technical university, trabzon, turkey. sonia gharibzadeh ahar branch, islamic azad university, ahar, iran

this paper aims to discuss the requirements of safe and smooth trajectory planning of transporter mobile robots to perform non-prehensile object manipulation task. in non-prehensile approach, the robot and the object must keep their grasp-less contact during manipulation task. to this end, dynamic grasp concept is employed for a box manipulation task and corresponding conditions are obtained an...

2009
Denis Saure Assaf Zeevi

We study a family of stylized assortment planning problems, where arriving customers make purchase decisions among offered products based on maximizing their utility. Given limited display capacity and no a priori information on consumers’ utility, the retailer must select which subset of products to offer. By offering different assortments and observing the resulting purchase behavior, the ret...

Journal: :Multimedia Tools and Applications 2015

Journal: :The Journal of the Institute of Image Information and Television Engineers 2000

1997
Robert P. Goldman David J. Musliner Kurt D. Krebsbach Mark S. Boddy

plan (isd); isd is initial state description let N = ;; The graph openlist = ;; is = make-initial-state(isd); N := N [ fisg; push(is, openlist); loopif there are no more reachable states in the openlist then we are done break; else let s = choose a reachable state from openlist; openlist := openlist fsg; oneof split-state : choose a proposition p and split s into jval(p)j states; remove s from ...

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

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