Eric Bourreau¹, Gérard Fleury², Philippe Lacomme^2,*

Journal of Quantum Computing, Vol.6, pp. 25-51, 2024, DOI:10.32604/jqc.2024.048792 - 25 October 2024

Abstract The paper presents a novel quantum method for addressing two fundamental routing problems: the Traveling Salesman Problem (TSP) and the Vehicle Routing Problem (VRP), both central to routing challenges. The proposed method, named the Indirect Quantum Approximate Optimization Algorithm (IQAOA), leverages an indirect solution representation using ranking. Our contribution focuses on two main areas: 1) the indirect representation of solutions, and 2) the integration of this representation into an extended version of QAOA, called IQAOA. This approach offers an alternative to QAOA and includes the following components: 1) a quantum parameterized circuit designed to simulate… More >

Xiaokui Huang¹, Yingbin Xue¹, Aaqil Khan¹, Hanqiao Hu¹, Naijie Feng^1,2,*, Dianfeng Zheng^1,2,*

Phyton-International Journal of Experimental Botany, Vol.92, No.8, pp. 2369-2382, 2023, DOI:10.32604/phyton.2023.027457 - 25 June 2023

Abstract For the purpose of functional validation, the mung bean (Vigna radiata) VrPR gene was cloned and overexpressed in Arabidopsis thaliana. The findings revealed that the ORF of VrPR contained 1200 bp, in which 399 amino acids were encoded. Bioinformatics analysis showed that the VrPR protein belonged to the NADB Rossmann superfamily, which was one of the non-transmembrane hydrophilic proteins. VrPR was assumed to have 44 amino acid phosphorylation sites and be contained in chloroplasts. The VrPR secondary structure comprised of random coil, α helix, β angle, and extended chain, all of which were quite compatible with the anticipated tertiary structure. More >

Jinhui Ge¹, Xiaoliang Liu^{2, *}, Guo Liang³

CMC-Computers, Materials & Continua, Vol.64, No.3, pp. 1945-1958, 2020, DOI:10.32604/cmc.2020.010977 - 30 June 2020

Abstract 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… More >