The conversion of the cartesian coordinates of a point to its geodetic equivalent coordinates in reference to the geodetic ellipsoid is one of the main challenges in geodesy.The ellipse equation in the meridian plane ...The conversion of the cartesian coordinates of a point to its geodetic equivalent coordinates in reference to the geodetic ellipsoid is one of the main challenges in geodesy.The ellipse equation in the meridian plane significantly influences the value of the geodetic coordinates.This research analyzes this influence and how it can contribute to their solutions.The study investigates the mathematical relation between them and presents an exact formula relating to the geodetic height and the ellipse equation.In addition,a heuristic formula for the relation between the geodetic height and the ellipse equation is proposed,which is independent of the geodetic latitude and has a relative accuracy better than 99.9 %.The calculation is stable,and the cost is low.展开更多
Improving the cooperative scheduling efficiency of equipment is the key for automated container terminals to copewith the development trend of large-scale ships. In order to improve the solution efficiency of the exis...Improving the cooperative scheduling efficiency of equipment is the key for automated container terminals to copewith the development trend of large-scale ships. In order to improve the solution efficiency of the existing spacetimenetwork (STN) model for the cooperative scheduling problem of yard cranes (YCs) and automated guidedvehicles (AGVs) and extend its application scenarios, two improved STN models are proposed. The flow balanceconstraints in the original model are decomposed, and the trajectory constraints of YCs and AGVs are added toacquire the model STN_A. The coupling constraint in STN_A is updated, and buffer constraints are added toSTN_A so that themodel STN_B is built.As the size of the problem increases, the solution speed of CPLEX becomesthe bottleneck. So a heuristic method containing three groups of heuristic rules is designed to obtain a near-optimalsolution quickly. Experimental results showthat the computation time of STN_A is shortened by 49.47% on averageand the gap is reduced by 1.69% on average compared with the original model. The gap between the solution ofthe heuristic rules and the solution of CPLEX is less than 3.50%, and the solution time of the heuristic rules is onaverage 99.85% less than the solution time of CPLEX. Compared with STN_A, the computation time for solvingSTN_B increases by 58.93% on average.展开更多
As the essence of traditional Chinese educational thought,heuristic teaching has gradually enriched and devel-oped its ideas through the continuous efforts of educational researchers of the past dynasties.In front-lin...As the essence of traditional Chinese educational thought,heuristic teaching has gradually enriched and devel-oped its ideas through the continuous efforts of educational researchers of the past dynasties.In front-line teach-ing,heuristic teaching,as a teaching principle that can help teachers and students to interact and learn,undoubtedly plays an important role in students’acquisition of knowledge and scientific thinking activities.But teachers’understanding of heuristic teaching is not the same.In actual teaching,there are obvious gaps in language ability among different teachers.This research aims to enrich the heuristic teaching theory based on the perspective of psychology,and provide a certain theoretical basis for teacher training.Through the research and analysis of the generation path of the heuristic teaching language,this paper helps more teachers realize the advantages of the heuristic teaching language,improve their own heuristic teaching language level,and provide reference for the scientific teaching evaluation standard.We apply the heuristic instruction language approach proposed in this study and apply it to real classrooms.In the application,it can be clearly found that the students’thinking and participation have been strengthened,and the teaching effect has been significantly improved com-pared with the past,which indicates that the heuristic teaching language generation path in this study has certain practical application value.展开更多
The exponential use of artificial intelligence(AI)to solve and automated complex tasks has catapulted its popularity generating some challenges that need to be addressed.While AI is a powerfulmeans to discover interes...The exponential use of artificial intelligence(AI)to solve and automated complex tasks has catapulted its popularity generating some challenges that need to be addressed.While AI is a powerfulmeans to discover interesting patterns and obtain predictive models,the use of these algorithms comes with a great responsibility,as an incomplete or unbalanced set of training data or an unproper interpretation of the models’outcomes could result in misleading conclusions that ultimately could become very dangerous.For these reasons,it is important to rely on expert knowledge when applying these methods.However,not every user can count on this specific expertise;non-AIexpert users could also benefit from applying these powerful algorithms to their domain problems,but they need basic guidelines to obtain themost out of AI models.The goal of this work is to present a systematic review of the literature to analyze studies whose outcomes are explainable rules and heuristics to select suitable AI algorithms given a set of input features.The systematic review follows the methodology proposed by Kitchenham and other authors in the field of software engineering.As a result,9 papers that tackle AI algorithmrecommendation through tangible and traceable rules and heuristics were collected.The reduced number of retrieved papers suggests a lack of reporting explicit rules and heuristics when testing the suitability and performance of AI algorithms.展开更多
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.展开更多
One of the drastically growing and emerging research areas used in most information technology industries is Bigdata analytics.Bigdata is created from social websites like Facebook,WhatsApp,Twitter,etc.Opinions about ...One of the drastically growing and emerging research areas used in most information technology industries is Bigdata analytics.Bigdata is created from social websites like Facebook,WhatsApp,Twitter,etc.Opinions about products,persons,initiatives,political issues,research achievements,and entertainment are discussed on social websites.The unique data analytics method cannot be applied to various social websites since the data formats are different.Several approaches,techniques,and tools have been used for big data analytics,opinion mining,or sentiment analysis,but the accuracy is yet to be improved.The proposed work is motivated to do sentiment analysis on Twitter data for cloth products using Simulated Annealing incorporated with the Multiclass Support Vector Machine(SA-MSVM)approach.SA-MSVM is a hybrid heuristic approach for selecting and classifying text-based sentimental words following the Natural Language Processing(NLP)process applied on tweets extracted from the Twitter dataset.A simulated annealing algorithm searches for relevant features and selects and identifies sentimental terms that customers criticize.SA-MSVM is implemented,experimented with MATLAB,and the results are verified.The results concluded that SA-MSVM has more potential in sentiment analysis and classification than the existing Support Vector Machine(SVM)approach.SA-MSVM has obtained 96.34%accuracy in classifying the product review compared with the existing systems.展开更多
There is an old saying,“Give a man a fish,and he will eat for a day.Teach a man to fish,and he will eat for the rest of his life.”In clinical teaching,students should not only be taught about diseases,but their inte...There is an old saying,“Give a man a fish,and he will eat for a day.Teach a man to fish,and he will eat for the rest of his life.”In clinical teaching,students should not only be taught about diseases,but their intelligence should also be cultivated,along with their analytical,comprehension,and independent learning skills.The ability to solve problems enables students to think independently and acquire knowledge.This is known as the heuristic method of teaching.In this study,we mainly analyze the application value of the heuristic method in the clinical teaching of internal medicine.展开更多
Combining the heuristic algorithm （HA） developed based on the specific knowledge of the cooperative multiple target attack （CMTA） tactics and the particle swarm optimization （PSO）, a heuristic particle swarm opt...Combining the heuristic algorithm （HA） developed based on the specific knowledge of the cooperative multiple target attack （CMTA） tactics and the particle swarm optimization （PSO）, a heuristic particle swarm optimization （HPSO） algorithm is proposed to solve the decision-making （DM） problem. HA facilitates to search the local optimum in the neighborhood of a solution, while the PSO algorithm tends to explore the search space for possible solutions. Combining the advantages of HA and PSO, HPSO algorithms can find out the global optimum quickly and efficiently. It obtains the DM solution by seeking for the optimal assignment of missiles of friendly fighter aircrafts （FAs） to hostile FAs. Simulation results show that the proposed algorithm is superior to the general PSO algorithm and two GA based algorithms in searching for the best solution to the DM problem.展开更多
Traditional models for project management have not adequately incorporated a number of factors that are important for resource allocation. This paper proposed a unified timed Petri net model in which scheduling and pl...Traditional models for project management have not adequately incorporated a number of factors that are important for resource allocation. This paper proposed a unified timed Petri net model in which scheduling and planning were collectively carried out to take full advantages of the flexibility of the FMS. Through the lens of system theory, two types of resources were distinguished: major role and auxiliary role, and the major role was used to construct the FMS' Petri net. The method simplified the Petri net's construction and gave a clear flow chart for scheduling. Hence, the auxiliary resource allocation could be easily carried out according to the schedule, which was proposed by heuristic search algorithm. At last, the efficacy of the Petri net model for online scheduling in a resource constrained environment was discussed.展开更多
Lot scheduling problem with idle time transfer between processes to minimize mean flow time is very important because to minimize mean flow time is to minimize work in process. But the problem is NP hard and no polyn...Lot scheduling problem with idle time transfer between processes to minimize mean flow time is very important because to minimize mean flow time is to minimize work in process. But the problem is NP hard and no polynomial algorithm exists to guarantee optimal solution. Based the analysis the mathematical structure of the problem, the paper presents a new heuristic algorithm. Computer simulation shows that the proposed heuristic algorithm performs well in terms of both quality of solution and execution speed.展开更多
In this paper,the berth scheduling problem is transformed into a special two-dimensional packing problem with some constraints.A nonlinear programming model for the problem is established,and a heuristic algorithm is ...In this paper,the berth scheduling problem is transformed into a special two-dimensional packing problem with some constraints.A nonlinear programming model for the problem is established,and a heuristic algorithm is proposed to solve the model.Simulation results show that the algorithm can improve the utilization of berths on discrete berth scheduling in the container port.展开更多
Confucianism （especially its teaching theory） is the core of Chinese traditional culture with Confucius as its representative. It has played an indispensable role in the development of Chinese culture. It is the spi...Confucianism （especially its teaching theory） is the core of Chinese traditional culture with Confucius as its representative. It has played an indispensable role in the development of Chinese culture. It is the spiritual pillar of Chinese sustainable development. There are no others that can compare with its teaching method and art. The famous ＂heuristic teaching theory＂ is one of its greatest inventions. But many people think that it is Socrates invention. In fact, Socrates ＂elicitation teaching theory＂ was invented far later than that of Confucius. This paper aims at investigating of these two theories.展开更多
The petrol truck routing problem is an important part of the petrol supply chain.This study focuses on determining routes for distributing petrol products from a depot to petrol stations with the objective of minimizi...The petrol truck routing problem is an important part of the petrol supply chain.This study focuses on determining routes for distributing petrol products from a depot to petrol stations with the objective of minimizing the total travel cost and the fixed cost required to use the trucks.We propose a mathematical model that considers petrol trucks returning to a depot multiple times and develop a heuristic algorithm based on a local branch-and-bound search with a tabu list and the Metropolis acceptance criterion.In addition,an approach that accelerates the solution process by adding several valid inequalities is presented.In this study,the trucks are homogeneous and have two compartments,and each truck can execute at most three tasks daily.The sales company arranges the transfer amount and the time windows for each station.The performance of the proposed algorithm is evaluated by comparing its results with the optimal results.In addition,a real-world case of routing petrol trucks in Beijing is studied to demonstrate the effectiveness of the proposed approach.展开更多
To satisfy the increasing demands of high-speed transmission, high-efficiency computing, and real-time communications in the high-dynamic and heterogeneous networks, the Contact Plan Design(CPD) has attracted continuo...To satisfy the increasing demands of high-speed transmission, high-efficiency computing, and real-time communications in the high-dynamic and heterogeneous networks, the Contact Plan Design(CPD) has attracted continuous attention in recent years, especially for the spatial-node-based Internet of Everything(IoE). In this paper, we study the NP-hardness of contact scheduling and the attenuation of atmospheric precipitation in the spatial-node-based IoE. Two heuristic computing methods for contact plan design are proposed by comprehensively considering the time-varying topology, the intermittent connectivity, and the adaptive transmission in different weather conditions, which are named Contact Plan Design-Particle Swarm Optimization(CPD-PSO) and Contact Plan Design-Greedy algorithm with the Minimum Delivery Time(CPD-GMDT) separately. For the population-based algorithm, CPD-PSO not only solves the CPD problem with a limited-resource condition, but also dynamically adjusts the search scope to ensure the continuous searching capability of the algorithm. For the CPD-GMDT that makes CP decisions based on the current state, the algorithm uses the idea of greedy algorithm to schedule Satellite-Platform Links(SPLs) and Inter Satellite Links(ISLs) respectively using the strategies of optimal matching and load balancing. The simulation results show that the proposed CPD-PSO outperforms Contact Plan Design-Genetic Algorithm(CPD-GA) in terms of fitness and delivery time, and CPD-GMDT presents better overall delay than Fair Contact Plan(FCP).展开更多
Resource-constrained project scheduling problem（RCPSP） is an important problem in research on project management. But there has been little attention paid to the objective of minimizing activities＇ cost with the re...Resource-constrained project scheduling problem（RCPSP） is an important problem in research on project management. But there has been little attention paid to the objective of minimizing activities＇ cost with the resource constraints that is a critical sub-problem in partner selection of construction supply chain management because the capacities of the renewable resources supplied by the partners will effect on the project scheduling. Its mathematic model is presented firstly, and analysis on the characteristic of the problem shows that the objective function is non-regular and the problem is NP-complete following which the basic idea for solution is clarified. Based on a definition of preposing activity cost matrix, a heuristic algorithm is brought forward. Analyses on the complexity of the heuristics and the result of numerical studies show that the heuristic algorithm is feasible and relatively effective.展开更多
We study the fabric spreading and cutting problem in apparel factories.For the sake of saving the material costs,the cutting requirement should be met exactly without producing additional garment components.For reduci...We study the fabric spreading and cutting problem in apparel factories.For the sake of saving the material costs,the cutting requirement should be met exactly without producing additional garment components.For reducing the production costs,the number of lays that corresponds to the frequency of using the cutting beds should be minimized.We propose an iterated greedy algorithm for solving the fabric spreading and cutting problem.This algorithm contains a constructive procedure and an improving loop.Firstly the constructive procedure creates a set of lays in sequence,and then the improving loop tries to pick each lay from the lay set and rearrange the remaining lays into a smaller lay set.The improving loop will run until it cannot obtain any smaller lay set or the time limit is due.The experiment results on 500 cases show that the proposed algorithm is effective and efficient.展开更多
This paper proposes and evaluates two improved Petri net （PN）-based hybrid search strategies and their applications to flexible manufacturing system （FMS） scheduling. The algorithms proposed in some previous paper...This paper proposes and evaluates two improved Petri net （PN）-based hybrid search strategies and their applications to flexible manufacturing system （FMS） scheduling. The algorithms proposed in some previous papers, which combine PN simulation capabilities with A＊ heuristic search within the PN reachability graph,may not find an optimum solution even with an admissible heuristic function. To remedy the defects an improved heuristic search strategy is proposed, which adopts a different method for selecting the promising markings and reserves the admissibility of the algorithm. To speed up the search process, another algorithm is also proposed which invokes faster termination conditions and still guarantees that the solution found is optimum. The scheduling results are compared through a simple FMS between our algorithms and the previous methods. They are also applied and evaluated in a set of randomly-generated FMSs with such characteristics as multiple resources and alternative routes.展开更多
文摘The conversion of the cartesian coordinates of a point to its geodetic equivalent coordinates in reference to the geodetic ellipsoid is one of the main challenges in geodesy.The ellipse equation in the meridian plane significantly influences the value of the geodetic coordinates.This research analyzes this influence and how it can contribute to their solutions.The study investigates the mathematical relation between them and presents an exact formula relating to the geodetic height and the ellipse equation.In addition,a heuristic formula for the relation between the geodetic height and the ellipse equation is proposed,which is independent of the geodetic latitude and has a relative accuracy better than 99.9 %.The calculation is stable,and the cost is low.
基金National Natural Science Foundation of China(62073212).
文摘Improving the cooperative scheduling efficiency of equipment is the key for automated container terminals to copewith the development trend of large-scale ships. In order to improve the solution efficiency of the existing spacetimenetwork (STN) model for the cooperative scheduling problem of yard cranes (YCs) and automated guidedvehicles (AGVs) and extend its application scenarios, two improved STN models are proposed. The flow balanceconstraints in the original model are decomposed, and the trajectory constraints of YCs and AGVs are added toacquire the model STN_A. The coupling constraint in STN_A is updated, and buffer constraints are added toSTN_A so that themodel STN_B is built.As the size of the problem increases, the solution speed of CPLEX becomesthe bottleneck. So a heuristic method containing three groups of heuristic rules is designed to obtain a near-optimalsolution quickly. Experimental results showthat the computation time of STN_A is shortened by 49.47% on averageand the gap is reduced by 1.69% on average compared with the original model. The gap between the solution ofthe heuristic rules and the solution of CPLEX is less than 3.50%, and the solution time of the heuristic rules is onaverage 99.85% less than the solution time of CPLEX. Compared with STN_A, the computation time for solvingSTN_B increases by 58.93% on average.
基金General Projects of the National Social Science Fund(Funding No.17BYY134).
文摘As the essence of traditional Chinese educational thought,heuristic teaching has gradually enriched and devel-oped its ideas through the continuous efforts of educational researchers of the past dynasties.In front-line teach-ing,heuristic teaching,as a teaching principle that can help teachers and students to interact and learn,undoubtedly plays an important role in students’acquisition of knowledge and scientific thinking activities.But teachers’understanding of heuristic teaching is not the same.In actual teaching,there are obvious gaps in language ability among different teachers.This research aims to enrich the heuristic teaching theory based on the perspective of psychology,and provide a certain theoretical basis for teacher training.Through the research and analysis of the generation path of the heuristic teaching language,this paper helps more teachers realize the advantages of the heuristic teaching language,improve their own heuristic teaching language level,and provide reference for the scientific teaching evaluation standard.We apply the heuristic instruction language approach proposed in this study and apply it to real classrooms.In the application,it can be clearly found that the students’thinking and participation have been strengthened,and the teaching effect has been significantly improved com-pared with the past,which indicates that the heuristic teaching language generation path in this study has certain practical application value.
基金funded by the Spanish Government Ministry of Economy and Competitiveness through the DEFINES Project Grant No. (TIN2016-80172-R)the Ministry of Science and Innovation through the AVisSA Project Grant No. (PID2020-118345RBI00)supported by the Spanish Ministry of Education and Vocational Training under an FPU Fellowship (FPU17/03276).
文摘The exponential use of artificial intelligence(AI)to solve and automated complex tasks has catapulted its popularity generating some challenges that need to be addressed.While AI is a powerfulmeans to discover interesting patterns and obtain predictive models,the use of these algorithms comes with a great responsibility,as an incomplete or unbalanced set of training data or an unproper interpretation of the models’outcomes could result in misleading conclusions that ultimately could become very dangerous.For these reasons,it is important to rely on expert knowledge when applying these methods.However,not every user can count on this specific expertise;non-AIexpert users could also benefit from applying these powerful algorithms to their domain problems,but they need basic guidelines to obtain themost out of AI models.The goal of this work is to present a systematic review of the literature to analyze studies whose outcomes are explainable rules and heuristics to select suitable AI algorithms given a set of input features.The systematic review follows the methodology proposed by Kitchenham and other authors in the field of software engineering.As a result,9 papers that tackle AI algorithmrecommendation through tangible and traceable rules and heuristics were collected.The reduced number of retrieved papers suggests a lack of reporting explicit rules and heuristics when testing the suitability and performance of AI algorithms.
基金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.
文摘One of the drastically growing and emerging research areas used in most information technology industries is Bigdata analytics.Bigdata is created from social websites like Facebook,WhatsApp,Twitter,etc.Opinions about products,persons,initiatives,political issues,research achievements,and entertainment are discussed on social websites.The unique data analytics method cannot be applied to various social websites since the data formats are different.Several approaches,techniques,and tools have been used for big data analytics,opinion mining,or sentiment analysis,but the accuracy is yet to be improved.The proposed work is motivated to do sentiment analysis on Twitter data for cloth products using Simulated Annealing incorporated with the Multiclass Support Vector Machine(SA-MSVM)approach.SA-MSVM is a hybrid heuristic approach for selecting and classifying text-based sentimental words following the Natural Language Processing(NLP)process applied on tweets extracted from the Twitter dataset.A simulated annealing algorithm searches for relevant features and selects and identifies sentimental terms that customers criticize.SA-MSVM is implemented,experimented with MATLAB,and the results are verified.The results concluded that SA-MSVM has more potential in sentiment analysis and classification than the existing Support Vector Machine(SVM)approach.SA-MSVM has obtained 96.34%accuracy in classifying the product review compared with the existing systems.
文摘There is an old saying,“Give a man a fish,and he will eat for a day.Teach a man to fish,and he will eat for the rest of his life.”In clinical teaching,students should not only be taught about diseases,but their intelligence should also be cultivated,along with their analytical,comprehension,and independent learning skills.The ability to solve problems enables students to think independently and acquire knowledge.This is known as the heuristic method of teaching.In this study,we mainly analyze the application value of the heuristic method in the clinical teaching of internal medicine.
文摘Combining the heuristic algorithm （HA） developed based on the specific knowledge of the cooperative multiple target attack （CMTA） tactics and the particle swarm optimization （PSO）, a heuristic particle swarm optimization （HPSO） algorithm is proposed to solve the decision-making （DM） problem. HA facilitates to search the local optimum in the neighborhood of a solution, while the PSO algorithm tends to explore the search space for possible solutions. Combining the advantages of HA and PSO, HPSO algorithms can find out the global optimum quickly and efficiently. It obtains the DM solution by seeking for the optimal assignment of missiles of friendly fighter aircrafts （FAs） to hostile FAs. Simulation results show that the proposed algorithm is superior to the general PSO algorithm and two GA based algorithms in searching for the best solution to the DM problem.
文摘Traditional models for project management have not adequately incorporated a number of factors that are important for resource allocation. This paper proposed a unified timed Petri net model in which scheduling and planning were collectively carried out to take full advantages of the flexibility of the FMS. Through the lens of system theory, two types of resources were distinguished: major role and auxiliary role, and the major role was used to construct the FMS' Petri net. The method simplified the Petri net's construction and gave a clear flow chart for scheduling. Hence, the auxiliary resource allocation could be easily carried out according to the schedule, which was proposed by heuristic search algorithm. At last, the efficacy of the Petri net model for online scheduling in a resource constrained environment was discussed.
文摘Lot scheduling problem with idle time transfer between processes to minimize mean flow time is very important because to minimize mean flow time is to minimize work in process. But the problem is NP hard and no polynomial algorithm exists to guarantee optimal solution. Based the analysis the mathematical structure of the problem, the paper presents a new heuristic algorithm. Computer simulation shows that the proposed heuristic algorithm performs well in terms of both quality of solution and execution speed.
文摘In this paper,the berth scheduling problem is transformed into a special two-dimensional packing problem with some constraints.A nonlinear programming model for the problem is established,and a heuristic algorithm is proposed to solve the model.Simulation results show that the algorithm can improve the utilization of berths on discrete berth scheduling in the container port.
文摘Confucianism （especially its teaching theory） is the core of Chinese traditional culture with Confucius as its representative. It has played an indispensable role in the development of Chinese culture. It is the spiritual pillar of Chinese sustainable development. There are no others that can compare with its teaching method and art. The famous ＂heuristic teaching theory＂ is one of its greatest inventions. But many people think that it is Socrates invention. In fact, Socrates ＂elicitation teaching theory＂ was invented far later than that of Confucius. This paper aims at investigating of these two theories.
基金the Program of “Study on Optimization and Supply-side Reliability of Oil Product Supply Chain Logistics System” funded under the National Natural Science Foundation of China, Grant Number 51874325
文摘The petrol truck routing problem is an important part of the petrol supply chain.This study focuses on determining routes for distributing petrol products from a depot to petrol stations with the objective of minimizing the total travel cost and the fixed cost required to use the trucks.We propose a mathematical model that considers petrol trucks returning to a depot multiple times and develop a heuristic algorithm based on a local branch-and-bound search with a tabu list and the Metropolis acceptance criterion.In addition,an approach that accelerates the solution process by adding several valid inequalities is presented.In this study,the trucks are homogeneous and have two compartments,and each truck can execute at most three tasks daily.The sales company arranges the transfer amount and the time windows for each station.The performance of the proposed algorithm is evaluated by comparing its results with the optimal results.In addition,a real-world case of routing petrol trucks in Beijing is studied to demonstrate the effectiveness of the proposed approach.
基金jointly supported by the National Natural Science Foundation in China (61601075, 61671092, 61771120, 61801105)the Fundamental Research Funds for the Central University (N171602002)the Natural Science Foundation Project of CQ CSTC (cstc2016jcyjA0174)
文摘To satisfy the increasing demands of high-speed transmission, high-efficiency computing, and real-time communications in the high-dynamic and heterogeneous networks, the Contact Plan Design(CPD) has attracted continuous attention in recent years, especially for the spatial-node-based Internet of Everything(IoE). In this paper, we study the NP-hardness of contact scheduling and the attenuation of atmospheric precipitation in the spatial-node-based IoE. Two heuristic computing methods for contact plan design are proposed by comprehensively considering the time-varying topology, the intermittent connectivity, and the adaptive transmission in different weather conditions, which are named Contact Plan Design-Particle Swarm Optimization(CPD-PSO) and Contact Plan Design-Greedy algorithm with the Minimum Delivery Time(CPD-GMDT) separately. For the population-based algorithm, CPD-PSO not only solves the CPD problem with a limited-resource condition, but also dynamically adjusts the search scope to ensure the continuous searching capability of the algorithm. For the CPD-GMDT that makes CP decisions based on the current state, the algorithm uses the idea of greedy algorithm to schedule Satellite-Platform Links(SPLs) and Inter Satellite Links(ISLs) respectively using the strategies of optimal matching and load balancing. The simulation results show that the proposed CPD-PSO outperforms Contact Plan Design-Genetic Algorithm(CPD-GA) in terms of fitness and delivery time, and CPD-GMDT presents better overall delay than Fair Contact Plan(FCP).
文摘Resource-constrained project scheduling problem（RCPSP） is an important problem in research on project management. But there has been little attention paid to the objective of minimizing activities＇ cost with the resource constraints that is a critical sub-problem in partner selection of construction supply chain management because the capacities of the renewable resources supplied by the partners will effect on the project scheduling. Its mathematic model is presented firstly, and analysis on the characteristic of the problem shows that the objective function is non-regular and the problem is NP-complete following which the basic idea for solution is clarified. Based on a definition of preposing activity cost matrix, a heuristic algorithm is brought forward. Analyses on the complexity of the heuristics and the result of numerical studies show that the heuristic algorithm is feasible and relatively effective.
基金supported in part by the National Key Research and Development Program of China(2018YFB1702701)the National Natural Science Foundation of China(61773381,61773382,61533019,61702519)+3 种基金Dongguan’s Innovation Talents Project(Gang Xiong)Guangdong’s Science and Technology Project(2017B090912001)Beijing Natural Science Foundation(4182065)Chinese Hunan’s Science and Technology Project(20181040)
文摘We study the fabric spreading and cutting problem in apparel factories.For the sake of saving the material costs,the cutting requirement should be met exactly without producing additional garment components.For reducing the production costs,the number of lays that corresponds to the frequency of using the cutting beds should be minimized.We propose an iterated greedy algorithm for solving the fabric spreading and cutting problem.This algorithm contains a constructive procedure and an improving loop.Firstly the constructive procedure creates a set of lays in sequence,and then the improving loop tries to pick each lay from the lay set and rearrange the remaining lays into a smaller lay set.The improving loop will run until it cannot obtain any smaller lay set or the time limit is due.The experiment results on 500 cases show that the proposed algorithm is effective and efficient.
文摘This paper proposes and evaluates two improved Petri net （PN）-based hybrid search strategies and their applications to flexible manufacturing system （FMS） scheduling. The algorithms proposed in some previous papers, which combine PN simulation capabilities with A＊ heuristic search within the PN reachability graph,may not find an optimum solution even with an admissible heuristic function. To remedy the defects an improved heuristic search strategy is proposed, which adopts a different method for selecting the promising markings and reserves the admissibility of the algorithm. To speed up the search process, another algorithm is also proposed which invokes faster termination conditions and still guarantees that the solution found is optimum. The scheduling results are compared through a simple FMS between our algorithms and the previous methods. They are also applied and evaluated in a set of randomly-generated FMSs with such characteristics as multiple resources and alternative routes.
