Search Results (16)

Background: The concept of Hyperconnected Megacity Parcel Logistics (HMPL) was introduced in 2018 and aims to enhance the efficiency, responsiveness, resilience, and sustainability of parcel movements in megacities. However, evaluating such fundamental solutions presents challenges and requires a comprehensive understanding of all stakeholders and decisions involved. Methods: This study introduces a discrete-event agent-based simulation platform that encompasses critical stakeholders and addresses various levels of decision-making. This platform provides an opportunity to evaluate key decisions within an HMPL structure. Results: To demonstrate the capability of the simulator, we assess the impact of package routing and consolidation strategies facilitated by HMPL compared to traditional practices. Preliminary findings suggest that increased interconnection among nodes in HMPL reduces transit times, thereby enabling tighter customer delivery services. However, examining different consolidation heuristics reveals potential trade-offs between handling and shipping costs under fixed shipment schedules, prompting further investigation into dynamic shipment services. Conclusions: The findings of this study suggest that the benefits of innovative approaches in a complex environment, such as parcel logistics, cannot be evaluated in isolation from other decisions. Accurate assessment of the ultimate outcomes and underlying trade-offs requires multi-faceted models that incorporate all key variables. Full article

In industries such as aircraft or train manufacturing, large-scale manufacturing companies often manage several complex projects. Each of these projects includes multiple tasks that share a set of limited resources. Typically, these tasks are also subject to time dependencies among them. One frequent goal in these scenarios is to minimize the makespan, or total time required to complete all the tasks within the entire project. Decisions revolve around scheduling these tasks, determining the sequence in which they are processed, and allocating shared resources to optimize efficiency while respecting the time dependencies among tasks. This problem is known in the scientific literature as the Resource-Constrained Project Scheduling Problem (RCPSP). Being an NP-hard problem with time dependencies and resource constraints, several optimization algorithms have already been proposed to tackle the RCPSP. In this paper, a novel discrete-event heuristic is introduced and later extended into an agile biased-randomized algorithm complemented with an adaptive capability to tune the parameters of the algorithm. The results underscore the effectiveness of the algorithm in finding competitive solutions for this problem within short computing times. Full article

This paper addresses the challenging scheduling of crude oil operations (SCOO) problem, characterized by the intricate sequencing of activities involving discrete events and continuous variables. Given the NP-Hard nature of scheduling problems due to their combinatorial complexity, this study employs a data-driven optimization approach. Initially, historical operational data relevant to the SCOO are scrutinized; however, due to data limitations, small-scale instances are solved using a mathematical programming model to generate data. Subsequently, operational solution data are processed using the Apriori algorithm, a renowned data mining technique. The insights gained are translated into heuristic rules, laying the groundwork for a novel data-driven heuristic algorithm tailored for the SCOO problem. This algorithm is then applied to a 45-day scheduling scenario, demonstrating the efficacy of the proposed approach. Full article

In automated storage and retrieval systems (AS/RSs), the utilization of intelligent algorithms can reduce the makespan required to complete a series of input/output operations. This paper introduces a simulation optimization algorithm designed to minimize the makespan in a realistic AS/RS commonly found in the steel sector. This system includes weight and quality constraints for the selected items. Our hybrid approach combines discrete event simulation with biased-randomized heuristics. This combination enables us to efficiently address the complex time dependencies inherent in such dynamic scenarios. Simultaneously, it allows for intelligent decision making, resulting in feasible and high-quality solutions within seconds. A series of computational experiments illustrates the potential of our approach, which surpasses an alternative method based on traditional simulated annealing. Full article

Automated guided vehicles (AGVs) stand out as a paradigmatic application of Industry 4.0, requiring the seamless integration of new concepts and technologies to enhance productivity while reducing labor costs, energy consumption, and emissions. In this context, specific industrial use cases can present a significant technological and scientific challenge. This study was inspired by a real industrial application for which the existing AGV literature did not contain an already well-studied solution. The problem is related to the sequencing of assigned tasks, where the queue formation dynamics and the resource sharing define the scheduling. The combinatorial nature of the problem requires the use of advanced mathematical tools such as heuristics, simulations, or a combination of both. A heuristic procedure was developed that generates candidate task sequences, which are, in turn, evaluated in a discrete-event simulation model developed in Simul8. This combined approach allows high-quality solutions to be generated and realistically evaluated, even graphically, by stakeholders and decision makers. A number of computational experiments were developed to validate the proposed method, which opens up some future lines of research, especially when considering stochastic settings. Full article

Many real-life applications of the vehicle routing problem (VRP) occur in scenarios subject to uncertainty or dynamic conditions. Thus, for instance, traveling times or customers’ demands might be better modeled as random variables than as deterministic values. Likewise, traffic conditions could evolve over time, synchronization issues should need to be considered, or a real-time re-optimization of the routing plan can be required as new data become available in a highly dynamic environment. Clearly, different solving approaches are needed to efficiently cope with such a diversity of scenarios. After providing an overview of current trends in VRPs, this paper reviews a set of heuristic-based algorithms that have been designed and employed to solve VRPs with the aforementioned properties. These include simheuristics for stochastic VRPs, learnheuristics and discrete-event heuristics for dynamic VRPs, and agile optimization heuristics for VRPs with real-time requirements. Full article

Outpatient Chemotherapy Appointment (OCA) planning and scheduling is a process of distributing appointments to available days and times to be handled by various resources through a multi-stage process. Proper OCAs planning and scheduling results in minimizing the length of stay of patients and staff overtime. The integrated consideration of the available capacity, resources planning, scheduling policy, drug preparation requirements, and resources-to-patients assignment can improve the Outpatient Chemotherapy Process’s (OCP’s) overall performance due to interdependencies. However, developing a comprehensive and stochastic decision support system in the OCP environment is complex. Thus, the multi-stages of OCP, stochastic durations, probability of uncertain events occurrence, patterns of patient arrivals, acuity levels of nurses, demand variety, and complex patient pathways are rarely addressed together. Therefore, this paper proposes a clustering and stochastic optimization methodology to handle the various challenges of OCA planning and scheduling. A Stochastic Discrete Simulation-Based Multi-Objective Optimization (SDSMO) model is developed and linked to clustering algorithms using an iterative sequential approach. The experimental results indicate the positive effect of clustering similar appointments on the performance measures and the computational time. The developed cluster-based stochastic optimization approaches showed superior performance compared with baseline and sequencing heuristics using data from a real Outpatient Chemotherapy Center (OCC). Full article

Many real-life combinatorial optimization problems are subject to a high degree of dynamism, while, simultaneously, a certain level of synchronization among agents and events is required. Thus, for instance, in ride-sharing operations, the arrival of vehicles at pick-up points needs to be synchronized with the times at which users reach these locations so that waiting times do not represent an issue. Likewise, in warehouse logistics, the availability of automated guided vehicles at an entry point needs to be synchronized with the arrival of new items to be stored. In many cases, as operational decisions are made, a series of interdependent events are scheduled for the future, thus making the synchronization task one that traditional optimization methods cannot handle easily. On the contrary, discrete-event simulation allows for processing a complex list of scheduled events in a natural way, although the optimization component is missing here. This paper discusses a hybrid approach in which a heuristic is driven by a list of discrete events and then extended into a biased-randomized algorithm. As the paper discusses in detail, the proposed hybrid approach allows us to efficiently tackle optimization problems with complex synchronization issues. Full article

In the last few decades, there has been a growing necessity for systems that handle market changes and personalized customer needs with near mass production efficiency, defined as the new mass customization paradigm. The Industry 5.0 vision further enhances the human-centricity aspect, in the necessity for manufacturing systems to cooperate with workers, taking advantage of their problem-solving capabilities, creativity, and expertise of the manufacturing process. A solution is to develop a flexible manufacturing system capable of handling different customer requests and real-time decisions from operators. This paper tackles these aspects by proposing a digital twin of a robotic system for solution preparation capable of making real-time scheduling decisions and forecasts using a simulation model while allowing human interventions. A discrete event simulation model was used to forecast possible system improvements. The simulation handles real-time scheduling considering the possibility of adding identical parallel machines. Results show that processing multiple jobs simultaneously with more than one machine on critical processes, increasing the robot speed, and using heuristics that emphasize the shortest transportation time can reduce the overall completion time by 82%. The simulation model has an animated visualization window for a deeper understanding of the system. Full article

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. Full article

We study infiltration of rainwater into fractured rock and the accompanying capillary exchange processes between fractures and matrix, hereafter referred to as fracture–matrix transfer (FMT). Its influence on the velocity of the wetting front for uniform and variable aperture fractures is of prime interest because it determines the penetration depth of infiltration pulses. FMT is modelled explicitly in a discrete fracture and matrix (DFM) framework realised using a hybrid finite element–finite volume discretisation with internal boundaries. The latter separate the fracture mesh from the rock matrix mesh with the benefit that the flow that occurs within the minute fracture subvolume can be tracked with great accuracy. A local interface solver deals with the transient nonlinear aspects of FMT, including spontaneous imbibition of the rock matrix. Two- and three-dimensional heuristic test cases are used to illustrate how FMT affects infiltration. For the investigated scenario, we find that—beyond a critical fracture aperture around 5–10-mm—infiltration rate is no longer affected by FMT. Fracture aperture variations promote in-fracture-plane fingering, with counter-current flow of water (downward) and air (upward). Fracture flow interacts with FMT in a complex fashion. For systems with a small fracture porosity (≤0.01%), our results suggest that intense, hour-long rainfall events can give rise to tens-of-meter-deep infiltration, depending on fracture/matrix properties and initial saturation of the fractured rock mass. Full article

In modern production systems, scheduling problems have to be solved in consideration of frequently changing demands and varying production parameters. This paper presents a approach combining forecasting and classification techniques to predict uncertainty from demands, and production data with heuristics, metaheuristics, and discrete event simulation for obtaining machine schedules. The problem is a hybrid flow shop with two stages, machine qualifications, skipping stages, and uncertainty in demands. The objective is to minimize the makespan. First, based on the available data of past orders, jobs that are prone to fluctuations just before or during the production phase are identified by clustering algorithms, and production volumes are adjusted accordingly. Furthermore, the distribution of scrap rates is estimated, and the quantiles of the resulting distribution are used to increase corresponding production volumes to prevent costly rescheduling resulting from unfulfilled demands. Second, Shortest Processing Time (SPT), tabu search, and local search algorithms are developed and applied. Third, the best performing schedules are evaluated and selected using a detailed simulation model. The proposed approach is validated on a real-world production case. The results show that the price for a very robust schedule that avoids underproduction with a high probability can significantly increase the makespan. Full article

Structural elements inserted in proteins are essential to define folding/unfolding mechanisms and partner recognition events governing signaling processes in living organisms. Here, we present an original approach to model the folding mechanism of these structural elements. Our approach is based on the exploitation of local, sequence-dependent structural information encoded in a database of three-residue fragments extracted from a large set of high-resolution experimentally determined protein structures. The computation of conformational transitions leading to the formation of the structural elements is formulated as a discrete path search problem using this database. To solve this problem, we propose a heuristically-guided depth-first search algorithm. The domain-dependent heuristic function aims at minimizing the length of the path in terms of angular distances, while maximizing the local density of the intermediate states, which is related to their probability of existence. We have applied the strategy to two small synthetic polypeptides mimicking two common structural motifs in proteins. The folding mechanisms extracted are very similar to those obtained when using traditional, computationally expensive approaches. These results show that the proposed approach, thanks to its simplicity and computational efficiency, is a promising research direction. Full article

Maintenance scheduling for geographically dispersed assets intricately and closely depends on the availability of maintenance resources. The need to have the right spare parts at the right place and at the right time inevitably calls for joint optimization of maintenance schedules and logistics of maintenance resources. The joint decision-making problem becomes particularly challenging if one considers multiple options for preventive maintenance operations and multiple delivery methods for the necessary spare parts. In this paper, we propose an integrated decision-making policy that jointly considers scheduling of preventive maintenance for geographically dispersed multi-part assets, managing inventories for spare parts being stocked in maintenance facilities, and choosing the proper delivery options for the spare part inventory flows. A discrete-event, simulation-based meta-heuristic was used to optimize the expected operating costs, which reward the availability of assets and penalizes the consumption of maintenance/logistic resources. The benefits of joint decision-making and the incorporation of multiple options for maintenance and logistic operations into the decision-making framework are illustrated through a series of simulations. Additionally, sensitivity studies were conducted through a design-of-experiment (DOE)-based analysis of simulation results. In summary, considerations of concurrent optimization of maintenance schedules and spare part logistic operations in an environment in which multiple maintenance and transpiration options are available are a major contribution of this paper. This large optimization problem was solved through a novel simulation-based meta-heuristic optimization, and the benefits of such a joint optimization are studied via a unique and novel DOE-based sensitivity analysis. Full article

Configurable process models are frequently used to represent business workflows and other discrete event systems among different branches of large organizations: they unify commonalities shared by all branches and describe their differences, at the same time. The configuration of such models is usually done manually, which is challenging. On the one hand, when the number of configurable nodes in the configurable process model grows, the size of the search space increases exponentially. On the other hand, the person performing the configuration may lack the holistic perspective to make the right choice for all configurable nodes at the same time, since choices influence each other. Nowadays, information systems that support the execution of business processes create event data reflecting how processes are performed. In this article, we propose three strategies (based on exhaustive search, genetic algorithms and a greedy heuristic) that use event data to automatically derive a process model from a configurable process model that better represents the characteristics of the process in a specific branch. These strategies have been implemented in our proposed framework and tested in both business-like event logs as recorded in a higher educational enterprise resource planning system and a real case scenario involving a set of Dutch municipalities. Full article