We report an overlapping sampling scheme to accelerate computational ghost imaging for imaging moving targets,based on reordering a set of Hadamard modulation matrices by means of a heuristic algorithm. The new conden...We report an overlapping sampling scheme to accelerate computational ghost imaging for imaging moving targets,based on reordering a set of Hadamard modulation matrices by means of a heuristic algorithm. The new condensed overlapped matrices are then designed to shorten and optimize encoding of the overlapped patterns, which are shown to be much superior to the random matrices. In addition, we apply deep learning to image the target, and use the signal acquired by the bucket detector and corresponding real image to train the neural network. Detailed comparisons show that our new method can improve the imaging speed by as much as an order of magnitude, and improve the image quality as well.展开更多
This paper focuses on the integrated problem of long-term planning and short-term scheduling in a largescale refinery-petrochemical complex,and considers the overall manufacturing process from the upstream refinery to...This paper focuses on the integrated problem of long-term planning and short-term scheduling in a largescale refinery-petrochemical complex,and considers the overall manufacturing process from the upstream refinery to the downstream petrochemical site.Different time scales are incorporated from the planning and scheduling subproblems.At the end of each discrete time period,additional constraints are imposed to ensure material balance between different time scales.Discrete time representation is applied to the planning subproblem,while continuous time is applied to the scheduling of ethylene cracking and polymerization processes in the petrochemical site.An enterprise-wide mathematical model is formulated through mixed integer nonlinear programming.To solve the problem efficiently,a heuristic algorithm combined with a convolutional neural network(CNN),is proposed.Binary variables are used as the CNN input,leading to the integration of a data-driven approach and classical optimization by which a heuristic algorithm is established.The results do not only illustrate the detailed operations in a refinery and petrochemical complex under planning and scheduling,but also confirm the high efficiency of the proposed algorithm for solving large-scale problems.展开更多
This paper investigates traffic flow of connected and automated vehicles at lane drop on two-lane highway. We evaluate and compare performance of an optimization-based control algorithm(OCA) with that of a heuristic r...This paper investigates traffic flow of connected and automated vehicles at lane drop on two-lane highway. We evaluate and compare performance of an optimization-based control algorithm(OCA) with that of a heuristic rules-based algorithm(HRA). In the OCA, the average speed of each vehicle is maximized. In the HRA, virtual vehicle and restriction of the command acceleration caused by the virtual vehicle are introduced. It is found that(i) capacity under the HRA(denoted as C_(H)) is smaller than capacity under the OCA;(ii) the travel delay is always smaller under the OCA, but driving is always much more comfortable under the HRA;(iii) when the inflow rate is smaller than C_(H), the HRA outperforms the OCA with respect to the fuel consumption and the monetary cost;(iv) when the inflow rate is larger than C_(H), the HRA initially performs better with respect to the fuel consumption and the monetary cost, but the OCA would become better after certain time. The spatiotemporal pattern and speed profile of traffic flow are presented, which explains the reason underlying the different performance. The study is expected to help for better understanding of the two different types of algorithm.展开更多
Aiming at minimizing spare capacity for optical WDM networks, we propose a new heuristic algorithm for preconfigured protection cycle (p-cycle) design. Numerical results show that the spare capacity obtained by our ne...Aiming at minimizing spare capacity for optical WDM networks, we propose a new heuristic algorithm for preconfigured protection cycle (p-cycle) design. Numerical results show that the spare capacity obtained by our new algorithm is very close to the optimal solution.展开更多
Industry 4.0 is a concept that assists companies in developing a modern supply chain(MSC)system when they are faced with a dynamic process.Because Industry 4.0 focuses on mobility and real-time integration,it is a goo...Industry 4.0 is a concept that assists companies in developing a modern supply chain(MSC)system when they are faced with a dynamic process.Because Industry 4.0 focuses on mobility and real-time integration,it is a good framework for a dynamic vehicle routing problem(DVRP).This research works on DVRP.The aim of this research is to minimize transportation cost without exceeding the capacity constraint of each vehicle while serving customer demands from a common depot.Meanwhile,new orders arrive at a specific time into the system while the vehicles are executing the delivery of existing orders.This paper presents a two-stage hybrid algorithm for solving the DVRP.In the first stage,construction algorithms are applied to develop the initial route.In the second stage,improvement algorithms are applied.Experimental results were designed for different sizes of problems.Analysis results show the effectiveness of the proposed algorithm.展开更多
In optimization theory,the adaptive control of the optimization process is an important goal that people pursue.To solve this problem,this study introduces the idea of neutrosophic decision-making into classical heuri...In optimization theory,the adaptive control of the optimization process is an important goal that people pursue.To solve this problem,this study introduces the idea of neutrosophic decision-making into classical heuristic algorithm,and proposes a novel neutrosophic adaptive clustering optimization thought,which is applied in a novel neutrosophic genetic algorithm(NGA),for example.The main feature of NGA is that the NGA treats the crossover effect as a neutrosophic fuzzy set,the variation ratio as a structural parameter,the crossover effect as a benefit parameter and the variation effect as a cost parameter,and then a neutrosophic fitness function value is created.Finally,a high order assignment problem in warehousemanagement is taken to illustrate the effectiveness of NGA.展开更多
Under the background of the rapid development of the air transport industry, the abnormal phenomenon of flights has become increasingly serious due to various factors such as the gradual reduction of resources, advers...Under the background of the rapid development of the air transport industry, the abnormal phenomenon of flights has become increasingly serious due to various factors such as the gradual reduction of resources, adverse climatic conditions, problems in air traffic control and mechanical failures. In order to reduce losses, it has become a major problem for airlines to use optimization algorithm to study the recovery of abnormal flights. By upgrading the passenger recovery engine, the purpose of this paper is to provide the optimal recovery scheme for passengers, so as to reduce the risk of transferring overseas flights, and thus reduce the economic loss of airlines. In this paper, the optimization model and algorithm based on network flow, combined with actual business requirements, comprehensively consider multiple optimization objectives to quickly generate passenger recovery solutions, and at the same time achieve the optimal income of airlines and the acceptance rate of passenger recovery, so as to balance the two. The practicability and effectiveness of the proposed model and algorithm are proved by some concrete examples.展开更多
The execution process of satellite-ground clock synchronization and ephemeris uploading in the system is analyzed,as well as their characterized operation and their relationship.Based on the analysis of the scheduling...The execution process of satellite-ground clock synchronization and ephemeris uploading in the system is analyzed,as well as their characterized operation and their relationship.Based on the analysis of the scheduling goal and constraint character,a heuristics rule-based multi-stage link scheduling algorithm was put forward.The algorithm distinguishes the on-off-frontier satellites from the others and schedules them by turns.The paper presented the main flow as well as the detailed design of the rule.Finally based on the current COMPASS global system,some typical resources and constraints are selected to generate an instance.Then the comparison analysis between the heuristics scheduling algorithm and three other traditional scheduling strategies are carried out.The result shows the validity and reasonability of the multi-stage strategy.展开更多
Cloud computing is currently dominated within the space of highperformance distributed computing and it provides resource polling and ondemand services through the web.So,task scheduling problem becomes a very importa...Cloud computing is currently dominated within the space of highperformance distributed computing and it provides resource polling and ondemand services through the web.So,task scheduling problem becomes a very important analysis space within the field of a cloud computing environment as a result of user’s services demand modification dynamically.The main purpose of task scheduling is to assign tasks to available processors to produce minimum schedule length without violating precedence restrictions.In heterogeneous multiprocessor systems,task assignments and schedules have a significant impact on system operation.Within the heuristic-based task scheduling algorithm,the different processes will lead to a different task execution time(makespan)on a heterogeneous computing system.Thus,a good scheduling algorithm should be able to set precedence efficiently for every subtask depending on the resources required to reduce(makespan).In this paper,we propose a new efficient task scheduling algorithm in cloud computing systems based on RAO algorithm to solve an important task and schedule a heterogeneous multiple processing problem.The basic idea of this process is to exploit the advantages of heuristic-based algorithms to reduce space search and time to get the best solution.We evaluate our algorithm’s performance by applying it to three examples with a different number of tasks and processors.The experimental results show that the proposed approach significantly succeeded in finding the optimal solutions than others in terms of the time of task implementation.展开更多
Cloud data centers have become overwhelmed with data-intensive applications due to the limited computational capabilities of mobile terminals.Mobile edge computing is emerging as a potential paradigm to host applicati...Cloud data centers have become overwhelmed with data-intensive applications due to the limited computational capabilities of mobile terminals.Mobile edge computing is emerging as a potential paradigm to host application execution at the edge of networks to reduce transmission delays.Compute nodes are usually distributed in edge environments,enabling crucially efficient task scheduling among those nodes to achieve reduced processing time.Moreover,it is imperative to conserve edge server energy,enhancing their lifetimes.To this end,this paper proposes a novel task scheduling algorithm named Energy-aware Double-fitness Particle Swarm Optimization(EA-DFPSO)that is based on an improved particle swarm optimization algorithm for achieving energy efficiency in an edge computing environment along with minimal task execution time.The proposed EA-DFPSO algorithm applies a dual fitness function to search for an optimal tasks-scheduling scheme for saving edge server energy while maintaining service quality for tasks.Extensive experimentation demonstrates that our proposed EA-DFPSO algorithm outperforms the existing traditional scheduling algorithms to achieve reduced task completion time and conserve energy in an edge computing environment.展开更多
Recently, the development of Industrial Internet of Things hastaken the advantage of 5G network to be more powerful and more intelligent.However, the upgrading of 5G network will cause a variety of issues increase,one...Recently, the development of Industrial Internet of Things hastaken the advantage of 5G network to be more powerful and more intelligent.However, the upgrading of 5G network will cause a variety of issues increase,one of them is the increased cost of coverage. In this paper, we proposea sustainable wireless sensor networks system, which avoids the problemsbrought by 5G network system to some extent. In this system, deployingrelays and selecting routing are for the sake of communication and charging.The main aim is to minimize the total energy-cost of communication underthe precondition, where each terminal with low-power should be charged byat least one relay. Furthermore, from the perspective of graph theory, weextract a combinatorial optimization problem from this system. After that,as to four different cases, there are corresponding different versions of theproblem. We give the proofs of computational complexity for these problems,and two heuristic algorithms for one of them are proposed. Finally, theextensive experiments compare and demonstrate the performances of thesetwo algorithms.展开更多
In most of the scientific research feature selection is a challenge for researcher.Selecting all available features is not an option as it usually complicates the research and leads to performance drop when dealing wi...In most of the scientific research feature selection is a challenge for researcher.Selecting all available features is not an option as it usually complicates the research and leads to performance drop when dealing with large datasets.On the other hand,ignoring some features can compromise the data accuracy.Here the rough set theory presents a good technique to identify the redundant features which can be dismissed without losing any valuable information,however,exploring all possible combinations of features will end with NP-hard problem.In this research we propose adopting a heuristic algorithm to solve this problem,Polar Bear Optimization PBO is a metaheuristic algorithm provides an effective technique for solving such kind of optimization problems.Among other heuristic algorithms it proposes a dynamic mechanism for birth and death which allows keep investing in promising solutions and keep dismissing hopeless ones.To evaluate its efficiency,we applied our proposed model on several datasets and measured the quality of the obtained minimal feature set to prove that redundant data was removed without data loss.展开更多
Solving the controller placement problem (CPP) in an SDN architecture with multiple controllers has a significant impact on control overhead in the network, especially in multihop wireless networks (MWNs). The generat...Solving the controller placement problem (CPP) in an SDN architecture with multiple controllers has a significant impact on control overhead in the network, especially in multihop wireless networks (MWNs). The generated control overhead consists of controller-device and inter-controller communications to discover the network topology, exchange configurations, and set up and modify flow tables in the control plane. However, due to the high complexity of the proposed optimization model to the CPP, heuristic algorithms have been reported to find near-optimal solutions faster for large-scale wired networks. In this paper, the objective is to extend those existing heuristic algorithms to solve a proposed optimization model to the CPP in software-<span>defined multihop wireless networking</span><span> (SDMWN).</span>Our results demonstrate that using ranking degrees assigned to the possible controller placements, including the average distance to other devices as a degree or the connectivity degree of each placement, the extended heuristic algorithms are able to achieve the optimal solution in small-scale networks in terms of the generated control overhead and the number of controllers selected in the network. As a result, using extended heuristic algorithms, the average number of hops among devices and their assigned controllers as well as among controllers will be reduced. Moreover, these algorithms are able tolower<span "=""> </span>the control overhead in large-scale networks and select fewer controllers compared to an extended algorithm that solves the CPP in SDMWN based on a randomly selected controller placement approach.展开更多
With increased dependence on space assets,scheduling and tasking of the space surveillance network(SSN)are vitally important.The multi-sensor collaborative observation scheduling(MCOS)problem is a multi-constraint and...With increased dependence on space assets,scheduling and tasking of the space surveillance network(SSN)are vitally important.The multi-sensor collaborative observation scheduling(MCOS)problem is a multi-constraint and high-conflict complex combinatorial optimization problem that is nondeterministic polynomial(NP)-hard.This research establishes a sub-time window constraint satisfaction problem(STWCSP)model with the objective of maximizing observation profit.Considering the significant effect of genetic algorithms(GA)on solving the problem of resource allocation,an evolution heuristic(EH)algorithm containing three strategies that focus on the MCOS problem is proposed.For each case,a task scheduling sequence is first obtained via an improved GA with penalty(GAPE)algorithm,and then a mission planning algorithm(heuristic rule)is used to determine the specific observation time.Compared to the model without sub-time windows and some other algorithms,a series of experiments illustrate the STWCSP model has better performance in terms of total profit.Experiments about strategy and parameter sensitivity validate its excellent performance in terms of EH algorithms.展开更多
Real-time train rescheduling plays a vital role in railway transportation as it is crucial for maintaining punctuality and reliability in rail operations.In this paper,we propose a rescheduling model that incorporates...Real-time train rescheduling plays a vital role in railway transportation as it is crucial for maintaining punctuality and reliability in rail operations.In this paper,we propose a rescheduling model that incorporates constraints and objectives generated through human-computer interaction.This approach ensures that the model is aligned with practical requirements and daily operational tasks while facilitating iterative train rescheduling.The dispatcher’s empirical knowledge is integrated into the train rescheduling process using a human-computer interaction framework.We introduce six interfaces to dynamically construct constraints and objectives that capture human intentions.By summarizing rescheduling rules,we devise a rule-based conflict detection-resolution heuristic algorithm to effectively solve the formulated model.A series of numerical experiments are presented,demonstrating strong performance across the entire system.Furthermore,theflexibility of rescheduling is enhanced through secondary analysis-driven solutions derived from the outcomes of humancomputer interactions in the previous step.This proposed interaction method complements existing literature on rescheduling methods involving human-computer interactions.It serves as a tool to aid dispatchers in identifying more feasible solutions in accordance with their empirical rescheduling strategies.展开更多
The uninterrupted operation of the quay crane(QC)ensures that the large container ship can depart port within laytime,which effectively reduces the handling cost for the container terminal and ship owners.The QC waiti...The uninterrupted operation of the quay crane(QC)ensures that the large container ship can depart port within laytime,which effectively reduces the handling cost for the container terminal and ship owners.The QC waiting caused by automated guided vehicles(AGVs)delay in the uncertain environment can be alleviated by dynamic scheduling optimization.A dynamic scheduling process is introduced in this paper to solve the AGV scheduling and path planning problems,in which the scheduling scheme determines the starting and ending nodes of paths,and the choice of paths between nodes affects the scheduling of subsequent AGVs.This work proposes a two-stage mixed integer optimization model to minimize the transportation cost of AGVs under the constraint of laytime.A dynamic optimization algorithm,including the improved rule-based heuristic algorithm and the integration of the Dijkstra algorithm and the Q-Learning algorithm,is designed to solve the optimal AGV scheduling and path schemes.A new conflict avoidance strategy based on graph theory is also proposed to reduce the probability of path conflicts between AGVs.Numerical experiments are conducted to demonstrate the effectiveness of the proposed model and algorithm over existing methods.展开更多
Taking the distribution route optimization of refined oil as background, this paper studies the inventory routing problem of refined oil distribution based on working time equilibrium. In consideration of the constrai...Taking the distribution route optimization of refined oil as background, this paper studies the inventory routing problem of refined oil distribution based on working time equilibrium. In consideration of the constraints of vehicle capacity, time window for unloading oil, service time and demand of each gas station, we take the working time equilibrium of each vehicle as goal and establish an integer programming model for the vehicle routing problem of refined oil distribution, the objective function of the model is to minimize the maximum working time of vehicles. To solve this model, a Lingo program was written and a heuristic algorithm was designed. We further use the random generation method to produce an example with 10 gas stations. The local optimal solution and approximate optimal solution are obtained by using Lingo software and heuristic algorithm respectively. By comparing the approximate optimal solution obtained by heuristic algorithm with the local optimal solution obtained by Lingo software, the feasibility of the model and the effectiveness of the heuristic algorithm are verified. The results of this paper provide a theoretical basis for the scheduling department to formulate the oil distribution plan.展开更多
With the rapid increase of the size of applications and the complexity of the supercomputer architecture,topology-aware process mapping becomes increasingly important.High communication cost has become a dominant cons...With the rapid increase of the size of applications and the complexity of the supercomputer architecture,topology-aware process mapping becomes increasingly important.High communication cost has become a dominant constraint of the performance of applications running on the supercomputer.To avoid a bad mapping strategy which can lead to terrible communication performance,we propose an optimized heuristic topology-aware mapping algorithm(OHTMA).The algorithm attempts to minimize the hop-byte metric that we use to measure the mapping results.OHTMA incorporates a new greedy heuristic method and pair-exchange-based optimization.It reduces the number of long-distance communications and effectively enhances the locality of the communication.Experimental results on the Tianhe-3 exascale supercomputer prototype indicate that OHTMA can significantly reduce the communication costs.展开更多
The growing awareness of climate change worldwide has led the urban tourism market to focus on balancing tourist tailored experiences and CO_(2) emissions.Therefore,designing personalized tourist routes with environ‐...The growing awareness of climate change worldwide has led the urban tourism market to focus on balancing tourist tailored experiences and CO_(2) emissions.Therefore,designing personalized tourist routes with environ‐mental pollution consideration is preferable in this context.This study proposes an evolution algorithm based on reinforcement learning(FSRL-HA)to design a personalized day tour route that simultaneously considers the utility of tourists and the carbon emission.We conducted a case study in Chengdu,Sichuan,China,to evaluate this algorithm's performance.The results indicate that the proposed algorithm outperforms selected baseline methods.Furthermore,the approach can provide more diverse route choices for different tourists,and an experiment was conducted to explore how tourist preferences affect tourist utilities.展开更多
In order processing in the industrial Internet platform for textile and clothing,assigning optimal order quantities to each factory is the focus and the existing difficulty.The order allocation is a typical NP⁃hard pr...In order processing in the industrial Internet platform for textile and clothing,assigning optimal order quantities to each factory is the focus and the existing difficulty.The order allocation is a typical NP⁃hard problem in combinatorial optimization,and typical research of this kind is still at the initial stage.This paper aims to improve the optimization approach to select factories and to allocate proper orders to each one.It designs a genetic algorithm by making a deviation constraint rule for the initial population and introducing a penalty function to improve convergence.Remarkably,the objective functions of total cost along with the related constraints undergo optimization in the model.The experimental results indicate that the proposed algorithm can effectively solve the model and provide an optimal order allocation for multi⁃factories with less cost and computational duration.展开更多
基金supported by the National Key Research and Development Program of China (Grant Nos. 2017YFA0403301, 2017YFB0503301, and2018YFB0504302)the National Natural Science Foundation of China (Grant Nos. 11991073, 61975229, and Y8JC011L51)+2 种基金the Key Program of CAS (Grant No. XDB17030500)the Civil Space Project (Grant No. D040301)the Science Challenge Project (Grant No. TZ2018005)。
文摘We report an overlapping sampling scheme to accelerate computational ghost imaging for imaging moving targets,based on reordering a set of Hadamard modulation matrices by means of a heuristic algorithm. The new condensed overlapped matrices are then designed to shorten and optimize encoding of the overlapped patterns, which are shown to be much superior to the random matrices. In addition, we apply deep learning to image the target, and use the signal acquired by the bucket detector and corresponding real image to train the neural network. Detailed comparisons show that our new method can improve the imaging speed by as much as an order of magnitude, and improve the image quality as well.
基金The authors gratefully acknowledge the financial support from the National Key Research and Development Program of China(Grant No.2018AAA0101602).
文摘This paper focuses on the integrated problem of long-term planning and short-term scheduling in a largescale refinery-petrochemical complex,and considers the overall manufacturing process from the upstream refinery to the downstream petrochemical site.Different time scales are incorporated from the planning and scheduling subproblems.At the end of each discrete time period,additional constraints are imposed to ensure material balance between different time scales.Discrete time representation is applied to the planning subproblem,while continuous time is applied to the scheduling of ethylene cracking and polymerization processes in the petrochemical site.An enterprise-wide mathematical model is formulated through mixed integer nonlinear programming.To solve the problem efficiently,a heuristic algorithm combined with a convolutional neural network(CNN),is proposed.Binary variables are used as the CNN input,leading to the integration of a data-driven approach and classical optimization by which a heuristic algorithm is established.The results do not only illustrate the detailed operations in a refinery and petrochemical complex under planning and scheduling,but also confirm the high efficiency of the proposed algorithm for solving large-scale problems.
基金Project supported in part by the Fundamental Research Funds for the Central Universities (Grant No.2021JBZ107)the National Natural Science Foundation of China (Grant Nos.72288101 and 71931002)。
文摘This paper investigates traffic flow of connected and automated vehicles at lane drop on two-lane highway. We evaluate and compare performance of an optimization-based control algorithm(OCA) with that of a heuristic rules-based algorithm(HRA). In the OCA, the average speed of each vehicle is maximized. In the HRA, virtual vehicle and restriction of the command acceleration caused by the virtual vehicle are introduced. It is found that(i) capacity under the HRA(denoted as C_(H)) is smaller than capacity under the OCA;(ii) the travel delay is always smaller under the OCA, but driving is always much more comfortable under the HRA;(iii) when the inflow rate is smaller than C_(H), the HRA outperforms the OCA with respect to the fuel consumption and the monetary cost;(iv) when the inflow rate is larger than C_(H), the HRA initially performs better with respect to the fuel consumption and the monetary cost, but the OCA would become better after certain time. The spatiotemporal pattern and speed profile of traffic flow are presented, which explains the reason underlying the different performance. The study is expected to help for better understanding of the two different types of algorithm.
文摘Aiming at minimizing spare capacity for optical WDM networks, we propose a new heuristic algorithm for preconfigured protection cycle (p-cycle) design. Numerical results show that the spare capacity obtained by our new algorithm is very close to the optimal solution.
文摘Industry 4.0 is a concept that assists companies in developing a modern supply chain(MSC)system when they are faced with a dynamic process.Because Industry 4.0 focuses on mobility and real-time integration,it is a good framework for a dynamic vehicle routing problem(DVRP).This research works on DVRP.The aim of this research is to minimize transportation cost without exceeding the capacity constraint of each vehicle while serving customer demands from a common depot.Meanwhile,new orders arrive at a specific time into the system while the vehicles are executing the delivery of existing orders.This paper presents a two-stage hybrid algorithm for solving the DVRP.In the first stage,construction algorithms are applied to develop the initial route.In the second stage,improvement algorithms are applied.Experimental results were designed for different sizes of problems.Analysis results show the effectiveness of the proposed algorithm.
基金supported by Shanghai Pujiang Pro-gram(2019PJC062)the Natural Science Foundation of Shandong Province(ZR2021MG003)+2 种基金the Research Project on Undergraduate Teaching Reform of Higher Education in Shandong Province(No.Z2021046)the National Natural Science Foundation of China(51508319)the Nature and Science Fund from Zhejiang Province Ministry of Education(Y201327642).
文摘In optimization theory,the adaptive control of the optimization process is an important goal that people pursue.To solve this problem,this study introduces the idea of neutrosophic decision-making into classical heuristic algorithm,and proposes a novel neutrosophic adaptive clustering optimization thought,which is applied in a novel neutrosophic genetic algorithm(NGA),for example.The main feature of NGA is that the NGA treats the crossover effect as a neutrosophic fuzzy set,the variation ratio as a structural parameter,the crossover effect as a benefit parameter and the variation effect as a cost parameter,and then a neutrosophic fitness function value is created.Finally,a high order assignment problem in warehousemanagement is taken to illustrate the effectiveness of NGA.
文摘Under the background of the rapid development of the air transport industry, the abnormal phenomenon of flights has become increasingly serious due to various factors such as the gradual reduction of resources, adverse climatic conditions, problems in air traffic control and mechanical failures. In order to reduce losses, it has become a major problem for airlines to use optimization algorithm to study the recovery of abnormal flights. By upgrading the passenger recovery engine, the purpose of this paper is to provide the optimal recovery scheme for passengers, so as to reduce the risk of transferring overseas flights, and thus reduce the economic loss of airlines. In this paper, the optimization model and algorithm based on network flow, combined with actual business requirements, comprehensively consider multiple optimization objectives to quickly generate passenger recovery solutions, and at the same time achieve the optimal income of airlines and the acceptance rate of passenger recovery, so as to balance the two. The practicability and effectiveness of the proposed model and algorithm are proved by some concrete examples.
基金National Natural Science Foundations of China(Nos.71201171,71501179)
文摘The execution process of satellite-ground clock synchronization and ephemeris uploading in the system is analyzed,as well as their characterized operation and their relationship.Based on the analysis of the scheduling goal and constraint character,a heuristics rule-based multi-stage link scheduling algorithm was put forward.The algorithm distinguishes the on-off-frontier satellites from the others and schedules them by turns.The paper presented the main flow as well as the detailed design of the rule.Finally based on the current COMPASS global system,some typical resources and constraints are selected to generate an instance.Then the comparison analysis between the heuristics scheduling algorithm and three other traditional scheduling strategies are carried out.The result shows the validity and reasonability of the multi-stage strategy.
文摘Cloud computing is currently dominated within the space of highperformance distributed computing and it provides resource polling and ondemand services through the web.So,task scheduling problem becomes a very important analysis space within the field of a cloud computing environment as a result of user’s services demand modification dynamically.The main purpose of task scheduling is to assign tasks to available processors to produce minimum schedule length without violating precedence restrictions.In heterogeneous multiprocessor systems,task assignments and schedules have a significant impact on system operation.Within the heuristic-based task scheduling algorithm,the different processes will lead to a different task execution time(makespan)on a heterogeneous computing system.Thus,a good scheduling algorithm should be able to set precedence efficiently for every subtask depending on the resources required to reduce(makespan).In this paper,we propose a new efficient task scheduling algorithm in cloud computing systems based on RAO algorithm to solve an important task and schedule a heterogeneous multiple processing problem.The basic idea of this process is to exploit the advantages of heuristic-based algorithms to reduce space search and time to get the best solution.We evaluate our algorithm’s performance by applying it to three examples with a different number of tasks and processors.The experimental results show that the proposed approach significantly succeeded in finding the optimal solutions than others in terms of the time of task implementation.
基金supported by UK-Jiangsu 20-20 World Class University Initiative programme.
文摘Cloud data centers have become overwhelmed with data-intensive applications due to the limited computational capabilities of mobile terminals.Mobile edge computing is emerging as a potential paradigm to host application execution at the edge of networks to reduce transmission delays.Compute nodes are usually distributed in edge environments,enabling crucially efficient task scheduling among those nodes to achieve reduced processing time.Moreover,it is imperative to conserve edge server energy,enhancing their lifetimes.To this end,this paper proposes a novel task scheduling algorithm named Energy-aware Double-fitness Particle Swarm Optimization(EA-DFPSO)that is based on an improved particle swarm optimization algorithm for achieving energy efficiency in an edge computing environment along with minimal task execution time.The proposed EA-DFPSO algorithm applies a dual fitness function to search for an optimal tasks-scheduling scheme for saving edge server energy while maintaining service quality for tasks.Extensive experimentation demonstrates that our proposed EA-DFPSO algorithm outperforms the existing traditional scheduling algorithms to achieve reduced task completion time and conserve energy in an edge computing environment.
基金The authors would like to extend their gratitude to King Saud University(Riyadh,Saudi Arabia)for funding this research through Researchers Supporting Project number(RSP-2021/260)And this work was supported by the Natural Science Foundation of Hunan Province,China(Grant No.2020JJ4949)the Postgraduate Scientific Research Innovation Project of Hunan Province(Grant No.CX20200883).
文摘Recently, the development of Industrial Internet of Things hastaken the advantage of 5G network to be more powerful and more intelligent.However, the upgrading of 5G network will cause a variety of issues increase,one of them is the increased cost of coverage. In this paper, we proposea sustainable wireless sensor networks system, which avoids the problemsbrought by 5G network system to some extent. In this system, deployingrelays and selecting routing are for the sake of communication and charging.The main aim is to minimize the total energy-cost of communication underthe precondition, where each terminal with low-power should be charged byat least one relay. Furthermore, from the perspective of graph theory, weextract a combinatorial optimization problem from this system. After that,as to four different cases, there are corresponding different versions of theproblem. We give the proofs of computational complexity for these problems,and two heuristic algorithms for one of them are proposed. Finally, theextensive experiments compare and demonstrate the performances of thesetwo algorithms.
文摘In most of the scientific research feature selection is a challenge for researcher.Selecting all available features is not an option as it usually complicates the research and leads to performance drop when dealing with large datasets.On the other hand,ignoring some features can compromise the data accuracy.Here the rough set theory presents a good technique to identify the redundant features which can be dismissed without losing any valuable information,however,exploring all possible combinations of features will end with NP-hard problem.In this research we propose adopting a heuristic algorithm to solve this problem,Polar Bear Optimization PBO is a metaheuristic algorithm provides an effective technique for solving such kind of optimization problems.Among other heuristic algorithms it proposes a dynamic mechanism for birth and death which allows keep investing in promising solutions and keep dismissing hopeless ones.To evaluate its efficiency,we applied our proposed model on several datasets and measured the quality of the obtained minimal feature set to prove that redundant data was removed without data loss.
文摘Solving the controller placement problem (CPP) in an SDN architecture with multiple controllers has a significant impact on control overhead in the network, especially in multihop wireless networks (MWNs). The generated control overhead consists of controller-device and inter-controller communications to discover the network topology, exchange configurations, and set up and modify flow tables in the control plane. However, due to the high complexity of the proposed optimization model to the CPP, heuristic algorithms have been reported to find near-optimal solutions faster for large-scale wired networks. In this paper, the objective is to extend those existing heuristic algorithms to solve a proposed optimization model to the CPP in software-<span>defined multihop wireless networking</span><span> (SDMWN).</span>Our results demonstrate that using ranking degrees assigned to the possible controller placements, including the average distance to other devices as a degree or the connectivity degree of each placement, the extended heuristic algorithms are able to achieve the optimal solution in small-scale networks in terms of the generated control overhead and the number of controllers selected in the network. As a result, using extended heuristic algorithms, the average number of hops among devices and their assigned controllers as well as among controllers will be reduced. Moreover, these algorithms are able tolower<span "=""> </span>the control overhead in large-scale networks and select fewer controllers compared to an extended algorithm that solves the CPP in SDMWN based on a randomly selected controller placement approach.
基金supported by the National Natural Science Foundation of China(11802333)the Scientific Research Program of the National University of Defense Technology(ZK19-31)。
文摘With increased dependence on space assets,scheduling and tasking of the space surveillance network(SSN)are vitally important.The multi-sensor collaborative observation scheduling(MCOS)problem is a multi-constraint and high-conflict complex combinatorial optimization problem that is nondeterministic polynomial(NP)-hard.This research establishes a sub-time window constraint satisfaction problem(STWCSP)model with the objective of maximizing observation profit.Considering the significant effect of genetic algorithms(GA)on solving the problem of resource allocation,an evolution heuristic(EH)algorithm containing three strategies that focus on the MCOS problem is proposed.For each case,a task scheduling sequence is first obtained via an improved GA with penalty(GAPE)algorithm,and then a mission planning algorithm(heuristic rule)is used to determine the specific observation time.Compared to the model without sub-time windows and some other algorithms,a series of experiments illustrate the STWCSP model has better performance in terms of total profit.Experiments about strategy and parameter sensitivity validate its excellent performance in terms of EH algorithms.
基金supported by the China Fundamental Research Funds for the Central Universities(2022JBQY006)。
文摘Real-time train rescheduling plays a vital role in railway transportation as it is crucial for maintaining punctuality and reliability in rail operations.In this paper,we propose a rescheduling model that incorporates constraints and objectives generated through human-computer interaction.This approach ensures that the model is aligned with practical requirements and daily operational tasks while facilitating iterative train rescheduling.The dispatcher’s empirical knowledge is integrated into the train rescheduling process using a human-computer interaction framework.We introduce six interfaces to dynamically construct constraints and objectives that capture human intentions.By summarizing rescheduling rules,we devise a rule-based conflict detection-resolution heuristic algorithm to effectively solve the formulated model.A series of numerical experiments are presented,demonstrating strong performance across the entire system.Furthermore,theflexibility of rescheduling is enhanced through secondary analysis-driven solutions derived from the outcomes of humancomputer interactions in the previous step.This proposed interaction method complements existing literature on rescheduling methods involving human-computer interactions.It serves as a tool to aid dispatchers in identifying more feasible solutions in accordance with their empirical rescheduling strategies.
基金supported in part by the National Natural Science Foundation of China(61473053)the Science and Technology Innovation Foundation of Dalian,China(2020JJ26GX033)。
文摘The uninterrupted operation of the quay crane(QC)ensures that the large container ship can depart port within laytime,which effectively reduces the handling cost for the container terminal and ship owners.The QC waiting caused by automated guided vehicles(AGVs)delay in the uncertain environment can be alleviated by dynamic scheduling optimization.A dynamic scheduling process is introduced in this paper to solve the AGV scheduling and path planning problems,in which the scheduling scheme determines the starting and ending nodes of paths,and the choice of paths between nodes affects the scheduling of subsequent AGVs.This work proposes a two-stage mixed integer optimization model to minimize the transportation cost of AGVs under the constraint of laytime.A dynamic optimization algorithm,including the improved rule-based heuristic algorithm and the integration of the Dijkstra algorithm and the Q-Learning algorithm,is designed to solve the optimal AGV scheduling and path schemes.A new conflict avoidance strategy based on graph theory is also proposed to reduce the probability of path conflicts between AGVs.Numerical experiments are conducted to demonstrate the effectiveness of the proposed model and algorithm over existing methods.
文摘Taking the distribution route optimization of refined oil as background, this paper studies the inventory routing problem of refined oil distribution based on working time equilibrium. In consideration of the constraints of vehicle capacity, time window for unloading oil, service time and demand of each gas station, we take the working time equilibrium of each vehicle as goal and establish an integer programming model for the vehicle routing problem of refined oil distribution, the objective function of the model is to minimize the maximum working time of vehicles. To solve this model, a Lingo program was written and a heuristic algorithm was designed. We further use the random generation method to produce an example with 10 gas stations. The local optimal solution and approximate optimal solution are obtained by using Lingo software and heuristic algorithm respectively. By comparing the approximate optimal solution obtained by heuristic algorithm with the local optimal solution obtained by Lingo software, the feasibility of the model and the effectiveness of the heuristic algorithm are verified. The results of this paper provide a theoretical basis for the scheduling department to formulate the oil distribution plan.
基金Project supported by the National Key Research and Development Program of China(No.2017YFB0202104)。
文摘With the rapid increase of the size of applications and the complexity of the supercomputer architecture,topology-aware process mapping becomes increasingly important.High communication cost has become a dominant constraint of the performance of applications running on the supercomputer.To avoid a bad mapping strategy which can lead to terrible communication performance,we propose an optimized heuristic topology-aware mapping algorithm(OHTMA).The algorithm attempts to minimize the hop-byte metric that we use to measure the mapping results.OHTMA incorporates a new greedy heuristic method and pair-exchange-based optimization.It reduces the number of long-distance communications and effectively enhances the locality of the communication.Experimental results on the Tianhe-3 exascale supercomputer prototype indicate that OHTMA can significantly reduce the communication costs.
基金We acknowledge the financial support from the National Natural Science Foundation of China[Grant number:71701167]the Humani‐ties and Social Science Foundation of Chinese Ministry of Education[Grant number:17YJC630078].
文摘The growing awareness of climate change worldwide has led the urban tourism market to focus on balancing tourist tailored experiences and CO_(2) emissions.Therefore,designing personalized tourist routes with environ‐mental pollution consideration is preferable in this context.This study proposes an evolution algorithm based on reinforcement learning(FSRL-HA)to design a personalized day tour route that simultaneously considers the utility of tourists and the carbon emission.We conducted a case study in Chengdu,Sichuan,China,to evaluate this algorithm's performance.The results indicate that the proposed algorithm outperforms selected baseline methods.Furthermore,the approach can provide more diverse route choices for different tourists,and an experiment was conducted to explore how tourist preferences affect tourist utilities.
基金Shanghai Foundation for Development of Industrial Internet Innovation,China(No.2019⁃GYHLW⁃004)。
文摘In order processing in the industrial Internet platform for textile and clothing,assigning optimal order quantities to each factory is the focus and the existing difficulty.The order allocation is a typical NP⁃hard problem in combinatorial optimization,and typical research of this kind is still at the initial stage.This paper aims to improve the optimization approach to select factories and to allocate proper orders to each one.It designs a genetic algorithm by making a deviation constraint rule for the initial population and introducing a penalty function to improve convergence.Remarkably,the objective functions of total cost along with the related constraints undergo optimization in the model.The experimental results indicate that the proposed algorithm can effectively solve the model and provide an optimal order allocation for multi⁃factories with less cost and computational duration.