Job-shop Scheduling Problem (JSP) is one of the most difficult benchmark problems. GA approaches often fail searching the global optimum because of the deception UV-structure of JSPs. In this paper, we introduce a novel framework model of GA, Innately Split Model (ISM) which prevents UV-phenomenon, and discuss on its power particularly. Next we analyze the structure of JSPs with the help of the UV-structure hypothesys, and finally we show ISM's excellent performance on JSP.

Open Shop Scheduling Problem is one of the most important scheduling problems in the field of engineering and industry. This kind of problem includes m machines and n jobs, each job contains a certain number of operations, and each operation has a predetermined processing time on its corresponding machine. The order of processing of these operations affects the completion times of all jobs. Therefore, the purpose of OSSP is to achieve a proper order of processing of jobs (...) using specified machines, so that the completion time of all jobs is minimized. In this paper, the strengths and limitations of three methods are evaluated by comparing the results of solving the OSSP in large-scale and small-scale benchmarks. In this case, the minimized completion time and total tardiness are considered the objective functions of the adapted methods. To solve small-scale problems, we adapt a mathematical model called Multiobjective Mixed Linear Programming. To solve large-scale problems, two metaheuristic algorithms including Multiobjective Parallel Genetic Algorithm and Multiobjective Parallel Simulated Annealing are adapted. In experimental results, we randomly generated small-scale problems to compare MOMILP with the Genetic Algorithm and Simulate Annealing. To compare MOPSA and MOPGA with the state of the art and show their strengths and limitations, we use a standard large-scale benchmark. The simulation results of the proposed algorithms show that although the MOPSA algorithm is faster, the MOPGA algorithm is more efficient in achieving optimal solutions for large-scale problems compared with other methods. (shrink)

This paper addresses a variant of the job shop scheduling problem with total tardiness minimization where task durations and due dates are uncertain. This uncertainty is modelled with intervals. Different ranking methods for intervals are considered and embedded into a genetic algorithm. A new robustness measure is proposed to compare the different ranking methods and assess their capacity to predict ‘expected delays’ of jobs. Experimental results show that dealing with uncertainty during the optimization process yields more robust (...) solutions. A sensitivity analysis also shows that the robustness of the solutions given by the solving method increases when the uncertainty grows. (shrink)

This paper considers two kinds of stochastic reentrant job shop scheduling problems, i.e., the SRJSSP with the maximum tardiness criterion and the SRJSSP with the makespan criterion. Owing to the NP-complete complexity of the considered RJSSPs, an effective differential evolutionary algorithm combined with two uncertainty handling techniques, namely, DEA_UHT, is proposed to address these problems. Firstly, to reasonably control the computation cost, the optimal computing budget allocation technique is applied for allocating limited computation budgets to assure reliable evaluation (...) and identification for excellent solutions or individuals, and the hypothesis test technique is added to execute a statistical comparison to reduce some unnecessary repeated evaluation. Secondly, a reentrant-largest-order-value rule is designed to convert the DEA’s individual to the SRJSSP’s solution. Thirdly, a conventional active decoding scheme for the job shop scheduling problem is extended to decode the solution for obtaining the criterion value. Fourthly, an Insert-based exploitation strategy and an Interchange-based exploration strategy are devised to enhance DEA’s exploitation ability and exploration ability, respectively. Finally, the test results and comparisons manifest the effectiveness and robustness of the proposed DEA_UHT. (shrink)

This paper addresses the job shop scheduling problem including time lag constraints. This is an extension of the job shop scheduling problem with many applications in real production environments, where extra delays can be introduced between successive operations of the same job. It belongs to a category of problems known as NP-hard problem due to large solution space. Biogeography-based optimization is an evolutionary algorithm which is inspired by the migration of species between habitats, recently proposed by (...) Simon in 2008 to optimize hard combinatorial optimization problems. We propose a hybrid biogeography-based optimization algorithm for solving the job shop scheduling problem with additional time lag constraints with minimization of total completion time. In the proposed HBBO, the effective greedy constructive heuristic is adapted to generate the initial population of habitat. Moreover, a local search metaheuristic is investigated in the mutation step in order to ameliorate the solution quality and enhance the diversity of the population. To assess the performance of HBBO, a series of experiments on well-known benchmark instances for job shop scheduling problem with time lag constraints is performed. (shrink)

This paper proposes a two-level metaheuristic consisting of lower- and upper-level algorithms for the job-shop scheduling problem with multipurpose machines. The lower-level algorithm is a local search algorithm used for finding an optimal solution. The upper-level algorithm is a population-based metaheuristic used to control the lower-level algorithm’s input parameters. With the upper-level algorithm, the lower-level algorithm can reach its best performance on every problem instance. Most changes of the proposed two-level metaheuristic from its original variants are in the (...) lower-level algorithm. A main purpose of these changes is to increase diversity into solution neighborhood structures. One of the changes is that the neighbor operators of the proposed lower-level algorithm are developed to be more adjustable. Another change is that the roulette-wheel technique is applied for selecting a neighbor operator and for generating a perturbation operator. In addition, the proposed lower-level algorithm uses an adjustable delay-time limit to select an optional machine for each operation. The performance of the proposed two-level metaheuristic was evaluated on well-known benchmark instances. The evaluation’s results indicated that the proposed two-level metaheuristic performs well on most benchmark instances. (shrink)

The concept of digital twinning has become a hot topic in the manufacturing industry in recent years. The emerging digital twin technology is an intelligent technology that makes full use of multimodels, big data, and interdisciplinary knowledge, which provides some new approaches for the field of the intelligent manufacturing industry. The job shop scheduling problem has been an important research field in the discrete manufacturing industry. Digital twin technology is adopted to solve the problem of job shop (...) scheduling, which provides the possibility for the intelligent development of workshops. Based on digital twin technology and combined with the actual problem of production line scheduling, we propose a new intelligent scheduling platform to solve the shop scheduling problems above. Meanwhile, based on the prediction and diagnosis of multisource dynamic interference in the workshop production process by big data analysis technology, the corresponding interference strategy is formulated in advance by the scheduling cloud platform. The model simulation experiment of intelligent dispatching cloud platform was carried out, and some enterprises in intelligent manufacturing workshop were taken as examples to verify the superiority of the dispatching cloud platform. Finally, we look forward to the future research direction of intelligent manufacturing based on digital twin technology. (shrink)

Genetic Algorithms(GAs) are effective approximation algorithms which focus on “hopeful area” in the searching process. However, in harder problems, it is often very difficult to maintain a favorable trade-off between exploitation and exploration. All individuals leave the big-valley including the global optimum, and concentrate on another big-valley including a local optimum often. In this paper, we define such a situation on conventional GAs as the “UV-phenomenon”, and suggest UV-structures as hard landscape structures that will cause the UV-phenomenon. We introduce (...) a test function which has explicit UV-structures, and show UV-phenomenon caused by them. Next we analyze Fletcher and Powell function to confirm our hypothesis. Finally we propose a novel framework of GAs which can cope with UV-structures. (shrink)

In this study, a new mathematical model is presented to solve the flexible flow shop problem where transportation is reliable and there are constraints on intermediate buffers, budgets, and human resource learning effects. Firstly, the model is validated to confirm the accuracy of its performance. Then, since it is an NP-hard one, two metaheuristic algorithms, namely, MOSA and MOEA/D, are rendered to solve mid- and large-scale problems. To confirm their accuracy of performance, two small-scale problems are solved (...) using GAMS exact solution software, and the obtained results have been compared with the output of the algorithms. Since the problem in this study is multiobjective, five comparative indices are used to compare the performance of algorithms. The results show that the answers achieved using the metaheuristic algorithms are very close to the ones achieved via the GAMS exact program. Therefore, the proposed algorithms are validated, and it is proved that they are accurately designed and useable in solving the real-world problems in logical calculation time. By comparing the obtained results, it can be seen that the MOEA/D algorithm performs better in terms of computational time and Mean ideal distance. The MOSA algorithm also performs better according to the index Spread of nondominated solutions, diversity metric, and number of Pareto solutions. Considering the confirmation of precision and accuracy of performance of the proposed algorithms, it can be concluded that MOSA and MOEA/D are useful in solving the mid- and large-scale modes of the problem in the study, which is very applicable in the real world. (shrink)

Schedule planning is one of the most crucial issues for any airline company, because the profit of the company directly depends on the efficiency of the schedule. This paper presents a novel scheduling method which solves problems related to time scheduling, fleet assignment and maintenance routing simultaneously by Genetic Algorithms. Every schedule constraint is embeded in the fitness function, which is described as an object oriented model and works as a simulater developing itself over time, and (...) whose solution is executable without human correction. The schedular is able to solve the problems involving several hundred flights in a few hours, and the solutions are superior or equivalent to those by human experts in terms of the estimated profit. (shrink)

Crew Pairing is one of the most important and difficult problems for airline companies. Nets to fuel costs, the crew costs constitute the largest cost of airlines, and the crew costs depend on the quality of the solution to the pairing problem. Conventional systems have been used to solve a daily model, which handles only regular flights with many simplifications, so a lot of corrections are needed to get a feasible solution and the quality of the solution is not (...) so high. A fully dated model, which handles regular flights and irregular flights simultaneously, is extremely hard and has not been solved directly hitherto. The number of irregular flights tend to increase in Europe and Japan, hence the resolution of the practical fully dated pairing system is desired. This paper presents a new approach which solves directly the fully dated crew pairing by Genetic Algorithms. GA is improved with stochastic processes to attack the fully dated model, and many heuristics are included in the decoding mecanism of the GA. For several hundred flights per day for fully dated 2 months scheduling period, the system found better or equivalent solutions to the human scheduler’s without any simplification from 5 to 20 times faster. (shrink)

Job shop scheduling problem is one of the most difficult optimization problems in manufacturing industry, and flexible job shop scheduling problem is an extension of the classical JSP, which further challenges the algorithm performance. In FJSP, a machine should be selected for each process from a given set, which introduces another decision element within the job path, making FJSP be more difficult than traditional JSP. In this paper, a variant of grasshopper optimization algorithm named dynamic opposite (...) learning assisted GOA is proposed to solve FJSP. The recently proposed dynamic opposite learning strategy adopts the asymmetric search space to improve the exploitation ability of the algorithm and increase the possibility of finding the global optimum. Various popular benchmarks from CEC 2014 and FJSP are used to evaluate the performance of DOLGOA. Numerical results with comparisons of other classic algorithms show that DOLGOA gets obvious improvement for solving global optimization problems and is well-performed when solving FJSP. (shrink)

Due to the NP-hard nature, the permutation flowshop scheduling problem is a fundamental issue for Industry 4.0, especially under higher productivity, efficiency, and self-managing systems. This paper proposes an improved genetic-shuffled frog-leaping algorithm to solve the permutation flowshop scheduling problem. In the proposed IGSFLA, the optimal initial frog in the initialized group is generated according to the heuristic optimal-insert method with fitness constrain. The crossover mechanism is applied to both the subgroup and the global group to avoid (...) the local optimal solutions and accelerate the evolution. To evolve the frogs with the same optimal fitness more outstanding, the disturbance mechanism is applied to obtain the optimal frog of the whole group at the initialization step and the optimal frog of the subgroup at the searching step. The mathematical model of PFSSP is established with the minimum production cycle as the objective function, the fitness of frog is given, and the IGSFLA-based PFSSP is proposed. Experimental results have been given and analyzed, showing that IGSFLA not only provides the optimal scheduling performance but also converges effectively. (shrink)

This paper studies a special scheduling problem under hierarchical management in nurse staff. This is a more complex rostering problem than traditional nurse scheduling. The first is that the rostering requirements of charge nurses and general nurses are different under hierarchical management. The second is that nurses are preferable for relative fair rather than absolute fair under hierarchical management. The model aims at allocating the required workload to meet the operational requirements, weekend rostering preferences, and relative fairness (...) preferences. Two hybrid heuristic algorithms based on multiobjective grey wolf optimizer and three corresponding single heuristic algorithms are employed to solve this problem. The experimental results based on real cases from the Third People’s Hospital, Panzhihua, China, show that MOGWO does not as good as it does on other engineering optimization. However, the hybrid algorithms based on MOGWO are better than corresponding single algorithms on generational distance and spacing of Pareto solutions. Furthermore, for relative fair rostering objective, NSGAII-MOGWO has more power to find the optimal solution in the dimension of relative fairness. (shrink)

The Vehicle Routing Problem (VRP) has been extensively studied by different researchers from all over the world in recent years. Multiple solutions have been proposed for different variations of the problem, such as Capacitive Vehicle Routing Problem (CVRP), Vehicle Routing Problem with Time Windows (VRP-TW), Vehicle Routing Problem with Pickup and Delivery (VRPPD), among others, all of them with deterministic times. In the last years, researchers have been interested in including in their different models the variations that travel times may (...) experience when exposed to all kind of phenomena, mainly vehicle traffic. This article addresses the VRP from this perspective, proposing the design and implementation of a genetic algorithm based on neutrosophic theory for calculating the fitness function of each route, considering the variability and uncertainty present in travel times. A deterministic genetic algorithm is also implemented with the average travel times to compare it with the neutrosophic algorithm using simulation. As conclusion, a deterministic algorithm does not necessarily generate the best solution in the real world, full of uncertainty. Also, the quantification of uncertainty using neutrosophic theory can be used in route planning, opening a broad and interesting field of research for future investigations. (shrink)

The increase in the size of universities has greatly increased the number of teachers, students, and courses and has also increased the difficulty of scheduling courses. This study used coevolution to improve the genetic algorithm and applied it to solve the course scheduling problem in universities. Finally, simulation experiments were conducted on the traditional and improved genetic algorithms in MATLAB software. The results showed that the improved genetic algorithm converged faster and produced better solutions than (...) the traditional genetic algorithm under the same crossover and mutation probability. As the mutation probability in the algorithm increased, the fitness values of both genetic algorithms gradually decreased, and the computation time increased. With the increase in crossover probability in the algorithm, the fitness value of the two genetic algorithms increased first and then decreased, and the computational time decreased first and then increased. (shrink)

This study aims to develop a hybrid model to represent the human mind from a functionalist point of view that can be adapted to artificial intelligence. The model is not a realistic theory of the neural network of the brain but an instrumentalist AI model, which means that there can be some other representative models too. It had been thought that the provability of an axiomatic system requires the completeness of a formal system. However, Gödel proved that (...) no consistent formal system can prove its own consistency. There is a paradoxical limit to provability. Both consistency and completeness are impossible together. These formal limits form the basis of our model: the hybrid model of the mind consists of a formal axiomatic system and an evolutionary algorithm (EA) of intelligence, which also includes the genetic algorithm (GA) of consciousness. The GA of consciousness operates based on intentions, functioning in conjunction with the principles of EA. This collaboration allows it to transcend the paradoxical formal limits of intelligence. However, GA overcomes the problem of paradoxicality at the cost of producing illusions. Following this collaboration gives us a GA operating system. After all, if the rational optimization task of the GA in question produces illusions, then the rationality must lie elsewhere in the paradox. (shrink)

This work proposes a hybrid heuristic algorithm to solve the bus rapid transit intelligent scheduling problem, which is a combination of the genetic algorithm, simulated annealing algorithm, and fitness scaling method. The simulated annealing algorithm can increase the local search ability of the genetic algorithm, so as to accelerate its convergence speed. Fitness scaling can reduce the differences between individuals in the early stage of the algorithm, to prevent the genetic algorithm from falling into a local (...) optimum through increasing the diversity of the population. It can also increase the selection probability of outstanding individuals, and speed up the convergence at the late stage of the algorithm, by increasing the differences between individuals. Using real operational data of BRT Line 1 in a city of Zhejiang province, the new scheduling scheme can be obtained through algorithm simulation. The passengers’ total waiting time in a single way will be reduced by 40 h on average under the same operating cost compared with the original schedule scheme in a day. (shrink)

For the application of the standard genetic algorithm in illustration art design, there are still problems such as low search efficiency and high complexity. This paper proposes an illustration art design model based on operator and clustering optimization genetic algorithm. First, during the operation of the genetic algorithm, the values of the crossover probability and the mutation probability are dynamically adjusted according to the characteristics of the population to improve the search efficiency of the algorithm, then (...) the k-medoids algorithm is introduced to optimize the clustering of the genetic algorithm, and a cost function is used to carry out and evaluate the quality of clustering to optimize the complexity of the original algorithm. In addition, a multiobjective optimization genetic algorithm with complex constraints based on group classification is proposed. This algorithm focuses on the problem of group diversity and uses k-means cluster analysis operation to solve the problem of group diversity. The algorithm divides the entire group into four subgroups and assigns appropriate fitness values to reflect the optimal preservation strategy. A large number of computer simulation calculations show that the algorithm can obtain a widely distributed and uniform Pareto optimal solution, the evolution speed is fast, usually only a few iterations can achieve a good optimization effect, and finally the improved genetic algorithm is used to design the random illustration art. The example simulation shows that the improved algorithm proposed in this paper can achieve higher artistic and innovative illustration art design. (shrink)

The aviation industry is one of the most widely used applications in transportation. Due to the limited capacity of aircraft, revenue management in this industry is of high significance. On the other hand, the hub location problem has been considered to facilitate the demands assignment to hubs. This paper presents an integrated p-hub location and revenue management problem under uncertain demand to maximize net revenue and minimize total cost, including hub establishment and transportation costs. A fuzzy programming model and (...) a genetic algorithm are developed to solve the proposed model with different sizes. The mining and petroleum industry is used for case studies. Results show that the proposed algorithm can obtain a suitable solution in a reasonable amount of time. (shrink)

This paper delves into a two-agent scheduling problem in which two agents are competing for a single resource. Each agent has a set of jobs to be processed by a single machine. The processing time, release time, weight, and the due dates of each job are known in advance. Both agents have their objectives, which are conflicting in nature. The first agent tries to minimize the total completion time, while the second agent tries to minimize the number of tardy (...) jobs. The two agents’ scheduling problem, an NP-hard problem, has a wide variety of applications ranging from the manufacturing industry to the cloud computing service provider. Due to the wide applicability, each variation of the problem requires a different algorithm, adapted according to the user’s requirements. This paper provides mathematical models, heuristic algorithms, and two nature-based metaheuristic algorithms to solve the problem. The algorithm’s performance was gauged against the optimal solution obtained from the AMPL-CPLEX solver for both solution quality and computational time. The outlined metaheuristics produce a solution that is comparable with a short computational time. The proposed metaheuristics even have a better solution than the CPLEX solver for medium-size problems, whereas the computation times are much less than the CPLEX solvers. (shrink)

The economical/environmental scheduling problem of the ship integrated energy system has high computational complexity, which includes more than one optimization objective, various types of constraints, and frequently fluctuated load demand. Therefore, the intelligent scheduling strategies cannot be applied to the ship energy management system online, which has limited computing power and storage space. Aiming at realizing green computing on SEMS, in this paper a typical SIES-EESP optimization model is built, considering the form of decision vectors, the economical/environmental (...) optimization objectives, and various types of real-world constraints of the SIES. Based on the complexity of SIES-EESPs, a two-stage offline-to-online multiobjective optimization strategy for SIES-EESP is proposed, which transfers part of the energy dispatch online computing task to the offline high-performance computer systems. The specific constraints handling methods are designed to reduce both continuous and discrete constraints violations of SIES-EESPs. Then, an establishment method of energy scheduling scheme-base is proposed. By using the big data offline, the economical/environmental scheduling solutions of a typical year can be obtained and stored with more computing resources and operation time on land. Thereafter, a short-term multiobjective offline-to-online optimization approach by SEMS is considered, with the application of multiobjective evolutionary algorithm and typical schemes corresponding to the actual SIES-EESPs. Simulation results show that the proposed strategy can obtain enough feasible Pareto solutions in a shorter time and get well-distributed Pareto sets with better convergence performance, which can well adapt to the features of real-world SIES-EESPs and save plenty of operation time and storage space for the SEMS. (shrink)

The paper discusses the problem of assignment production resources in executing a production order on the example of the car rims manufacturing process. The more resources are involved in implementing the manufacturing process and the more they can be used interchangeably, the more complex and problematic the scheduling process becomes. Special attention is paid to the effective scheduling and assignment of rim machining operations to production stations in the considered manufacturing process. In this case, the use of traditional (...) scheduling methods based on simple calculations, or the know-how of process engineers often turns out to be insufficient to achieve the intended results. Due to the scale of the problems faced in practice, the methods based on approximate approaches (Genetic and Tabu Search) were used to solve them. In this perspective, the problem under consideration involves the extension of the classic assignment problem with the possibility of taking into account: the times of operations, potential changeovers and the capacity of production resources. (shrink)

The topology optimization of computer communication network is studied based on improved genetic algorithm, a network optimization design model based on the establishment of network reliability maximization under given cost constraints, and the corresponding improved GA is proposed. In this method, the corresponding computer communication network cost model and computer communication network reliability model are established through a specific project, and the genetic intelligence algorithm is used to solve the cost model and computer communication (...) network reliability model, respectively. It has been proved that GA can solve the complex problems of computer working environment better, which is 80% higher than the general algorithm, and can select the optimal scheme pertinently. (shrink)

The paper considers two-agent order acceptance scheduling problems with different scheduling criteria. Two agents have a set of jobs to be processed by a single machine. The processing time and due date of each job are known in advance. In the order accepting scheduling problem, jobs are allowed to be rejected. The objective of the problem is to maximize the net revenue while keeping the weighted number of tardy jobs for the second agent within a predetermined value. (...) A mixed-integer linear programming formulation is provided to obtain the optimal solution. The problem is considered as an NP-hard problem. Therefore, MILP can be used to solve small problem instances optimally. To solve the problem instances with realistic size, heuristic and metaheuristic algorithms have been proposed. A heuristic method is used to determine and secure a quick solution while the metaheuristic based on particle swarm optimization is designed to obtain the near-optimal solution. A numerical experiment is piloted and conducted on the benchmark instances that could be obtained from the literature. The performances of the proposed algorithms are tested through numerical experiments. The proposed PSO can obtain the solution within 0.1% of the optimal solution for problem instances up to 60 jobs. The performance of the proposed PSO is found to be significantly better than the performance of the heuristic. (shrink)

The well-known classifier support vector machine has many parameters associated with its various kernel functions. The radial basis function kernel, being the most preferred kernel, has two parameters to be optimized. The problem of optimizing these parameter values is called model selection in the literature, and its results strongly influence the performance of the classifier. Another factor that affects the classification performance of a classifier is the feature subset. Both these factors are interdependent and must be dealt with simultaneously. (...) Following the multiobjective definition of feature selection, we have applied a multiobjective genetic algorithm, NSGA II, to optimize the feature subset and model parameters simultaneously. Comparison of the proposed approach with the grid algorithm and GA-based method suggests that the MOGA-based approach performs better than the grid algorithm and is as good as the GA-based approach. Moreover, it provides multiple solutions instead of a single solution. The users can prefer one feature subset over the other as per their requirement and available resources. (shrink)

Since the opening of the economy, China’s regional economy has developed rapidly, the overall national strength has been increasing, and the people’s living standards have been continuously improved. The issue of coordinated regional development has become an important issue in today’s society. Genetic algorithm is a kind of prediction algorithm that has developed rapidly in recent years and is widely used. However, when solving engineering prediction problems, there are often problems such as premature convergence and easiness to fall into (...) local optimal solutions. Therefore, on the basis of studying the related theories of genetic algorithm and artificial immune algorithm, this paper uses the advantages of the two algorithms, combines the two algorithms, and proposes an improved algorithm for genetic algorithm-adaptive immune genetic algorithm. Taking genetic algorithm as the basic framework, the operators and selection methods of artificial immune algorithm are integrated. Using the adaptive concept, the formulas of adaptive crossover probability and mutation probability are innovatively designed. Compared with the fixed value of the immune genetic algorithm, the introduction of the adaptive concept can intelligently adjust the optimization process and increase the optimization speed. Considering the double uncertain factors of product market demand and waste product recycling in the remanufacturing supply chain system, the maximization of logistics network operating profit, the minimization of environmental impact, and the maximization of customer satisfaction are the forecast goals. The market demand of uncertain products is effectively controlled through the option contract mechanism, and a multiobjective forecasting model based on the option contract mechanism is established. According to the characteristics of the model, an improved immune genetic algorithm is designed to solve the problem, and the effectiveness of the immune genetic algorithm is verified through an example. (shrink)

The deterministic economic system will also produce chaotic dynamic behaviour, so economic chaos is getting more and more attention, and the research of economic chaos forecasting methods has become an important topic at present. The traditional economic chaos forecasting models are mostly based on large samples, but in actual production activities, there are a large number of small-sample economic chaos problems, and there is still no effective solution. This paper proposes a combined forecasting model based on the traditional economic (...) chaos forecasting method. First of all, through the decision tree classification, priority selection of features, rough prediction is achieved. Secondly, we use BP neural network to make secondary prediction. Because the initial weight is randomly selected, it is easy to fall into the defect of local minimum. This paper optimizes the BP neural network. Finally, the decision tree model and the BP neural network model optimized by the improved genetic algorithm are combined, and the combined model is optimized by the improved GA. This method can take advantage of many prediction models and combine the prediction information of multiple different prediction models to effectively improve the fitting ability of the model and improve the prediction accuracy. (shrink)

Based on the problem of e-commerce logistics and distribution network optimization, this paper summarizes the solution ideas and solutions proposed by domestic and foreign scholars and designs a method to optimize the B2C e-commerce logistics and distribution network by taking into account the special traffic conditions in the city. The logistics network optimization model is established and solved by combining various methods. Taking into account the new target requirements constantly proposed in the modern logistics environment, the vehicle path problem (...) under the generalized objective function is studied, and the multidimensional impact maximization problem in this type of problem is proposed and modeled. The problem follows from the path planning for emergency material delivery. Given locations, roads, and multiple classes of supplies in a map, each road allows vehicles to deliver each class of supplies with a certain probability. The goal of the problem is how to select a finite number of locations in the map as centers of supplies so that the number of locations that can be effectively covered by vehicle paths from them is maximized with the desired probability. For the first time, we used a hybrid genetic algorithm to optimize the e-commerce logistics path, and the optimized results are more reasonable than other algorithms. (shrink)

On the basis of analyzing the complexity of railway flatcar loading optimization problem, according to the characteristics of railway flatcar loading, based on the situation of railway transport loading unit of multiple railway flatcars, this study puts forward the optimal loading optimization method of multimodel railway flatcars based on improved genetic algorithm, constructs the linear programming model of railway flatcar loading optimization problem, and combines with the improved genetic algorithm to solve the problem. The study also analyzes (...) the structural characteristics of the optimal loading materials of multimodel railway flatcars, selects the optimal materials and inputs the relevant data into the computer, and uses MATLAB to program the optimal loading algorithm of multimodel railway flatcars. Through the analysis of the calculation example, the study discusses its scope of application. The experimental results show that the average general utilization rate of the proposed method is 73%, which has higher universality, more effective application, and fully meets the research requirements. It is verified that the proposed method has a statistically significant impact on the optimal loading of multi-type railway flatcars. (shrink)

This paper is about representations for Artificial Intelligence systems. All of the results described in it involve engineering the representation to make AI systems more effective. The main AI techniques studied here are varieties of search: path-finding in graphs, and probablilistic searching via simulated annealing and genetic algorithms. The main results are empirical findings about the granularity of representation in implementations of genetic algorithms. We conclude by proposing a new algorithm, called “Long-Term Evolution,” which is a genetic (...) algorithm running on an evolving problem description. We see this as modelling the evolution of a species from simpler (more coarsely described— fewer genes) types of organisms to more complex ones. The results, which are reported here of our experiments with the algorithm make it seem a promising optimisation technique. (shrink)

This paper deals with a single-machine resource allocation scheduling problem with learning effect and group technology. Under slack due-date assignment, our objective is to determine the optimal sequence of jobs and groups, optimal due-date assignment, and optimal resource allocation such that the weighted sum of earliness and tardiness penalties, common flow allowances, and resource consumption cost is minimized. For three special cases, it is proved that the problem can be solved in polynomial time. To solve the general case of (...) problem, the heuristic, tabu search, and branch-and-bound algorithms are proposed. (shrink)

The development of the social sciences needs to rely on precise methods. The nomological model of explanation adopted in the natural sciences is ill-suited for the social sciences. An algorithmic model of society can be a promising solution to existing problems. In its most general form, an algorithm is a generally understood prescription for what actions to perform and in what order to achieve the desired result. Any algorithm can be represented as a set of rules of the (...) form «If A, do D to get P». People are the bearers of this kind of rules that apply in different areas of their activities. The rules are subject to change based on personal and collective experience. There is a special mathematical discipline that studies the laws of evolution of such rules. This discipline is called genetic programming. Contrary to the threatening name, the algorithmic model does not imply the deprivation of a person’s right to free choice, but it needs this right as a necessary condition for the evolution of social algorithms. These algorithms allow us to give a non-causal, but law-like explanation of many well-known social phenomena, as well as to effectively model the future, which is critically important today. A retrospective look at the evolution of social algorithms shows that the current global crisis of human society is associated with the approach to the point of singularity in their evolution. This is due to the fact that there is no need for direct human participation in the implementation of social algorithms, which is reflected in a fundamental change in the sphere of employment and less need for further development of the sciences. (shrink)

Presently, most studies focus on the minimization of the costs and negative social effects of the location of construction waste recycling centers; however, the influence of the location on future operation is usually ignored. Aiming at solving these problems, a location model for the maximization of service reliability was devised. Service reliability includes the recycling reliability of the construction waste and the delivery reliability of the recycled product. Through maximizing service reliability, the location deviation as a result of arrival (...) delay is expected to be reduced and the service reliability improved. Then, two important parameters in our model were solved on the basis of correlative mathematical theories. Finally, an example was implemented to verify our location optimization model. A genetic algorithm was used to obtain optimal solutions, and the solutions were analyzed. Through establishing a location optimization model, a possible better solution to location problems may be obtained to help in implementing location selection for recycling centers. (shrink)

Reproductive genetic technologies allow parents to decide whether their future children will have or lack certain genetic predispositions. A popular model that has been proposed for regulating access to RGTs is the ‘genetic supermarket’. In the genetic supermarket, parents are free to make decisions about which genes to select for their children with little state interference. One possible consequence of the genetic supermarket is that collective action problems will arise: if rational individuals use the (...) genetic supermarket in isolation from one another, this may have a negative effect on society as a whole, including future generations. In this article we argue that RGTs targeting height, innate immunity, and certain cognitive traits could lead to collective action problems. We then discuss whether this risk could in principle justify state intervention in the genetic supermarket. We argue that there is a plausible prima facie case for the view that such state intervention would be justified and respond to a number of arguments that might be adduced against that view. (shrink)

In this paper I argue against three leading accounts of self-deception in the philosophical literature and propose a heretofore overlooked route to self-deception. The central problem with extant accounts of self-deception is that they are unable to balance two crucial desiderata: (1) to make the dynamics of self-deception (e.g., the formation of self-deceptive beliefs) psychologically plausible and (2) to capture self-deception as an intentional phenomenon for which the self-deceiver is responsible. I argue that the three leading views all fail on (...) one or both counts. However, I claim that many or most cases of self-deception conform to a different model, which I call ‘Self-deception as Omission’. In these cases, the process of self-deceptive belief formation and the intentional act for which the self-deceiver is responsible come apart, allowing us to meet both desiderata. Self-deceptive beliefs are often formed by unconscious mechanisms closely analogous to the 'System 1' processes of dual-systems psychology, or by other mechanisms of motivated reasoning. The nascently self-deceptive subject then acquiesces in the comforting belief and commits an epistemic failure by allowing it to persist. If this is done for motivationally biased reasons — e.g., preferring that the belief in question be true — then the subject is self-deceived and is blameworthy for her epistemic omission. (shrink)

According to the environment-induced approach to decoherence, the split of the Universe into the degrees of freedom which are of direct interest to the observer and the remaining degrees of freedom is absolutely essential for decoherence. However, the EID approach offers no general criterion for deciding where to place the “cut” between system and environment: the environment may be “external” or “internal”. The main purpose of this paper is to argue that decoherence is a relative phenomenon, better understood from (...) a closed-system perspective according to which the split of a closed quantum system into an open subsystem and its environment is just a way of selecting a particular space of relevant observables of the whole closed system. In order to support this claim, we shall consider the results obtained in a natural generalization of the simple spin-bath model usually studied in the literature. Our main thesis will lead us to two corollaries. First, the problem of identifying the system that decoheres is actually a pseudo-problem, which vanishes as soon as one acknowledges the relative nature of decoherence. Second, the usually supposed link between decoherence and energy dissipation is misguided. As previously pointed out, energy dissipation and decoherence are different phenomena, and we shall argue for this difference on the basis of the relative nature of decoherence. (shrink)

Biologically inspired Evolution Algorithms, that use individuals as searching points and progress search by evolutions or adaptations of the individuals, are widely applied to many optimization problems. Many real world problems, which could be transformed to optimization problems, are very often difficult because the problems have complex landscapes that are multimodal, epistatic and having strong local minima. Current real-coded genetic algorithms could solve high-dimensional multimodal functions, but could not solve strong deceptive functions. Niching GAs are applied to low-dimensional multimodal (...) functions by maintaining diversity of searching population, but could not be applicable to highdimensional functions. In order to optimize high dimensional deceptive multimodal functions, we propose a new EA called Adaptive Neighboring Search, that is structured with a selection for reproduction by restricting mating individuals to neighbors, a crossover-like mutation using the mating individuals and an elitist selection for survival within one centered parent and its offsprings. By individualized generation alternation and complementary crossover-like mutation, the ANS realizes self-distributive and locally adaptive search, and individuals in the search divide into plural promising valleys and converge within same valley. The ANS is applicable to high dimensional deceptive multimodal function optimization, because the feature is independent of number of problem’s dimensions. By applying to high dimensional Fletcher and Powell function as a deceptive multimodal one, we show the ANS can obtain various solutions and several optimal solutions in high probability. (shrink)

The no-wait flow-shop scheduling problem with sequence-dependent setup times and release times is a typical NP-hard problem. This paper proposes an enhanced differential evolution algorithm with several fast evaluating strategies, namely, DE_FES, to minimize the total weighted tardiness objective for the NFSP with SSTs and RTs. In the proposed DE_FES, the DE-based search is adopted to perform global search for obtaining the promising regions or solutions in solution space, and a fast local search combined with three presented strategies (...) is designed to execute exploitation from these obtained regions. Test results and comparisons with two effective meta-heuristics show the effectiveness and robustness of DE_FES. (shrink)

Shane Harwood and Richard Scheines. Genetic Algorithm Search Over Causal Models.

The travelling salesman problem (TSP) belongs to the class of NP-hard problems, in which an optimal solution to the problem cannot be obtained within a reasonable computational time for large-sized problems. To address TSP, we propose a hybrid algorithm, called GA-TCTIA-LBSA, in which a genetic algorithm (GA), tour construction and tour improvement algorithms (TCTIAs) and a list-based simulated annealing (LBSA) algorithm are used. The TCTIAs are introduced to generate a first population, and after that, a search is continued with (...) the GA. The problem of premature convergence of the GA to local optimum is tackled by a method called social disaster technique. Afterwards, the LBSA is applied to generate a new population based on one of two proposed operators called packing and judgement day. The proposed algorithm is implemented in the MATLAB environment, and its two variants, called GA-TCTIA-LBSA packing and GA-TCTIA-LBSA judgement day, are tested on symmetric and asymmetric instances from TSPLIB. The overall results demonstrate that the proposed GA-TCTIA-LBSAs offer promising results, particularly for small-sized instances. (shrink)

A large number of modern communication technologies and sensing technologies are incorporated into the smart grid, which makes its structure unique. The centralized optimized dispatch method of traditional power grids is difficult to achieve effective dispatch of smart grids. Based on the analysis of power generation plan and maintenance plan optimization model, this paper establishes a smart grid power generation and maintenance collaborative optimization model with distributed renewable energy. The objective function of this collaborative optimization problem is the (...) operating cost of conventional units, the cost of wind power generation, and the cost of overhauling units; the constraints considered mainly include system constraints and overhaul constraints. The solution method of combinatorial optimization is analyzed, and the genetic optimization algorithm adopted in this paper is selected and discussed. According to the characteristics of the system, various loads are modeled, and power supply constraints are considered. By establishing an effective objective function, the adjustable load scheduling problem is transformed into a solvable optimal control problem. Taking into account the uncertain factors in the system, the advantage of the real-time control system is that it can realize the dynamic update scheduling of the load, so it is more in line with the requirements of the actual system. The real-time algorithm proposed in the paper is based on a distributed control strategy, which can not only realize dynamic compensation for random fluctuations in renewable energy power generation but also satisfy the load curve optimization under the premise of making full use of power supply resources. In addition, simulation experiments compare the load dispatching capabilities of the proposed algorithm with the existing algorithms, thereby verifying the performance of the proposed method. (shrink)

Emergency scheduling of public resources on the cloud computing platform network can effectively improve the network emergency rescue capability of the cloud computing platform. To schedule the network common resources, it is necessary to generate the initial population through the Hamming distance constraint and improve the objective function as the fitness function to complete the emergency scheduling of the network common resources. The traditional method, from the perspective of public resource fairness and priority mapping, uses incremental optimization algorithm (...) to realize emergency scheduling of public resources, neglecting the improvement process of the objective function, which leads to unsatisfactory scheduling effect. An emergency scheduling method of cloud computing platform network public resources based on genetic algorithm is proposed. With emergency public resource scheduling time cost and transportation cost minimizing target, initial population by Hamming distance constraints, emergency scheduling model, and the corresponding objective function improvement as the fitness function, the genetic algorithm to individual selection and crossover and mutation probability were optimized and complete the public emergency resources scheduling. Experimental results show that the proposed method can effectively improve the efficiency of emergency resource scheduling, and the reliability of emergency scheduling is better. (shrink)