With the expansion of the application scope of social computing problems,many path problems in real life have evolved from pure path optimization problems to social computing problems that take into account various so...With the expansion of the application scope of social computing problems,many path problems in real life have evolved from pure path optimization problems to social computing problems that take into account various social attributes,cultures,and the emotional needs of customers.The actual soft time window vehicle routing problem,speeding up the response of customer needs,improving distribution efficiency,and reducing operating costs is the focus of current social computing problems.Therefore,designing fast and effective algorithms to solve this problem has certain theoretical and practical significance.In this paper,considering the time delay problem of customer demand,the compensation problem is given,and the mathematical model of vehicle path problem with soft time window is given.This paper proposes a hybrid tabu search(TS)&scatter search(SS)algorithm for vehicle routing problem with soft time windows(VRPSTW),which mainly embeds the TS dynamic tabu mechanism into the SS algorithm framework.TS uses the scattering of SS to avoid the dependence on the quality of the initial solution,and SS uses the climbing ability of TS improves the ability of optimizing,so that the quality of search for the optimal solution can be significantly improved.The hybrid algorithm is still based on the basic framework of SS.In particular,TS is mainly used for solution improvement and combination to generate new solutions.In the solution process,both the quality and the dispersion of the solution are considered.A simulation experiments verify the influence of the number of vehicles and maximum value of tabu length on solution,parameters’control over the degree of convergence,and the influence of the number of diverse solutions on algorithm performance.Based on the determined parameters,simulation experiment is carried out in this paper to further prove the algorithm feasibility and effectiveness.The results of this paper provide further ideas for solving vehicle routing problems with time windows and improving the efficiency of vehicle routing problems and have strong applicability.展开更多
The multitrip pickup and delivery problem with time windows and manpower planning(MTPDPTW-MP)determines a set of ambulance routes and finds staff assignment for a hospital. It involves different stakeholders with dive...The multitrip pickup and delivery problem with time windows and manpower planning(MTPDPTW-MP)determines a set of ambulance routes and finds staff assignment for a hospital. It involves different stakeholders with diverse interests and objectives. This study firstly introduces a multiobjective MTPDPTW-MP(MO-MTPDPTWMP) with three objectives to better describe the real-world scenario. A multiobjective iterated local search algorithm with adaptive neighborhood selection(MOILS-ANS) is proposed to solve the problem. MOILS-ANS can generate a diverse set of alternative solutions for decision makers to meet their requirements. To better explore the search space, problem-specific neighborhood structures and an adaptive neighborhood selection strategy are carefully designed in MOILS-ANS. Experimental results show that the proposed MOILS-ANS significantly outperforms the other two multiobjective algorithms. Besides, the nature of objective functions and the properties of the problem are analyzed. Finally, the proposed MOILS-ANS is compared with the previous single-objective algorithm and the benefits of multiobjective optimization are discussed.展开更多
The scheduling efficiency of the tracking and data relay satellite system(TDRSS)is strictly limited by the scheduling degrees of freedom(DoF),including time DoF defined by jobs' flexible time windows and spatial D...The scheduling efficiency of the tracking and data relay satellite system(TDRSS)is strictly limited by the scheduling degrees of freedom(DoF),including time DoF defined by jobs' flexible time windows and spatial DoF brought by multiple servable tracking and data relay satellites(TDRSs).In this paper,ageneralized multiple time windows(GMTW)model is proposed to fully exploit the time and spatial DoF.Then,the improvements of service capability and job-completion probability based on the GMTW are theoretically proved.Further,an asymmetric path-relinking(APR)based heuristic job scheduling framework is presented to maximize the usage of DoF provided by the GMTW.Simulation results show that by using our proposal 11%improvement of average jobcompletion probability can be obtained.Meanwhile,the computing time of the time-to-target can be shorten to 1/9 of the GRASP.展开更多
在Matlab/Simulink中应用Real-Time Windows Target模块重构状态观测器的实时仿真模型,采用该方法开发的实验系统既便于实现,又能和实际物理系统良好对接,有利于学生掌握状态观测器的相关知识和促进对Matlab的了解和应用。给出的应用实...在Matlab/Simulink中应用Real-Time Windows Target模块重构状态观测器的实时仿真模型,采用该方法开发的实验系统既便于实现,又能和实际物理系统良好对接,有利于学生掌握状态观测器的相关知识和促进对Matlab的了解和应用。给出的应用实例验证了方法的可行性。展开更多
This study attempts to solve vehicle routing problem with time window (VRPTW). The study first identifies the real problems and suggests some recommendations on the issues. The technique used in this study is Genetic ...This study attempts to solve vehicle routing problem with time window (VRPTW). The study first identifies the real problems and suggests some recommendations on the issues. The technique used in this study is Genetic Algorithm (GA) and initialization applied is random population method. The objective of the study is to assign a number of vehicles to routes that connect customers and depot such that the overall distance travelled is minimized and the delivery operations are completed within the time windows requested by the customers. The analysis reveals that the problems experienced in vehicle routing with time window can be solved by GA and retrieved for optimal solutions. After a thorough study on VRPTW, it is highly recommended that a company should implement the optimal routes derived from the study to increase the efficiency and accuracy of delivery with time insertion.展开更多
A novel genetic algorithm with multiple species in dynamic region is proposed,each of which occupies a dynamic region determined by the weight vector of a fuzzy adaptive Hamming neural network. Through learning and cl...A novel genetic algorithm with multiple species in dynamic region is proposed,each of which occupies a dynamic region determined by the weight vector of a fuzzy adaptive Hamming neural network. Through learning and classification of genetic individuals in the evolutionary procedure,the neural network distributes multiple species into different regions of the search space. Furthermore,the neural network dynamically expands each search region or establishes new region for good offspring individuals to continuously keep the diversification of the genetic population. As a result,the premature problem inherent in genetic algorithm is alleviated and better tradeoff between the ability of exploration and exploitation can be obtained. The experimental results on the vehicle routing problem with time windows also show the good performance of the proposed genetic algorithm.展开更多
This paper addresses the open vehicle routing problem with time window(OVRPTW), where each vehicle does not need to return to the depot after completing the delivery task.The optimization objective is to minimize the ...This paper addresses the open vehicle routing problem with time window(OVRPTW), where each vehicle does not need to return to the depot after completing the delivery task.The optimization objective is to minimize the total distance. This problem exists widely in real-life logistics distribution process.We propose a hybrid column generation algorithm(HCGA) for the OVRPTW, embedding both exact algorithm and metaheuristic. In HCGA, a label setting algorithm and an intelligent algorithm are designed to select columns from small and large subproblems, respectively. Moreover, a branch strategy is devised to generate the final feasible solution for the OVRPTW. The computational results show that the proposed algorithm has faster speed and can obtain the approximate optimal solution of the problem with 100 customers in a reasonable time.展开更多
Consensus of creativity research suggests that the measurement of both originality and valuableness is necessary when designing creativity tasks.However,few studies have emphasized valuableness when exploring underlyi...Consensus of creativity research suggests that the measurement of both originality and valuableness is necessary when designing creativity tasks.However,few studies have emphasized valuableness when exploring underlying neural substrates of creative thinking.The present study employs product-based creativity tasks that measure both originality and valuableness in an exploration of the dynamic relationship between the default mode(DMN),executive control(ECN),and salience(SN)networks through time windows.This methodology highlights relevance,or valuableness,in creativity evaluation as opposed to divergent thinking tasks solely measuring originality.The researchers identified seven brain regions belonging to the ECN,DMN,and SN as regions of interest(ROIs),as well as four representative seeds to analyze functional connectivity in 25 college student participants.Results showed that all of the identified ROIs were involved during the creative task.The insula,precuneus,and ventrolateral prefrontal cortex(vlPFC)remained active across all stages of product-based creative thinking.Moreover,the connectivity analyses revealed varied interaction patterns of DMN,ECN,and SN at different thinking stages.The integrated findings of the whole brain,ROI,and connectivity analyses suggest a trend that the DMN and SN(which relate to bottom-up thinking)attenuate as time proceeds,whereas the vlPFC(which relates to top-down thinking)gets stronger at later stages;these findings reflect the nature of our creativity tasks and decision-making of valuableness in later stages.Based on brain region activation throughout execution of the task,we propose that product-based creative process may include three stages:exploration and association,incubation and insight,and finally,evaluation and decision making.This model provides a thinking frame for further research and classroom instruction.展开更多
Our research focuses on the development of two cooperative approaches for resolution of the multi-item capacitated lot-sizing problems with time windows and setup times (MICLSP-TW-ST). In this paper we combine variabl...Our research focuses on the development of two cooperative approaches for resolution of the multi-item capacitated lot-sizing problems with time windows and setup times (MICLSP-TW-ST). In this paper we combine variable neighborhood search and accurate mixed integer programming (VNS-MIP) to solve MICLSP-TW-ST. It concerns so a particularly important and difficult problem in production planning. This problem is NP-hard in the strong sense. Moreover, it is very difficult to solve with an exact method;it is for that reason we have made use of the approximate methods. We improved the variable neighborhood search (VNS) algorithm, which is efficient for solving hard combinatorial optimization problems. This problem can be viewed as an optimization problem with mixed variables (binary variables and real variables). The new VNS algorithm was tested against 540 benchmark problems. The performance of most of our approaches was satisfactory and performed better than the algorithms already proposed in the literature.展开更多
Objective:To investigate the clinical effects of applying the magnetic resonance double mismatch technique to endovascular treatment of acute anterior circulation,large vessel occlusion with cerebral infarction in an ...Objective:To investigate the clinical effects of applying the magnetic resonance double mismatch technique to endovascular treatment of acute anterior circulation,large vessel occlusion with cerebral infarction in an unknown time window.Methods:The research work was carried out in our hospital,the work was carried out from November 2018 to November 2019,the patients with acute anterior circulation large vessel occlusion with cerebral infarction who were treated in our hospital during this period,100 patients,50 patients with an unknown time window and 50 patients with definite time window were selected,and they were named as the experimental and control groups,given different examination methods,were given to investigate the clinical treatment effect.Results:Patients’data on HIHSS score before treatment,the incidence of intracranial hemorrhage and rate of Mrs≤2 rating after 90 days of treatment were not significantly different(P>0.05),which was not meaningful.The differences in data between the two groups concerning HIHSS scores were relatively significant before,and after treatment(P<0.05).Conclusion:The magnetic resonance double mismatch technique will be applied in the endovascular treatment of acute anterior circulation large vessel occlusion with cerebral infarction of unknown time window.展开更多
The time dependent vehicle routing problem with time windows(TDVRPTW) is considered. A multi-type ant system(MTAS) algorithm hybridized with the ant colony system(ACS)and the max-min ant system(MMAS) algorithms is pro...The time dependent vehicle routing problem with time windows(TDVRPTW) is considered. A multi-type ant system(MTAS) algorithm hybridized with the ant colony system(ACS)and the max-min ant system(MMAS) algorithms is proposed. This combination absorbs the merits of the two algorithms in solutions construction and optimization separately. In order to improve the efficiency of the insertion procedure, a nearest neighbor selection(NNS) mechanism, an insertion local search procedure and a local optimization procedure are specified in detail. And in order to find a balance between good scouting performance and fast convergence rate, an adaptive pheromone updating strategy is proposed in the MTAS. Computational results confirm the MTAS algorithm's good performance with all these strategies on classic vehicle routing problem with time windows(VRPTW) benchmark instances and the TDVRPTW instances, and some better results especially for the number of vehicles and travel times of the best solutions are obtained in comparison with the previous research.展开更多
Unmanned combat air vehicles(UCAVs) mission planning is a fairly complicated global optimum problem. Military attack missions often employ a fleet of UCAVs equipped with weapons to attack a set of known targets. A UCA...Unmanned combat air vehicles(UCAVs) mission planning is a fairly complicated global optimum problem. Military attack missions often employ a fleet of UCAVs equipped with weapons to attack a set of known targets. A UCAV can carry different weapons to accomplish different combat missions. Choice of different weapons will have different effects on the final combat effectiveness. This work presents a mixed integer programming model for simultaneous weapon configuration and route planning of UCAVs, which solves the problem optimally using the IBM ILOG CPLEX optimizer for simple missions. This paper develops a heuristic algorithm to handle the medium-scale and large-scale problems. The experiments demonstrate the performance of the heuristic algorithm in solving the medium scale and large scale problems. Moreover, we give suggestions on how to select the most appropriate algorithm to solve different scale problems.展开更多
As a new variant of vehicle routing problem( VRP),a finished vehicle routing problem with time windows in finished vehicle logistics( FVRPTW) is modeled and solved. An optimization model for FVRPTW is presented with t...As a new variant of vehicle routing problem( VRP),a finished vehicle routing problem with time windows in finished vehicle logistics( FVRPTW) is modeled and solved. An optimization model for FVRPTW is presented with the objective of scheduling multiple transport routes considering loading constraints along with time penalty function to minimize the total cost. Then a genetic algorithm( GA) is developed. The specific encoding and genetic operators for FVRPTW are devised.Especially,in order to accelerate its convergence,an improved termination condition is given. Finally,a case study is used to evaluate the effectiveness of the proposed algorithm and a series of experiments are conducted over a set of finished vehicle routing problems. The results demonstrate that the proposed approach has superior performance and satisfies users in practice. Contributions of the study are the modeling and solving of a complex FVRPTW in logistics industry.展开更多
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.展开更多
The paper aims to optimize the therapeutic dose and time window of picroside II by orthogonal test in cerebral ischemic injury in rats. The forebrain ischemia models were established by bilateral common carotid artery...The paper aims to optimize the therapeutic dose and time window of picroside II by orthogonal test in cerebral ischemic injury in rats. The forebrain ischemia models were established by bilateral common carotid artery occlusion (BCCAO) methods. The successful models were randomly divided into sixteen groups according to orthogonal experimental design and treated by injecting picroside II intraperitonenally at different ischemic time with different dose. The concentrations of neuron-specific enolase (NSE), neuroglial marker protein S100B and myelin basic protein (MBP) in serum were determined by enzyme linked immunosorbent assay to evaluate the therapeutic effect of picroside II in cerebral ischemic injury. The results indicated that best therapeutic time window and dose of picroside II in cerebral ischemic injury were ischemia 1.5 h with 20 mg/kg body weight according to the concentrations of NSE, S100B and MBP in serum. It is concluded that according to the principle of lowest therapeutic dose with longest time window, the optimized therapeutic dose and time window are injecting picroside II intraperitonenally with 20 mg/kg body weight at ischemia 1.5 h in cerebral ischemic injury in rats.展开更多
The aim is to optimize the anti-inflammatory effect and the therapeutic dose and time window of picrosede II by orthogonal test in cerebral ischemic injury in rats. The forebrain ischemia models were established by bi...The aim is to optimize the anti-inflammatory effect and the therapeutic dose and time window of picrosede II by orthogonal test in cerebral ischemic injury in rats. The forebrain ischemia models were established by bilateral common carotid artery occlusion (BCCAO) methods in 30 Wistar rats. The successful models were randomly divided into sixteen groups according to orthogonal experimental design and treated by injecting picroside II intraperitoneally at different ischemic time with different dose. The concentrations of aquaporins 4 (AQP4), matrix metalloproteinases9 (MMP9) and cyclooxygenase 2 (COX2) in serum and brain tissue were determined by enzyme linked immunosorbent assay to evaluate the therapeutic effect of picroside II in cerebral ischemic injury. The best therapeutic time window and dose of picroside II in cerebral ischemic injury were 1) ischemia 2.0 h with 20 mg/kg and 1.5 h with 20 mg/kg body weight according to the concentration of AQP4 in serum and brain tissue;2) ischemia 1.5 h with 20 mg/kg and ischemia 2.0 h with 20 mg/kg according to the concentrations of MMP9 in serum and brain tissue;and 3) ischemia 1.5 h with 10 mg/kg and ischemia 1.5 h with 20 mg/kg according to the concentrations of COX2 in serum and brain tissue respectively. According to the principle of the lowest therapeutic dose with the longest time window, the optimized therapeutic dose and time window were injecting picroside II intraperitoneally with 10 - 20 mg/kg body weight at ischemia 1.5 - 2.0 h in cerebral ischemic injury.展开更多
A preliminary study from our research group showed that picroside II inhibited neuronal apoptosis in ischemic penumbra,reduced ischemic volume,and improved neurobehavioral function in rats with cerebral ischemia.The a...A preliminary study from our research group showed that picroside II inhibited neuronal apoptosis in ischemic penumbra,reduced ischemic volume,and improved neurobehavioral function in rats with cerebral ischemia.The aim of the present study was to validate the neuroprotective effects of picroside II and optimize its therapeutic time window and dose in a rat model of cerebral ischemia.We found that picroside II inhibited cell apoptosis and reduced the expression of neuron-specific enolase,a marker of neuronal damage,in rats after cerebral ischemic injury.The optimal treatment time after ischemic injury and dose were determined,respectively,as follows:(1)2.0 hours and 10 mg/kg according to the results of toluidine blue staining;(2)1.5 hours and 10 mg/kg according to early apoptotic ratio by flow cytometry;(3)2.0 hours and 10 mg/kg according to immunohistochemical and western blot analysis;and(4)1.5 hours and 10 mg/kg according to reverse transcription polymerase chain reaction.The present findings suggest that an intraperitoneal injection of 10 mg/kg picroside II 1.5–2.0 hours after cerebral ischemic injury in rats is the optimal dose and time for therapeutic benefit.展开更多
The coherence cube technology has become an important technology for the seismic attribute interpretation, which extracts the discontinuities of the events through analyzing the similarities of adjacent seismic channe...The coherence cube technology has become an important technology for the seismic attribute interpretation, which extracts the discontinuities of the events through analyzing the similarities of adjacent seismic channels to identify the fault form. The coherence cube technology which uses constant time window lengths can not balance the shallow layers and the deep layers, because the frequency band of seismic data varies with time. When analyzing the shallow layers, the time window will crossover a lot of events, which will lead to weak focusing ability and failure to delineate the details. While the time window will not be long enough for analyzing deep layers, which will lead to low accuracy because the coherences near the zero points of the events are heavily influenced by noise. For solving the problem, we should make a research on the coherence cube technology with self-adaptive time window. This paper determines the sample points' time window lengths in real time by computing the instantaneous frequency bands with Wavelet Transformation, which gives a coherence computing method with the self-adaptive time window lengths. The result shows that the coherence cube technology with self-adaptive time window based on Wavelet Transformation improves the accuracy of fault identification, and supresses the noise effectively. The method combines the advantages of long time window method and short time window method.展开更多
Aim to the manufacturing supply chain optimization problem with time windows,presents an improved orthogonal genetic algorithm to solve it. At first,we decompose this problem into two sub-problems (distribution and ro...Aim to the manufacturing supply chain optimization problem with time windows,presents an improved orthogonal genetic algorithm to solve it. At first,we decompose this problem into two sub-problems (distribution and routing) plus an interface mechanism to allow the two algorithms to collaborate in a master-slave fashion,with the distribution algorithm driving the routing algorithm. At second,we describe the proposed improved orthogonal genetic algorithm for solving giving problem detailedly. Finally,the examples suggest that this proposed approach is feasible,correct and valid.展开更多
OBJECTIVE To detect the underlying mechanism of time window for estrogen(E2)replacement treating cognitive decline.METHODS E2 begun 1 week after the ovariectomy(OVXST)or 3 months after the ovariectomy(OVXLT).Learning ...OBJECTIVE To detect the underlying mechanism of time window for estrogen(E2)replacement treating cognitive decline.METHODS E2 begun 1 week after the ovariectomy(OVXST)or 3 months after the ovariectomy(OVXLT).Learning and memory ability were examined by trace fear memory test and inhibitory avoidance test.LTP and LTD were detected by MED64.High throughput gene expression sequencing and microRNA(miR NA) sequencing were used to detecte the differently expressed genes between OVXSTand OVXLTafter estrogen treatment.RESULTS Subcutaneous injection of E2 improved fear memory formation in both 1 week after ovariectomy(OVXST) mice or 3 months after ovariectomy(OVXLT) mice.However,for fear memory extinction,facilitated by E2 in OVXSTmice,but impaired by E2 in OVXLTmice.Further researches showed in medial prefrontal cortex(mPFC),estrogen facilitates LTD in OVXSTmice but impairs LTD in OVXLTmice.Results of highthroughput sequencings of mR NA and miRNA in mPFC from sham,OVXSTmice,E2 treated OVXST mice,OVXLTmice,and E2 treated OVXLTmice indicated decreased miR-221-5 p expression in OVXLTmice compared with OVXSTmice.In OVXLT mice,miR-221-5 p could be further reduced by E2 treatment.Additionally,miR-221-5 p targeted neuralized E3 ubiquitin protein ligase 1 a/b(Neurl1 a/b) m RNA.Decreased miR-221-5 p will promotes cannabinoid receptor 1(CB1) ubiquitination through up-regulating Neurl1 a/b protein levels in E2 treated OVXLTmice,which disrupted the retrograde endocanabinoids system.Replenishing miR-221-5 p or treating with CB1 agonist rescued the fear extinction impairment in E2 treated OVXLTmice.CONCLUSION These results uncovered a epigenetic change after long term E2 responsible for failure of E2 improving cognitive performance in OVXLTmice,moreover miR-221-5 p and CB1 agonist as potential targets for prolonging the time window for E2 replacement therapy.展开更多
基金This work was supported by the National Natural Science Foundation of China(61772196,61472136)the Hunan Provincial Focus Social Science Fund(2016ZDB006)Thanks to Professor Weijin Jiang for his guidance and suggestions on this research.Funding Statement。
文摘With the expansion of the application scope of social computing problems,many path problems in real life have evolved from pure path optimization problems to social computing problems that take into account various social attributes,cultures,and the emotional needs of customers.The actual soft time window vehicle routing problem,speeding up the response of customer needs,improving distribution efficiency,and reducing operating costs is the focus of current social computing problems.Therefore,designing fast and effective algorithms to solve this problem has certain theoretical and practical significance.In this paper,considering the time delay problem of customer demand,the compensation problem is given,and the mathematical model of vehicle path problem with soft time window is given.This paper proposes a hybrid tabu search(TS)&scatter search(SS)algorithm for vehicle routing problem with soft time windows(VRPSTW),which mainly embeds the TS dynamic tabu mechanism into the SS algorithm framework.TS uses the scattering of SS to avoid the dependence on the quality of the initial solution,and SS uses the climbing ability of TS improves the ability of optimizing,so that the quality of search for the optimal solution can be significantly improved.The hybrid algorithm is still based on the basic framework of SS.In particular,TS is mainly used for solution improvement and combination to generate new solutions.In the solution process,both the quality and the dispersion of the solution are considered.A simulation experiments verify the influence of the number of vehicles and maximum value of tabu length on solution,parameters’control over the degree of convergence,and the influence of the number of diverse solutions on algorithm performance.Based on the determined parameters,simulation experiment is carried out in this paper to further prove the algorithm feasibility and effectiveness.The results of this paper provide further ideas for solving vehicle routing problems with time windows and improving the efficiency of vehicle routing problems and have strong applicability.
基金supported by the National Key R&D Program of China(2018AAA0101203)the National Natural Science Foundation of China(61673403,71601191)the JSPS KAKENHI(JP17K12751)。
文摘The multitrip pickup and delivery problem with time windows and manpower planning(MTPDPTW-MP)determines a set of ambulance routes and finds staff assignment for a hospital. It involves different stakeholders with diverse interests and objectives. This study firstly introduces a multiobjective MTPDPTW-MP(MO-MTPDPTWMP) with three objectives to better describe the real-world scenario. A multiobjective iterated local search algorithm with adaptive neighborhood selection(MOILS-ANS) is proposed to solve the problem. MOILS-ANS can generate a diverse set of alternative solutions for decision makers to meet their requirements. To better explore the search space, problem-specific neighborhood structures and an adaptive neighborhood selection strategy are carefully designed in MOILS-ANS. Experimental results show that the proposed MOILS-ANS significantly outperforms the other two multiobjective algorithms. Besides, the nature of objective functions and the properties of the problem are analyzed. Finally, the proposed MOILS-ANS is compared with the previous single-objective algorithm and the benefits of multiobjective optimization are discussed.
基金Supported by the National Natural Science Foundation of China(91338101,91338108,61132002,6132106)Research Fund of Tsinghua University(2011Z05117)Co-innovation Laboratory of Aerospace Broadband Network Technology
文摘The scheduling efficiency of the tracking and data relay satellite system(TDRSS)is strictly limited by the scheduling degrees of freedom(DoF),including time DoF defined by jobs' flexible time windows and spatial DoF brought by multiple servable tracking and data relay satellites(TDRSs).In this paper,ageneralized multiple time windows(GMTW)model is proposed to fully exploit the time and spatial DoF.Then,the improvements of service capability and job-completion probability based on the GMTW are theoretically proved.Further,an asymmetric path-relinking(APR)based heuristic job scheduling framework is presented to maximize the usage of DoF provided by the GMTW.Simulation results show that by using our proposal 11%improvement of average jobcompletion probability can be obtained.Meanwhile,the computing time of the time-to-target can be shorten to 1/9 of the GRASP.
文摘This study attempts to solve vehicle routing problem with time window (VRPTW). The study first identifies the real problems and suggests some recommendations on the issues. The technique used in this study is Genetic Algorithm (GA) and initialization applied is random population method. The objective of the study is to assign a number of vehicles to routes that connect customers and depot such that the overall distance travelled is minimized and the delivery operations are completed within the time windows requested by the customers. The analysis reveals that the problems experienced in vehicle routing with time window can be solved by GA and retrieved for optimal solutions. After a thorough study on VRPTW, it is highly recommended that a company should implement the optimal routes derived from the study to increase the efficiency and accuracy of delivery with time insertion.
文摘A novel genetic algorithm with multiple species in dynamic region is proposed,each of which occupies a dynamic region determined by the weight vector of a fuzzy adaptive Hamming neural network. Through learning and classification of genetic individuals in the evolutionary procedure,the neural network distributes multiple species into different regions of the search space. Furthermore,the neural network dynamically expands each search region or establishes new region for good offspring individuals to continuously keep the diversification of the genetic population. As a result,the premature problem inherent in genetic algorithm is alleviated and better tradeoff between the ability of exploration and exploitation can be obtained. The experimental results on the vehicle routing problem with time windows also show the good performance of the proposed genetic algorithm.
基金supported by the National Natural Science Foundation of China (61963022,51665025,61873328)。
文摘This paper addresses the open vehicle routing problem with time window(OVRPTW), where each vehicle does not need to return to the depot after completing the delivery task.The optimization objective is to minimize the total distance. This problem exists widely in real-life logistics distribution process.We propose a hybrid column generation algorithm(HCGA) for the OVRPTW, embedding both exact algorithm and metaheuristic. In HCGA, a label setting algorithm and an intelligent algorithm are designed to select columns from small and large subproblems, respectively. Moreover, a branch strategy is devised to generate the final feasible solution for the OVRPTW. The computational results show that the proposed algorithm has faster speed and can obtain the approximate optimal solution of the problem with 100 customers in a reasonable time.
文摘Consensus of creativity research suggests that the measurement of both originality and valuableness is necessary when designing creativity tasks.However,few studies have emphasized valuableness when exploring underlying neural substrates of creative thinking.The present study employs product-based creativity tasks that measure both originality and valuableness in an exploration of the dynamic relationship between the default mode(DMN),executive control(ECN),and salience(SN)networks through time windows.This methodology highlights relevance,or valuableness,in creativity evaluation as opposed to divergent thinking tasks solely measuring originality.The researchers identified seven brain regions belonging to the ECN,DMN,and SN as regions of interest(ROIs),as well as four representative seeds to analyze functional connectivity in 25 college student participants.Results showed that all of the identified ROIs were involved during the creative task.The insula,precuneus,and ventrolateral prefrontal cortex(vlPFC)remained active across all stages of product-based creative thinking.Moreover,the connectivity analyses revealed varied interaction patterns of DMN,ECN,and SN at different thinking stages.The integrated findings of the whole brain,ROI,and connectivity analyses suggest a trend that the DMN and SN(which relate to bottom-up thinking)attenuate as time proceeds,whereas the vlPFC(which relates to top-down thinking)gets stronger at later stages;these findings reflect the nature of our creativity tasks and decision-making of valuableness in later stages.Based on brain region activation throughout execution of the task,we propose that product-based creative process may include three stages:exploration and association,incubation and insight,and finally,evaluation and decision making.This model provides a thinking frame for further research and classroom instruction.
文摘Our research focuses on the development of two cooperative approaches for resolution of the multi-item capacitated lot-sizing problems with time windows and setup times (MICLSP-TW-ST). In this paper we combine variable neighborhood search and accurate mixed integer programming (VNS-MIP) to solve MICLSP-TW-ST. It concerns so a particularly important and difficult problem in production planning. This problem is NP-hard in the strong sense. Moreover, it is very difficult to solve with an exact method;it is for that reason we have made use of the approximate methods. We improved the variable neighborhood search (VNS) algorithm, which is efficient for solving hard combinatorial optimization problems. This problem can be viewed as an optimization problem with mixed variables (binary variables and real variables). The new VNS algorithm was tested against 540 benchmark problems. The performance of most of our approaches was satisfactory and performed better than the algorithms already proposed in the literature.
文摘Objective:To investigate the clinical effects of applying the magnetic resonance double mismatch technique to endovascular treatment of acute anterior circulation,large vessel occlusion with cerebral infarction in an unknown time window.Methods:The research work was carried out in our hospital,the work was carried out from November 2018 to November 2019,the patients with acute anterior circulation large vessel occlusion with cerebral infarction who were treated in our hospital during this period,100 patients,50 patients with an unknown time window and 50 patients with definite time window were selected,and they were named as the experimental and control groups,given different examination methods,were given to investigate the clinical treatment effect.Results:Patients’data on HIHSS score before treatment,the incidence of intracranial hemorrhage and rate of Mrs≤2 rating after 90 days of treatment were not significantly different(P>0.05),which was not meaningful.The differences in data between the two groups concerning HIHSS scores were relatively significant before,and after treatment(P<0.05).Conclusion:The magnetic resonance double mismatch technique will be applied in the endovascular treatment of acute anterior circulation large vessel occlusion with cerebral infarction of unknown time window.
文摘The time dependent vehicle routing problem with time windows(TDVRPTW) is considered. A multi-type ant system(MTAS) algorithm hybridized with the ant colony system(ACS)and the max-min ant system(MMAS) algorithms is proposed. This combination absorbs the merits of the two algorithms in solutions construction and optimization separately. In order to improve the efficiency of the insertion procedure, a nearest neighbor selection(NNS) mechanism, an insertion local search procedure and a local optimization procedure are specified in detail. And in order to find a balance between good scouting performance and fast convergence rate, an adaptive pheromone updating strategy is proposed in the MTAS. Computational results confirm the MTAS algorithm's good performance with all these strategies on classic vehicle routing problem with time windows(VRPTW) benchmark instances and the TDVRPTW instances, and some better results especially for the number of vehicles and travel times of the best solutions are obtained in comparison with the previous research.
基金supported by the National Natural Science Foundation of China(7147117571471174)
文摘Unmanned combat air vehicles(UCAVs) mission planning is a fairly complicated global optimum problem. Military attack missions often employ a fleet of UCAVs equipped with weapons to attack a set of known targets. A UCAV can carry different weapons to accomplish different combat missions. Choice of different weapons will have different effects on the final combat effectiveness. This work presents a mixed integer programming model for simultaneous weapon configuration and route planning of UCAVs, which solves the problem optimally using the IBM ILOG CPLEX optimizer for simple missions. This paper develops a heuristic algorithm to handle the medium-scale and large-scale problems. The experiments demonstrate the performance of the heuristic algorithm in solving the medium scale and large scale problems. Moreover, we give suggestions on how to select the most appropriate algorithm to solve different scale problems.
基金Supported by the National Natural Science Foundation of China(No.51565036)
文摘As a new variant of vehicle routing problem( VRP),a finished vehicle routing problem with time windows in finished vehicle logistics( FVRPTW) is modeled and solved. An optimization model for FVRPTW is presented with the objective of scheduling multiple transport routes considering loading constraints along with time penalty function to minimize the total cost. Then a genetic algorithm( GA) is developed. The specific encoding and genetic operators for FVRPTW are devised.Especially,in order to accelerate its convergence,an improved termination condition is given. Finally,a case study is used to evaluate the effectiveness of the proposed algorithm and a series of experiments are conducted over a set of finished vehicle routing problems. The results demonstrate that the proposed approach has superior performance and satisfies users in practice. Contributions of the study are the modeling and solving of a complex FVRPTW in logistics industry.
基金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.
文摘The paper aims to optimize the therapeutic dose and time window of picroside II by orthogonal test in cerebral ischemic injury in rats. The forebrain ischemia models were established by bilateral common carotid artery occlusion (BCCAO) methods. The successful models were randomly divided into sixteen groups according to orthogonal experimental design and treated by injecting picroside II intraperitonenally at different ischemic time with different dose. The concentrations of neuron-specific enolase (NSE), neuroglial marker protein S100B and myelin basic protein (MBP) in serum were determined by enzyme linked immunosorbent assay to evaluate the therapeutic effect of picroside II in cerebral ischemic injury. The results indicated that best therapeutic time window and dose of picroside II in cerebral ischemic injury were ischemia 1.5 h with 20 mg/kg body weight according to the concentrations of NSE, S100B and MBP in serum. It is concluded that according to the principle of lowest therapeutic dose with longest time window, the optimized therapeutic dose and time window are injecting picroside II intraperitonenally with 20 mg/kg body weight at ischemia 1.5 h in cerebral ischemic injury in rats.
文摘The aim is to optimize the anti-inflammatory effect and the therapeutic dose and time window of picrosede II by orthogonal test in cerebral ischemic injury in rats. The forebrain ischemia models were established by bilateral common carotid artery occlusion (BCCAO) methods in 30 Wistar rats. The successful models were randomly divided into sixteen groups according to orthogonal experimental design and treated by injecting picroside II intraperitoneally at different ischemic time with different dose. The concentrations of aquaporins 4 (AQP4), matrix metalloproteinases9 (MMP9) and cyclooxygenase 2 (COX2) in serum and brain tissue were determined by enzyme linked immunosorbent assay to evaluate the therapeutic effect of picroside II in cerebral ischemic injury. The best therapeutic time window and dose of picroside II in cerebral ischemic injury were 1) ischemia 2.0 h with 20 mg/kg and 1.5 h with 20 mg/kg body weight according to the concentration of AQP4 in serum and brain tissue;2) ischemia 1.5 h with 20 mg/kg and ischemia 2.0 h with 20 mg/kg according to the concentrations of MMP9 in serum and brain tissue;and 3) ischemia 1.5 h with 10 mg/kg and ischemia 1.5 h with 20 mg/kg according to the concentrations of COX2 in serum and brain tissue respectively. According to the principle of the lowest therapeutic dose with the longest time window, the optimized therapeutic dose and time window were injecting picroside II intraperitoneally with 10 - 20 mg/kg body weight at ischemia 1.5 - 2.0 h in cerebral ischemic injury.
基金supported by the National Natural Science Foundation of China,No.81041092,81274116
文摘A preliminary study from our research group showed that picroside II inhibited neuronal apoptosis in ischemic penumbra,reduced ischemic volume,and improved neurobehavioral function in rats with cerebral ischemia.The aim of the present study was to validate the neuroprotective effects of picroside II and optimize its therapeutic time window and dose in a rat model of cerebral ischemia.We found that picroside II inhibited cell apoptosis and reduced the expression of neuron-specific enolase,a marker of neuronal damage,in rats after cerebral ischemic injury.The optimal treatment time after ischemic injury and dose were determined,respectively,as follows:(1)2.0 hours and 10 mg/kg according to the results of toluidine blue staining;(2)1.5 hours and 10 mg/kg according to early apoptotic ratio by flow cytometry;(3)2.0 hours and 10 mg/kg according to immunohistochemical and western blot analysis;and(4)1.5 hours and 10 mg/kg according to reverse transcription polymerase chain reaction.The present findings suggest that an intraperitoneal injection of 10 mg/kg picroside II 1.5–2.0 hours after cerebral ischemic injury in rats is the optimal dose and time for therapeutic benefit.
文摘The coherence cube technology has become an important technology for the seismic attribute interpretation, which extracts the discontinuities of the events through analyzing the similarities of adjacent seismic channels to identify the fault form. The coherence cube technology which uses constant time window lengths can not balance the shallow layers and the deep layers, because the frequency band of seismic data varies with time. When analyzing the shallow layers, the time window will crossover a lot of events, which will lead to weak focusing ability and failure to delineate the details. While the time window will not be long enough for analyzing deep layers, which will lead to low accuracy because the coherences near the zero points of the events are heavily influenced by noise. For solving the problem, we should make a research on the coherence cube technology with self-adaptive time window. This paper determines the sample points' time window lengths in real time by computing the instantaneous frequency bands with Wavelet Transformation, which gives a coherence computing method with the self-adaptive time window lengths. The result shows that the coherence cube technology with self-adaptive time window based on Wavelet Transformation improves the accuracy of fault identification, and supresses the noise effectively. The method combines the advantages of long time window method and short time window method.
文摘Aim to the manufacturing supply chain optimization problem with time windows,presents an improved orthogonal genetic algorithm to solve it. At first,we decompose this problem into two sub-problems (distribution and routing) plus an interface mechanism to allow the two algorithms to collaborate in a master-slave fashion,with the distribution algorithm driving the routing algorithm. At second,we describe the proposed improved orthogonal genetic algorithm for solving giving problem detailedly. Finally,the examples suggest that this proposed approach is feasible,correct and valid.
文摘OBJECTIVE To detect the underlying mechanism of time window for estrogen(E2)replacement treating cognitive decline.METHODS E2 begun 1 week after the ovariectomy(OVXST)or 3 months after the ovariectomy(OVXLT).Learning and memory ability were examined by trace fear memory test and inhibitory avoidance test.LTP and LTD were detected by MED64.High throughput gene expression sequencing and microRNA(miR NA) sequencing were used to detecte the differently expressed genes between OVXSTand OVXLTafter estrogen treatment.RESULTS Subcutaneous injection of E2 improved fear memory formation in both 1 week after ovariectomy(OVXST) mice or 3 months after ovariectomy(OVXLT) mice.However,for fear memory extinction,facilitated by E2 in OVXSTmice,but impaired by E2 in OVXLTmice.Further researches showed in medial prefrontal cortex(mPFC),estrogen facilitates LTD in OVXSTmice but impairs LTD in OVXLTmice.Results of highthroughput sequencings of mR NA and miRNA in mPFC from sham,OVXSTmice,E2 treated OVXST mice,OVXLTmice,and E2 treated OVXLTmice indicated decreased miR-221-5 p expression in OVXLTmice compared with OVXSTmice.In OVXLT mice,miR-221-5 p could be further reduced by E2 treatment.Additionally,miR-221-5 p targeted neuralized E3 ubiquitin protein ligase 1 a/b(Neurl1 a/b) m RNA.Decreased miR-221-5 p will promotes cannabinoid receptor 1(CB1) ubiquitination through up-regulating Neurl1 a/b protein levels in E2 treated OVXLTmice,which disrupted the retrograde endocanabinoids system.Replenishing miR-221-5 p or treating with CB1 agonist rescued the fear extinction impairment in E2 treated OVXLTmice.CONCLUSION These results uncovered a epigenetic change after long term E2 responsible for failure of E2 improving cognitive performance in OVXLTmice,moreover miR-221-5 p and CB1 agonist as potential targets for prolonging the time window for E2 replacement therapy.
