به جمع مشترکان مگیران بپیوندید!

تنها با پرداخت 70 هزارتومان حق اشتراک سالانه به متن مقالات دسترسی داشته باشید و 100 مقاله را بدون هزینه دیگری دریافت کنید.

برای پرداخت حق اشتراک اگر عضو هستید وارد شوید در غیر این صورت حساب کاربری جدید ایجاد کنید

عضویت

جستجوی مقالات مرتبط با کلیدواژه "mixed integer programming" در نشریات گروه "فنی و مهندسی"

  • میثم حسینی*، ارسلان رحمانی
    تحت رقابت شدید بازار برای کاهش انتشار آلوگی محیط زیست، شرکت های لجستیک زنجیره سرد برای توسعه بهتر علاوه بر برآورد تقاضای مشتری، انتشار گازهای مخرب را نیز مورد توجه قرارمی دهند. زنجیره تامین سرد به تهیه و توزیع کالاهایی می پردازد که در گذر زمان دچار فسادپذیری و تخریب می شوند. بنابراین، برای تازه نگهداشتن کالاها در این زنجیره باید دما به طور بی وقفه و پیوسته کنترل شود که منجر به مصرف سوخت بیشتری می شود. همچنین در مسایل مسیریابی خودروها زمان پیمودن یک مسیر و مصرف سوخت تنها به مسافت پیموده شده بستگی ندارد، بلکه به سرعت و زمانی از روز که آن مسیر پیموده می شود نیز بستگی دارد. این مقاله یک مدل بهینه سازی عددصحیح مختلط جدید از مسیله مسیریابی خودروها یخچال دار با توجه به ترافیک موجود در شبکه، با هدف به حداقل رساندن انتشار آلوگی ارایه می دهد. در این مدل علاوه بر هزینه انتشار آلودگی هزینه هایی دیگر شامل هزینه ثابت خودرو، حمل ونقل، از دست دادن کیفیت، تازه نگهداشتن مواد و جریمه رسیدن خارج از پنجره زمانی مربوط به مشتری درنظر گرفته شده است. برای حل مسایل بزرگ یک الگوریتم حل مبتنی بر روش تجزیه بندرز ارایه شده است. نتایج محاسباتی نشان دادند که مدل ارایه شده به خوبی مسیر بهینه و زمان سفر خودرو را با درنظر گرفتن کاهش آلودگی و سرعت مناسب را ارایه می دهد. همچنین اجرای الگوریتم حل بر روی مثالهای متفاوت کارایی الگوریتم را در کاهش زمان حل و به دست آوردن جوابهای با دقت خوب را نشان داد.
    کلید واژگان: الگوریتم تجزیه بندرز, آلودگی محیط زیست, برنامه ریزی عدد صحیح مختلط, زنجیره تامین سرد, مسئله مسیریابی خودرو
    Meysam Hosseini *, Arsalan Rahmani
    To reduce the environmental Pollution emissions caused by market activities, cold chain logistics companies also considered the emission of harmful gases for better service in satisfying customers’ demands. In the cold supply chain, goods are supplied and distributed that become corrupt and degraded over time. Therefore, to keep such goods fresh, the temperature must be constantly and continuously controlled, which in turn requires more fuel consumption. Also, in vehicle routing problem, the travel time of a route and fuel consumption does not only depend on the distance traveled, but also on the speed and time of day when that route is traveled. In this study, a new mixed-integer optimization model of the vehicle routing problem in a cold supply chain concerning congestion is presented with the aim is to minimize costs of Pollution emissions. In this model, in addition to the cost of the environmental Pollution emissions, other costs are considered, including the vehicle operating cost, transportation, loss of quality, product freshness, and penalty cost for arriving outside the customer's time window. In continuing, a solution method based on Benders decomposition is applied to solve the proposed model for large size networks. The computational results showed that the presented model provides the optimal route and travel time of the vehicle by considering the reduction of pollution and the appropriate speed. Also, the implementation of the solution algorithm on several test instances with different sizes showed the efficiency of the algorithm in reducing the solution time and obtaining a good solution.
    Keywords: mixed integer programming, Benders decomposition algorithm, Cold supply chain, Environmental pollution, vehicle routing problem
  • Y. Mansouri, R. Sahraeian *
    This paper focuses on a closed-loop supply chain that deals with disruptions in the distribution centers, and optimizes the network in two dimensions of sustainability: economic and environmental. Economically, the proposed network maximizes the profits of the customers, manufacturers and distributors. Three avenues for cost minimization are designed for the customer by adding the warranty periods, the reworking options, and the incentives for returning the used items. Non-dominated solutions via the Reservation Level-driven Tchebycheff procedure are found by appropriate choice of facility establishment and suitable allocation links considering the disruption in the distribution centers.Environmentally, the model adopts a zero-waste strategy by embedding various return-segmentation policies and a secondary chain. The backward flow depends on the customers' choice of reworking, the validity of the warranty contract, and the quality of the returns. The test results indicate that due to various revenue options, the manufacturing and distribution centers prefer returns with medium-range quality, while due to the incentives offered for the recyclable items, the customers benefit the most from returning the items with the lowest quality. The tests on the probability of disruptions indicate that establishing a minimum number of the manufacturing and/or distribution sites without disruption leads to better overall performance.
    Keywords: Closed-loop supply chain networks, disruption, facility failure, return quality management, Mixed integer programming, reservation level-driven Tchebycheff procedure
  • پرهام حیاتی*، بهزاد پزشکی

    در پژوهش حاضر، با رویکرد جدیدی به بهینه سازی عملکرد تقاطع پرداخته شده است. ترکیب متغیرهای زمانی و متغیرهای هندسی از منظر مهندسی ترافیک باعث بهبود بیشتر عملکرد تقاطع چراغ دار با هدف بیشینه سازی ظرفیت تقاطع شده است. خطوط تردد و تنظیمات چراغ به عنوان متغیرهای تصمیم در نظر گرفته شده اند و قید خطوط کوتاه نیز در مدل سازی گنجانده شده است. وجود خطوط کوتاه برای تعریض معابر بسیار پرکاربرد هستند و در بسیار از تقاطعات دیده می شوند. ظرفیت و عملکرد تقاطع به متغیرهای خطوط کوتاه رابطه بسیار معناداری در جهت مثبت و منفی دارد. در تحقیق حاضر با سه نگرش جدید: 1- در نظر گرفتن متغیرهای هندسی تقاطع به همراه متغیرهای زمان بندی و فازبندی چراغ؛ 2- در نظر گرفتن خط کوتاه و اثر آن؛ 3- استفاده از برنامه ریزی ریاضی صفرویک برای بهینه سازی؛ ظرفیت تقاطع بزرگراه جلال آل احمد و بلوار آریانفر بیشینه شدند و کارایی تقاطع حدود چهارده درصد افزایش یافت. به منظور اعتبار سنجی مدل و بررسی رفتار تقاطع مدل در نرم افزار سینکرو شبیه سازی شد و ظرفیت، زمان سفر و میزان تاخیر تقاطع برآورد شد.

    کلید واژگان: ظرفیت تقاطع چراغ دار بهینه سازی صفر و یک, تنظیم چراغ راهنمایی, خط کوتاه
    Parham Hayati*, Behzad Pezeshki

    In the current research, a new approach has been used to optimize the performance of the intersection. The combination of time variables and geometric is enhanced optimization of intersection capacity. Traffic lanes and traffic light settings are considered as decision variables, and the limitation of short lines is also included in the modeling. short are very common and can be seen in many intersections. Intersection capacity and performance have a very significant positive and negative relationship with the variables of short lines. In the present research, with three new approaches: 1- Considering the geometrical variables of the intersection along with the timing and phasing variables of the lights; 2- Considering the short line and its effect; 3- Using mixed integer programming, zero-one as methodology; The capacity of the intersection of Jalal Al-Ahmad highway and Arianfar Boulevard was maximized and the efficiency of the intersection increased by about fourteen percent. In order to validate the model and check the behavior of the intersection, the model was simulated in Synchro software, and the capacity, travel time and delay of the intersection were estimated.

    Keywords: Signalized Intersection Capacity, Mixed integer programming, traffic signal timing, Shortlane
  • Zahra Zanjani Foumani, Ensieh Ghaedy heidary, Amir Aghsami, Masoud Rabbani

    This paper proposes a bi-objective model for a green closed-loop supply chain network design. Four levels for forward and five levels for reverse flow were considered, including plants, distribution centers, online retailers, traditional retailers and customers for forward flow and customers, collecting centers, disposal centers, repair centers and plants for the reverse flow. The objectives are minimizing the GHG emission and maximizing profit by considering defective products and a second market for these products. Also, online retailers were considered alongside with traditional ones, since the Covid-19 pandemic has led to increase in the amount of online shopping. GAMS software and the Lpmetric technique were used to solve the model in the small and medium sizes. However, for the large size, we used Grasshopper Optimization Algorithm (GOA) as a meta-heuristic approach since solving the large size problem with GAMS is a complicated and time-consuming process. We provided Numerical and computational results to prove the efficiency and feasibility of the presented model. Finally, the managerial insights and future works were provided.

    Keywords: CO2 emission, Defective product, Grasshopper Optimization Algorithm (GOA), Green Closed-loop supply chain, Mixed-integer programming
  • Z. Moghaddas, M. Vaez-Ghasemi, F. Hosseinzadeh Lotfi, R. Farzipoor Saen *
    Data envelopment analysis (DEA) technique is widely applied for performance assessment of decision making units (DMUs). The revenue efficiency (RE) evaluation is one of the controversial subject matters that can be performed through DEA context. The amount of productions and its prices are crucial factors in the RE. The classical DEA models consider the prices to be fixed and known which are not the case in real world. Also, the classical DEA models considers linear pricing in revenue assessment. However, most of real world problems deal with nonlinear prices. This paper evaluates the RE given the piecewise linear theory in non-competitive situations. In doing so, a stepwise pricing function is introduced which lets the prices to be changed in relation to the amount of the production. As an innovative idea, a more accurate mathematical modeling for the RE is proposed. We define a dynamic weights’ function in maximum revenue optimization model which no longer considers fixed prices. A case study validates our proposed model.
    Keywords: Data envelopment analysis (DEA), Revenue efficiency, Stepwise pricing, Mixed integer programming, Big M, Malmquist productivity index (MPI), Piecewise linear functions
  • فاطمه پایدار، مرضیه امینی رارانی، محمدسعید جبل عاملی*

    صنعت کاشی و سرامیک یکی از مشاغل قدیمی ایرانیان است که در هر دوره‌ی تاریخی به اشکال متفاوت به‌کار گرفته شده ‌است. ایران یکی از پنج کشور بزرگ تولیدکننده‌ی کاشی و سرامیک است که با دارا بودن ظرفیت بسیار زیاد در این صنعت توانسته است‌ به‌عنوان بزرگترین صادرکننده‌ی این محصولات در غرب آسیا شناخته‌ شود. در سال‌های اخیر صادرات کاشی و سرامیک یکی از مهم‌ترین دادوستدهای خارجی کشور شده ‌است. لذا برای دستیابی به بخش بزرگتری از سهم صادرات، فضای رقابتی بر این صنعت حاکم شده ‌است. از سوی دیگر امروزه مدیریت زنجیره‌تامین به‌دلیل افزایش جهانی شدن صنایع و رقابت‌های بین‌المللی بیش از پیش مورد توجه واقع شده ‌است. بسیاری از شرکت‌ها ترجیح می‌دهند، بخش‌های تدارکات، تامین، تولید و توزیع خود را به‌صورت مجزا در چندین کشور قرار دهند و مدیریت کنند. بنابراین در برخورد با رقابت‌های جهانی، چگونگی طراحی یک شبکه زنجیره‌تامین با حداقل هزینه و با تاکید بر ملاحظات مالی، بیمه و هزینه‌های گمرکی به یک مساله مهم برای شرکت‌های چندملیتی تبدیل شده ‌است. در این مقاله با به‌کارگیری روش برنامه‌ریزی مختلط عدد صحیح، یک مدل مکان‌یابی جهانی چهار سطحی چندهدفه با درنظر گرفتن محدودیت آب مصرفی در خطوط تولید ارایه شده و با استفاده از نرم‌افزار گمز حل و مورد بررسی قرار گرفته است. مدل پیشنهادی در یکی از صنایع تولیدی کاشی و سرامیک استان یزد جهت صحت سنجی مدل و بررسی تاثیر پارامترهای مهم بر تصمیمات استراتژیک مکان‌یابی به‌کار گرفته شده است که منجر به مکان‌یابی دو انبار داخلی و سه مرکز توزیع خارجی در کشورهای مجاور شد.

    کلید واژگان: طراحی شبکه زنجیره تامین جهانی, مکانیابی تسهیلات بین المللی, زنجیره تامین کاشی و سرامیک, برنامه ریزی مختلط عدد صحیح
    Fatemeh Paydar, Marzieh Aminirarani, Mohammad Jabalameli*

    The ceramic and tile industry is one of the traditional Iranian jobs used in every historical period of different forms. Iran is one of the five largest producers of tiles and ceramics, which have been able to become the biggest exporter of these products in Western Asia by having a huge capacity in the industry. In recent years, ceramics and tiles exports have become one of the country's most important foreign trade. Therefore, to achieve a larger part of the export share, the competitive environment has dominated the industry. On the other hand, supply chain management is considered more and more attention due to the increasing globalization of industries and international competition. Many companies prefer to supply and manage their procurement, production and distribution sectors separately in several countries. Therefore, in dealing with global competitiveness, how to design a supply chain network with minimum cost and with emphasis on financial considerations, insurance and customs, has become an important issue for multinational companies. In this paper, using mixed integer programming method, a four level global positioning model is proposed considering the limitation of water consumption in the production line using GAMS software. The proposed model was used in one of the ceramic tile manufacturing industries in Yazd province to validate the model and investigate the effect of important parameters on strategic location decisions, which led to the location of two domestic warehouses and three foreign distribution centers in neighboring countries.

    Keywords: Global supply chain design, International facility location, Ceramic tile supply chain, Mixed Integer Programming
  • Mehrzad Navabakhsh *, Somayeh Shafaghizadeh, Sadoullah Ebrahimnejad, Seyed Mojtaba Sajadi

    The resilient supply chain considers many capabilities for companies to overcome financial crises and to supply and distribute products. In this study, we address the allocation of inventory distribution for a distribution network, including a factory, a number of potential locations for distribution centers and a number of retailers. Customers demand is assumed to be certain and deterministic for all periods but time varying in the limited planning horizon. The proposed model in this research is a linear complex integer programming model with two-objective functions. The first objective function minimizes the total costs of the entire distribution system in the planning horizon, and the second objective function seeks to minimize the difference between the maximum and minimum distances traveled by vehicles over the planning horizon. Therefore, the model tries to satisfy the demand and at the same time reduce costs using the best route transportation option configuration and transportation option. The routing problem is developed, and as the problem is a NP-hard problem, a meta-heuristic method is used to solve it. In this model, the demand volume for each customer in a period of the network, vehicle capacity, factory capacity, constant transportation cost, variable transportation cost, etc., are considered as factors affecting the model. The results show that the model proposed in the network can be used as a lever to improve the performance of the financial economic supply network through saving in routes.

    Keywords: resilient supply chain, Meta-heuristic, NP-hard problem, mixed integer programming
  • Mahdi Yousefi Nejad Attari, Sajjad Ebadi Torkayesh, Ali Ebadi Torkayesh *
    This paper designs an optimization model for the emergency department of a hospital, considering related costs, nursing staff satisfaction, and waiting time for several diseases concerning the number of staff in each shift. This study's primary purpose is to minimize the related costs, maximize nursing staff satisfaction, and allocate nursing staff to working shifts in the emergency department. In the first stage, a simulation model is constructed based on the emergency department's status with ARENA 14 software. Then, the model is investigated under three different scenarios. In the second stage, mixed-integer programming is proposed to minimize the costs, nursing staff satisfaction and optimally allocate nurses to various shifts. Furthermore, the generalized center method is used to solve the model by converting the multi-objective model to a single-objective one. In Tabriz, Iran, Imam Reza hospital is considered our case study investigated by simulation and MIP models. Finally, the results of simulation and mathematical models demonstrate that six new nurses should be added to the emergency department.
    Keywords: Staff assignment, Service time, Simulation, Mixed-integer programming, Generalized center method
  • Sh. Ataeian, M. Solimanpur *, S.S.M. Amiripour, R. Shankar
    The quality of public transportation service has major effects on people’s quality of life. During frequency and timetable setting, synchronization is a very important and complicated issue which can directly influence the utility and attractiveness of the system. In this paper, a mixed-integer nonlinear programming model is proposed that aims at setting timetables on a bus transit network with the maximum synchronization and the minimum number of fleet size. The proposed model is shown to be applicable for both small and large-scale transit networks by employing it for setting timetables on two samples of both sizes. As an illustrative example, a simple version of the model is coded and run in GAMS Software and a completely reasonable timetable is obtained. As the second example, the proposed model is used to set timetables on Tehran BRT networks through the genetic algorithm; then the NSGA-II is used to obtain the Pareto optimal solutions of the problem for five different scenarios. The Pareto optimal solutions are used to draw the Pareto optimal fronts which act as an essential decision making tool. The overall results show that the proposed model is efficient enough to be employed setting timetables on transit networks with different sizes.
    Keywords: Public transportation, Bus line timetable setting, mathematical modelling, mixed-integer programming, Genetic Algorithm
  • علیرضا علما، مختار شاصادقی*، امین رمضانی
    کنترل پیش بین سیستم های هایبرید با دو چالش اساسی تضمین پایداری حلقه-بسته و همچنین کاهش پیچیدگی محاسباتی روبه رو می باشد. در این مقاله، پایداری نمایی حلقه-بسته سیستم های هایبرید توصیف شده توسط مدل مرکب منطقی دینامیکی توسط کنترل پیش بین مدل تحلیل می شود. برای این منظور، استفاده از شرط نزولی بودن یک تابع لیاپانوف مبتنی بر نرم بی نهایت متغیرهای حالت سیستم، به جای تحمیل قید مساوی نهایی در مسئله کنترل پیش بین مدل سیستم های مرکب منطقی دینامیکی پیشنهاد می شود. شرایط تضمین پایداری نمایی حلقه-بسته با استفاده از روش پیشنهادی دارای عملکرد بهتری هم از نظر پیاده سازی کنترل کننده و هم از نظر پیچیدگی محاسباتی است . علاوه بر این، با استفاده از این روش، شرایط پایداری نمایی حلقه-بسته نقطه تعادل به مقدار افق پیش بینی سیستم وابسته نمی باشد و همین امر می تواند یکی از مهم ترین مزایای این روش در نظر گرفته شود. با استفاده از شرط نزولی بودن تابع لیاپانوف در فرمول بندی کنترل پیش بین مدل برای سیستم های مرکب منطقی دینامیکی، نسخه زیربهینه سیگنال کنترل با حجم محاسباتی بسیار کمتر به دست می آید. به منظور بررسی عملکرد روش پیشنهادشده، مسئله پایدارسازی در سیستم تعلیق خودرو مورد مطالعه و شبیه سازی قرار می گیرد.
    کلید واژگان: کنترل کننده پیش بین مدل, سیستم های هایبرید مرکب منطقی دینامیکی, پایداری, برنامه ریزی صحیح-مرکب
    A. Olama, M. Shasadeghi *, A. Ramezani
    There are two main challenges in control of hybrid systems which are to guarantee the closed-loop stability and reduce computational complexity. In this paper, we propose the exponential stability conditions of hybrid systems which are described in the Mixed Logical Dynamical (MLD) form in closed-loop with Model Predictive Control (MPC). To do this, it is proposed to use the decreasing condition of infinity norm based Lyapunov function instead of imposing the terminal equality constraint in the MPC formulation of MLD system. The exponential stability conditions have a better performance from both implementation and computational points of view. In addition, the exponential stability conditions of the equilibrium point of the MLD system do not depend on the prediction horizon of MPC problem which is the main advantage of the proposed method. On the other hand, by using the decreasing condition of the Lyapunov function in the MPC setup, the suboptimal version of the control signal with reduced complexity is obtained. In order to show the capabilities of the proposed method, the stabilization problem of the car suspension system is studied.
    Keywords: model predictive control, Mixed logical dynamical system, Mixed integer programming
  • Lorena Pradenas *, German Bravo, Rodrigo Linfati
    Sawmills are an important part of the forest supply chain, and as at any company, their production planning is highly complex. Planning in the remanufacturing area, in terms of its economic contribution to the sawmill and the supply chain, has not been studied in the scientific literature. The goal of this study was to develop and solve a mixed-integer linear programming model by employing an efficient allocation of cutting patterns on in-stock logs to maximize profits. To quantify the impact of an appropriate use of raw materials in the remanufacturing area in a sawmill, real and generated data were used. The model considers fixed and variable production costs, the availability of raw material, the capacity of the processes, the sale price of the products and the demand, for a process period of one month. The proposed compact mixed-integer linear programming model was solved using the commercial solver IBM ILGO CPLEX12.8. It was determined that the additional margin in USD earned in the remanufacturing area for the considered scenarios amounted to an average of 21.6%. The proposed method facilitates evaluating the economic contribution of remanufacturing while identifying bottlenecks and assessing proposed scenarios.
    Keywords: Forest industry, Planning in sawmills, Tactical planning, Mixed Integer Programming, Forest optimization
  • Yu-Chung Tsao *, Praveen Vijaya Raj Pushpa Raj
    Under conditions of consumer panic buying, satisfying demand with the available products is a complex problem. In reality, most retailers accept alternative products during panic situations. This study considers the case of firm-driven substitution of products (differing in weight) based on retailer preferences over two periods. In the proposed model, panic behavior emerged in the first period and supply disruption occurred in the second period. Under this model, retail stores were segmented into high index (valuable) and low index (less valuable) customers. Before meeting the demand of low-index customers, wholesalers attempt to satiate high-index customer’s panic buying behavior. We determined the optimal number of units to be substituted, order quantities, and leftover units that generated maximum total profits for the wholesaler. The performance of the model was analyzed both with and without customer-segmented substitution. To gain managerial insights, we also examined the influence of both the degree of supply disruption and substitution costs on decisions and profits. The results can assist business managers to improve the decision-making process.
    Keywords: panic buying, product substitution, service level, customer segmentation, mixed-integer programming
  • محمد مهدی نصیری*، سمانه کرلو

    یکی از مسایلی که جوامع شهری با آن روبه رو هستند مدیریت زباله است. در این مقاله، مکان های دفن زباله ها، ظرفیت این مکان ها، مکان ایستگاه های انتقال، ظرفیت آن ها و مکان محل های بازیافت زباله را به گونه ای تعیین می کنیم که کل هزینه (شامل هزینه های احداث مراکز، حمل ونقل زباله از محل تولید تا محل پالایش، دفن و بازیافت) حداقل شود. هم چنین، برای رعایت محدودیت های زیست محیطی با تعریف کردن حداکثر مجاز آلودگی برای هر مرکز جمعیت، میزان آلودگی را کنترل می کنیم. در این پژوهش، مسئله به صورت یک مدل برنامه ریزی عدد صحیح آمیخته فرمول بندی شده است. سپس ظرفیت محل دفن و ظرفیت محل پالایش غیرقطعی در نظر گرفته شده و مدل به صورت بهینه سازی استوار توسعه یافته است. همچنین برای اعتبارسنجی مدل، یک مسئله نمونه حل شده و نتایج محاسباتی به ازای سطوح متفاوتی از محافظه کاری ارایه گردیده است. تصمیم گیرنده می تواند از این نتایج برای انتخاب سطح محافظه کاری مناسب استفاده نماید.

    کلید واژگان: مدیریت زباله شهری, مکان یابی محل دفن زباله, بهینه سازی استوار, برنامه ریزی عدد صحیح آمیخته
    MohammadMahdi Nasiri *, Samaneh Korlou

    One of the issues facing urban communities is waste management. In this paper, we determine the location of landfills, the capacity of these sites, the location of transfer stations, their capacity, and the location of waste recycling centers in such a way that the total costs (including the costs of establishment and transportation of waste from production to refining sites, landfills and recycling centers) are minimized. We also control pollution levels by defining a maximum allowable pollution for each population center to comply with environmental constraints. In this study, the problem is formulated as a mixed integer programming model. Then, the capacity of the landfill and the capacity of the refining sites are considered as uncertain parameters and a robust optimization model is developed. Also, to validate the model, a problem instance is solved and the computational results are presented for different levels of conservatism. The decision maker can use the results to select the appropriate level of conservatism.

    Keywords: Urban waste management, Landfill location, Robust Optimization, Mixed Integer Programming
  • مجتبی مغربی*، علیرضا جلالی یزدی، جعفر بلوری بزاز

    در پروژه های ساختمانی بلند-مرتبه، فراهم بودن منابع از جمله نیروی انسانی و مصالح مورد نیاز، دقیقا پیش از آغاز فعالیت های ساختمانی، عاملی بحرانی است که مستقیما بر پیشرفت پروژه تاثیر گذار خواهد بود. تیم مدیریت پروژه، به منظور جلوگیری از تاخیرات ناشی از عدم وجود منابع انسانی و مصالح ساختمانی، همواره در پی یافتن راهی برای تسهیل فرآیند تامین مصالح و نیروهای انسانی در طی فرآیند ساخت و ساز می باشد. این امر به ویژه در ساختمان های بلند مرتبه که شامل تعداد بسیار زیادی از فعالیت های تکراری و همزمان هستند و حمل و نقل می بایست در ارتفاع نیز صورت پذیرد اهمیت بیشتری پیدا می کند. در حین ساخت و ساز ساختمان های بلند مرتبه حمل و نقل عمودی فقط توسط ماشین آلاتی خاص از جمله تاور کرین ها و بالابر ها امکان پذیر است. در پژوهش های گذشته مشاهده شده است که شبیه سازی حمل و نقل عمودی باعث شناخت دقیق تر عملکرد لیفت ها شده است. در این پژوهش یک مدل ریاضی برای بهینه سازی برنامه روزانه عملکرد بالابرها در ساختمان های بلند مرتبه ی توسعه داده خواهد شد و مدل بدست آمده در بهینه کردن حمل و نقل عمودی یک برج 34 طبقه در شهر مشهد مقدس تست خواهد شد.

    کلید واژگان: ساختمان بلند مرتبه, بالابر, لیفت, بهینه سازی, برنامه ریزی عدد صحیح
    Mojtaba Maghrebi *, Alireza Jalali Yazdi, Jafar Bolouri Bazaz

    The availability of resources such as workforce and materials at each level of a high-rise construction project just before the commencement of building tasks is a crucial issue that might have direct impacts on project progress. To avoid delays caused by lack of human resources and construction materials, a construction management team always tries to find a better way to facilitate supply chain process specifically for construction projects facing a significant number of simultaneous and repetitive tasks. The other challenge in a high-rise construction project is vertical transportation that requires detailed machinery e.g. cranes or lifts, and maximizing their utilities is another challenge. In this paper, we tried to automate vertical transportation planning process in high-rise construction projects by introducing a platform that handles the entire lifting process. This platform considers (i) tasks attributes (e.g. required resources, location and commencement time) from the project schedule, (ii) lifting system specifications (e.g. travel speed, weight, and volume capacity) and (iii) project geometrics (e.g. current height of the project). In details, the introduced platform provides an optimized daily-based delivery plan by developing a Mixed-Integer Programming (MIP) model that covers workforce and construction materials. In this paper, we also test the proposed platform with field data obtained from a 34-story construction project in Mashhad, Iran. The model could find a solution with 0.000% optimality gap in approximately one hour, which is an acceptable amount of computational cost for the problem.

    Keywords: High rise construction, lift, optimization, mixed integer programming, Graph Theory
  • M. Yazdi *, M. Zandieh, H. Haleh
    The ever-increasing demands for surgeries and the limited resources force hospitals to have efficient management of resources, especially the expensive ones like operating rooms (ORs). Scheduling surgeries including sequencing them, assigning resources to them and determining their start times is a complicated task for hospital managers. Surgery referrals usually include elective surgeries that are admitted before the planning horizon of the schedule and emergency surgeries that arrive during this horizon and require fast services. In this paper, we presented a mathematical model for scheduling electives and emergencies. In our model, we considered surgeries as projects with multi-activities. We implemented the Break-in-Moments (BIMs) technique in this structure, which to our best knowledge has not been implemented in the literature before. We examined this method with real data from a medium-sized Norwegian hospital and observed that this method reduces the waiting time of emergencies to be inserted into the schedule without dedicating any OR merely to emergencies. In such a way, this method counterbalances between efficient OR usage and responsiveness for emergency surgeries.
    Keywords: Break-in-Moments, Mixed-Integer Programming, Operating Room Management, Project scheduling, Surgery Scheduling Problem
  • Sepideh Khalafi, Ashkan Hafezalkotob *, Davood Mohamaditabar, MohammadKazem Sayadi

    Recently, following the raise in expense pressures led to lower economic growth, an increasing number of manufacturers have begun to investigate eventuality of handling returned product in a more cost-effective and proper procedure. Significance of Reverse Logistics (RL) is becoming greater due to various governmental, societal, and environmental reasons. Number of papers present in the literature on RLs is a well index of its importance. In some industries, appropriately collected returned products could be used as raw material for another product, increasing Supply Chain (SC) profits and reducing the waste. Since, perishable goods have a limited shelf -life, they can be reusable if they are collected before they reach a critical time. Accordingly, in the present study, a Mixed Integer Linear Programming (MILP) model was introduced for a network of closed-loop SC with recycling of returned perishable goods, involving suppliers, producers, retailers, together with collection and disposal centers, in a multi-product, multi-period, and multi-level basis. To do this, a case study was performed on milk and yogurt products of a company in dairy industry. The model was solved and analyzed using GAMS software. Results obtained from assessment of the model indicated that, timely collection of perishable goods and their use in production of new products reduces total costs of perishable SC network.

    Keywords: Closed-loop supply chain, forward, reverse logistics, mixed integer programming, perishable products
  • علی پرهیزکار، محمد تاجی، امیر حسین بانگیان تبریزی*، علی مظفری

    در این پژوهش، یک مدل یکپارچه برای یافتن اندازه مطلوب بلوک انفجار ارائه میشود که طی آن در گام نخست با استفاده از یک روش تصمیمگیری چند معیاره اندازه بلوک معدنی قابل استخراج احصاء شده و متعاقبا با روش برنامهریزی خطی برای انتخاب بلوک انفجاری به منظور حفاری و تصمیم گیری در مورد مقدار سنگ معدن و باطله در هر یک از بلوکهای منتخب اقدام میشود. این دو روش با استفاده از داده های چالهای تولیدی علاوه بر گمانه های معمول اکتشافی برای بهبود ارزیابی و تعیین دقیقتر خصوصیات سنگ معدن و بلوک انفجاری استفاده میشود. این پژوهش با هدف ایجاد یک مدل ریاضی برای شناسایی طول و عرض بهینه بلوک به منظور کاهش هزینه های حفاری و انفجار در معادن روباز انجام شده است. در نتیجه، اندازه بلوک انفجاری موثر با هدف کاهش هزینه های حفاری و انفجار مورد توجه قرار میگیرد. علاوه بر این، مجموعه کاملی از اصول کاربردی برای تعیین ابعاد مناسب بلوک قابل استخراج با استفاده از روش تصمیمگیری چند معیاره با رویکرد منطق فازی ارائه شده است. مدل فوق برای پیشبینی اندازه بلوک مورد نیاز برای برنامهریزی تولید استفاده میشود. در مرحله بعد مدلی مبتنی بر برنامهریزی عدد صحیح مختلط تبیین شد تا به وسیله آن با در نظر گرفتن برنامهریزی انفجار، امکان تعیین ابعاد بهینه بلوک انفجار فراهم شود. مدل ارائه شده در معدن سنگ آهن چادرملو مورد استفاده قرار گرفت و روایی و پایایی آن با نتایج حاصل در شرایط متفاوت نشان داده شد.

    کلید واژگان: اندازه بلوک انفجاری, بلوک قابل استخراج, بهینهسازی, معدن روباز, برنامهریزی عدد صحیح مختلط, منطق فازی
    A. Mozafari, A.H. Bangian Tabrizi*, M. Taji, A. Parhizkar

    In this paper, we present an integrated model to find the optimum size of blast block that uses (i) a multi-criteria decision-making method to specify the applicable size of the mineable block; (ii) a linear programming method for the selection of the blasted areas to be excavated and in deciding the quantity of ores and wastes to be mined from each one of the selected blocks. These two methods use improved estimates of the orebody characteristics utilizing the blast hole data in addition to the usual borehole statistics to improve the prediction accuracy of the block level ore body characteristics. This work aims to make a mathematical model to figure out the ideal width and length of the blast block in order to curtail drilling and blasting expenses in open-pit mines. As a consequence, the effective blast block size is heeded so as to decrease the expenses of drilling and blasting. Furthermore, a complete set of actual principles is presented to specify the applicable size of the mineable block by means of the multi-criteria decision-making method of fuzzy logic. The aforementioned model is practiced to forecast the block size necessary for the purpose of production planning. Next, a mixed integer programming model is developed to blast planning in order to select the optimal size of the blast block by considering the mineable block. The proposed model is applied in the Chadormalu iron ore mine and the rationality of the model is demonstrated by the outcomes of dissimilar circumstances.

    Keywords: Blast Block Size, Mineable Block, Optimization, Open-Pit Mine, Mixed Integer Programming, Fuzzy Logic
  • Javad Nikoukar *, Majid Khalili

    Due to the ever-growing load, especially peak load, the increase in the capacity of plants is inevitable for the response to this growth. Peak load causes increases in customer costs and vast investments in generating and transmission parts. Therefore, restructuring in the electrical industry, competition in the electrical market and Demand Response Programs (DRPs) are of special importance in power systems. In DRPs, customers in certain periods, such as peak or times when the price is high, decrease self-consumption. It means profit for costumers and prevention of expensive production in peak time for a genera-tion source. Moreover, to decrease the operation cost of network and ever-growing technology significantly, the power sys-tems operators have employed new sources of energy production as well as thermal units, and it has led to the emergence of Electric Vehicles (EVs) technology as a new source of energy production. This paper studies the simultaneous presence of DRPs and EVs to minimize the total operation cost of a network from one hand and from the other to improve the level of system reserve in Unit Commitment (UC) problem with considering the security constraint. Here, the proposed framework is structured as a Mixed Integer Programming (MIP) and solved using CPLEX solver.

    Keywords: Demand Response, Mixed Integer Programming, security constrained unit commitment, electric vehicles
  • Reza Behmanesh, Mostafa Zandieh *, Seyyed Mohammad Hadji Molana
    In this paper, we address the surgical case scheduling problem in multi operating theater environment with uncertain service times in order to minimize makespan. In surgical case scheduling, not only the hospital resources are allocated to surgical cases but also the start time of performing surgeries is determined based on sequence of cases in a short-term time horizon. We consider fuzzy numbers for duration times of all stages and hereafter the problem called fuzzy surgical case scheduling. Since the operational environment in the problem is similar to no-wait multi-resource fuzzy flexible job shop problem, we consider constraints of that for formulating and solving problem. This problem is strongly an NP-hard optimization problem, hence we employ ant system algorithm to tackle problem. The proposed approach is illustrated by detailed examples of three test cases, and numerical computational experiments. Therefore, the performance of proposed algorithm is compared with a schedule constructed by first-come-first-service rule on all test instances. Also, a real case is provided from Isfahan’s hospital to evaluate proposed algorithm.  Consequently, computational experiments state that algorithm outperforms results obtained by hospital planning as well as fuzzy rule, and these indicate efficiency and capability of our algorithm for optimizing the makespan.
    Keywords: Surgical case scheduling, Ant System, Operating theater, Fuzzy duration time, Makespan, Mixed integer programming
  • معصومه حسین پور*، علیرضا فخارزاده جهرمی
    در دهه های اخیر نظریه ی بهینه سازی استوار (مقاوم) به عنوان ابزاری توانمند جهت بهینه یابی فرآیندهای غیرقطعی معرفی کرده است. نظربه قطعی نبودن میزان بارگلیسمی مواد غذایی مصرفی، هدف اصلی این مقاله تهیه ی رژیم غذایی بهینه ایرانی با استفاده از بهینه سازی استوار به منظور تنظیم بارگلیسمی در بیماران مبتلا به دیابت نوع 2 است. این درحالی است که دیابت نوع 2 یکی از بیماری های ویرانگری است که علاوه بر بیماری های قلبی-عروقی، عفونی و کلیه، مقاومت به انسولین و سرطان را در پی دارد و و داروهای کاهش دهنده ی کلسترول، خطر عوارض قلبی-عروقی و حتی ابتلا به سرطان را در خود دارند. در این راستا، تنظیم تغذیه در پیشگیری، کنترل و جلوگیری یا کاهش عوارض حاصل از دیابت نقش مهمی دارد. در این تحقیق پس از جمع آوری اطلاعات تغذیه ای لازم، به جهت عدم قطعیت بارگلیسمی غذاها، مدل رژیم غذایی ایرانی را با استفاده از روش بهینه سازی استوار تعیین و مورد تحلیل قرار داده ایم. بر این اساس، 75 نوع غذا (42 غذای ایرانی، 10 ماده غذایی جهت صبحانه، 20 نوع میوه و آب میوه و3 نوع لبنیات) به صورت بومی مورد مطالعه قرار گرفته است. از مزایای این مدل، توانایی تطبیق بر اساس سلیقه ی شخص و نظر متخصص تغذیه با هدف کمینه سازی تغییرات رژیم غذایی فعلی فرد می باشد.
    کلید واژگان: رژیم غذای ایرانی, شاخص و بارگلیسمی, بهینه سازی استوار (مقاوم), برنامه ریزی عدد صحیح آمیخته
    Masomeh Hoseinpour *, Alireza Fakharzadeh Jahromi
    In recent decades, the theory of robust optimization has been introduced as a powerful tool for optimizing uncertain processes. Regarding the Uncertainty of the glycemic load of consumed food, the main purpose of this article is to provide an optimal Iranian diet using a robust optimization to adjust the glycemic load in patients with type 2 diabetes. Diabetes type 2 is a devastating disease, in addition to cardiovascular disease, infectious and kidney diseases, causes insulin resistance and cancer and drugs of cholesterol-lowering have an increased risk of cardiovascular complications and incidence of cancer. Indeed, adjustment of nutrition is important to prevent and control or reduce the complications of diabetes. In this paper, due to the uncertainty of the glycemic load of foods, with collecting necessary nutritional information, the Iranian diet model is determined and analyzed by robust optimization method. According to this, 75 cases of food (42 Iranian food, 10 Foodstuffs for breakfast, 20 types of fruits and Fruit juices and 3 types of dairy products) have been studied locally. The benefits of this model are the ability to adapt according to the person's tastes and opinion of the nutritionist with minimizing changes for the current diet of the individual.
    Keywords: Iranian diet, Glycemic index, load, robust optimization, Mixed-Integer Programming
نکته
  • نتایج بر اساس تاریخ انتشار مرتب شده‌اند.
  • کلیدواژه مورد نظر شما تنها در فیلد کلیدواژگان مقالات جستجو شده‌است. به منظور حذف نتایج غیر مرتبط، جستجو تنها در مقالات مجلاتی انجام شده که با مجله ماخذ هم موضوع هستند.
  • در صورتی که می‌خواهید جستجو را در همه موضوعات و با شرایط دیگر تکرار کنید به صفحه جستجوی پیشرفته مجلات مراجعه کنید.
درخواست پشتیبانی - گزارش اشکال