As a collective and highly dynamic social group, the human crowd is a fascinating phenomenon that has been frequently studied by experts from various areas. Recently, computer-based modeling and simulation technologies have emerged to support investigation of the dynamics of crowds, such as a crowd's behaviors under normal and emergent situations. This article assesses the major existing technologies for crowd modeling and simulation. We first propose a two-dimensional categorization mechanism to classify existing work depending on the size of crowds and the time-scale of the crowd phenomena of interest. Four evaluation criteria have also been introduced to evaluate existing crowd simulation systems from the point of view of both a modeler and an end-user. We have discussed some influential existing work in crowd modeling and simulation regarding their major features, performance as well as the technologies used in this work. We have also discussed some open problems in the area. This article will provide the researchers with useful information and insights on the state of the art of the technologies in crowd modeling and simulation as well as future research directions.

Genetic programming (GP) is a powerful evolutionary algorithm that has been widely used for solving many real-world optimization problems. However, traditional GP can only solve a single task in one independent run, which is inefficient in cases where multiple tasks need to be solved at the same time. Recently, multifactorial optimization (MFO) has been proposed as a new evolutionary paradigm toward evolutionary multitasking. It intends to conduct evolutionary search on multiple tasks in one independent run. To enable multitasking GP, in this paper, we propose a novel multifactorial GP (MFGP) algorithm. To the best of our knowledge, this is the first attempt in the literature to conduct multitasking GP using a single population. The proposed MFGP consists of a novel scalable chromosome encoding scheme which is capable of representing multiple solutions simultaneously, and new evolutionary mechanisms for MFO based on self-learning gene expression programming. Further, comprehensive experimental studies are conducted on multitask scenarios consisting of commonly used GP benchmark problems and real world applications. The obtained empirical results confirmed the efficacy of the proposed MFGP.

In this paper, a novel self-learning gene expression programming (GEP) methodology named SL-GEP is proposed to improve the search accuracy and efficiency of GEP. In contrast to the existing GEP variants, the proposed SL-GEP features a novel chromosome representation in which each chromosome is embedded with subfunctions that can be deployed to construct the final solution. As part of the chromosome, the subfunctions are self-learned or self-evolved by the proposed algorithm during the evolutionary search. By encompassing subfunctions or any partial solution as input arguments of another subfunction, the proposed SL-GEP facilitates the formation of sophisticated, higher-order, and constructive subfunctions that improve the accuracy and efficiency of the search. Further, a novel search mechanism based on differential evolution is proposed for the evolution of chromosomes in the SL-GEP. The proposed SL-GEP is simple, generic and has much fewer control parameters than the traditional GEP variants. The proposed SL-GEP is validated on 15 symbolic regression problems and six even-parity problems. Experimental results show that the proposed SL-GEP offers enhanced performances over several state-of-the-art algorithms in terms of accuracy and search efficiency.

Globalisation and lean initiatives increase the vulnerabilities of the supply chains (SC), where disruptions in any plant in a supply chain network (SCN) can propagate throughout the whole SCN. Redundancy is part of the SC re-engineering to improve supply chain resilience (SCRES). This paper presents a conceptual model of an SCN using graph theory, considering the relationships between plants and materials. Based on the model, the structural redundancy of the SCN is measured, which is used to assess SCRES. This assessment approach focuses on the resilience of the SCN against disruptions. Case studies are discussed to illustrate the applicability of this model and show that increasing structural redundancy of the SCN improves SCRES against disruptions.

Supply chain resilience (SCRES) refers to the ability of a supply chain (SC) to both resist disruptions and recover its operational capability after disruptions. This paper presents a simulation model that includes network structural properties in the analysis of SCRES. This simulation model extends an existing graph model to consider operational behaviours in order to capture disruption-recovery dynamics. Through structural analysis of a supply chain network (SCN), mitigation strategies are designed to build redundancy, while contingency strategies are developed to prioritise recovery of the affected SCN. SCRES indexes are proposed by sampling SC performance measures of disruption for each plant and aggregating the measures based on the criticality of the plants in the SCN. The applicability of this simulation model is demonstrated in a real-world case study of different disruption scenarios. The application of mitigation and contingency strategies is shown to both improve recovery and reduce the total costs associated with disruptions. Through such simulation-based analysis, firms can gain insight into the SCRES of their existing SCNs and identify suitable strategies to improve SCRES by considering recovery time and costs.