Vehicle Coordinated Strategy for Vehicle Routing Problem with Fuzzy Demands

The vehicle routing problem with fuzzy demands (VRPFD) is considered. A fuzzy reasoning constrained program model is formulated for VRPFD, and a hybrid ant colony algorithm is proposed to minimize total travel distance. Specifically, the two-vehicle-paired loop coordinated strategy is presented to reduce the additional distance, unloading times, and waste capacity caused by the service failure due to the uncertain demands. Finally, numerical examples are presented to demonstrate the effectiveness of the proposed approaches

NLO fragmentation functions for a quark into a spin-singlet quarkonium: Same flavor case

In the paper, we calculate the fragmentation functions for $c \to \eta_c$ and $b \to \eta_b$ up to next-to-leading-order (NLO) QCD accuracy. The ultraviolet divergences in the real corrections are removed through operator renormalization under the modified minimal subtraction scheme. We then obtain the fragmentation functions $D_{c \to \eta_c}(z,\mu_F)$ and $D_{b \to \eta_b}(z,\mu_F)$ up to NLO QCD accuracy, which are presented as figures and fitting functions. The numerical results show that the NLO corrections are significant. The sensitives of the fragmentation functions to the renormalization scale and the factorization scale are analyzed explicitly.Comment: 18 pages, 7 figure

Global analysis of measured and unmeasured hadronic two-body weak decays of antitriplet charmed baryons

A large amount of data on hadronic two body weak decays of anti-triplet charmed baryons $T_{c\bar 3}$ to an octet baryon $T_8$ and an octet or singlet pseudoscalar meson $P$, $T_{c \bar 3} \to T_8 P$, have been measured. The SU(3) flavor symmetry has been applied to study these decays to obtain insights about weak interactions for charm physics. However not all such decays needed to determine the SU(3) irreducible amplitudes have been measured forbidding a complete global analysis. Previously, it has been shown that data from measured decays can be used to do a global fit to determine all except one parity violating and one parity conserving amplitudes of the relevant SU(3) irreducible amplitudes causing 8 hadronic two body weak decay channels involving $\Xi^0_c$ to $\eta$ or $\eta'$ transitions undetermined. It is important to obtain information about these decays in order to guide experimental searches. In this work using newly measured decay modes by BESIII and Belle in 2022, we carry out a global analysis and parameterize the unknown amplitudes to provide the ranges for the branching ratios of the 8 undetermined decays. Our results indicate that the SU(3) flavor symmetry can explain the measured data exceptionally well, with a remarkable minimal $\chi^2/d.o.f.$ of 1.21 and predict 80 observables in 45 decays for future experimental data to test. We then vary the unknown SU(3) amplitudes to obtain the allowed range of branching ratios for the 8 undetermined decays. We find that some of them are within reach of near future experimental capabilities. We urge our experimental colleagues to carry out related searches.Comment: 9pages, 2 figures, 3 table

Solution Of Wheeler-De Witt Equation, Potential Well And Tunnel Effect

This paper uses the relation of the cosmic scale factor and scalar field to solve Wheeler-DeWitt equation, gives the tunnel effect of the cosmic scale factor a and quantum potential well of scalar field, and makes it fit with the physics of cosmic quantum birth. By solving Wheeler-DeWitt equation we achieve a general probability distribution of the cosmic birth, and give the analysis of cosmic quantum birth.Comment: 12 page

A Q-learning-based approach for deploying dynamic service function chains

As the size and service requirements of today’s networks gradually increase, large numbers of proprietary devices are deployed, which leads to network complexity, information security crises and makes network service and service provider management increasingly difficult. Network function virtualization (NFV) technology is one solution to this problem. NFV separates network functions from hardware and deploys them as software on a common server. NFV can be used to improve service flexibility and isolate the services provided for each user, thus guaranteeing the security of user data. Therefore, the use of NFV technology includes many problems worth studying. For example, when there is a free choice of network path, one problem is how to choose a service function chain (SFC) that both meets the requirements and offers the service provider maximum profit. Most existing solutions are heuristic algorithms with high time efficiency, or integer linear programming (ILP) algorithms with high accuracy. It’s necessary to design an algorithm that symmetrically considers both time efficiency and accuracy. In this paper, we propose the Q-learning Framework Hybrid Module algorithm (QLFHM), which includes reinforcement learning to solve this SFC deployment problem in dynamic networks. The reinforcement learning module in QLFHM is responsible for the output of alternative paths, while the load balancing module in QLFHM is responsible for picking the optimal solution from them. The results of a comparison simulation experiment on a dynamic network topology show that the proposed algorithm can output the approximate optimal solution in a relatively short time while also considering the network load balance. Thus, it achieves the goal of maximizing the benefit to the service provider