Heuristic Rules for the Dynamic Pricing Problem
نویسندگان
چکیده
This paper is devoted to the development of heuristics for dynamic pricing problem. A discrete time model on fixed horizon proposed. It applicable products that satisfy two properties: 1) product value expires at a certain predetermined date, and 2) consumers demand most single unit product. type structure allows deriving simple system recursive equations optimal prices using programming techniques. Optimal policy expressed as function expiration inventory levels unsold products. An analytical solution this problem was obtained special cases, while general case, numerical algorithm has been developed. Qualitative characteristics are established, their implications dynamics inventories discussed. Based these observations, heuristic rule price adjustments Performance evaluated against fixed-price policies Monte-Carlo experiments. Results demonstrate high efficiency proposed strategy its even simpler derivatives. Heuristics’ adaptability ease implementation should make it suitable attractive small medium businesses.
منابع مشابه
the algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولA Hybrid Meta-heuristic for the Dynamic Layout Problem with Transportation System Design
This paper primarily presents a comprehensive dynamic layout design model which integrates layout and transportation system design via considering more realistic assumptions, such as taking account of fixed-position departments and distance between departments that endanger each other. In addition, specific criteria such as capacity, cost and reliability of facilities are considered in transpor...
متن کاملNew scheduling rules for a dynamic flexible flow line problem with sequence-dependent setup times
In the literature, the application of multi-objective dynamic scheduling problem and simple priority rules are widely studied. Although these rules are not efficient enough due to simplicity and lack of general insight, composite dispatching rules have a very suitable performance because they result from experiments. In this paper, a dynamic flexible flow line problem with sequence-dependent se...
متن کاملA smoothing heuristic for a bilevel pricing problem
In this paper, we provide a heuristic procedure, that performs well from a global optimality point of view, for an important and difficult class of bilevel programs. The algorithm relies on an interior point approach that can be interpreted as a combination of smoothing and implicit programming techniques. Although the algorithm cannot guarantee global optimality, very good solutions can be obt...
متن کاملHeuristic Methods for the Unrestricted Dynamic Container Relocation Problem
In this work, we address the unrestricted Dynamic Container Relocation Problem (DCRP). The DCRP is an extension of the Container Relocation Problem (CRP) that is NPhard. The CRP aims to empty a single yard-bay, which contains containers with a given retrieval sequence from the yardbay, such that the total number of relocations is minimized. The DCRP extends the CRP so that containers both arriv...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Organizations and markets in emerging economies
سال: 2023
ISSN: ['2029-4581', '2345-0037']
DOI: https://doi.org/10.15388/omee.2023.14.99