A Hybrid Genetic Programming Algorithm for Automated Design of Dispatching Rules

Genetic programming-based predictive model for the Cr removal effect of in-situ electrokinetic remediation in contaminated soil

Soil electrokinetic remediation is an emerging and efficient in-situ remediation technology for reducing environmental risks. Promoting the dissolution and migration of Cr in soil under the electric field is crucial to decrease soil toxicity and ecological influences. However, it is difficult to establish strong relationships between soil treatment and impact factors and to quantify their contributions. Machine learning can help establish pollutant migration models, but it is challenging to derive predictive formulas to improve remediation efficiency, describe the predictive model construction process, and reflect the importance of the predictors for better regulation. Therefore, this paper established a predictive model for the electrokinetic remediation of Cr-contaminated soil using genetic programming (GP) after determining the characteristic parameters which influenced the remediation effect, described the model's adaptive optimization process through the algorithm's function, and identified the sensitivity factors affecting the Cr removal effect. Results showed that the Cr(VI) and total Cr concentrations predicted by GP were in satisfactory agreement with the experimental values, 92% of the training data and 90% of the validation data achieved errors within 1%, and could fully reflect the target ions' content variation in different soil layers. By substituting the above prediction formulas into Sobol sensitivity analysis, it was determined that conductivity, pH, current, and moisture content dramatically affected the Cr content variation in distinguished regions. For overall contaminated area, the system current and soil pH were the most sensitive factors for Cr(VI) and total Cr contents. Remediation efforts throughout the contaminated area should focus on the role of current versus soil pH. GP and sensitivity analysis can provide decision support and operational guidance for in-situ soil electrokinetic treatment by establishing a remediation effect prediction model, expediting the development and innovation of electrokinetic technology.

Automated Coordination Strategy Design Using Genetic Programming for Dynamic Multipoint Dynamic Aggregation

The multipoint dynamic aggregation (MPDA) problem of the multirobot system is of great significance for its real-world applications such as bush fire elimination. The problem is to design the optimal plan for a set of heterogeneous robots to complete some geographically distributed tasks collaboratively. In this article, we consider the dynamic version of the problem, where new tasks keep appearing after the robots are dispatched from the depot. The dynamic MPDA problem is a complicated optimization problem due to several characteristics, such as the collaboration of robots, the accumulative task demand, the relationships among robots and tasks, and the unpredictable task arrivals. In this article, a new model of the problem considering these characteristics is proposed. To solve the problem, we develop a new genetic programming hyperheuristic (GPHH) method to evolve reactive coordination strategies (RCSs), which can guide the robots to make decisions in real time. The proposed GPHH method contains a newly designed effective RCS heuristic template to generate the execution plan for the robots according to a GP tree. A new terminal set of features related to both robots and tasks and a cluster filter that assigns the robots to urgent tasks are designed. The experimental results show that the proposed GPHH significantly outperformed the state-of-the-art methods. Through further analysis, useful insights such as how to distribute and coordinate robots to execute different types of tasks are discovered.

Genetic Programming with Delayed Routing for Multiobjective Dynamic Flexible Job Shop Scheduling

Dynamic Flexible Job Shop Scheduling (DFJSS) is an important and challenging problem, and can have multiple conflicting objectives. Genetic Programming Hyper-Heuristic (GPHH) is a promising approach to fast respond to the dynamic and unpredictable events in DFJSS. A GPHH algorithm evolves dispatching rules (DRs) that are used to make decisions during the scheduling process (i.e., the so-called heuristic template). In DFJSS, there are two kinds of scheduling decisions: the routing decision that allocates each operation to a machine to process it, and the sequencing decision that selects the next job to be processed by each idle machine. The traditional heuristic template makes both routing and sequencing decisions in a non-delay manner, which may have limitations in handling the dynamic environment. In this article, we propose a novel heuristic template that delays the routing decisions rather than making them immediately. This way, all the decisions can be made under the latest and most accurate information. We propose three different delayed routing strategies, and automatically evolve the rules in the heuristic template by GPHH. We evaluate the newly proposed GPHH with Delayed Routing (GPHH-DR) on a multiobjective DFJSS that optimises the energy efficiency and mean tardiness. The experimental results show that GPHH-DR significantly outperformed the state-of-the-art GPHH methods. We further demonstrated the efficacy of the proposed heuristic template with delayed routing, which suggests the importance of delaying the routing decisions.