This paper addresses the Multi-Vehicle Routing Problem with Time Windows and Simultaneous Pickup and Delivery(MVRPTWSPD),aiming to optimize logistics distribution routes and minimize total costs.A vehicle routing opti...This paper addresses the Multi-Vehicle Routing Problem with Time Windows and Simultaneous Pickup and Delivery(MVRPTWSPD),aiming to optimize logistics distribution routes and minimize total costs.A vehicle routing optimization model is developed based on the operational requirements of the KS Logistics Center,focusing on minimizing vehicle dispatch,loading and unloading,operating,and time window penalty costs.The model incorporates constraints such as vehicle capacity,time windows,and travel distance,and is solved using a genetic algorithm to ensure optimal route planning.Through MATLAB simulations,34 customer points are analyzed,demonstrating that the simultaneous pickup and delivery model reduces total costs by 30.13%,increases vehicle loading rates by 20.04%,and decreases travel distance compared to delivery-only or pickup-only models.The results demonstrate the significant advantages of the simultaneous pickup and delivery mode in reducing logistics costs and improving vehicle utilization,offering valuable insights for enhancing the operational efficiency of the KS Logistics Center.展开更多
The Vehicle Routing Problem with Time Windows(VRPTW)presents a significant challenge in combinatorial optimization,especially under real-world uncertainties such as variable travel times,service durations,and dynamic ...The Vehicle Routing Problem with Time Windows(VRPTW)presents a significant challenge in combinatorial optimization,especially under real-world uncertainties such as variable travel times,service durations,and dynamic customer demands.These uncertainties make traditional deterministic models inadequate,often leading to suboptimal or infeasible solutions.To address these challenges,this work proposes an adaptive hybrid metaheuristic that integrates Genetic Algorithms(GA)with Local Search(LS),while incorporating stochastic uncertainty modeling through probabilistic travel times.The proposed algorithm dynamically adjusts parameters—such as mutation rate and local search probability—based on real-time search performance.This adaptivity enhances the algorithm’s ability to balance exploration and exploitation during the optimization process.Travel time uncertainties are modeled using Gaussian noise,and solution robustness is evaluated through scenario-based simulations.We test our method on a set of benchmark problems from Solomon’s instance suite,comparing its performance under deterministic and stochastic conditions.Results show that the proposed hybrid approach achieves up to a 9%reduction in expected total travel time and a 40% reduction in time window violations compared to baseline methods,including classical GA and non-adaptive hybrids.Additionally,the algorithm demonstrates strong robustness,with lower solution variance across uncertainty scenarios,and converges faster than competing approaches.These findings highlight the method’s suitability for practical logistics applications such as last-mile delivery and real-time transportation planning,where uncertainty and service-level constraints are critical.The flexibility and effectiveness of the proposed framework make it a promising candidate for deployment in dynamic,uncertainty-aware supply chain environments.展开更多
To provide the supplier with the minimizum vehicle travel distance in the distribution process of goods in three situations of new customer demand,customer cancellation service,and change of customer delivery address,...To provide the supplier with the minimizum vehicle travel distance in the distribution process of goods in three situations of new customer demand,customer cancellation service,and change of customer delivery address,based on the ideas of pre-optimization and real-time optimization,a two-stage planning model of dynamic demand based vehicle routing problem with time windows was established.At the pre-optimization stage,an improved genetic algorithm was used to obtain the pre-optimized distribution route,a large-scale neighborhood search method was integrated into the mutation operation to improve the local optimization performance of the genetic algorithm,and a variety of operators were introduced to expand the search space of neighborhood solutions;At the real-time optimization stage,a periodic optimization strategy was adopted to transform a complex dynamic problem into several static problems,and four neighborhood search operators were used to quickly adjust the route.Two different scale examples were designed for experiments.It is proved that the algorithm can plan the better route,and adjust the distribution route in time under the real-time constraints.Therefore,the proposed algorithm can provide theoretical guidance for suppliers to solve the dynamic demand based vehicle routing problem.展开更多
Considering that the vehicle routing problem （VRP） with many extended features is widely used in actual life, such as multi-depot, heterogeneous types of vehicles, customer service priority and time windows etc., a ...Considering that the vehicle routing problem （VRP） with many extended features is widely used in actual life, such as multi-depot, heterogeneous types of vehicles, customer service priority and time windows etc., a mathematical model for multi-depot heterogeneous vehicle routing problem with soft time windows （MDHVRPSTW） is established. An improved ant colony optimization （IACO） is proposed for solving this model. First, MDHVRPSTW is transferred into different groups according to the nearest principle, and then the initial route is constructed by the scanning algorithm （SA）. Secondly, genetic operators are introduced, and crossover probability and mutation probability are adaptively adjusted in order to improve the global search ability of the algorithm. Moreover, the smooth mechanism is used to improve the performance of the ant colony optimization （ACO）. Finally, the 3-opt strategy is used to improve the local search ability. The proposed IACO was tested on three new instances that were generated randomly. The experimental results show that IACO is superior to the other three existing algorithms in terms of convergence speed and solution quality. Thus, the proposed method is effective and feasible, and the proposed model is meaningful.展开更多
With a three-dimensional semiclassical ensemble method, we theoretically investigated the nonsequential double ionization of Ar driven by the spatially inhomogeneous few-cycle negatively chirped laser pulses. Our resu...With a three-dimensional semiclassical ensemble method, we theoretically investigated the nonsequential double ionization of Ar driven by the spatially inhomogeneous few-cycle negatively chirped laser pulses. Our results show that the recollision time window can be precisely controlled within an isolated time interval of several hundred attoseconds, which is useful for understanding the subcycle correlated electron dynamics. More interestingly, the correlated electron momentum distribution (CEMD) exhibits a strong dependence on laser intensity. That is, at lower laser intensity, CEMD is located in the first quadrant. As the laser intensity increases,CEMD shifts almost completely to the second and fourth quadrants, and then gradually to the third quadrant.The underlying physics governing the CEMD's dependence on laser intensity is explained.展开更多
This paper first analyzes the complexity of pathological processes involved in acute hemorrhagic or ischemic stroke,including primary and secondary brain injury manifestations and mechanisms,potential transformations ...This paper first analyzes the complexity of pathological processes involved in acute hemorrhagic or ischemic stroke,including primary and secondary brain injury manifestations and mechanisms,potential transformations between hemorrhage and infarction,and the impact of postbrain injury inflammation on disease progression.Based on decades of extensive clinical and pharmacological research on the usage of Chinese herbal medicine(CHM)monomers or formulas that promote blood circulation and remove blood stasis(such as Angong Niuhuang Wan,Buyang Huanwu Tang,Dahuoluo Wan,and Dushen Tang)for stroke treatment,it proposes that tonifying qi,promoting blood circulation,removing blood stasis,and detoxifying are rational treatment principles of CHM.These principles correspond to the following Western medical implications:tonifying qi corresponds to neuroprotection effects,promoting blood circulation corresponds to anticoagulation and thrombolysis,removing blood stasis addresses hematoma absorption and cerebral edema reduction,and detoxifying corresponds to anti-inflammatory actions.This paper further proposes from a systems medicine perspective that acute stroke is a complex disease requiring individualized CHM treatment with timely modifications rather than a one-sizefits-all approach.CHM monomers or formulas for promoting blood circulation and removing blood stasis,which have various effects such as lowering blood pressure,hemostasis,anticoagulation,antiplatelet,anti-inflammatory,promoting fibrinolysis,and edema reduction,must align with disease progression and be applied within appropriate therapeutic time windows to ensure efficacy and safety.Finally,this paper suggests that a combined use of acupuncture and CHM can potentially synergistically leverage their respective therapeutic strengths.Additionally,acupuncture shows clear benefits in the acute phase of intracerebral hemorrhage(ICH),such as stimulating the vagus nerve to enhance cerebral blood flow,reducing inflammation,as well as triggering hemostatic effects.By applying these rational treatment principles in an integrated approach,better CHM treatment outcomes and higher efficacy of stroke management may be attained.展开更多
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） algorithm...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.展开更多
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.展开更多
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.展开更多
The time window in which a drug is effective varies between drugs. The present study investigated the therapeutic window of Qingkailing injection for focal cerebral ischemia/reperfusion in mice. Animals underwent midd...The time window in which a drug is effective varies between drugs. The present study investigated the therapeutic window of Qingkailing injection for focal cerebral ischemia/reperfusion in mice. Animals underwent middle cerebral artery occlusion and were injected with Qingkailing （1.5, 3, 6 mL/kg）. Infarct volume and neurological function were assessed after 24 hours of ischemia. In addition, to establish the therapeutic time window, mice were injected with 3 mL/kg Qingkailing at 0, 1, 3, 4, 6, 9 and 12 hours after occlusion. Results revealed that Qingkailing injection significantly reduced infarct volume and improved neurological function in model mice after cerebral infarction for up to 9 hours, demonstrating that the therapeutic window of Qingkailing injection can extend to 9 hours for cerebral ischemia/reperfusion in mice.展开更多
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.展开更多
Objective To evaluate the utility of computed tomography perfusion(CTP)both at admission and during delayed cerebral ischemia time-window(DCITW)in the detection of delayed cerebral ischemia(DCI)and the change in CTP p...Objective To evaluate the utility of computed tomography perfusion(CTP)both at admission and during delayed cerebral ischemia time-window(DCITW)in the detection of delayed cerebral ischemia(DCI)and the change in CTP parameters from admission to DCITW following aneurysmal subarachnoid hemorrhage.Methods Eighty patients underwent CTP at admission and during DCITW.The mean and extreme values of all CTP parameters at admission and during DCITW were compared between the DCI group and non-DCI group,and comparisons were also made between admission and DCITW within each group.The qualitative color-coded perfusion maps were recorded.Finally,the relationship between CTP parameters and DCI was assessed by receiver operating characteristic(ROC)analyses.Results With the exception of cerebral blood volume(P=0.295,admission;P=0.682,DCITW),there were significant differences in the mean quantitative CTP parameters between DCI and non-DCI patients both at admission and during DCITW.In the DCI group,the extreme parameters were significantly different between admission and DCITW.The DCI group also showed a deteriorative trend in the qualitative color-coded perfusion maps.For the detection of DCI,mean transit time to the center of the impulse response function(Tmax)at admission and mean time to start(TTS)during DCITW had the largest area under curve(AUC),0.698 and 0.789,respectively.Conclusion Whole-brain CTP can predict the occurrence of DCI at admission and diagnose DCI during DCITW.The extreme quantitative parameters and qualitative color-coded perfusion maps can better reflect the perfusion changes of patients with DCI from admission to DCITW.展开更多
In this study, we established a Wistar rat model of right middle cerebral artery occlusion and observed pathological imaging changes （T2-weighted imaging [T2WI], T2FLAIR, and diffusion-weighted imaging [DWI]） follow...In this study, we established a Wistar rat model of right middle cerebral artery occlusion and observed pathological imaging changes （T2-weighted imaging [T2WI], T2FLAIR, and diffusion-weighted imaging [DWI]） following cerebral infarction. The pathological changes were divided into three phases： early cerebral infarction, middle cerebral infarction, and late cerebral infarction. In the early cerebral infarction phase （less than 2 hours post-infarction）, there was evidence of intracellular edema, which improved after reperfusion. This improvement was defined as the ischemic penumbra. In this phase, a high DWI signal and a low apparent diffusion coefficient were observed in the right basal ganglia region. By contrast, there were no abnormal T2WI and T2FLAIR signals. For the middle cerebral infarction phase （2-4 hours post-infarction）, a mixed edema was observed. After reperfusion, there was a mild improvement in cell edema, while the angioedema became more serious. A high DWI signal and a low apparent diffusion coefficient signal were observed, and some rats showed high T2WI and T2FLAIR signals. For the late cerebral infarction phase （4-6 hours post-infarction）, significant angioedema was visible in the infarction site. After reperfusion, there was a significant increase in angioedema, while there was evidence of hemorrhage and necrosis. A mixed signal was observed on DWI, while a high apparent diffusion coefficient signal, a high T2WI signal, and a high T2FLAIR signal were also observed. All 86 cerebral infarction patients were subjected to T2WI, T2FLAIR, and DWI. MRI results of clinic data similar to the early infarction phase of animal experiments were found in 51 patients, for which 10 patients （10/51） had an onset time greater than 6 hours. A total of 35 patients had MRI results similar to the middle and late infarction phase of animal experiments, of which eight patients （8/35） had an onset time less than 6 hours. These data suggest that defining the ＂therapeutic time window＂ as the time 6 hours after infarction may not be suitable for all patients. Integrated application of MRI sequences including T2WI, T2FLAIR, DW-MRI, and apparent diffusion coefficient mapping should be used to examine the ischemic penumbra, which may provide valuable information for identifying the ＂therapeutic time window＂.展开更多
A preliminary study from our research group showed that picroside II inhibited neuronal apop- tosis in ischemic penumbra, reduced ischemic volume, and improved neurobehavioral function in rats with cerebral ischemia. ...A preliminary study from our research group showed that picroside II inhibited neuronal apop- tosis 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 Ⅱ 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.展开更多
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.展开更多
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.展开更多
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 ...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.展开更多
The development of the cotton fiber is very sensitive to temperature variation, and high temperature stress often causes reduced fiber yield and fiber quality. Short-term high temperature stress often occurs during co...The development of the cotton fiber is very sensitive to temperature variation, and high temperature stress often causes reduced fiber yield and fiber quality. Short-term high temperature stress often occurs during cotton production, but little is known about the specific timing and duration of stress that affects fiber development. To make this clear, pot experiments were carried in 2014 and 2015 in a climate chamber using cotton cultivars HY370WR（less sensitive variety） and Sumian 15（heat sensitive variety）, which present different temperature sensitivities. Changes of the most important fiber quality indices（i.e., fiber length, fiber strength and marcironaire） and three very important fiber development components（i.e., cellulose, sucrose and callose） were analyzed to define the time window and critical duration to the high temperature stress at 34°C（max38°C/min30°C）. When developing bolls were subjected to 5 days of high temperature stress at different days post-anthesis（DPA）, the changes（Δ%） of fiber length, strength and micronire, as a function of imposed time followed square polynomial eq. as y=a＋bx＋cx^2, and the time around 15 DPA was the most sensitive period for fiber quality development in response to heat stress. When 15 DPA bolls were heat-stressed for different durations（2, 3, 4, 5, 6, 7 days）, the changes（Δ%） of fiber length, strength and micronire, as a function of stress duration followed logistic equations y=A_1-A_2/1＋（x/x_0）~p＋A_2. Referred to that 5, 10 and 15% are usually used as criteria to decide whether techniques are effective or changes are significant in crop culture practice and reguard to the fiber quality indices change range, we suggested that 5% changes of the major fiber quality indices（fiber length, fiber strength and micronaire） and 10% changes of fiber development components（cellulose, sucrose and callose） could be taken as criteria to judge whether fiber development and fiber quality have been significantly affected by high temperature stress. The key time window for cotton fiber development in response to the high temperature stress was 13–19 DPA, and the critical duration was about 5 days.展开更多
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.展开更多
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＆#39; 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.展开更多
文摘This paper addresses the Multi-Vehicle Routing Problem with Time Windows and Simultaneous Pickup and Delivery(MVRPTWSPD),aiming to optimize logistics distribution routes and minimize total costs.A vehicle routing optimization model is developed based on the operational requirements of the KS Logistics Center,focusing on minimizing vehicle dispatch,loading and unloading,operating,and time window penalty costs.The model incorporates constraints such as vehicle capacity,time windows,and travel distance,and is solved using a genetic algorithm to ensure optimal route planning.Through MATLAB simulations,34 customer points are analyzed,demonstrating that the simultaneous pickup and delivery model reduces total costs by 30.13%,increases vehicle loading rates by 20.04%,and decreases travel distance compared to delivery-only or pickup-only models.The results demonstrate the significant advantages of the simultaneous pickup and delivery mode in reducing logistics costs and improving vehicle utilization,offering valuable insights for enhancing the operational efficiency of the KS Logistics Center.
文摘The Vehicle Routing Problem with Time Windows(VRPTW)presents a significant challenge in combinatorial optimization,especially under real-world uncertainties such as variable travel times,service durations,and dynamic customer demands.These uncertainties make traditional deterministic models inadequate,often leading to suboptimal or infeasible solutions.To address these challenges,this work proposes an adaptive hybrid metaheuristic that integrates Genetic Algorithms(GA)with Local Search(LS),while incorporating stochastic uncertainty modeling through probabilistic travel times.The proposed algorithm dynamically adjusts parameters—such as mutation rate and local search probability—based on real-time search performance.This adaptivity enhances the algorithm’s ability to balance exploration and exploitation during the optimization process.Travel time uncertainties are modeled using Gaussian noise,and solution robustness is evaluated through scenario-based simulations.We test our method on a set of benchmark problems from Solomon’s instance suite,comparing its performance under deterministic and stochastic conditions.Results show that the proposed hybrid approach achieves up to a 9%reduction in expected total travel time and a 40% reduction in time window violations compared to baseline methods,including classical GA and non-adaptive hybrids.Additionally,the algorithm demonstrates strong robustness,with lower solution variance across uncertainty scenarios,and converges faster than competing approaches.These findings highlight the method’s suitability for practical logistics applications such as last-mile delivery and real-time transportation planning,where uncertainty and service-level constraints are critical.The flexibility and effectiveness of the proposed framework make it a promising candidate for deployment in dynamic,uncertainty-aware supply chain environments.
基金supported by Natural Science Foundation Project of Gansu Provincial Science and Technology Department(No.1506RJZA084)Gansu Provincial Education Department Scientific Research Fund Grant Project(No.1204-13).
文摘To provide the supplier with the minimizum vehicle travel distance in the distribution process of goods in three situations of new customer demand,customer cancellation service,and change of customer delivery address,based on the ideas of pre-optimization and real-time optimization,a two-stage planning model of dynamic demand based vehicle routing problem with time windows was established.At the pre-optimization stage,an improved genetic algorithm was used to obtain the pre-optimized distribution route,a large-scale neighborhood search method was integrated into the mutation operation to improve the local optimization performance of the genetic algorithm,and a variety of operators were introduced to expand the search space of neighborhood solutions;At the real-time optimization stage,a periodic optimization strategy was adopted to transform a complex dynamic problem into several static problems,and four neighborhood search operators were used to quickly adjust the route.Two different scale examples were designed for experiments.It is proved that the algorithm can plan the better route,and adjust the distribution route in time under the real-time constraints.Therefore,the proposed algorithm can provide theoretical guidance for suppliers to solve the dynamic demand based vehicle routing problem.
基金The National Natural Science Foundation of China(No.61074147)the Natural Science Foundation of Guangdong Province(No.S2011010005059)+2 种基金the Foundation of Enterprise-University-Research Institute Cooperation from Guangdong Province and Ministry of Education of China(No.2012B091000171,2011B090400460)the Science and Technology Program of Guangdong Province(No.2012B050600028)the Science and Technology Program of Huadu District,Guangzhou(No.HD14ZD001)
文摘Considering that the vehicle routing problem （VRP） with many extended features is widely used in actual life, such as multi-depot, heterogeneous types of vehicles, customer service priority and time windows etc., a mathematical model for multi-depot heterogeneous vehicle routing problem with soft time windows （MDHVRPSTW） is established. An improved ant colony optimization （IACO） is proposed for solving this model. First, MDHVRPSTW is transferred into different groups according to the nearest principle, and then the initial route is constructed by the scanning algorithm （SA）. Secondly, genetic operators are introduced, and crossover probability and mutation probability are adaptively adjusted in order to improve the global search ability of the algorithm. Moreover, the smooth mechanism is used to improve the performance of the ant colony optimization （ACO）. Finally, the 3-opt strategy is used to improve the local search ability. The proposed IACO was tested on three new instances that were generated randomly. The experimental results show that IACO is superior to the other three existing algorithms in terms of convergence speed and solution quality. Thus, the proposed method is effective and feasible, and the proposed model is meaningful.
基金supported by the National Natural Science Foundation of China (Grant No. 12074329)Nanhu Scholars Program for Young Scholars of Xinyang Normal University。
文摘With a three-dimensional semiclassical ensemble method, we theoretically investigated the nonsequential double ionization of Ar driven by the spatially inhomogeneous few-cycle negatively chirped laser pulses. Our results show that the recollision time window can be precisely controlled within an isolated time interval of several hundred attoseconds, which is useful for understanding the subcycle correlated electron dynamics. More interestingly, the correlated electron momentum distribution (CEMD) exhibits a strong dependence on laser intensity. That is, at lower laser intensity, CEMD is located in the first quadrant. As the laser intensity increases,CEMD shifts almost completely to the second and fourth quadrants, and then gradually to the third quadrant.The underlying physics governing the CEMD's dependence on laser intensity is explained.
文摘This paper first analyzes the complexity of pathological processes involved in acute hemorrhagic or ischemic stroke,including primary and secondary brain injury manifestations and mechanisms,potential transformations between hemorrhage and infarction,and the impact of postbrain injury inflammation on disease progression.Based on decades of extensive clinical and pharmacological research on the usage of Chinese herbal medicine(CHM)monomers or formulas that promote blood circulation and remove blood stasis(such as Angong Niuhuang Wan,Buyang Huanwu Tang,Dahuoluo Wan,and Dushen Tang)for stroke treatment,it proposes that tonifying qi,promoting blood circulation,removing blood stasis,and detoxifying are rational treatment principles of CHM.These principles correspond to the following Western medical implications:tonifying qi corresponds to neuroprotection effects,promoting blood circulation corresponds to anticoagulation and thrombolysis,removing blood stasis addresses hematoma absorption and cerebral edema reduction,and detoxifying corresponds to anti-inflammatory actions.This paper further proposes from a systems medicine perspective that acute stroke is a complex disease requiring individualized CHM treatment with timely modifications rather than a one-sizefits-all approach.CHM monomers or formulas for promoting blood circulation and removing blood stasis,which have various effects such as lowering blood pressure,hemostasis,anticoagulation,antiplatelet,anti-inflammatory,promoting fibrinolysis,and edema reduction,must align with disease progression and be applied within appropriate therapeutic time windows to ensure efficacy and safety.Finally,this paper suggests that a combined use of acupuncture and CHM can potentially synergistically leverage their respective therapeutic strengths.Additionally,acupuncture shows clear benefits in the acute phase of intracerebral hemorrhage(ICH),such as stimulating the vagus nerve to enhance cerebral blood flow,reducing inflammation,as well as triggering hemostatic effects.By applying these rational treatment principles in an integrated approach,better CHM treatment outcomes and higher efficacy of stroke management may be attained.
文摘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 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(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.
基金the Science and Technology Major Projects for Major New Drugs, No.2009ZX09102-136
文摘The time window in which a drug is effective varies between drugs. The present study investigated the therapeutic window of Qingkailing injection for focal cerebral ischemia/reperfusion in mice. Animals underwent middle cerebral artery occlusion and were injected with Qingkailing （1.5, 3, 6 mL/kg）. Infarct volume and neurological function were assessed after 24 hours of ischemia. In addition, to establish the therapeutic time window, mice were injected with 3 mL/kg Qingkailing at 0, 1, 3, 4, 6, 9 and 12 hours after occlusion. Results revealed that Qingkailing injection significantly reduced infarct volume and improved neurological function in model mice after cerebral infarction for up to 9 hours, demonstrating that the therapeutic window of Qingkailing injection can extend to 9 hours for cerebral ischemia/reperfusion in mice.
基金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.
基金supported by the National Natural Science Foundation of China,Research on Brain Magnetic Resonance Image Segmentation Based on Particle Computation(No.61672386).
文摘Objective To evaluate the utility of computed tomography perfusion(CTP)both at admission and during delayed cerebral ischemia time-window(DCITW)in the detection of delayed cerebral ischemia(DCI)and the change in CTP parameters from admission to DCITW following aneurysmal subarachnoid hemorrhage.Methods Eighty patients underwent CTP at admission and during DCITW.The mean and extreme values of all CTP parameters at admission and during DCITW were compared between the DCI group and non-DCI group,and comparisons were also made between admission and DCITW within each group.The qualitative color-coded perfusion maps were recorded.Finally,the relationship between CTP parameters and DCI was assessed by receiver operating characteristic(ROC)analyses.Results With the exception of cerebral blood volume(P=0.295,admission;P=0.682,DCITW),there were significant differences in the mean quantitative CTP parameters between DCI and non-DCI patients both at admission and during DCITW.In the DCI group,the extreme parameters were significantly different between admission and DCITW.The DCI group also showed a deteriorative trend in the qualitative color-coded perfusion maps.For the detection of DCI,mean transit time to the center of the impulse response function(Tmax)at admission and mean time to start(TTS)during DCITW had the largest area under curve(AUC),0.698 and 0.789,respectively.Conclusion Whole-brain CTP can predict the occurrence of DCI at admission and diagnose DCI during DCITW.The extreme quantitative parameters and qualitative color-coded perfusion maps can better reflect the perfusion changes of patients with DCI from admission to DCITW.
基金supported by the National Natural Science Foundation of China,No.30960399,and No.81160181
文摘In this study, we established a Wistar rat model of right middle cerebral artery occlusion and observed pathological imaging changes （T2-weighted imaging [T2WI], T2FLAIR, and diffusion-weighted imaging [DWI]） following cerebral infarction. The pathological changes were divided into three phases： early cerebral infarction, middle cerebral infarction, and late cerebral infarction. In the early cerebral infarction phase （less than 2 hours post-infarction）, there was evidence of intracellular edema, which improved after reperfusion. This improvement was defined as the ischemic penumbra. In this phase, a high DWI signal and a low apparent diffusion coefficient were observed in the right basal ganglia region. By contrast, there were no abnormal T2WI and T2FLAIR signals. For the middle cerebral infarction phase （2-4 hours post-infarction）, a mixed edema was observed. After reperfusion, there was a mild improvement in cell edema, while the angioedema became more serious. A high DWI signal and a low apparent diffusion coefficient signal were observed, and some rats showed high T2WI and T2FLAIR signals. For the late cerebral infarction phase （4-6 hours post-infarction）, significant angioedema was visible in the infarction site. After reperfusion, there was a significant increase in angioedema, while there was evidence of hemorrhage and necrosis. A mixed signal was observed on DWI, while a high apparent diffusion coefficient signal, a high T2WI signal, and a high T2FLAIR signal were also observed. All 86 cerebral infarction patients were subjected to T2WI, T2FLAIR, and DWI. MRI results of clinic data similar to the early infarction phase of animal experiments were found in 51 patients, for which 10 patients （10/51） had an onset time greater than 6 hours. A total of 35 patients had MRI results similar to the middle and late infarction phase of animal experiments, of which eight patients （8/35） had an onset time less than 6 hours. These data suggest that defining the ＂therapeutic time window＂ as the time 6 hours after infarction may not be suitable for all patients. Integrated application of MRI sequences including T2WI, T2FLAIR, DW-MRI, and apparent diffusion coefficient mapping should be used to examine the ischemic penumbra, which may provide valuable information for identifying the ＂therapeutic time window＂.
基金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 apop- tosis 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 Ⅱ 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.
基金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 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.
基金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.
基金funded by the National Natural Science Foundation of China(31271654,31471444)the Natural Science Foundation of Jiangsu Province,China(BK20131318)
文摘The development of the cotton fiber is very sensitive to temperature variation, and high temperature stress often causes reduced fiber yield and fiber quality. Short-term high temperature stress often occurs during cotton production, but little is known about the specific timing and duration of stress that affects fiber development. To make this clear, pot experiments were carried in 2014 and 2015 in a climate chamber using cotton cultivars HY370WR（less sensitive variety） and Sumian 15（heat sensitive variety）, which present different temperature sensitivities. Changes of the most important fiber quality indices（i.e., fiber length, fiber strength and marcironaire） and three very important fiber development components（i.e., cellulose, sucrose and callose） were analyzed to define the time window and critical duration to the high temperature stress at 34°C（max38°C/min30°C）. When developing bolls were subjected to 5 days of high temperature stress at different days post-anthesis（DPA）, the changes（Δ%） of fiber length, strength and micronire, as a function of imposed time followed square polynomial eq. as y=a＋bx＋cx^2, and the time around 15 DPA was the most sensitive period for fiber quality development in response to heat stress. When 15 DPA bolls were heat-stressed for different durations（2, 3, 4, 5, 6, 7 days）, the changes（Δ%） of fiber length, strength and micronire, as a function of stress duration followed logistic equations y=A_1-A_2/1＋（x/x_0）~p＋A_2. Referred to that 5, 10 and 15% are usually used as criteria to decide whether techniques are effective or changes are significant in crop culture practice and reguard to the fiber quality indices change range, we suggested that 5% changes of the major fiber quality indices（fiber length, fiber strength and micronaire） and 10% changes of fiber development components（cellulose, sucrose and callose） could be taken as criteria to judge whether fiber development and fiber quality have been significantly affected by high temperature stress. The key time window for cotton fiber development in response to the high temperature stress was 13–19 DPA, and the critical duration was about 5 days.
文摘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.
文摘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＆#39; 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.
