Looking at current enterprise resource planning systems shows that material requirements planning (MRP) is one of the main production planning approaches implemented there. The MRP planning ...parameters lot size, safety stock, and planned lead time, have to be identified for each MRP planned material. With increasing production system complexity, more planning parameters have to be defined. Simulation-based optimization is known as a valuable tool for optimizing these MRP planning parameters for the underlying production system. In this article, a fast and easy-to-apply simheuristic was developed with the objective to minimize overall costs. The simheuristic sets the planning parameters lot size, safety stock, and planned lead time for the simulated stochastic production systems. The developed simheuristic applies aspects of simulation annealing (SA) for an efficient metaheuristic-based solution parameter sampling. Additionally, an intelligent simulation budget management (SBM) concept is introduced, which skips replications of not promising iterations. A comprehensive simulation study for a multi-item and multi-staged production system structure is conducted to evaluate its performance. Different simheuristic combinations and parameters are tested, with the result that the combination of SA and SBM led to the lowest overall costs. The contributions of this article are an easy implementable simheuristic for MRP parameter optimization and a promising concept to intelligently manage simulation budget.
The use of simulation and reinforcement learning can be viewed as a flexible approach to aid managerial decision-making, particularly in the face of growing complexity in manufacturing and logistic ...systems. Efficient supply chains heavily rely on steamlined warehouse operations, and therefore, having a well-informed storage location assignment policy is crucial for their improvement. The traditional methods found in the literature for tackling the storage location assignment problem have certain drawbacks, including the omission of stochastic process variability or the neglect of interaction between various warehouse workers. In this context, we explore the possibilities of combining simulation with reinforcement learning to develop effective mechanisms that allow for the quick acquisition of information about a complex environment, the processing of that information, and then the decision-making about the best storage location assignment. In order to test these concepts, we will make use of the FlexSim commercial simulator.
The team orienteering problem (TOP) is a well-studied optimization challenge in the field of Operations Research, where multiple vehicles aim to maximize the total collected rewards within a given ...time limit by visiting a subset of nodes in a network. With the goal of including dynamic and uncertain conditions inherent in real-world transportation scenarios, we introduce a novel dynamic variant of the TOP that considers real-time changes in environmental conditions affecting reward acquisition at each node. Specifically, we model the dynamic nature of environmental factors—such as traffic congestion, weather conditions, and battery level of each vehicle—to reflect their impact on the probability of obtaining the reward when visiting each type of node in a heterogeneous network. To address this problem, a learnheuristic optimization framework is proposed. It combines a metaheuristic algorithm with Thompson sampling to make informed decisions in dynamic environments. Furthermore, we conduct empirical experiments to assess the impact of varying reward probabilities on resource allocation and route planning within the context of this dynamic TOP, where nodes might offer a different reward behavior depending upon the environmental conditions. Our numerical results indicate that the proposed learnheuristic algorithm outperforms static approaches, achieving up to 25% better performance in highly dynamic scenarios. Our findings highlight the effectiveness of our approach in adapting to dynamic conditions and optimizing decision-making processes in transportation systems.
In an effort to balance the distribution of services across a given territory, dispersion and diversity models typically aim to maximize the minimum distance between any pair of facilities. ...Specifically, in the capacitated dispersion problem (CDP), each facility has an associated capacity or level of service, and the objective is to select a set of facilities so that the minimum distance between any pair of them (dispersion) is maximized, while ensuring a user-defined level of service. This problem can be formulated as a linear integer model, where the sum of the capacities of the selected facilities must match or exceed the total demand in the network. Real-life applications often necessitate considering the levels of uncertainty affecting the capacity of the nodes. Failure to account for this uncertainty could lead to low-quality or infeasible solutions in practical scenarios. However, research addressing the stochastic version of the CDP is scarce. This paper introduces two models for the CDP with stochastic capacities, incorporating soft constraints and penalty costs for violating the total capacity constraint. The first model includes a probabilistic constraint to ensure the required level of service with a certain probability, while the second model introduces a soft constraint with penalty costs for violations. To solve both variants of the model, a forward–backward simheuristic algorithm is proposed. Our approach combines a metaheuristic algorithm with Monte Carlo simulation, enabling the efficient handling of the random behavior of node capacities and obtaining reliable solutions regardless of their probability distribution.
Transport activities and citizen mobility have a deep impact on enlarged smart cities. By analyzing Big Data streams generated through Internet of Things (IoT) devices, this paper aims to show the ...efficiency of using IoT analytics, as an agile optimization input for solving real-time problems in smart cities. IoT analytics has become the main core of large-scale Internet applications, however, its utilization in optimization approaches for real-time configuration and dynamic conditions of a smart city has been less discussed. The challenging research topic is how to reach real-time IoT analytics for use in optimization approaches. In this paper, we consider integrating IoT analytics into agile optimization problems. A realistic waste collection problem is modeled as a dynamic team orienteering problem with mandatory visits. Open data repositories from smart cities are used for extracting the IoT analytics to achieve maximum advantage under the city environment condition. Our developed methodology allows us to process real-time information gathered from IoT systems in order to optimize the vehicle routing decision under dynamic changes of the traffic environments. A series of computational experiments is provided in order to illustrate our approach and discuss its effectiveness. In these experiments, a traditional static approach is compared against a dynamic one. In the former, the solution is calculated only once at the beginning, while in the latter, the solution is re-calculated periodically as new data are obtained. The results of the experiments clearly show that our proposed dynamic approach outperforms the static one in terms of rewards.
In this paper, we analyze both the deterministic and stochastic versions of a team orienteering problem (TOP) in which rewards from customers are dynamic. The typical goal of the TOP is to select a ...set of customers to visit in order to maximize the total reward gathered by a fixed fleet of vehicles. To better reflect some real-life scenarios, we consider a version in which rewards associated with each customer might depend upon the order in which the customer is visited within a route, bonusing the first clients and penalizing the last ones. In addition, travel times are modeled as random variables. Two mixed-integer programming models are proposed for the deterministic version, which is then solved using a well-known commercial solver. Furthermore, a biased-randomized iterated local search algorithm is employed to solve this deterministic version. Overall, the proposed metaheuristic algorithm shows an outstanding performance when compared with the optimal or near-optimal solutions provided by the commercial solver, both in terms of solution quality as well as in computational times. Then, the metaheuristic algorithm is extended into a full simheuristic in order to solve the stochastic version of the problem. A series of numerical experiments allows us to show that the solutions provided by the simheuristic outperform the near-optimal solutions obtained for the deterministic version of the problem when the latter are used in a scenario under conditions of uncertainty. In addition, the solutions provided by our simheuristic algorithm for the stochastic version of the problem offer a higher reliability level than the ones obtained with the commercial solver.
The identification and selection of genetically superior animals for residual feed intake (RFI) could enhance productivity and minimize environmental impacts. The aim of this study was to use RNA-seq ...data to identify the differentially expressed genes (DEGs), known non-coding RNAs (ncRNAs), specific biomarkers and enriched biological processes associated with RFI of the liver in Nellore cattle in two genetic groups. In genetic group 1 (G1), 24 extreme RFI animals (12 low RFI (LRFI) versus 12 high RFI (HRFI)) were selected from a population of 60 Nellore bulls. The RNA-seq of the samples from their liver tissues was performed using an Illumina HiSeq 2000. In genetic group 2 (G2), 20 samples of liver tissue of Nellore bulls divergent for RFI (LRFI,
= 10 versus HRFI,
= 10) were selected from 83 animals. The raw data of the G2 were chosen from the ENA repository. A total of 1811 DEGs were found for the G1 and 2054 for the G2 (
-value ≤ 0.05). We detected 88 common genes in both genetic groups, of which 33 were involved in the immune response and in blocking oxidative stress. In addition, seven (
,
,
,
,
,
, and
) possible gene biomarkers were identified through a receiver operating characteristic analysis (ROC) considering an AUC > 0.70. The
gene was overexpressed in the LRFI group. This gene regulates the lipid metabolism protein turnover and inhibits cell death. We also found non-coding RNAs in both groups. MIR25 was up-regulated and SNORD16 was down-regulated in the LRFI for G1. For G2, up-regulated RNase_MRP and SCARNA10 were found. We highlight MIR25 as being able to act by blocking cytotoxicity and oxidative stress and RMRP as a blocker of mitochondrial damage. The biological pathways associated with RFI of the liver in Nellore cattle in the two genetic groups were for energy metabolism, protein turnover, redox homeostasis and the immune response. The common transcripts, biomarkers and metabolic pathways found in the two genetic groups make this unprecedented work even more relevant, since the results are valid for different herds raised in different ways. The results reinforce the biological importance of these known processes but also reveal new insights into the complexity of the liver tissue transcriptome of Nellore cattle.
Based on a real-world application in the semiconductor industry, this article models and discusses a hybrid flow shop problem with time dependencies and priority constraints. The analyzed problem ...considers a production where a large number of heterogeneous jobs are processed by a number of machines. The route that each job has to follow depends upon its type, and, in addition, some machines require that a number of jobs are combined in batches before starting their processing. The hybrid flow model is also subject to a global priority rule and a “same setup” rule. The primary goal of this study was to find a solution set (permutation of jobs) that minimizes the production makespan. While simulation models are frequently employed to model these time-dependent flow shop systems, an optimization component is needed in order to generate high-quality solution sets. In this study, a novel algorithm is proposed to deal with the complexity of the underlying system. Our algorithm combines biased-randomization techniques with a discrete-event heuristic, which allows us to model dependencies caused by batching and different paths of jobs efficiently in a near-natural way. As shown in a series of numerical experiments, the proposed simulation-optimization algorithm can find solutions that significantly outperform those provided by employing state-of-the-art simulation software.
In smart cities, unmanned aerial vehicles and self-driving vehicles are gaining increased concern. These vehicles might utilize ultra-reliable telecommunication systems, Internet-based technologies, ...and navigation satellite services to locate their customers and other team vehicles to plan their routes. Furthermore, the team of vehicles should serve their customers by specified due date efficiently. Coordination between the vehicles might be needed to be accomplished in real-time in exceptional cases, such as after a traffic accident or extreme weather conditions. This paper presents the planning of vehicle routes as a team orienteering problem. In addition, an ‘agile’ optimization algorithm is presented to plan these routes for drones and other autonomous vehicles. This algorithm combines an extremely fast biased-randomized heuristic and a parallel computing approach.
Simheuristics combine metaheuristics with simulation in order to solve the optimization problems with stochastic elements. This paper introduces the concept of fuzzy simheuristics, which extends the ...simheuristics approach by making use of fuzzy techniques, thus allowing us to tackle optimization problems under a more general scenario, which includes uncertainty elements of both stochastic and non-stochastic nature. After reviewing the related work, the paper discusses, in detail, how the optimization, simulation, and fuzzy components can be efficiently integrated. In order to illustrate the potential of fuzzy simheuristics, we consider the team orienteering problem (TOP) under an uncertainty scenario, and perform a series of computational experiments. The obtained results show that our proposed approach is not only able to generate competitive solutions for the deterministic version of the TOP, but, more importantly, it can effectively solve more realistic TOP versions, including stochastic and other uncertainty elements.
PDF
