نتایج جستجو برای: heuristic dynamic programming
تعداد نتایج: 740207 فیلتر نتایج به سال:
In adaptive dynamic programming, neurocontrol and reinforcement learning, the objective is for an agent to learn to choose actions so as to minimise a total cost function. In this paper we show that when discretized time is used to model the motion of the agent, it can be very important to do “clipping” on the motion of the agent in the final time step of the trajectory. By clipping we mean tha...
We consider the dynamic headway control problem under no-deadlock and no-collision constraints. Different speed limits are applied to different railway segments and junctions according to local geographic conditions. A mathematical programming formulation is given under the consideration of the trains’ dynamics. Then a heuristic rule for train movement is proposed to reduce delay and guarantees...
Inventory routing problems arise as simultaneous decisions in inventory and routing optimization. In the present study, vendor managed inventory is proposed as a collaborative model for reverse supply chains and the optimization problem is modeled in terms of an inventory routing problem. The studied reverse supply chains include several return generators and recovery centers and one collection...
the control problem and dynamic programming is a powerful tool in economics and management. we review the dynamic programming problem from its beginning up to its present stages. a problem which was involved in physics and mathematics in i 7” century led to a branch of mathematics called calculus of variation which was used in economic, and management at the end of the first quarter of the 20” ...
Recently, an Alignment approach for the comparison of two genomes, based on an evolutionary model restricted to Duplications and Losses, has been presented. An exact linear programming algorithm has been developed and successfully applied to the Transfer RNA (tRNA) repertoire in Bacteria, leading to interesting observation on tRNA shift of identity. Here, we explore a direct dynamic programming...
References [1] Leonidas Fegaras. A new heuristic for optimizing large queries. [2] Toshihide Ibaraki and Tiko Kameda. On the optimal nesting order for computing n-relational joins. Optimizing large join queries using a graph-based approach. [5] Guido Moerkotte and Thomas Neumann. Analysis of two existing and one new dynamic programming algorithm for the generation of optimal bushy join trees wi...
We present a new dynamic programming formulation for the stochastic multi-stage serial inventory system based on the cost of sub-system with fewer stages. A heuristic based on judiciously selected common downstream holding costs requires solving one newsvendor problem per stage. A closed form approximate upper bound allows for accurate sensitivity analysis. 1
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید