dynamic programming
در نشریات گروه صنایع-
در این پژوهش، یک مدل برنامه ریزی ریاضی برای مسیله ی مکان یابی چنددوره یی پایدار هاب ارایه می شود که در آن، تقاضای حمل ونقل وابسته به زمان است و افق برنامه ریزی زمان پیوسته است. مسیله به صورت یک مدل برنامه ریزی غیرخطی عدد صحیح آمیخته چندهدفه فرموله می شود که در آن، اهداف پایداری شامل کمینه سازی هزینه های سیستم حمل ونقل، کمینه سازی انتشار آلاینده ها در شبکه ی حمل ونقل و بیشینه سازی فرصت های شغلی ثابت و متغیر ایجاد شده در اثر احداث هاب ها در طی افق برنامه ریزی هستند. همچنین، تعدادی نامعادله معتبر برای بهبود فرمول بندی مسیله ارایه می شود. برای حل مسیله، از دو روش محدودیت اپسیلون تکامل یافته و برنامه ریزی پویا استفاده می کنیم. نتایج حاصل از این دو روش، برای یک مسیله ی نمونه روی داده های شبکه ی ترکیه ارایه می شود. برای اعتبارسنجی روش برنامه ریزی پویا، مجموعه داده های هوایی ایالات متحده مورد استفاده قرار می گیرد. نتایج نشان می دهد که روش برنامه ریزی پویا می تواند مسایل تا 25 گره و 6 دوره زمانی را حل کند.
کلید واژگان: مسئله ی مکان یابی هاب، پایداری، برنامه ریزی چنددوره یی، افق برنامه ریزی زمان پیوسته، برنامه ریزی پویاToday, many transportation systems use hub and spoke structures to transfer flow (good, message, passenger, etc.) from origin to destination. In such systems, the manager must plan for the location of the hubs and the allocation of other demand points to the hubs and other decisions during the planning horizon. Also, if the planning horizon is continuous time, the manager must also determine the timing of implementing the decisions. To determine the optimal decisions during the planning horizon and the best time for implementing decisions (i.e., breakpoints) according to sustainability aspects. In this research, a mathematical programming model is presented for a sustainable multi-period hub location problem in which the transportation demand between different origin-destination pairs is time-dependent and the planning horizon is continuous-time. The problem is formulated as a nonlinear multi-objective mixed integer programming model. Sustainability aspects are considered as objectives of the model. These objectives are minimizing transportation system costs, minimizing emissions in the transportation network, and maximizing fixed and variable job opportunities created by hubs during the planning horizon. Also, some valid inequalities are presented for strengthening the formulation of the problem. To solve the problem, we first use the Augmented Epsilon Constraint method version 2 (AUGMECON2) and then, use a dynamic programming approach to determine the optimal values of the breakpoints of the planning horizon. Using the proposed dynamic programming method, in each stage, some of decision variables are fixed and the number of variables in the original problem is reduced and instead of a nonlinear mixed integer programming problem, we solve a mixed integer linear programming problem that is easier to solve. The results of the solution methods are presented for a sample problem on the Turkish network dataset. Also, the CAB dataset is used to validate the dynamic programming method. The results show that the dynamic programming approach can solve problems with up to 25 nodes and 6 time periods.
Keywords: Hub location problem, sustainability, multi-period planning, continuous-time planning horizon, dynamic programming -
In this research, we study an optimal overhaul–replacement policy of a multi-degraded repairable system sold with a free replacement warranty. In the proposed replacement policy, a maintenance action and failure are dependent on a system degradation level and the system age, and hence the replacement model will provide more effective maintenance decisions. Failure of the system is modeled using a rate of occurrence of failure for the system, which is as a function of a degradation level of the system and its age. We develop the optimal replacement policy for a multi-degraded repairable system from the buyer’s point of view, who plans to use the system for a horizon planning T. The buyer conducts a periodic evaluation and selects an appropriate maintenance option based on the revealed system condition together with the system operational age. At each evaluation point, three alternative decisions are available, i.e., keep running the system, overhaul, or replace it with a new one. We formulate the sequential decision (keep, overhaul, or replace) problem as a dynamic programming model and obtain an optimal policy that minimizes total cost over T. Numerical examples are presented using several hypothetical data sets to illustrate the structure of optimal solution and its sensitivity against the change in parameter values. The main contribution of the paper is to offer a decision tool that will help in deciding the overhaul–replacement action based on the degradation level and the operational age of the system.
Keywords: Multi degraded repairable system, Warranty, Minimal repair, overhaul, replacement, Sequential optimal decision, Dynamic programming -
Investment problem is one of the most important and interesting optimization problems. This problem becomes more difficult when we deal with it in an uncertain and vague environment with chaos data. This paper attempts to study the investment problem with uncertain return data. These data are represented as chaos numbers. Dynamic programming is applied to obtain the optimal policy and the corresponding best return. Finally, a numerical example is given to illustrate the utility, effectiveness, and applicability of the approach to the problem.
Keywords: Investment problem, Chaos numbers, Dynamic programming, Optimal Policy, Best return -
International Journal of Supply and Operations Management, Volume:6 Issue: 2, Spring 2019, PP 168 -181
Supplier selection is one of the critical issues in the supply chain. Green supplier selection is performed based on the assessment of quantitative and qualitative criteria in two fields, including economic, environmental attributes. In this study, a two-level supply chain model has been proposed for green supplier selection and order allocation in a multi-period and single-product environment. In the first phase, the analytic hierarchical process (AHP) method is used to rank the suppliers and in the second phase, a model is designed based on constraints such as demand, capacity, and allowed level of inventory and shortage to maximize the total value of purchase (TVP) and total profit of purchase (TPP). Demand is assumed to be stochastic in different periods. Thus random demand leads to create the various scenarios in the planning horizon. A new integrated approach is presented based on stochastic programming and dynamic programming to solve the problem. The incorporation of stochastic demand condition and application of dynamic programming is a novel idea. Finally, a Numerical example is provided to investigate the procedure in details.
Keywords: Green Supplier Selection, Order Allocation, Dynamic Programming, Stochastic Programming -
یکی از مشکلات رایج شبکه های کامپیوتری حجم زیاد اطلاعات موجود در چنین شبکه هایی است. در این بین، جستجو و اطلاع از محتوای اسناد متنی که گسترده ترین نوع اطلاعات بر روی چنین شبکه هایی هستند، بسیار مشکل و گاهی اوقات غیرممکن می باشد. هدف سیستم های خلاصه سازی چند سندی متن، تولید کردن خلاصه ای با طول ثابت از اسناد متنی ورودی ضمن پوشش حداکثری محتوای اسناد می باشد. مقاله ی حاضر، روشی جدید برای خلاصه سازی اسناد متنی بر مبنای استفاده از روابط تفسیر و استلزام متنی و با فرموله سازی مساله در قالب یک مساله ی بهینه سازی ارائه کرده است. در این روش، جمله های درون اسناد ورودی ابتدا بر اساس رابطه ی تفسیر متنی خوشه بندی شده سپس امتیاز استلزام متنی برای کسری از سرآیند خوشه ها که دارای بیشترین امتیاز مرتبط با پرس وجوی کاربر هستند محاسبه شده و براساس آن امتیاز نهایی هر جمله به دست می آید. در نهایت، به کمک دو رویکرد حریصانه و برنامه ریزی پویا مساله ی بهینه سازی حل شده و ضمن انتخاب بهترین جمله ها، خلاصه ی نهایی تولید می شود. نتایج اجرای سیستم پیشنهادی بر روی مجموعه داده های استاندارد و انجام ارزایابی بر اساس سیستم ROUGE نشان می دهند که این سیستم کارایی بهترین سیستم های خلاصه سازی استخراجی مبتنی بر پرس وجو را به صورت میانگین حداقل به میزان 5/2% بهبود داده است.کلید واژگان: پردازش زبان طبیعی، خلاصه سازی متن، تفسیر متنی، استلزام متنی، کوله پشتی صفر و یکOne of the most common problems with computer networks is the amount of information in these networks. Meanwhile searching and getting inform about content of textual document, as the most widespread forms of information on such networks, is difficult and sometimes impossible. The goal of multi-document textual summarization is to produce a pre-defined length summary from input textual documents while maximizing documents’ content coverage. This paper presents a new approach for textual document summarization based on paraphrasing and textual entailment relations and formulating the problem as an optimization problem. In this approach the sentences of input documents are clustered according to paraphrasing relation and then the entailment score and final score of a fraction of the header sentences of clusters which have the best score according to the user query is calculated. Finally, the optimization problem is solved via greedy and dynamic programming approaches and while selecting the best sentences, the final summary is generated. The results of implementing the proposed system on standard datasets and evaluation via ROUGE system show that the proposed system outperforms the state-of-the-art systems at least by 2.5% in average.Keywords: Textual Document Summarization, Dynamic Programming, Textual Entailment
-
در این مقاله، مسئله ی تعیین اندازه ی انباشته ی پویای احتمالی با درنظرگرفتن تخفیف کلی بررسی می شود. مدل غیرخطی مسئله در دو حالت ارائه می شود. با رویکرد اول مدل تقریب تکه تکه خطی مسئله ارائه خواهد شد؛ رویکرد دوم مبتنی بر یک الگوریتم شاخه وکران است. در این الگوریتم زیرمسئله ی مربوط به هر گره، یک مسئله ی غیرخطی مختلط است که بر مبنای برنامه ریزی پویا حل می شود. هر مرحله از این برنامه ریزی پویا با روش ترکیبی شاخه وکران و آزادسازی لاگرانژ حل می شود. نتایج عددی ارائه شده در این مطالعه نشان می دهد که الگوریتم پیشنهادی نسبت به حل مدل ریاضی مسئله با استفاده از نرم افزار تجاری G A M S بسیار سریع تر به جواب بهینه می رسد. الگوریتم پیشنهادی برای حالت دوسطحی تخفیف با حل مدل تقریبی مسئله در این نرم افزار نیز مقایسه شده است.
کلید واژگان: تعیین اندازه ی انباشته ی احتمالی، تخفیف کلی، شاخه وکران، برنامه ریزی پویا، آزادسازی لاگرانژDynamic lot sizing problem is one of the significant problems in industrial units and has beenconsidered by many researchers. Considering the quantity discount in purchasing cost is one of the important and practical aspects of inventory problems in the field of inventory control and management, and it has been less focused in terms of stochastic version of dynamic lot-sizing problem in inventory management. In this paper, the stochastic dynamic lot-sizing problem with the assumption of existence of all-units quantity discount in purchasing is defined and formulated. Two approaches are presented to handle the solving procedure of this problem. Since the considered model is a mixed integer non-linear programing model, and the objective function of the model is the only non-linear part of the model. At first, we introduce a piecewise linear approximation model to convert the objective function to a linear term. The main solution approach breaks down the problem into four levels. At the first level, a branch and bound algorithm branches the problem on the periods with a predetermined discount level. In this case, the problem is converted to constrained version of the Sox problem [10]. This sub problem raised in each node in the branch and bound algorithm, is a mixed integer non-linear programing too, which is solved based on a dynamic programming approach in the second level. In each stage, in this dynamic programming algorithm, there is a sub -problem which is solved via a branch and bound algorithm. The problem raised in each node of the recent branch and bound algorithm is solved with lagrangian relaxation method. The numeric results found in this study indicate that the proposed approach solves the problem faster than the mathematicalprogramming model using the commercial software GAMS. Moreover, the proposed algorithm for the two discount levels is also compared with the approximate solution in the mentioned software. The results indicate that our algorithm up to 14 periods can not only obtain the exact solution, but also consume less time in contrast to the approximate model.
Keywords: Dynamic lot sizing problem, total quantity discount, branch and bound algorithm, dynamic programming, lagrangian relaxation method -
In this paper, dynamic programming for sequencing weighted jobs on a single machine to minimizing total tardiness is focused, to significance of fuzzy numbers field, and importance of that for decision makers who are facing on uncertain data, combination of dynamic programming and fuzzy numbers is applied. A random scheduling problem with fuzzy processing times is given and solved. In addition, algorithm consuming time during solving same category problem and different sizes are analyzed that for large problem CPU time usage is extremely unaffordable. Therefore demonstration of near-exact heuristic method such as Genetic Algorithm (GA) appears. In this paper sufficient discussion around solving this kind of problems and their algorithms analysis and a combination between Dynamic Programming (DP) and genetic algorithm as a newly born method is proposed that stand on DP performance and genetic algorithm search power, and finally comparison on the recent developed method has been held. Then this method can deal with real-world problem easily. Thus, decision makers actually can use this modification of dynamic programming for coping with un-crisp problem.Keywords: Comparing Fuzzy Numbers, Dynamic programming, Genetic Algorithm, Scheduling
-
This paper addresses the Tardy/Lost penalty minimization on a single machine. According to this penalty criterion, if the tardiness of a job exceeds a predefined value, the job will be lost and penalized by a fixed value. Besides its application in real world problems, Tardy/Lost measure is a general form for popular objective functions like weighted tardiness, late work and tardiness with rejection and hence, the results of this study are applicable for them. Initially, we present two approximation algorithms. Then, two special cases of the main problem are considered. In the first case, all jobs have the same tardiness weights where an FPTAS is developed using the technique of structuring the execution of an algorithm". The second special case occurs when none of the jobs can be early. For this case, a 2-approximation algorithm is developed as well as a dynamic programming algorithm which is converted to an FPTAS.Keywords: Single machine scheduling, Tardy-Lost penalty, Dynamic programming, Approximation algorithm, FPTAS
-
In this research, a single batch processing machine scheduling problem with minimization of total earliness and tardiness as the objective function is investigated.We first formulate the problem as a mixed integer linear programming model. Since the research problem is shown to be NP-hard, an improved memetic algorithmis proposed to efficiently solve the problem. To further enhance the memetic algorithm and avoid premature convergence, we hybridize it with a variable neighborhood search procedureas its local search engine. A dynamic programming approach is also proposed to find optimal schedule for a given set of batches. Wedesign a Taguchi experiment to evaluate the effects of different parameters on the performance of the proposed algorithm. The results of an extensive computational study demonstrate the efficacy of the proposed algorithm.Keywords: Batch processing machine, Total earliness, tardiness, Memetic algorithm, Variable neighborhood search, Dynamic programming
-
International Journal of Supply and Operations Management, Volume:4 Issue: 2, Spring 2017, PP 180 -192
In this article, we present a sequential sampling plan for a three-state machine replacement problem using dynamic programming model. We consider an application of the Bayesian Inferences in a machine replacement problem. The machine was studied at different states of good, medium and bad. Discount dynamic programming (DDP) was applied to solve the three-state machine replacement problem, mainly to provide a policy for maintenance by considering item quality and to determine an optimal threshold policy for maintenance in the finite time horizon. A decision tree based on the sequential sampling which included the decisions of renew, repair and do-nothing was implemented in order to achieve a threshold for making an optimized decision minimizing expected final cost. According to condition-based maintenance, where the point of defective item is placed in continuing sampling area, we decided to repair the machine or to continue sampling. A sensitivity analysis technique shows that the optimal policy can be very sensitive.
Keywords: Machine replacement, Dynamic programming, Sequential sampling plan, Maintenance -
Journal of Optimization in Industrial Engineering, Volume:9 Issue: 20, Summer and Autumn 2016, PP 75 -90Data envelopment analysis (DEA) is a methodology for measuring the relative efficiency of decision making units (DMUs) which âŽconsume the same types of inputs and producing the same types of outputs. Believing that future planning and predicting the âŽefficiency are very important for DMUs, this paper first presents a new dynamic random fuzzy DEA model (DRF-DEA) with âŽcommon weights (using multi objective DEA approach) to predict the efficiency of DMUs under mean chance constraints and âŽexpected values of the objective functions. In the initial proposedâ âDRF-DEA model, the inputs and outputs are assumed to be âŽcharacterized by random triangular fuzzy variables with normal distribution, in which data are changing sequentially. Under this âŽassumption, the solution process is very complex. So we then convert the initial proposed DRF-DEA model to its equivalent multi-âŽobjective stochastic programming, in which the constraints contain the standard normal distribution functions, and the objective âŽfunctions are the expected values of functions of normal random variables. In order to improve in computational time, we then âŽconvert the equivalent multi-objective stochastic model to one objective stochastic model with using fuzzy multiple objectives âŽprogramming approach. To solve it, we design a new hybrid algorithm by integrating Monte Carlo (MC) simulation and Genetic âŽAlgorithm (GA). Since no benchmark is available in the literature, one practical example will be presented. The computational results âŽshow that our hybrid algorithm outperforms the hybrid GA algorithm which was proposed by Qin and Liu (2010) in terms of âŽruntime and solution quality. âŽKeywords: Stochastic Data envelopment analysis, Dynamic programming, random fuzzy variable, Monte Carlo simulation, Genetic algorithm.â€?
-
Journal of Optimization in Industrial Engineering, Volume:9 Issue: 19, Winter and Spring 2016, PP 9 -24Acceptance Sampling models have been widely applied in companies for the inspection and testing the raw material as well as the final products. A number of lots of the items are produced in a day in the industries so it may be impossible to inspect/test each item in a lot. The acceptance sampling models only provide the guarantee for the producer and consumer that the items in the lots are according to the required specifications that they can make appropriate decision based on the results obtained by testing the samples. Acceptance sampling plans are practical tools for quality control applications which consider quality contracting on product orders between the vendor and the buyer. Acceptance decision is based on sample information. In this research, dynamic programming and Bayesian inference is applied to decide among decisions of accepting, rejecting, tumbling the lot or continuing to the next decision making stage and more sampling. We employ cost objective functions to determine the optimal policy. First, we used the Bayesian modelling concept to determine the probability distribution of the nonconforming proportion of the lot and then dynamic programming is utilized to determine the optimal decision. Two dynamic programming models have been developed. First one is for the perfect inspection system and the second one is for imperfect inspection. At the end, a case study is analysed to demonstrate the application the proposed methodology and sensitivity analyses are performed.Keywords: Acceptance Sampling, Bayesian Inference, Dynamic Programming, Inspection Errors, Quality Cost
-
Journal of Quality Engineering and Production Optimization, Volume:1 Issue: 1, Winter - Spring 2015, PP 11 -20The dynamic facility layout problem (DFLP) is the problem of finding positions of departments on the plant floor for multiple periods (material flows between departments change during the planning horizon) such that departments do not overlap, and the sum of the material handling and rearrangement costs is minimized. In this paper a new optimization algorithm inspired from colonizing weeds, Invasive Weeds Optimization (IWO) is utilized to solve the well-known DFLP. IWO is a simple algorithm which uses basic characteristics of a colony of weeds such as proliferation, growth and competition. A set of reference numerical problems is taken in order to evaluate the efficiency of the algorithm compared with the Dynamic Programming method which had been applied to solve the addressed problem. In order to verify the efficiency of the proposed algorithm a wide range of experiments are carried out to compare the proposed algorithm. Computational results have indicated that the DIWO algorithm is capable of obtaining optimal solutions for small and medium-scaled problems very efficiently.Keywords: Discrete Invasive Weed Optimization, Dynamic Facility layout Problem, Dynamic Programming
-
بهینه سازی حد کنترل در نگه داری و تعمیر مبتنی بر شرایط با فرض ثابت نبودن هزینه ی تعویض به دلیل خرابیدر نگه داری و تعمیر مبتنی بر شرایط دستگاه هدف این است که با انجام بازرسی و کنترل شرایط، دستگاه به عمر واقعی تعویض نزدیک شد. در روش حد کنترل، تابع توام نرخ مخاطره دستگاه و تاثیر متغیرهای کنترل شرایط، با استفاده از مدل تلفیقی نرخ مخاطره (P H M)، و با توجه به سوابق اطلاعاتی دستگاه تخمین زده می شود. سپس، بهترین حد کنترل به گونه یی تعیین می شود که متوسط هزینه های تعویض به دلیل خرابی و تعویض پیشگیرانه در یک دوره ی طولانی کمینه شود. در مدل ارائه شده در این نوشتار، فرض ثابت بودن هزینه ی تعویض به دلیل خرابی حذف و هزینه ی این نوع خرابی، تابعی صعودی از عمر دستگاه و مقادیر متغیرهای تشخیص خرابی در نظر گرفته شده است. سپس مدلی برای تعیین بهترین حد کنترل ارائه شده است، به گونه یی که متوسط هزینه های تعویض کمینه شود. یک مثال عددی نیز به منظور تشریح بهتر مدل، ارائه شده است.
کلید واژگان: نگه داری و تعمیرات براساس شرایط، مدل تلفیقی نرخ مخاطره، سیاست تعویض، برنامه ریزی پویا، هزینه ی تعویض متغیرThe primary goal of condition-based maintenance (CBM) is to extend system lifetime based on the information collected through periodic inspections. There have been many attempts to include economic considerations in the process of decision making in CBM. A well-known approach is called the control limit policy. In this approach, using historical data of the equipment and the values of condition monitoring covariates, the hazard rate function is first estimated. It is assumed that the inspections are performed at fixed and given intervals of time. The equipment is replaced whenever it fails. Also, after each inspection and based on the inspection results, if the cost-related failure rate reaches or exceeds a pre-determined limit, a preventive replacement is scheduled. The limit is, then, determined such that the expected average maintenance costs per unit time, due to preventive and failure replacements over a long time horizon, is minimized. However, it is assumed that the failure cost is constant, no matter when or at which state the failure occurs. Using the main principals of the control limit policy, this paper extends the approach assuming that the failure cost depends on both the age of the system and the value of the covariates observed. This assumption is more practical, as equipment usually incurs more failure cost as it deteriorates. However, determination of the function that can represent the variable failure cost is often difficult. In this paper, we consider a hypothetical non-decreasing failure cost function. This does not limit the scope of the application of the proposed method, as its relaxation only entails replacing the failure cost function with the one determined in a given application. The derivation of the required mathematical formulation to obtain the optimal control limit is presented in detail. A numerical example is also given to illustrate the proposed approach.Keywords: Condition, based maintenance, Proportional hazard, odel, Replacement policy, Dynamic programming, Variable failure cost -
In this paper, three dynamic pricing models are developed and analyzed. We assume a limited number of a particular asset is offered for sale over a period of time. This asset is perishable and can be an inventory or a manufacturing capacity. During each period, the seller sets a price for this asset. This price is selected from a predetermined discrete set. The maximum amount which a customer is willing to pay is called "reservation price". Different customers have different reservation prices. The distribution function of the reservation prices for all potential customers is known. Demands arrive according to a nonhomogeneous Poisson process. To maximize the expected revenue, the price of this asset is controlled periodically, as sales evolve. Demand cancellation is also considered. Furthermore, we study the effect of cancellation as well as setting a sale limit for each period. The analysis of the models indicates that their properties are different from those of the basic models studied previously. By randomly generated examples, we show that the properties of “Inventory Monotonocity” and “Time Monotonocity” do not hold in our models, while these properties hold for continuous price review models.Keywords: Dynamic pricing, Periodic review, Cancellation, Dynamic programming
-
We introduce a new approach to distribution fitting, called Decision on Beliefs (DOB). The objective is to identify the probability distribution function (PDF) of a random variable X with the greatest possible confidence. It is known that f X is a member of = {,, }. 1 m S f L f To reach this goal and select X f from this set, we utilize stochastic dynamic programming and formulate this problem as a special case of Optimal Stopping Problem. The decision is made on the basis of the outcome of a limited number of experiments. A real number, namely, belief is assigned to each candidate by considering the outcome of observations. At each stage and after a random observation, beliefs are updated by applying Bayesian formula and then either one element of S is selected as the desired PDF or another observation is made. At each stage, a PDF from S with the greatest belief is accepted as the desired PDF provided the belief is higher than a least acceptable designated level. We assume the total number of possible observations can not exceed N and a cost is incurred for each observation. Dynamic and nonlinear programming are applied to calculate the least acceptable belief value for each stage.To reduce the search of the optimal solution, the concept of entropy is utilized.Keywords: Distribution fitting, Dynamic programming, Markovian decision process
- نتایج بر اساس تاریخ انتشار مرتب شدهاند.
- کلیدواژه مورد نظر شما تنها در فیلد کلیدواژگان مقالات جستجو شدهاست. به منظور حذف نتایج غیر مرتبط، جستجو تنها در مقالات مجلاتی انجام شده که با مجله ماخذ هم موضوع هستند.
- در صورتی که میخواهید جستجو را در همه موضوعات و با شرایط دیگر تکرار کنید به صفحه جستجوی پیشرفته مجلات مراجعه کنید.