Vehicle routing optimization algorithm based on time windows and dynamic demand

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.

Whole-brain CT Perfusion at Admission and During Delayed Time-window Detects the Delayed Cerebral Ischemia in Patients with Aneurysmal Subarachnoid Hemorrhage

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.

基于Windows/RTX的实时仿测软件设计

针对传统测试软件实时性有限、传统仿真接口软件通用性程度低的问题,为满足半实物仿真软件需兼顾单元测试和控制系统仿真验证的需求,设计了基于Windows/RTX的实时仿测软件。仿测软件采用模块化的设计原则,开发了GUI层人机交互界面和RTX层实时运行程序。为保证实时性,采用无锁循环缓冲区+双线程技术,解决了RTX环境下仿真步长为1 ms时串口数据收发的超时问题;提出一种超时检测算法监测仿真节点的实时状态。借助cJSON优化了测试用例配置文件,用户可以更灵活地编辑测试用例,利用RTW自动代码生成将弹体模型编译集成到RTX仿测软件工程。实验结果表明:该仿测软件有效兼顾了单测与仿真,提高了仿测软件的通用性和二次开发效率,降低了开发难度。

The Influence of the Implementation of Trade Facilitation Systems on the Time Required for Creating Delivery Orders: A Case Study of Tema Port

This study evaluated the impact of Ghana’s Integrated Customs Management System (ICUMS), implemented within the National Single Window initiative, on the efficiency of issuing Delivery Orders (DO) at Tema Port. Filling a gap in the existing literature, the research employed a quantitative approach to assess a specific time-related aspect of the cargo clearance process. Employing an Independent t-test on a dataset spanning 2026 Delivery Orders (924 pre-ICUMS and 1102 post-ICUMS) from July 2020 to July 2023, the study investigated ICUMS’s effectiveness in reducing DO issuance time. Results indicate a noteworthy decrease in average DO issuance time, from 11 days pre-implementation to approximately 9 days post-implementation, a reduction validated by statistical analysis through the independent t-test. In light of these findings, the study recommends ongoing refinement of the implementation, reinforcement of trade facilitation measures, and the adoption of best practices from successful global ports. Continuous stakeholder training and regular assessments of ICUMS performance are also endorsed. The study’s implications support the theoretical framework for Single Window systems and carry significant policy implications, emphasizing the need for collaborative efforts to streamline trade facilitation processes driven by Information Technology. Practically, the results serve as a management tool for stakeholders, highlighting areas for targeted interventions to reduce DO issuance times. Methodologically, this research contributes by applying robust statistical analysis to a specific component within the Time Release Study framework, offering a nuanced understanding of trade facilitation systems’ effectiveness in improving cargo clearance processes.

Improved ant colony optimization for multi-depot heterogeneous vehicle routing problem with soft time windows

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.

基于Real-Time Windows Target状态观测器的实验开发

在Matlab/Simulink中应用Real-Time Windows Target模块重构状态观测器的实时仿真模型,采用该方法开发的实验系统既便于实现,又能和实际物理系统良好对接,有利于学生掌握状态观测器的相关知识和促进对Matlab的了解和应用。给出的应用实例验证了方法的可行性。

Multi-type ant system algorithm for the time dependent vehicle routing problem with time windows

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.

Weapon configuration, allocation and route planning with time windows for multiple unmanned combat air vehicles

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.

Solving Multitrip Pickup and Delivery Problem With Time Windows and Manpower Planning Using Multiobjective Algorithms

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.

A GA approach to vehicle routing problem with time windows considering loading constraints

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.

Research on Vehicle Routing Problem with Soft Time Windows Based on Hybrid Tabu Search and Scatter Search Algorithm

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.

Optimal therapeutic dose and time window of picroside II in cerebral ischemic injury

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.

A metaheuristic method for the multireturn-to-depot petrol truck routing problem with time windows

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.

Generalized multiple time windows model based parallel machine scheduling for TDRSS

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.

An Alternative Algorithm for Vehicle Routing Problem with Time Windows for Daily Deliveries

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 Computing Method with Self-adaptive Time Window Based on Wavelet Transform

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.

Solving open vehicle problem with time window by hybrid column generation 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 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.

Determination of safe mud window considering time-dependent variations of temperature and pore pressure:Analytical and numerical approaches

Wellbore stability is a key to have a successful drilling operation.Induced stresses are the main factors affecting wellbore instability and associated problems in drilling operations.These stresses are significantly impacted by pore pressure variation and thermal stresses in the field.In order to address wellbore instability problems,it is important to investigate the mechanisms of rockefluid interaction with respect to thermal and mechanical aspects.In order to understand the induced stresses,different mathematical models have been developed.In this study,the field equations governing the problem have been derived based on the thermo-poroelastic theory and solved analytically in Laplace domain.The results are transferred to time domain using Fourier inverse method.Finite difference method is also utilized to validate the results.Pore pressure and temperature distributions around the wellbore have been focused and simulated.Next,induced radial and tangential stresses for different cases of cooling and heating of formation are compared.In addition,the differences between thermo-poroelastic and poroelastic models in situation of permeable and impermeable wellbores are described.It is observed that cooling and pore pressure distribution reinforce the induced radial stress.Whereas cooling can be a tool to control and reduce tangential stress induced due to invasion of drilling fluid.In the next step,safe mud window is obtained using Mohr-Coulomb,Mogi-Coulomb,and modified Lade failure criteria for different inclinations.Temperature and pore pressure distributions do not change the minimum allowable wellbore pressure significantly.However,upper limit of mud window is sensitive to induced stresses and it seems vital to consider changes in temperature and pore pressure to avoid any failures.The widest and narrowest mud windows are proposed by modified Lade and Mohr-Coulomb failure criteria,respectively.

To Optimize the Therapeutic Dose and Time Window of Picroside II in Cerebral Ischemic Injury in Rats by Orthogonal Test

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 anti-inflammatory effect of picroside II and the optimizing of therapeutic dose and time window 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.