Search results

Developing an optimized project schedule that considers all decision criteria represents a challenge for project managers. The purpose of this paper is to provide a multi-objectives overall optimization model for project scheduling considering time, cost, resources, and cash flow. This development aims to overcome the limitations of optimizing each objective at once resulting of non-overall optimized schedule.

In this paper, a multi-objectives overall optimization model for project scheduling is developed using particle swarm optimization with a new evolutionary strategy based on the compromise solution of the Pareto-front. This model optimizes the most important decisions that affect a given project including: time, cost, resources, and cash flow. The study assumes each activity has different execution methods accompanied by different time, cost, cost distribution pattern, and multiple resource utilization schemes.

Applying the developed model to schedule a real-life case study project proves that the proposed model is valid in modeling real-life construction projects and gives important results for schedulers and project managers. The proposed model is expected to help construction managers and decision makers in successfully completing the project on time and reduced budget by utilizing the available information and resources.

The paper presented a novel model that has four main characteristics: it produces an optimized schedule considering time, cost, resources, and cash flow simultaneously; it incorporates a powerful particle swarm optimization technique to search for the optimum schedule; it applies multi-objectives optimization rather than single-objective and it uses a unique Pareto-compromise solution to drive the fitness calculations of the evolutionary process.

The purpose of this paper is to explore new methods to improve supply chain management in uncertain environment, more specifically, to tackle the uncertain demand problem and the inventory optimization problem faced by most supply chain systems.

The paper develops a multi‐objective inventory optimization model, which combines the classic grey prediction GM(1,1) model with the metaheuristic method. The former is applied to achieve the forecasting mechanism in supply chain operations, and the latter is applied to optimize the model solution.

Results show that the grey‐based forecasting mechanism performs better than other prediction methods, such as the double exponential smoothing method used in this paper. The solution of the multi‐objective inventory optimization model is also improved with the integration of grey prediction method. These indicate the importance of a forecasting mechanism in supply chain management.

The paper succeeds in constructing a novel inventory optimization model and in providing a novel supply chain management framework. It shows for the first time that grey prediction method combined with metaheuristic method may be a valid approach to supply chain management under uncertain environment.

The optimization of investment portfolios is a topic of major importance in financial decision making, with many relevant models available in the relevant literature. The purpose of this paper is to perform a thorough comparative assessment of different bi-objective models as well as multi-objective one, in terms of the performance and robustness of the whole set of Pareto optimal portfolios.

In this study, three bi-objective models are considered (mean-variance (MV), mean absolute deviation, conditional value-at-risk (CVaR)), as well as a multi-objective model. An extensive comparison is performed using data from the Standard and Poor’s 500 index, over the period 2005–2016, through a rolling-window testing scheme. The results are analyzed using novel performance indicators representing the deviations between historical (estimated) efficient frontiers, actual out-of-sample efficient frontiers and realized out-of-sample portfolio results.

The obtained results indicate that the well-known MV model provides quite robust results compared to other bi-objective optimization models. On the other hand, the CVaR model appears to be the least robust model. The multi-objective approach offers results which are well balanced and quite competitive against simpler bi-objective models, in terms of out-of-sample performance.

This is the first comparative study of portfolio optimization models that examines the performance of the whole set of efficient portfolios, proposing analytical ways to assess their stability and robustness over time. Moreover, an extensive out-of-sample testing of a multi-objective portfolio optimization model is performed, through a rolling-window scheme, in contrast static results in prior works. The insights derived from the obtained results could be used to design improved and more robust portfolio optimization models, focusing on a multi-objective setting.

In this study, a mixed-model assembly line (MMAL) balancing problem is applied in a make-to-order (MTO) environment. One of the important problems in MTO systems is identifying the control points, which is considered by designing a control system. Furthermore, the worker assignment problem is defined by considering abilities and operating costs of workers. The proposed model is solved in two stages. First, a multi-objective model by simultaneously minimizing the number of stations and the total cost of the task duplication and workers assignment is considered. The second stage is designing a control system to minimize the work in process.

To solve this problem, a non-dominated sorting genetic algorithm (NSGA-II) is introduced and the proposed model is compared with four multi-objective algorithms (MOAs).

The proposed model is compared with four MOAs, i.e. multi-objective particle swarm optimization, multi-objective ant colony optimization, multi-objective firefly algorithm and multi-objective simulated annealing algorithm. The computational results of the NSGA-II algorithm are superior to the other algorithms, and multi-objective ant colony optimization has the best running time of the four MOA algorithms.

With attention to workers assignment in a MTO environment for the MMAL balancing problem, the present research has several significant implications for the rapidly changing manufacturing challenge.

To the best of the authors’ knowledge, no study has provided for the MMAL balancing problem in a MTO environment considering control points. This study provides the first attempt to fill this research gap. Also, a usual assumption in the literature that common tasks of different models must be assigned to a single station is relaxed and different types of real assignment restrictions like resource restrictions and tasks restrictions are described.

Globalization of markets and pace of technological change have caused the growing importance of paying attention to supplier selection problem. Therefore, this study aims to choose the best suppliers by providing a mathematical model for the supplier selection problem considering the green factors and stochastic parameters. This paper aims to propose a multi-objective model to identify optimal suppliers for a green supply chain network under uncertainty.

The objective of this model is to select suppliers considering total cost, total quality parts and total greenhouse gas emissions. Also, uncertainty is tackled by stochastic programming, and the multi-objective model is solved as a single-objective model by the LP-metric method.

Twelve numerical examples are provided, and a sensitivity analysis is conducted to demonstrate the effectiveness of the developed mathematical model. Results indicate that with increasing market numbers and final product numbers, the total objective function value and run time increase. In case that decision-makers are willing to deal with uncertainty with higher reliability, they should consider whole environmental conditions as input parameters. Therefore, when the number of scenarios increases, the total objective function value increases. Besides, the trade-off between cost function and other objective functions is studied. Also, the benefit of the stochastic programming approach is proved. To show the applicability of the proposed model, different modes are defined and compared with the proposed model, and the results demonstrate that the increasing use of recyclable parts and application of the recycling strategy yield more economic savings and less costs.

This paper aims to present a more comprehensive model based on real-world conditions for the supplier selection problem in green supply chain under uncertainty. In addition to economic issue, environmental issue is considered from different aspects such as selecting the environment-friendly suppliers, purchasing from them and taking the probability of defective finished products and goods from suppliers into account.

A circular economy (CE) is an economic system that tries to eliminate waste and continually use resources. Due to growing environmental concerns, supply chain (SC) design should be based on the CE considerations. In addition, responding and satisfying customers are the challenges managers constantly encounter. This study aims to improve the design of an agile closed-loop supply chain (CLSC) from the CE point of view.

In this research, a new multi-stage, multi-product and multi-period design of a CLSC network under uncertainty is proposed that aligns with the goals of CE and SC participants. Recycling of goods is an important part of the CLSC. Therefore, a multi-objective mixed-integer linear programming model (MILP) is proposed to formulate the problem. Besides, a robust counterpart of multi-objective MILP is offered based on robust optimization to cope with the uncertainty of parameters. Finally, the proposed model is solved using the e-constraint method.

The proposed model aims to provide the strategic choice of economic order to the suppliers and third-party logistic companies. The present study, which is carried out using a numerical example and sensitivity analysis, provides a robust model and solution methodology that are effective and applicable in CE-related problems.

This study shows how all upstream and downstream units of the SC network must work integrated to meet customer needs considering the CE context.

The main goal of the CE is to optimize resources, reduce the use of raw materials, and revitalize waste by recycling. In this study, a comprehensive model that can consider both SC design and CE necessities is developed that considers all SC participants.

The purpose of this paper is to formulate and simulate the model for vehicle routing problem (VRP) on a practical application in logistics distribution.

Based on the real data of a distribution center in Utica, Michigan, USA, the design of VRP is modeled as a multi‐objective optimization problem which considers three objectives. The non‐dominated sorting genetic algorithm II (NSGA‐II) is adopted to solve this multi‐objective problem. On the other hand, the VRP model is simulated and an object‐oriented idea is employed to analyze the classes, functions, and attributes of all involved objects on VRP. A modularized objectification model is established on AnyLogic software, which can simulate the practical distribution process by changing parameters dynamically and randomly. The simulation model automatically controls vehicles motion by programs, and has strong expansibility. Meanwhile, the model credibility is strengthened by introducing random traffic flow to simulate practical traffic conditions.

The computational results show that the NSGA‐II algorithm is effective in solving this practical problem. Moreover, the simulation results suggest that by analyzing and controlling specific key factors of VRP, the distribution center can get useful information for vehicle scheduling and routing.

Multi‐objective problems are seldom considered on VRPs, yet they are of great practical value in logistics distribution. This paper is mainly focused on multi‐objective VRP which is derived from a practical distribution center. The NSGA‐II algorithm is applied in this problem and the AnyLogic software is employed as the simulation tool. In addition, this paper deals with several key factors of VRP in order to control and simulate the distribution process. The computational and simulation results regarding VRPs constitute the main contribution of our paper.

Due to the randomness and unpredictability of many disasters, it is essential to be prepared to face difficult conditions after a disaster to reduce human casualties and meet the needs of the people. After the disaster, one of the most essential measures is to deliver relief supplies to those affected by the disaster. Therefore, this paper aims to assign demand points to the warehouses as well as routing their related relief vehicles after a disaster considering convergence in the border warehouses.

This research proposes a multi-objective, multi-commodity and multi-period queueing-inventory-routing problem in which a queuing system has been applied to reduce the congestion in the borders of the affected zones. To show the validity of the proposed model, a small-size problem has been solved using exact methods. Moreover, to deal with the complexity of the problem, a metaheuristic algorithm has been utilized to solve the large dimensions of the problem. Finally, various sensitivity analyses have been performed to determine the effects of different parameters on the optimal response.

According to the results, the proposed model can optimize the objective functions simultaneously, in which decision-makers can determine their priority according to the condition by using the sensitivity analysis results.

The focus of the research is on delivering relief items to the affected people on time and at the lowest cost, in addition to preventing long queues at the entrances to the affected areas.

When designing an optimization model for use in a mass casualty event response, it is common to encounter the heavy and considerable demand of injured patients and inadequate resources and personnel to provide patients with care. The purpose of this study is to create a model that is more practical in the real world. So the concept of “predicting the resource and personnel shortages” has been used in this research. Their model helps to predict the resource and personnel shortages during a mass casualty event. In this paper, to deal with the shortages, some temporary emergency operation centers near the hospitals have been created, and extra patients have been allocated to the operation center nearest to the hospitals with the purpose of improving the performance of the hospitals, reducing congestion in the hospitals and considering the welfare of the applicants.

The authors research will focus on where to locate health-care facilities and how to allocate the patients to multiple hospitals to take into view that in some cases of emergency situations, the patients may exceed the resource and personnel capacity of hospitals to provide conventional standards of care.

In view of the fact that the problem is high degree of complexity, two multi-objective meta-heuristic algorithms, including non-dominated sorting genetic algorithm (NSGA-II) and non-dominated ranking genetic algorithm (NRGA), were proposed to solve the model where their performances were compared in terms of four multi-objective metrics including maximum spread index (MSI), spacing (S), number of Pareto solution (NPS) and CPU run-time values. For comparison purpose, paired t-test was used. The results of 15 numerical examples showed that there is no significant difference based on MSI, S and NPS metrics, and NRGA significantly works better than NSGA-II in terms of CPU time, and the technique for the order of preference by similarity to ideal solution results showed that NRGA is a better procedure than NSGA-II.

The planning horizon and time variable have not been considered in the model, for example, the length of patients’ hospitalization at hospitals.

Presenting an effective strategy to respond to a mass casualty event (natural and man-made) is the main goal of the authors’ research.

This paper strategy is used in all of the health-care centers, such as hospitals, clinics and emergency centers when dealing with disasters and encountering with the heavy and considerable demands of injured patients and inadequate resources and personnel to provide patients with care.

This paper attempts to shed light onto the formulation and the solution of a three-objective optimization model. The first part of the objective function attempts to maximize the covered population of injured patients, the second objective minimizes the distance between hospitals and temporary emergency operation centers and the third objective minimizes the distance between the warehouses and temporary centers.

This study aims to investigate a locating-routing-allocating problems and the supply chain, including factories distributor candidate locations and retailers. The purpose of this paper is to minimize system costs and delivery time to retailers so that routing is done and the location of the distributors is located.

The problem gets closer to reality by adding some special conditions and constraints. Retail service start times have hard and soft time windows, and each customer has a demand for simultaneous delivery and pickups. System costs include the cost of transportation, non-compliance with the soft time window, construction of a distributor, purchase or rental of a vehicle and production costs. The conceptual model of the problem is first defined and modeled and then solved in small dimensions by general algebraic modeling system (GAMS) software and non-dominated sorting genetic algorithm II (NSGAII) and multiple objective particle swarm optimization (MOPSO) algorithms.

According to the solution of the mathematical model, the average error of the two proposed algorithms in comparison with the exact solution is less than 0.7%. Also, the algorithms’ performance in terms of deviation from the GAMS exact solution, is quite acceptable and for the largest problem (N = 100) is 0.4%. Accordingly, it is concluded that NSGAII is superior to MOSPSO.

In this study, since the model is bi-objective, the priorities of decision makers in choosing the optimal solution have not been considered and each of the objective functions has been given equal importance according to the weighting methods. Also, the model has not been compared and analyzed in deterministic and robust modes. This is because all variables, except the one that represents the uncertainty of traffic modes, are deterministic and the random nature of the demand in each graph is not considered.

The results of the proposed model are valuable for any group of decision makers who care optimizing the production pattern at any level. The use of a heterogeneous fleet of delivery vehicles and application of stochastic optimization methods in defining the time windows, show how effective the distribution networks are in reducing operating costs.

This study fills the gaps in the relationship between location and routing decisions in a practical way, considering the real constraints of a distribution network, based on a multi-objective model in a three-echelon supply chain. The model is able to optimize the uncertainty in the performance of vehicles to select the refueling strategy or different traffic situations and bring it closer to the state of certainty. Moreover, two modified algorithms of NSGA-II and multiple objective particle swarm optimization (MOPSO) are provided to solve the model while the results are compared with the exact general algebraic modeling system (GAMS) method for the small- and medium-sized problems.