-
دسترسی آزاد مقاله
1 - A Bi-objective Capacitated Single-Allocation Hub Location Problem with Reliability Assumption on Paths
F. Moeen Moghadas F. FuladiThe hub location problems are highly crucial due to their applications in the transportation and distribution area. Today, the complexities of solving the real world problems using the single-objective techniques are challenging. For a more real model, the present study چکیده کاملThe hub location problems are highly crucial due to their applications in the transportation and distribution area. Today, the complexities of solving the real world problems using the single-objective techniques are challenging. For a more real model, the present study considers a bi-objective capacitated single-allocation hub location problem assuming the reliability of paths. In addition to the capacity, the fixed costs for the hubs are considered, as well. Furthermore, while minimizing the cost, the reliability of the weakest path is making maximized. Three mathematical models are proposed for this problem. The performance of single-objective models is evaluated and then, the proposed bi-objective model is solved using the ε-constraint method. In the present study, the fixed cost is calculated using two different methods: one is based on the distance from the center of mass and another one depends on the hub capacity. The results reveal that the third model with the fixed cost based on the distance from the center of mass has the best performance. پرونده مقاله -
دسترسی آزاد مقاله
2 - The Bi-Objective Location-Routing Problem based on Simultaneous Pickup and Delivery with Soft Time Window
Elham Jelodari Mamaghani Mostafa SetakThe location-routing problem is the most significant and yet new research field in location problems that considers simultaneously vehicle routing problem features with original one for achieving high-quality integrated distribution systems in beside of the global optim چکیده کاملThe location-routing problem is the most significant and yet new research field in location problems that considers simultaneously vehicle routing problem features with original one for achieving high-quality integrated distribution systems in beside of the global optimum. Simultaneous pickup and delivery based on time windows are the two main characteristics of logistic management that have been used separately in most of the location routing problem in spite of their various real-life application with together. Furthermore, distribution manager always trying to create a distributed system layout along with the lowest total system cost and enhancing service levels for providing all customers satisfaction. Accordingly, in the current paper is considered the mentioned gap, that is to say the bi-objective capacitated location-routing problem based on simultaneous pickup and delivery with soft time window and multi depots (BOCLRPSPDSTW). For achieving the main goal, bi-objective mixed-integer linear programming model for BOCLRPSPDSTW, on the one hand minimizing summation of all problem costs and on the other hand, for meeting customer service level minimizing maximum summation of delivery times and service times are addressed. To solve the presented model, NSGAII and NRGA are proposed and at last efficiency of the anticipated solutions are depicted by testing them in a data set. پرونده مقاله -
دسترسی آزاد مقاله
3 - A Two-dimensional Warranty Model with Consideration of Customer and Manufacturer Objectives Solved with Non-dominated Sorting Genetic Algorithm
Amin Asadi Mohammad Saidi-Mehrabad Faranak Fathi AghdamWarranty is a powerful implement for marketing strategy that is used by manufacturersand creates satisfaction for consumers by ensuring to compensate for incorrect operation of the product. Warranty serviceresults ina cost named warranty cost for a manufacturer.This cos چکیده کاملWarranty is a powerful implement for marketing strategy that is used by manufacturersand creates satisfaction for consumers by ensuring to compensate for incorrect operation of the product. Warranty serviceresults ina cost named warranty cost for a manufacturer.This cost is a function of warranty policy, regions, and product failures pattern. Since this service coversthe cost of uncertain failure of the product, it makes some utility for customers. In this paper, we developed a novel customer utility function that is used as a customer objective to be maximized. In addition to the manufacturer objective, minimizing the warranty costisconsidered simultaneously. There are four restrictions on warranty parameters such as time, usage, unit product price and the R&D expenditure to be considered. Finally, we will propose a novel bi-objective model that maximizesthe utility function for customers and minimizesthe warranty cost for the manufacturer. This model will be solved with an evolutionary algorithmcalled Non-Dominated Sorting Genetic Algorithm (NSGA-II) and non-dominated Pareto solutionswill be gained from this method.To give a numerical instance, for a certain usage rate’s range of costumers, different warranties are provided and compared. It is believed that the computational results can help manufacturers to determine optimal solutions for the objective functions and consequentlywarranty parameters. پرونده مقاله -
دسترسی آزاد مقاله
4 - A Non-dominated Sorting Ant Colony Optimization Algorithm Approach to the Bi-objective Multi-vehicle Allocation of Customers to Distribution Centers
Jafar Bagherinejad Mina DehghaniDistribution centers (DCs) play important role in maintaining the uninterrupted flow of goods and materials between the manufacturers and their customers.This paper proposes a mathematical model as the bi-objective capacitated multi-vehicle allocation of customers to di چکیده کاملDistribution centers (DCs) play important role in maintaining the uninterrupted flow of goods and materials between the manufacturers and their customers.This paper proposes a mathematical model as the bi-objective capacitated multi-vehicle allocation of customers to distribution centers. An evolutionary algorithm named non-dominated sorting ant colony optimization (NSACO) is used as the optimization tool for solving this problem. The proposed methodology is based on a new variant of ant colony optimization (ACO) specialized in multi-objective optimization problem. To aid the decision maker choosing the best compromise solution from the Pareto front, the fuzzy-based mechanism is employed for this purpose. For ensuring the robustness of the proposed method and giving a practical sense of this study, the computational results are compared with those obtained by NSGA-II algorithm. Results show that both NSACO and NSGA-II algorithms can yield an acceptable number of non-dominated solutions. In addition, the results show while the distribution of solutions in the trade-off surface of both NSACO and NSGA-II algorithms do not differ significantly, the computational CPU time of NSACO is considerably lower than that of NSGA-II. Moreover, it can be seen that the fast NSACO algorithm is more efficient than NSGA-II in the viewpoint of the optimality and convergence. پرونده مقاله -
دسترسی آزاد مقاله
5 - Solving Bi-objective Model of Hotel Revenue Management Considering Customer Choice Behavior Using Meta-heuristic Algorithms
Surur Yaghobi Harzandi Amir Abbas NajafiThe problem of maximizing the benefit from a specified number of a particular product with respect to the behavior of customer choices is regarded as revenue management. This managerial technique was first adopted by the airline industries before being widely used by ma چکیده کاملThe problem of maximizing the benefit from a specified number of a particular product with respect to the behavior of customer choices is regarded as revenue management. This managerial technique was first adopted by the airline industries before being widely used by many others such as hotel industries. The scope of this research is mainly focused on hotel revenue management, regarding which a bi-objective model is proposed. The suggested method aims at increasing the revenue of hotels by assigning the same rooms to different customers. Maximization of hotel revenue is a network management problem aiming to manage several resources simultaneously. Accordingly, a model is proposed in this paper based on the customer choice behavior in which the customers are divided into two groups of business and leisure. Customers of the business group prefer products with full price, whereas products with discounts are most desirable for leisure customers. The model consists of two objectives, the first one of which maximizes the means of revenue, and the second one minimizes the dispersion of revenue. Since the problem under consideration is Non-deterministic Polynomial-time hard (NP-hard), two meta-heuristic algorithms of Non-dominated Sorting Genetic Algorithm-II (NSGA-II) and Multiple Objective Particle Swarm Optimization (MOPSO) are proposed to solve the problem. Moreover, the tuned algorithms are compared via the statistical analysis method. The results show that the NSGA-II is more efficient in comparison with MOPSO. پرونده مقاله -
دسترسی آزاد مقاله
6 - A Bi-objective Non-linear Approach for Determining the Ordering Strategy for Group B in ABC Analysis Inventory
Fatemeh Keshavarz-Ghorbani Seyed Hamid Reza PasandidehThe main aim of this research is to find the best inventory review policy for different types of items in group B in ABC analysis through minimizing the total cost of the system and maximizing the service level. Moreover, this study has considered several operational co چکیده کاملThe main aim of this research is to find the best inventory review policy for different types of items in group B in ABC analysis through minimizing the total cost of the system and maximizing the service level. Moreover, this study has considered several operational constraints such as limitations on storage space, number of orders, and allowable shortage. To solve this problem, first, an individual optimization method is utilized to obtain optimal solutions. Then, two classic and novel multi-objective optimization methods have been used to convert the bi-objective problem to a single-objective and reach the near-optimal solutions for both objectives simultaneously. Finally, the proposed methods are compared in terms of objective function values and computational time to find the better method. پرونده مقاله -
دسترسی آزاد مقاله
7 - A Bi-objective Optimization for Vendor Managed Inventory Model
Amir Hossein Niknamfar Seyed Hamid Reza PasandidehVendor managed inventory is a continuous replenishment program that is designed to provide major cost saving benefits for both vendors and retailers. Previous research on this area mainly included single objective optimization models where the objective is to minimize t چکیده کاملVendor managed inventory is a continuous replenishment program that is designed to provide major cost saving benefits for both vendors and retailers. Previous research on this area mainly included single objective optimization models where the objective is to minimize the total supply chain costs or to maximize the total supply chain benefits. This paper presents a bi-objective mathematical model for single-manufacture multi-retailer with multi-product in order to maximize their benefits. It is assumed that demand is a decreasing and convex function of the retail price. In this paper, common replenishment cycle is considered for the manufacturer and its retailers. Then, the proposed model converts to the single-objective optimization problem using a weighted sum method. A genetic algorithm (GA) is applied to solve it and response surface methodology is employed to tune the GA parameters. Finally, several numerical examples are investigated to demonstrate the applicability of the proposed model and solution approach. پرونده مقاله -
دسترسی آزاد مقاله
8 - A New Model for Location-Allocation Problem within Queuing Framework
Seyed Hamid Reza Pasandideh Amirhossain ChambariThis paper proposes a bi-objective model for the facility location problem under a congestion system. The idea of the model is motivated by applications of locating servers in bank automated teller machines (ATMS), communication networks, and so on. This model can be sp چکیده کاملThis paper proposes a bi-objective model for the facility location problem under a congestion system. The idea of the model is motivated by applications of locating servers in bank automated teller machines (ATMS), communication networks, and so on. This model can be specifically considered for situations in which fixed service facilities are congested by stochastic demand within queueing framework. We formulate this model with two perspectives simultaneously: (i) customers and (ii) service provider. The objectives of the model are to minimize (i) the total expected travelling and waiting time and (ii) the average facility idle-time. This model represents a mixed-integer nonlinear programming problem which belongs to the class of NP-hard problems. In addition, to solve the model, two metaheuristic algorithms including non-dominated sorting genetic algorithms (NSGA-II) and non-dominated ranking genetic algorithms (NRGA) are proposed. Besides, to evaluate the performance of the two algorithms some numerical examples are roduced and analyzed with some metrics to determine which algorithm works better. پرونده مقاله -
دسترسی آزاد مقاله
9 - A Comparison of NSGA II and MOSA for Solving Multi-depots Time-dependent Vehicle Routing Problem with Heterogeneous Fleet
Behrouz Afshar-nadjafi Arian Razmi-faroojiTime-dependent Vehicle Routing Problem is one of the most applicable but least-studied variants of routing and scheduling problems. In this paper, a novel mathematical formulation of time-dependent vehicle routing problems with heterogeneous fleet, hard time widows and چکیده کاملTime-dependent Vehicle Routing Problem is one of the most applicable but least-studied variants of routing and scheduling problems. In this paper, a novel mathematical formulation of time-dependent vehicle routing problems with heterogeneous fleet, hard time widows and multiple depots, is proposed. To deal with the traffic congestions, we also considered that the vehicles are not forced to come back to the depots, from which they were departed. In order to solve our bi-objective formulation, we presented two well-known Meta-heuristic algorithms, namely NSGA II and MOSA and compared their performance based on a set of randomly generated test problems. The results confirm that our MILP model is valid and both NSGA II and MOSA work properly. While NSGA II finds closer solutions to the true Pareto front, MOSA finds evenly- distributed solutions which allows the algorithm to search the space more diversely. پرونده مقاله -
دسترسی آزاد مقاله
10 - Evaluation of Bi-objective Scheduling Problems by FDH, Distance and Triangle Methods
S.M MousaviIn this paper, two methods named distance and triangle methods are extended to evaluate the quality of approximation of the Pareto set from solving bi-objective problems. In order to use evaluation methods, a bi-objective problem is needed to define. It is considered th چکیده کاملIn this paper, two methods named distance and triangle methods are extended to evaluate the quality of approximation of the Pareto set from solving bi-objective problems. In order to use evaluation methods, a bi-objective problem is needed to define. It is considered the problem of scheduling jobs in a hybrid flow shop environment with sequence-dependent setup times and the objectives of minimizing both the makespan and the total tardiness. The bi-objective genetic algorithm in literature is applied to solve this problem belongs to NP-hard class. In the structure of algorithm, 3 and 4 alternatives for dispatching rules and neighborhood search structure have been introduced respectively. Therefore, twelve algorithms are derived from a combination of dispatching rules and neighborhood search structures. After the execution of algorithms, efficient sets are compared through several evaluation methods. Computational results show that the FIFO rule is the best alternative for the dispatching rule in order to find the job sequence for the second to end stages. پرونده مقاله -
دسترسی آزاد مقاله
11 - Reused raw materials of returned products in closed-loop supply chain considering green technology and quality level
malihe ebrahimiIn recent years, reverse logistics has been given more research attention. Reverse logistics has backward and forward flow of products which customers are not end of the flow. Reverse logistics has environmental and economic benefits such as recovering the value of retu چکیده کاملIn recent years, reverse logistics has been given more research attention. Reverse logistics has backward and forward flow of products which customers are not end of the flow. Reverse logistics has environmental and economic benefits such as recovering the value of returning products, and contenting the environmental requirements. In this lecture, a new multi-objective mixed-integer non-linear program is suggested in order to minimize total cost and air pollution. Decreasing carbon emissions is considered related to environmental aspects or the second aim( minimizing air pollution). The new closed-loop supply chain (CLSC) model is an inventory-location multi-period problem. The demand in this model is depended on green technology and quality level. The returned products are disassembled and sorted, the good raw materials are sent to the manufacturers and other materials disposed. The LP-metric and utility function or total weighted methods /are applied to gain Pareto optimal solutions. Finally, a numerical example is applied for validating the new model. پرونده مقاله -
دسترسی آزاد مقاله
12 - رویکرد محدودیت شانس با امکان تصحیح نسبی در مساله انتخاب سبد سهام در بازار سرمایه ایران
میثم دعائی مهسا صابرفرددر این پژوهش مساله مدیریت سرمایهگذاری در شرکتهای موجود در بازار بورس اوراق بهادار تهران و فرابورس ایران به عنوان یک مساله بهینهسازی سبد سهام مورد بررسی قرار گرفته است. این مدل شامل دو تابع هدف شامل کمینهسازی ریسک و بیشینهسازی بازده است محدودیتهای مدل شامل محدودیت چکیده کاملدر این پژوهش مساله مدیریت سرمایهگذاری در شرکتهای موجود در بازار بورس اوراق بهادار تهران و فرابورس ایران به عنوان یک مساله بهینهسازی سبد سهام مورد بررسی قرار گرفته است. این مدل شامل دو تابع هدف شامل کمینهسازی ریسک و بیشینهسازی بازده است محدودیتهای مدل شامل محدودیت انتخاب شرکتها به صورت منحصربفرد و همچنین محدودیت بودجه است. جهت برخورد با شرایط عدم قطعیت موجود در پارامترهای مدل، از رویکرد محدودیتها شانسی استفاده میشود و توابع هدف نیز با استفاده از روش برنامهریزی آرمانی به عنوان یک مساله واحد درنظرگرفته میشود. جهت حل مساله در حالت دوهدفه از روش محدودیت اپسیلون تقویت شده استفاده میشود. مطابق با نتایج عددی میتوان مشاهده نمود که حل مساله در حالت دوهدفه قادر به تولید پاسخهای پارتویی بوده که در یک ساختار مناسب یکدیگر را مغلوب نمیکنند. همچنین در حالت عدم قطعیت استفاده از برنامهریزی آرمانی باعث حصول پاسخهای عددی با سطح عملکرد مناسب است و خروجیهایی منطبق با واقعیت میشود. در حقیقت خروجیهای مساله در هر دوحالت چندهدفه و تک هدفه قابلیت پیادهسازی در شرایط دنیای واقعی را دارد. لذا در نهایت میتوان گفت که استفاده از نتایج محاسباتی این پژوهش میتواند به عنوان یک ابزار عملیاتی مورد استفاده قرار گیرد. پرونده مقاله
سکوی نشر دانش
سند یا سکوی نشر دانش ،سامانه ای جهت مدیریت حوزه علمی و پژوهشی نشریات دانشگاه آزاد می باشد
پیوندهای سایت
مراکز مرتبط
پشتیبانی
صفحات رسمی
حقوق این وبسایت متعلق به سامانه مدیریت نشریات دانشگاه آزاد اسلامی است.
حق نشر © 1403-1400