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)

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 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)

Compared to a charging scheduling and management problem characterized by predetermined trip assignment, this study takes bus and driver scheduling into account, and mealtime windows must be guaranteed as one of the major labor regulations. A discretized mixed-integer linear programming model is developed based on a single electric bus route. We aim to obtain fast and high-quality global solutions for this problem, and the model can be easily executed by bus operators by directly invoking an available optimization solver such as (...) IBM ILOG CPLEX. We test our model on a real round-trip bus route. Numerical experiments show that CPLEX takes approximately 6 sec to obtain an optimal solution. The model can not only reasonably arrange daily trips for each electric bus and driver but also effectively determine the optimal charging schedule and management for an electric bus line. Besides, we analyze the sensitivity of the key parameters in the model. With the increase in the drivers’ maximum workload, the drivers’ average idle time decreases by approximately 11.25%. The objective value decreases by approximately 38.71% and 40.04% with increases in the battery capacity and fleet size, respectively, and the objective value increases by approximately 30.06% with the decrease in the initial battery driving range. In addition, we compare the effectiveness of our time discretization modeling method in solving the same case study to that from other similar studies, and the validity of our method can be verified by the calculation time. We also compare the computational efficiency of CPLEX in solving the same case study problem with and without implementing valid inequalities, and the computational efficiency of the valid inequality method is greatly improved. Finally, through the testing of a multiline network, the potential application of the model to a large-scale traffic network is verified. (shrink)

Considering time-varying demand of online retail industry, the traditional static storage location assignment is converted into a multistage storage location assignment process based on the idea of gradual and small-step-forward optimization, which can respond to rapid changes in demand by adjusting the storage location of SKUs in the warehouse in real time and dynamically. First, the study formulates the framework dynamic storage location assignment. Then, the adjustment gain model of dynamic storage location assignment is built, and a genetic algorithm (...) is designed to find the final adjustment solution. Finally, the computer program is developed to simulate the whole process. Simulation and data analysis results show that dynamic storage location assignment can effectively improve picking efficiency when the average order size is small and large demand correlation strength. Dynamic storage location assignment simplifies the warehouse operation process by combining the picking operation and storage location assignment into one without changing the picker’s current walking route, which can offer some theoretical guidance for online retail enterprises implementing dynamic storage location assignment. (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)

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)

Water quality prediction is the basis of water environmental planning, evaluation, and management. In this work, a novel intelligent prediction model based on the fuzzy wavelet neural network including the neural network, the fuzzy logic, the wavelet transform, and the genetic algorithm was proposed to simulate the nonlinearity of water quality parameters and water quality predictions. A self-adapted fuzzy c-means clustering was used to determine the number of fuzzy rules. A hybrid learning algorithm based on a genetic algorithm (...) and gradient descent algorithm was employed to optimize the network parameters. Comparisons were made between the proposed FWNN model and the fuzzy neural network, the wavelet neural network, and the neural network. The results indicate that the FWNN made effective use of the self-adaptability of NN, the uncertainty capacity of FL, and the partial analysis ability of WT, so it could handle the fluctuation and the nonseasonal time series data of water quality, while exhibiting higher estimation accuracy and better robustness and achieving better performances for predicting water quality with high determination coefficients R2 over 0.90. The FWNN is feasible and reliable for simulating and predicting water quality in river. (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)

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)

Connected vehicle fleets have formed significant component of industrial internet of things scenarios as part of Industry 4.0 worldwide. The number of vehicles in these fleets has grown at a steady pace. The vehicles monitoring with machine learning algorithms has significantly improved maintenance activities. Predictive maintenance potential has increased where machines are controlled through networked smart devices. Here, benefits are accrued considering uptimes optimization. This has resulted in reduction of associated time and labor costs. It has also provided (...) significant increase in cost benefit ratios. Considering vehicle fault trends in this research predictive maintenance problem is addressed through hybrid deep learning-based ensemble method (HDLEM). The ensemble framework which acts as predictive analytics engine comprises of three deep learning algorithms viz modified cox proportional hazard deep learning (MCoxPHDL), modified deep learning embedded semi supervised learning (MDLeSSL) and merged LSTM (MLSTM) networks. Both sensor as well as historical maintenance data are collected and prepared using benchmarking methods for HDLEM training and testing. Here, times between failures (TBF) modeling and prediction on multi-source data are successfully achieved. The results obtained are compared with stated deep learning models. This ensemble framework offers great potential towards achieving more profitable, efficient and sustainable vehicle fleet management solutions. This helps better telematics data implementation which ensures preventative management towards desired solution. The ensemble method's superiority is highlighted through several experimental results. (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 incorporation of hybrid systems based on renewable sources for the optimization of electricity distribution systems and planning of power supply strategies using genetic algorithms is studied. A series of characteristics of electrical sub-stations was chosen and through simulations, data were obtained for the optimization of the existing infrastructure, which provides reliability, security, economic supply and quality of service. An algorithm was obtained with the optimal configuration of various components: photovoltaic panels, batteries, AC generator, fuel cell and inverter, which (...) in the case of mono-objective optimization, minimized total system costs throughout its useful life. The most appropriate control strategy or combination of control variables was obtained to minimize costs. Keywords: Electrical distribution, Hybrid systems, Genetic algorithms. References [1]D. F. Pinzón, «Diseño óptimo de Sistemas de Distribución,» Universidad Nacional de Colombia, Bogotá, 2014. [2]F. A. Mendoza Lameda, «Diseño multiobjetivo y multietapa de sistemas de distribución de energía eléctrica aplicando algoritmos evolutivos,» Universidad de Zaragoza, Zaragoza, 2010. [3]L. Miró Hernández and R. Vizcón Toledo, «Sistema Hibrido Propuesto Para la Generación de Electricidad en un Policlínico,» Revista Avanzada Científica, vol. 9, nº 2, pp. 50-56, 2006. [4]J. Lagunas M., C. Ortega S. and P. Caratozzolo M., «Control supervisorio para sistemas híbridos de geración eléctrica basado en lógica difusa,» Boletin UE, Monterrey, 2005. [5]J. L. Bernal Agustín, «Aplicación de algoritmos genéticos al diseño óptimo de sistemas de distribución de energía eléctrica,» Universidad de Zaragoza, Zaragoza, 1998. [6]V. MIranda, J. V. Ranito and L. Proenca, «Genetic Algorithms in Optimal Multistage Distribution Network Planning, » IEEE, Porto, 1994. [7]I. Ramirez-Rosado and J. Dominguez-Navarro, «Computer Aided Desing of Power Distribution Systems: Multiobjective Mathematical Simulations» International Journal of Power and Energy Systems, vol. 19, nº 4, pp. 1801-1810, 2004. (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 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)

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)

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)

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)

In this paper, the single-machine scheduling problem is studied by simultaneously considering due-date assignment and group technology. The objective is to determine the optimal sequence of groups and jobs within groups and optimal due-date assignment to minimize the weighted sum of the absolute value in lateness and due-date assignment cost, where the weights are position dependent. For the common due-date assignment, slack due-date assignment, and different due-date assignment, an O n log n time algorithm is proposed, respectively, to solve the (...) problem, where n is the number of jobs. (shrink)

Neural network models have recently made significant achievements in solving vehicle scheduling problems. Adaptive ant colony algorithm provides a new idea for neural networks to solve complex system problems of multiconstrained network intensive vehicle routing models. The pheromone in the path is changed by adjusting the volatile factors in the operation process adaptively. It effectively overcomes the tendency of the traditional ant colony algorithm to fall easily into the local optimal solution and slow convergence speed to search for the (...) global optimal solution. The multiconstrained network intensive vehicle routing algorithm based on adaptive ant colony algorithm in this paper refers to the interaction between groups. Adaptive transfer and pheromone update strategies are introduced based on the traditional ant colony algorithm to optimize the selection, update, and coordination mechanisms of the algorithm further. Thus, the search task of the objective function for a feasible solution is completed by the search ants. Through the division and collaboration of different kinds of ants, pheromone adaptive strategy is combined with polymorphic ant colony algorithm. It can effectively overcome some disadvantages, such as premature stagnation, and has a theoretical significance to the study of large-scale multiconstrained vehicle routing problems in complex traffic network systems. (shrink)

The development of artificial intelligence technology has brought changes to various industries. Under the concept of green sustainable development, how to use the progress of science and technology to implement low-carbon strategies is a problem that every enterprise should consider. Aiming at the problem of picking up goods in logistics industry, this paper proposed a secondary task assignment theory for multiple unmanned aerial vehicle based on green scheduling. The theory greatly improves the utilization rate of unmanned aerial vehicle and reduces (...) the energy consumption. We analyzed the advantages and disadvantages of local optimal algorithm and global optimal algorithm in time and energy consumption. Through repeated experiments in different ranges, we have well verified the high efficiency and general applicability of this theory, which can provide theoretical and practical implications for logistics enterprises using UAV to achieve low-carbon sustainable development in the future. (shrink)

A thermal-mechanical analysis of the behavior of the segments of the rollers of the briquetting machines is carried out due to the effect of thermal shock and efforts exerted on the part. It is intended to obtain the main causes that generate this problem, through a mechanical analysis that simulated the behavior in the presence of several thermal gradients. The purpose of the study is to reduce maintenance costs and the continuous replacement and repair of segments, as well as (...) losses in tons of production due to the failure that are of great impact to the industry. This investigation allows us to know to what extent the operating parameters, such as: material temperature, pressure, torque, speed of the rollers influence the life of the segments according to their manufacturing material and based on these the behavior is simulated during the briquetting process. Keywords: Simulation, Finite element, Briquettes. [1]D. F. Pinzón, «Diseño óptimo de Sistemas de Distribución,» Universidad Nacional de Colombia, Bogotá, 2014. [2]F. A. Mendoza Lameda, «Diseño multiobjetivo y multietapa de sistemas de distribución de energía eléctrica aplicando algoritmos evolutivos,» Universidad de Zaragoza, Zaragoza, 2010. [3]L. Miró Hernández y R. Vizcón Toledo, «Sistema Hibrido Propuesto Para la Generación de Electricidad en un Policlínico,» Revista Avanzada Científica, vol. 9, nº 2, pp. 50-56, 2006. [4]J. Lagunas M., C. Ortega S. y P. Caratozzolo M., «Control supervisorio para sistemas híbridos de geración eléctrica basado en lógica difusa,» Boletin UE, Monterrey, 2005. [5]J. L. Bernal Agustín, «Aplicación de algoritmos genéticos al diseño óptimo de sistemas de distribución de energía eléctrica,» Universidad de Zaragoza, Zaragoza, 1998. [6]V. MIranda, J. V. Ranito y L. Proenca, «Genetic Algorithms in Optimal Multistage Distribution Network Planning, » IEEE, Porto, 1994. [7]I. Ramirez-Rosado y J. Dominguez-Navarro, «Computer Aided Desing of Power Distribution Systems: Multiobjective Mathematical Simulations» International Journal of Power and Energy Systems, vol. 19, nº 4, pp. 1801-1810, 2004. (shrink)

This article uses a research method that combines theoretical research and empirical analysis. It first introduces the relevant theories of energy service city distribution sites in the context of e-commerce and then the types of energy service city distribution sites and the composition of energy service city distribution systems. The network layout of the service city distribution site and the location objectives, principles, and processes of the model is studied to determine the network layout plan of the energy service city (...) distribution system in this paper. This paper fully considers the characteristics of the network operation mode of the energy service city distribution site and establishes an optimization model for the location selection and vehicle routing of the distribution center with the lowest total system cost under the simultaneous delivery service mode; based on the hierarchical solution strategy, a combination of deep learning is designed. Algorithms mainly include two-stage hybrid heuristic algorithm of cluster analysis, maximum coverage and genetic algorithm; simulation analysis is conducted to verify the effectiveness of the model and algorithm by data simulation, finally get the integrated optimization plan of distribution center location and routing, and put forward the operation strategy through the result expansion analysis. This paper studies the planning model based on the network layout planning of the energy service city distribution system under the e-commerce environment, aiming to promote the breakthrough development of urban smart logistics and prove the importance of the energy service city distribution station network layout planning. The purpose and results of the research are to reduce traffic and environmental pressures, achieve joint direct distribution, improve the efficiency of urban logistics and distribution, and solve the problem of the last mile of the city. (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)

By exploring whether nanotechnologies have the potential to generate green innovations, we consider the paradox between the negative and positive side-effects that could come with the development of nanotechnologies. Starting from the conceptual framework of green product innovation, the potential green innovation activity of more than 14,000 firms of the nanotech sector is investigated. Using a query-search method, their patenting activity is explored. Results first show that there is an increasing trend toward the creation of fundamental green knowledge by firms (...) involved in nanotechnologies; second, they demonstrate that energy efficiency is the main driver of green knowledge creation in the sector and third they reveal the main characteristics of nanotech firms creating green knowledge. Beyond their contribution to the debate between positive and negative outcomes of nanotechnology developments, these results also enrich the conceptual framework of green product innovation—a key route to achieving sustainability at the same time as growth. (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)

As one of the most effective medical technologies for the infertile patients, in vitro fertilization has been more and more widely developed in recent years. However, prolonged waiting for IVF procedures has become a problem of great concern, since this technology is only mastered by the large general hospitals. To deal with the insufficiency of IVF service capacity, this paper studies an IVF queuing network in an integrated cloud healthcare system, where the two key medical services, that is, egg retrieval (...) and transplantation, are assigned to accomplish in the general hospital, while the routine medical tests are assigned into the community hospital. Based on continuous-time Markov procedure, a dynamic large-scale server scheduling problem in this complicated service network is modeled with consideration of different arrival rates of multiple type of patients and different service capacities of multiple servers that can be defined as doctors of the general hospital. To solve this model, a reinforcement learning algorithm is proposed, where the reward functions are designed for four conflicting subcosts: setup cost, patient waiting cost, penalty cost for unsatisfied patient personal preferences, and medical cost of patient. The experimental results show that the optimal service rule of each server’s queue obtained by the RL method is significantly superior to the traditional service rule. (shrink)

This research proposes a modified metaheuristic optimization algorithm, named as improved stochastic fractal search, which is formed based on the integration of the quasiopposition-based learning and chaotic local search schemes into the original SFS algorithm for solving the optimal capacitor placement in radial distribution networks. The test problem involves the determination of the optimal number, location, and size of fixed and switched capacitors at different loading conditions so that the network total yearly cost is minimized with simultaneous fulfillment of operating (...) constraints. Also, the hourly on/off scheduling plans of switched shunt capacitors considering a modified cost objective function are obtained. The proposed ISFS algorithm has been tested on two IEEE 69-bus and 119-bus RDNs and a practical 152-bus RDN. For clarifying the effectiveness and validation of the ISFS, the simulated results have been compared with those of other previously utilized solution approaches in the literature as well as the original SFS. From result comparison, the proposed ISFS outperforms other previous approaches regarding solution quality and statistical performance for the compared cases, especially in the complex and large-scale networks. Notably, compared with the original SFS, the proposed ISFS shows a significantly better performance in all the tested cases. (shrink)

As one of the most important routing problems in the complex network within a very-large-scale integration circuit, bus routing has become much more challenging when witnessing the advanced technology node enters the deep nanometer era because all bus bits need to be routed with the same routing topology in the context. In particular, the nonuniform routing track configuration and obstacles bring the largest difficulty for maintaining the same topology for all bus bits. In this paper, we (...) first present a track handling technique to unify the nonuniform routing track configuration with obstacles. Then, we formulate the topology-aware single bus routing as an unsplittable flow problem, which is integrated into a negotiation-based global routing to determine the desired routing regions for each bus. A topology-aware track assignment is also presented to allocate the tracks to each segment of buses under the guidance of the global routing result. Finally, a detailed routing scheme is proposed to connect the segments of each bus. We evaluate our routing result with the benchmark suite of the 2018 CAD Contest. Compared with the top-3 state-of-the-art methods, experimental results show that our proposed algorithm achieves the best overall score regarding specified time limitations. (shrink)

Individuals vary in the way they navigate through space. Some take novel shortcuts, while others rely on known routes to find their way around. We wondered how and why there is so much variation in the population. To address this, we first compared the trajectories of 368 human subjects navigating a virtual maze with simulated trajectories. The simulated trajectories were generated by strategy-based path planning algorithms from robotics. Based on the similarities between human trajectories and different strategy-based simulated trajectories, we (...) found that there is a variation in the type of strategy individuals apply to navigate space, as well as variation within individuals on a trial-by-trial basis. Moreover, we observed variation within a trial when subjects occasionally switched the navigation strategies halfway through a trajectory. In these cases, subjects started with a route strategy, in which they followed a familiar path, and then switched to a survey strategy, in which they took shortcuts by considering the layout of the environment. Then we simulated a second set of trajectories using five different but comparable artificial maps. These trajectories produced the similar pattern of strategy variation within and between trials. Furthermore, we varied the relative cost, that is, the assumed mental effort or required timesteps to choose a learned route over alternative paths. When the learned route was relatively costly, the simulated agents tended to take shortcuts. Conversely, when the learned route was less costly, the simulated agents showed preference toward a route strategy. We suggest that cost or assumed mental effort may be the reason why in previous studies, subjects used survey knowledge when instructed to take the shortest path. We suggest that this variation we observe in humans may be beneficial for robotic swarms or collections of autonomous agents during information gathering. (shrink)

Individuals vary in the way they navigate through space. Some take novel shortcuts, while others rely on known routes to find their way around. We wondered how and why there is so much variation in the population. To address this, we first compared the trajectories of 368 human subjects navigating a virtual maze with simulated trajectories. The simulated trajectories were generated by strategy-based path planning algorithms from robotics. Based on the similarities between human trajectories and different strategy-based simulated trajectories, we (...) found that there is a variation in the type of strategy individuals apply to navigate space, as well as variation within individuals on a trial-by-trial basis. Moreover, we observed variation within a trial when subjects occasionally switched the navigation strategies halfway through a trajectory. In these cases, subjects started with a route strategy, in which they followed a familiar path, and then switched to a survey strategy, in which they took shortcuts by considering the layout of the environment. Then we simulated a second set of trajectories using five different but comparable artificial maps. These trajectories produced the similar pattern of strategy variation within and between trials. Furthermore, we varied the relative cost, that is, the assumed mental effort or required timesteps to choose a learned route over alternative paths. When the learned route was relatively costly, the simulated agents tended to take shortcuts. Conversely, when the learned route was less costly, the simulated agents showed preference toward a route strategy. We suggest that cost or assumed mental effort may be the reason why in previous studies, subjects used survey knowledge when instructed to take the shortest path. We suggest that this variation we observe in humans may be beneficial for robotic swarms or collections of autonomous agents during information gathering. (shrink)

Higher education institutions have access to higher volumes and a greater variety and granularity of student data, often in real-time, than ever before. As such, the collection, analysis and use of student data are increasingly crucial in operational and strategic planning, and in delivering appropriate and effective learning experiences to students. Student data – not only in what data is collected, but also how the data is framed and used – has material and discursive effects, both permanent and fleeting. We (...) have to critically engage claims that artificial intelligence and the ever expansive/expanding systems of algorithmic decision-making provide speedy, accessible, revealing, panoramic, prophetic and smart analyses of students' risks, potential and learning needs. We need to pry open the black boxes higher education institutions use to admit, steer, predict and prescribe students’ learning journeys. (shrink)

This chapter is concerned with the Cambrian explosion. It considers only one particular kind of explanation for the Cambrian radiation: that major innovations in animal body plan were produced from relatively few genetic changes of large phenotypic effect. It investigates the developmental genetic hypothesis of the origin and maintenance of body plans. This chapter suggests that the genetic architecture underlying body plans was not set during the Cambrian and has been immutable since. It shows that the (...) link between body plan and phylum can become blurry when the minor phyla are considered. (shrink)

Path selection is one of the key technologies of wireless sensor network. A reasonable choice of coverage path can improve the service quality of WSN and extend the life cycle of WSN. Biogeography-based optimization is widely used in the field of cluster intelligent optimization because its search method has a better incentive mechanism for population evolution. In this paper, the move-in and move-out operation and mutation operation of the BBO algorithm enable WSN to find an efficient routing path. In (...) this paper, simulation experiments are carried out in two scenarios of regular deployment and random deployment of WSN nodes. The experimental results show that the quality of the WSN coverage path solution optimized by the BBO algorithm in the two scenarios is better than that of the particle swarm algorithm and genetic algorithm. (shrink)

Demodulating harmful nodes and diminishing the energy waste in sensor nodes can prolong the lifespan of wireless sensor networks. In this study, a genetic algorithm and an adaptive neuro fuzzy inference system were used to diminish the energy waste of sensors. Weighted trust evaluation was applied to search for harmful nodes in the network to prolong the lifespan of WSNs. A low-energy adaptive clustering hierarchy method was used to analyze the results. It was discovered that searching for harmful nodes (...) with GA-ANFIS using weighted trust evaluation significantly increased the lifespan of WSNs. For evaluation of the proposed method we used the mean of energy of all sensors against of the round, data packets received in base station, minimum energy versus rounds and number of alive sensors versus rounds. Also, in this paper we compared the proposed method results with LEACH, LEACH-DT, Random, SIF and GA-Fuzzy methods. As results the proposed method has high life time than other methods. A representation of the overall system was implemented using MATLAB software. (shrink)

With the development and application of information technology, the digitization of information management and the virtualization of physical models have become very important technical application fields in the world. The establishment of the 3D landscape model and the realization of the 3D geographic information system are based on this, and there is not only a wide range of development prospects in many aspects such as urban planning and management, planning and design, local government construction, housing industry development, land monitoring and (...) management, and environmental monitoring and evaluation. There are not only research studies and formulations but also a practical significance in other analysis, evaluation, decision making, and other departments. In recent years, the research of 3D city modeling has been developed rapidly, and most of the existing 2D-GIS can be transformed into 3D visual landscape. Based on the three-dimensional geographic information system and desktop drawing software AutoCAD, this paper takes the two-dimensional line drawing of a residential district as the base map, expounds the design process of the three-dimensional simulation model of the urban community from the aspects of map preprocessing, building simulation model construction, texture mapping, and virtual visualization, and discusses the problems encountered in it. The main contributions of this paper are that this technology puts forward a new solution for the integrated corridor operation and maintenance management, greatly improves the intelligent management level of the integrated corridor operation and maintenance work, and simplifies the complex integrated corridor operation and maintenance management. It is helpful to improve the work efficiency of operation and maintenance, reduce the dependence of personnel, and respond to the long-term construction needs of the smart city at the same time. (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)

The purpose of this study is development of a supporting system for teacher's design of lesson plan. Especially design of lesson plan which relates to the new subject "Information Study" is supported. In this study, we developed a system which generates teaching and learning activity sequences by interlinking lesson's activities corresponding to the various conditions according to the user's input. Because user's input is multiple information, there will be caused contradiction which the system should solve. This multiobjective optimization problem is (...) resolved by Distributed Genetic Algorithms, in which some fitness functions are defined with reference models on lesson, thinking and teaching style. From results of various experiments, effectivity and validity of the proposed methods and reference models were verified; on the other hand, some future works on reference models and evaluation functions were also pointed out. (shrink)

The proposed article is devoted to the description of an intelligent urban passenger transport system based on unmanned electric vehicles, sequentially moving along a separate line. This system is a passenger transport system of a new urban mobility, formed under the influence of social conditions generated by high population density in cities, that suppose the development of pedestrian zones and ecological modes of transport, "transport as a service", etc. In this historical context, public transport systems acquire special relevance. The described (...) transport system belongs to intelligent systems, since it is capable of functioning in autonomous mode without human intervention, adaptively responding to changes in the dynamics of the flow of passengers during the day. Passengers are transported by electric cars, which can be combined into cassettes according to the principle of road trains based on the transportation plan drawn up by the intelligent center of the transport system according to the matrix of correspondences, filled in taking into account the incoming requests for service from passengers. When drawing up a transportation plan, the algorithms of the transport system give preference to transportation according to the "source-destination" principle, that is, when the passenger goes to the destination with a minimum number of intermediate stops, and ideally without them. The paper formulates also a criterion of arising of a conflict in the movement of vehicles, which allows to identify situations when an electric vehicle driving in front can detain vehicles following after. The work has relevance because the criterion will allow to make adjustments in the schedule of movement of vehicles and exclude the loss of time and energy that carries the transport system during braking and acceleration of electric cars, as well as to reduce waiting time and travel of passengers. (shrink)

With the advent of the cloud computing model allowing a shared access to massive computing facilities, a surging demand emerges for the protection of the intellectual property tied to the programs executed on these uncontrolled systems. If novel paradigm as confidential computing aims at protecting the data manipulated during the execution, obfuscating techniques (in particular at the source code level) remain a popular solution to conceal the purpose of a program or its logic without altering its functionality, thus preventing reverse-engineering (...) on the program even with the help of computing resources. The many advantages of code obfuscation, together with its low cost, makes it a popular technique. This paper proposes a novel methodology for source code obfuscation that can be used together with other traditional obfuscation techniques, making the code more robust against reverse engineering attacks. Three program complexity metrics are used to define three different single-objective combinatorial optimization versions of the problem, which are solved and analysed. Additionally, three multi-objective problems are defined, those considering each of the selected metrics together with the program execution time, in order to avoid strong obfuscations penalizing the performance. The goal of the defined problems is to find sequences of LLVM optimizations that lead to highly obfuscated versions of the original code. These transformations are applied to the back-end pseudo-assembly code (i.e., LLVM Intermediate Representation), thus avoiding any further optimizations by the compiler. Classical genetic algorithms (GAs) are used to solve the studied problems, namely a basic cellular GA for the single-objective problems and the popular NSGA-II for the multi-objective ones. The promising results show the potential of the proposed technique. (shrink)

Order picking, which is collecting a set of products from different locations in a warehouse, has repeatedly been described as one of the most laborious and time-consuming internal logistic processes. Each order is issued to pick some products located at given locations in the warehouse. In this paper, we consider an order picking problem, in which a number of orders with different delivery due dates are going to be retrieved by a limited number of order pickers in multiperiods such that (...) the total tardiness is minimized. The aim is to determine a retrieval plan in terms of order batching and order picker multitrip routing as decision variables. Besides, products are arrived and replenished at the predetermined locations at different periods. Therefore, products sitting in those locations should be delivered soon to provide empty rooms for replenishment. A mixed integer linear programming formulation is proposed for this new problem. The model is optimally solved for small-size problems. For larger instances, grouping metaheuristic algorithms are proposed based on particle swarm optimization and the league championship algorithm that use group-based operators to generate reasonable batches of orders. Improvement heuristics are designed as well. The performance of the MILP formulation and metaheuristic algorithms is analyzed for different problem instances whose designs are based on real data gathered from an auto parts warehouse. Results indicate that our algorithms can stably solve large instances of the problem in a reasonable time. (shrink)

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