38,860 research outputs found

    Investigating biocomplexity through the agent-based paradigm.

    Get PDF
    Capturing the dynamism that pervades biological systems requires a computational approach that can accommodate both the continuous features of the system environment as well as the flexible and heterogeneous nature of component interactions. This presents a serious challenge for the more traditional mathematical approaches that assume component homogeneity to relate system observables using mathematical equations. While the homogeneity condition does not lead to loss of accuracy while simulating various continua, it fails to offer detailed solutions when applied to systems with dynamically interacting heterogeneous components. As the functionality and architecture of most biological systems is a product of multi-faceted individual interactions at the sub-system level, continuum models rarely offer much beyond qualitative similarity. Agent-based modelling is a class of algorithmic computational approaches that rely on interactions between Turing-complete finite-state machines--or agents--to simulate, from the bottom-up, macroscopic properties of a system. In recognizing the heterogeneity condition, they offer suitable ontologies to the system components being modelled, thereby succeeding where their continuum counterparts tend to struggle. Furthermore, being inherently hierarchical, they are quite amenable to coupling with other computational paradigms. The integration of any agent-based framework with continuum models is arguably the most elegant and precise way of representing biological systems. Although in its nascence, agent-based modelling has been utilized to model biological complexity across a broad range of biological scales (from cells to societies). In this article, we explore the reasons that make agent-based modelling the most precise approach to model biological systems that tend to be non-linear and complex

    Modeling water resources management at the basin level: review and future directions

    Get PDF
    Water quality / Water resources development / Agricultural production / River basin development / Mathematical models / Simulation models / Water allocation / Policy / Economic aspects / Hydrology / Reservoir operation / Groundwater management / Drainage / Conjunctive use / Surface water / GIS / Decision support systems / Optimization methods / Water supply

    Optimization of manpower allocation by considering customer relationship management criteria and uncertainty conditions in car dealerships

    Get PDF
    Purpose A mathematical mixed integer model was used in this research in order to optimize manpower allocation in car industry. The objective function of proposed model subjected to minimization of the maximum waiting time for customers in service queue and limitations included manpower allocation and time calculation for each service in each center. Methodology: Therefore, mathematical optimization methods were employed in this research. To solve the problem at small dimensions, BARON solver was used through GAMS software. Metaheuristic algorithms were used to solve the large dimensions of problem due to NP-hard nature of allocation problem. However, these algorithms have been designed based on the natural elements; hence, a stochastic procedure is applied to generate initial responses and to improve the process to obtained the final response. Therefore, proper comparisons should be done to make sure of accurate performance of such procedure. To this end, three metaheuristic algorithms of Genetic, Harmony Search and Gray Wolf were used to solve the final problem. Findings: According to the obtained computational results, gray wolf algorithm had the highest performance efficiency compared to other algorithms so it is more practical in solving the real numerical samples. Originality/Value: The objective function of proposed model subjected to minimization of the maximum waiting time for customers in service queue and limitations included manpower allocation and time calculation for each service in each center. We used three metaheuristic algorithms, Genetic, Harmony Search and Gray Wolf, to solve the final problem

    A Survey of Agent-Based Modeling Practices (January 1998 to July 2008)

    Get PDF
    In the 1990s, Agent-Based Modeling (ABM) began gaining popularity and represents a departure from the more classical simulation approaches. This departure, its recent development and its increasing application by non-traditional simulation disciplines indicates the need to continuously assess the current state of ABM and identify opportunities for improvement. To begin to satisfy this need, we surveyed and collected data from 279 articles from 92 unique publication outlets in which the authors had constructed and analyzed an agent-based model. From this large data set we establish the current practice of ABM in terms of year of publication, field of study, simulation software used, purpose of the simulation, acceptable validation criteria, validation techniques and complete description of the simulation. Based on the current practice we discuss six improvements needed to advance ABM as an analysis tool. These improvements include the development of ABM specific tools that are independent of software, the development of ABM as an independent discipline with a common language that extends across domains, the establishment of expectations for ABM that match their intended purposes, the requirement of complete descriptions of the simulation so others can independently replicate the results, the requirement that all models be completely validated and the development and application of statistical and non-statistical validation techniques specifically for ABM.Agent-Based Modeling, Survey, Current Practices, Simulation Validation, Simulation Purpose

    Facility Layout Planning and Job Shop Scheduling – A survey

    Get PDF

    A Comprehensive Optimization Framework for Designing Sustainable Renewable Energy Production Systems

    Get PDF
    As the world has recognized the importance of diversifying its energy resource portfolio away from fossil resources and more towards renewable resources such as biomass, there arises a need for developing strategies which can design renewable sustainable value chains that can be scaled up efficiently and provide tangible net environmental benefits from energy utilization. The objective of this research is to develop and implement a novel decision-making framework for the optimal design of renewable energy systems. The proposed optimization framework is based on a distributed, systematic approach which is composed of different layers including systems-based strategic optimization, detailed mechanistic modeling and operational level optimization. In the strategic optimization the model is represented by equations which describe physical flows of materials across the system nodes and financial flows that result from the system design and material movements. Market uncertainty is also incorporated into the model through stochastic programming. The output of the model includes optimal design of production capacity of the plant for the planning horizon by maximizing the net present value (NPV). The second stage consists of three main steps including simulation of the process in the simulation software, identification of critical sources of uncertainties through global sensitivity analysis, and employing stochastic optimization methodologies to optimize the operating condition of the plant under uncertainty. To exemplify the efficacy of the proposed framework a hypothetical lignocellulosic biorefinery based on sugar conversion platform that converts biomass to value-added biofuels and biobased chemicals is utilized as a case study. Furthermore, alternative technology options and possible process integrations in each section of the plant are analysed by exploiting the advantages of process simulation and the novel hybrid optimization framework. In conjunction with the simulation and optimization studies, the proposed framework develops quantitative metrics to associate economic values with technical barriers. The outcome of this work is a new distributed decision support framework which is intended to help economic development agencies, as well as policy makers in the renewable energy enterprises

    Dynamic Facility Layout for Cellular and Reconfigurable Manufacturing using Dynamic Programming and Multi-Objective Metaheuristics

    Get PDF
    The facility layout problem is one of the most classical yet influential problems in the planning of production systems. A well-designed layout minimizes the material handling costs (MHC), personnel flow distances, work in process, and improves the performance of these systems in terms of operating costs and time. Because of this importance, facility layout has a rich literature in industrial engineering and operations research. Facility layout problems (FLPs) are generally concerned with positioning a set of facilities to satisfy some criteria or objectives under certain constraints. Traditional FLPs try to put facilities with the high material flow as close as possible to minimize the MHC. In static facility layout problems (SFLP), the product demands and mixes are considered deterministic parameters with constant values. The material flow between facilities is fixed over the planning horizon. However, in today’s market, manufacturing systems are constantly facing changes in product demands and mixes. These changes make it necessary to change the layout from one period to the other to be adapted to the changes. Consequently, there is a need for dynamic approaches of FLP that aim to generate layouts with high adaptation concerning changes in product demand and mix. This thesis focuses on studying the layout problems, with an emphasis on the changing environment of manufacturing systems. Despite the fact that designing layouts within the dynamic environment context is more realistic, the SFLP is observed to have been remained worthy to be analyzed. Hence, a math-heuristic approach is developed to solve an SFLP. To this aim, first, the facilities are grouped into many possible vertical clusters, second, the best combination of the generated clusters to be in the final layout are selected by solving a linear programming model, and finally, the selected clusters are sequenced within the shop floor. Although the presented math-heuristic approach is effective in solving SFLP, applying approaches to cope with the changing manufacturing environment is required. One of the most well-known approaches to deal with the changing manufacturing environment is the dynamic facility layout problem (DFLP). DFLP suits reconfigurable manufacturing systems since their machinery and material handling devices are reconfigurable to encounter the new necessities for the variations of product mix and demand. In DFLP, the planning horizon is divided into some periods. The goal is to find a layout for each period to minimize the total MHC for all periods and the total rearrangement costs between the periods. Dynamic programming (DP) has been known as one of the effective methods to optimize DFLP. In the DP method, all the possible layouts for every single period are generated and given to DP as its state-space. However, by increasing the number of facilities, it is impossible to give all the possible layouts to DP and only a restricted number of layouts should be fed to DP. This leads to ignoring some layouts and losing the optimality; to deal with this difficulty, an improved DP approach is proposed. It uses a hybrid metaheuristic algorithm to select the initial layouts for DP that lead to the best solution of DP for DFLP. The proposed approach includes two phases. In the first phase, a large set of layouts are generated through a heuristic method. In the second phase, a genetic algorithm (GA) is applied to search for the best subset of layouts to be given to DP. DP, improved by starting with the most promising initial layouts, is applied to find the multi-period layout. Finally, a tabu search algorithm is utilized for further improvement of the solution obtained by improved DP. Computational experiments show that improved DP provides more efficient solutions than DP approaches in the literature. The improved DP can efficiently solve DFLP and find the best layout for each period considering both material handling and layout rearrangement costs. However, rearrangement costs may include some unpredictable costs concerning interruption in production or moving of facilities. Therefore, in some cases, managerial decisions tend to avoid any rearrangements. To this aim, a semi-robust approach is developed to optimize an FLP in a cellular manufacturing system (CMS). In this approach, the pick-up/drop-off (P/D) points of the cells are changed to adapt the layout with changes in product demand and mix. This approach suits more a cellular flexible manufacturing system or a conventional system. A multi-objective nonlinear mixed-integer programming model is proposed to simultaneously search for the optimum number of cells, optimum allocation of facilities to cells, optimum intra- and inter-cellular layout design, and the optimum locations of the P/D points of the cells in each period. A modified non-dominated sorting genetic algorithm (MNSGA-II) enhanced by an improved non-dominated sorting strategy and a modified dynamic crowding distance procedure is used to find Pareto-optimal solutions. The computational experiments are carried out to show the effectiveness of the proposed MNSGA-II against other popular metaheuristic algorithms
    corecore