Search results

The purpose of this study is to investigate the optimization of the scheduling of production and transportation systems while considering delay time (DT) and environmental pollution (EP) concurrently. To this, an integrated multi-site manufacturing process using a cumulative transportation system is investigated. Additionally, a novel multi-society genetic algorithm is developed to reach the best answers.

A bi-objective model is proposed to optimize the production and transportation process with the objectives of minimizing DT and EP. This is solved by a social dynamic genetic algorithm (SDGA), which is a novel multi-society genetic algorithm, in scenarios of equal and unequal impacts of each objective. The impacts of each objective are calculated by the analytical hierarchical process (AHP) using experts’ opinions. Results are compared by dynamic genetic algorithm and optimum solution results.

Results clearly depict the efficiency of the proposed algorithm and model in the scheduling of production and transportation systems with the objectives of minimizing DT and EP concurrently. Although SDGA’s performance is acceptable in all cases, in comparison to other genetic algorithms, it needs more process time which is the cost of reaching better answers. Additionally, SDGA had better performance in variable weights of objectives in comparison to itself and other genetic algorithms.

This research is an improvement which allows both society and industry to elevate the levels of their satisfaction while their social responsibilities have been glorified through assuaging the concerns of customers on distribution networks’ emission, competing more efficient and effective in the global market and having the ability to make deliberate decisions far from bias. Additionally, implications of the developed genetic algorithm help directly to the organizations engaged with intelligent production and/or transportation planning which society will be merited indirectly from their outcomes. It also could be utilitarian for organizations that are engaged with small, medium and big data analysis in their processes and want to use more effective and more efficient tools.

Optimization of EP and DT are considered simultaneously in both model and algorithm in this study. Besides, a novel genetic algorithm, SDGA, is proposed. In this multi-society algorithm, each society is focused on a particular objective; however, in one society all the feasible answers will have been integrated and optimization will have been continued.

This paper aims to provide a prolonging network lifetime and optimizing energy consumption in mobile wireless sensor networks (MWSNs). MWSNs have characteristics of dynamic topology due to the factors such as energy consumption and node movement that lead to create a problem in lifetime of the sensor network. Node clustering in wireless sensor networks (WSNs) helps in extending the network life time by reducing the nodes’ communication energy and balancing their remaining energy. It is necessary to have an effective clustering algorithm for adapting the topology changes and improve the network lifetime.

This work consists of two centralized dynamic genetic algorithm-constructed algorithms for achieving the objective in MWSNs. The first algorithm is based on improved Unequal Clustering-Genetic Algorithm, and the second algorithm is Hybrid K-means Clustering-Genetic Algorithm.

Simulation results show that improved genetic centralized clustering algorithm helps to find the good cluster configuration and number of cluster heads to limit the node energy consumption and enhance network lifetime.

In this work, each node transmits and receives packets at the same energy level throughout the solution. The proposed approach was implemented in centralized clustering only.

The main reason for the research efforts and rapid development of MWSNs occupies a broad range of circumstances in military operations.

The research highly gains impacts toward mobile-based applications.

A new fitness function is proposed to improve the network lifetime, energy consumption and packet transmissions of MWSNs.

Applies a computer model GAIA (Groups of Adaptive Inferencing Agents) to simulate the lifecycle of artificial groups directed by agendas which specify varying strategies for collective problem solving. Within GAIA, groups of artificial agents dynamically learn and interact by proposing, combining and testing inductive hypotheses in the form of genetic building blocks. Agents share and combine building block solutions to evolve decision trees to respond to environmental inputs. Effects of agendas which emphasize stages of conservative and liberal problem solving strategies over a group’s lifecycle were simulated. Conservative strategies emphasize consensus and collective memories within groups. Liberal strategies emphasize challenges to collective memory and individual agent predictions. Agendas which vary from conservative to liberal resulted in the poor group solutions. Significantly better group solutions were produced by an agenda varying from liberal to conservative and back to liberal (L‐C‐L). The L‐C‐L agenda focuses on critical evaluation and rewards for individual contribution in the beginning and ending lifecycle stages and provides a middle stage of collective exploration.

The purpose of this paper is to show that research on policy diffusion mechanism of Government Procurement of Public Services (GPPS) is beneficial to improve the efficiency of policy formulation and implementation.

In view of the four dimensions which are internal demand, external pressure, policy innovation environment and service characteristic, a system of factors affecting policy diffusion is established. On this basis, a Multilayer Fuzzy Cognitive Map (MFCM) model for policy diffusion of GPPS is constructed. Nonlinear Hebbian Learning algorithm and genetic algorithm are applied to optimize the two components of the MFCM model, which are relationship between nodes at the same layer and influence weights between nodes at different layers, respectively. Taking Nanjing municipal government purchasing elderly-care services in China as the empirical object, simulation of policy diffusion based on the MFCM model is carried out, aiming to obtain the key factors influencing policy diffusion and the dynamic diffusion mechanism of GPPS policy.

Research results show that, compared with monolayer Fuzzy Cognitive Map, the MFCM model converges faster. In addition, simulation results of policy diffusion indicate that economic development level of jurisdiction, superior pressure, administrative level and operability of services are key influencing factors which are under four dimensions correspondingly. And the dynamic influencing mechanism of key factors has also been learned.

This paper constructs the MFCM model, which is a new approach based on several monolayer FCMs, to study the policy diffusion mechanism.

Due to the increasing size and complexity of construction projects, construction engineering and management involves the coordination of many complex and dynamic processes and relies on the analysis of uncertain, imprecise and incomplete information, including subjective and linguistically expressed information. Various modelling and computing techniques have been used by construction researchers and applied to practical construction problems in order to overcome these challenges, including fuzzy hybrid techniques. Fuzzy hybrid techniques combine the human-like reasoning capabilities of fuzzy logic with the capabilities of other techniques, such as optimization, machine learning, multi-criteria decision-making (MCDM) and simulation, to capitalise on their strengths and overcome their limitations. Based on a review of construction literature, this chapter identifies the most common types of fuzzy hybrid techniques applied to construction problems and reviews selected papers in each category of fuzzy hybrid technique to illustrate their capabilities for addressing construction challenges. Finally, this chapter discusses areas for future development of fuzzy hybrid techniques that will increase their capabilities for solving construction-related problems. The contributions of this chapter are threefold: (1) the limitations of some standard techniques for solving construction problems are discussed, as are the ways that fuzzy methods have been hybridized with these techniques in order to address their limitations; (2) a review of existing applications of fuzzy hybrid techniques in construction is provided in order to illustrate the capabilities of these techniques for solving a variety of construction problems and (3) potential improvements in each category of fuzzy hybrid technique in construction are provided, as areas for future research.

Community detection of dynamic networks provides more effective information than static network community detection in the real world. The mainstream method for community detection in dynamic networks is evolutionary clustering, which uses temporal smoothness of community structures to connect snapshots of networks in adjacent time intervals. However, the error accumulation issues limit the effectiveness of evolutionary clustering. While the multi-objective evolutionary approach can solve the issue of fixed settings of the two objective function weight parameters in the evolutionary clustering framework, the traditional multi-objective evolutionary approach lacks self-adaptability.

This paper proposes a community detection algorithm that integrates evolutionary clustering and decomposition-based multi-objective optimization methods. In this approach, a benchmark correction procedure is added to the evolutionary clustering framework to prevent the division results from drifting.

Experimental results demonstrate the superior accuracy of this method compared to similar algorithms in both real and synthetic dynamic datasets.

To enhance the clustering results, adaptive variances and crossover probabilities are designed based on the relative change amounts of the subproblems decomposed by MOEA/D (A Multiobjective Optimization Evolutionary Algorithm based on Decomposition) to dynamically adjust the focus of different evolutionary stages.

Big Data analysis is one of the key challenges to the provision of health care to emerge in the last few years. This challenge has been spearheaded by the huge interest in the “4Ps” of health care (predictive, preventive, personalized, and participatory). Big Data offers striking development opportunities in health care and life sciences. Healthcare research is already using Big Data to analyze the spatial distribution of diseases such as diabetes mellitus at detailed geographic levels. Big Data is also being used to assess location-specific risk factors based on data of health insurance claims. Other studies in systems medicine utilize bioinformatics approaches to human biology which necessitate Big Data statistical analysis and medical informatics tools. Big Data is also being used to develop electronic algorithms to forecast clinical events in real time, with the intent to improve patient outcomes and thus reduce costs.

Yet, this Big Data era also poses critically difficult ethical challenges, since it is breaking down the traditional divisions between what belongs to public and private domains in health care and health research. Big Data in health care raises complex ethical concerns due to use of huge datasets obtained from different sources for varying reasons. The clinical translation of this Big Data is thus resulting in key ethical and epistemological challenges for those who use these data to generate new knowledge and the clinicians who eventually apply it to improve patient care.

Underlying this challenge is the fact that patient consent often cannot be collected for the use of individuals’ personal data which then forms part of this Big Data. There is also the added dichotomy of healthcare providers which use such Big Data in attempts to reduce healthcare costs, and the negative impact this may have on the individual with respect to privacy issues and potential discrimination.

Big Data thus challenges societal norms of privacy and consent. Many questions are being raised on how these huge masses of data can be managed into valuable information and meaningful knowledge, while still maintaining ethical norms. Maintaining ethical integrity may lack behind in such a fast-changing sphere of knowledge. There is also an urgent need for international cooperation and standards when considering the ethical implications of the use of Big Data-intensive information.

This chapter will consider some of the main ethical aspects of this fast-developing field in the provision of health care, health research, and public health. It will use examples to concretize the discussion, such as the ethical aspects of the applications of Big Data obtained from clinical trials, and the use of Big Data obtained from the increasing popularity of health mobile apps and social media sites.

This paper aims to present an integrated method for optimized project duration and costs, considering the size and cost of crews assigned to project activities' execution modes.

The proposed method utilizes fuzzy set theory (FSs) for modeling uncertainties associated with activities' duration and cost and genetic algorithm (GA) for optimizing project schedule. The method has four main modules that support two optimization methods: modeling uncertainty and defuzzification module; scheduling module; cost calculations module; and decision-support module. The first optimization method uses the elitist non-dominated sorting genetic algorithm (NSGA-II), while the second uses a dynamic weighted optimization genetic algorithm. The developed scheduling and optimization methods are coded in python as a stand-alone automated computerized tool to facilitate the developed method's application.

The developed method is applied to a numerical example to demonstrate its use and illustrate its capabilities. The method was validated using a multi-layered comparative analysis that involves performance evaluation, statistical comparisons and stability evaluation. Results indicated that NSGA-II outperformed the weighted optimization method, resulting in a better global optimum solution, which avoided local minima entrapment. Moreover, the developed method was constructed under a deterministic scenario to evaluate its performance in finding optimal solutions against the previously developed literature methods. Results showed the developed method's superiority in finding a better optimal set of solutions in a reasonable processing time.

The novelty of the proposed method lies in its capacity to consider resource planning and project scheduling under uncertainty simultaneously while accounting for activity splitting.

In this study, the authors consider the key decisions in the design of the green closed-loop supply chain (CSLC) network. These decisions include considering the optimal location of suppliers, production facilities, distribution, customers, recycling centers and disposal of non-recyclable goods. In the proposed model, the level of technology used in recycling and production centers is taken into account. Moreover, in this paper is the environmental impacts of production and distribution of products based on the eco-indicator 99 are considered.

In this study, the author consider the key decisions in the design of the green CLSC network. These decisions include considering the optimal location of suppliers, production facilities, distribution, customers, recycling centers and disposal of non-recyclable goods. In the proposed model, the level of technology used in recycling and production centers is taken into account. Moreover, the environmental impacts of production and distribution of products based on the eco-indicator 99 are considered.

The results indicate that the results obtained from the colonial competition algorithm have higher quality than the genetic algorithm. This quality of results includes relative percentage deviation and computational time of the algorithm and it is shown that the computational time of the colonial competition algorithm is significantly lower than the computational time of the genetic algorithm. Furthermore, the limit test and sensitivity analysis results show that the proposed model has sufficient accuracy.

Solid modeling of the green supply chain of the closed loop using the solid optimized method by Bertsimas and Sim. Development of models that considered environmental impacts to the closed loop supply chain. Considering the impact of the technology type in the manufacture of products and the recycling of waste that will reduce emissions of environmental pollutants. Another innovation of the model is the multi-cycle modeling of the closed loop of supply chain by considering the uncertainty and the fixed and variable cost of transport.

The aim of this paper is to propose a genetic algorithms approach to develop a collaborative supply chain network, i.e. a supply chain network with genetic algorithms embedded (GA‐SCN), so as to increase the efficiency and effectiveness of a supply chain network.

The methodologies of the GA‐SCN are illustrated through a case study of a supply chain network of a Hong Kong lamp manufacturing company involving 10 entities, whose roles range from suppliers, purchasers, designers and manufacturers, to sales and distributors. A GA‐SCN is developed according to the information provided by the company, the performance results in the case study are discussed, and the concepts of network analysis are then introduced to analyze the equivalence structure of the developed GA‐SCN.

The genetic algorithms approach is a suitable approach for developing an efficient and effective supply chain network in terms of shortening the processing time and reducing operating time in the network: the processing time and operating cost are reduced by around 45 percent and 35 percent per order, respectively, in the case study.

This paper is the first known study to apply genetic algorithms for the development of a collaborative supply chain network to increase the competitiveness of a supply chain.