Qizhang Luo

Prof. Qizhang Luo

orcid

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
20 June 2022 in IEEE Transactions on Intelligent Transportation Systems
Verified
Journal Article
Closed access
GWGuohua Wu
Guohua Wu
NMNi Mao
Ni Mao
QLQizhang Luo
Qizhang Luo
BXBinjie Xu
Binjie Xu
JSJianmai Shi
Jianmai Shi
PSPonnuthurai Nagaratnam Suganthan
Ponnuthurai Nagaratnam Suganthan
The COVID-19 pandemic calls for contactless deliveries. To prevent the further spread of the disease and ensure the timely delivery of supplies, this paper investigates a collaborative truck-drone routing problem for contactless parcel delivery (CRP-T&D), which allows multiple trucks and multiple drones to deliver parcels cooperatively in epidemic areas. We formulate a mixed-integer programming model that minimizes the delivery time, with the consideration of the energy consumption model of drones. To solve CRP-T&D, we develop an improved variable neighborhood descent (IVND) that combines the Metropolis acceptance criterion of Simulated Annealing (SA) and the tabu list of Tabu Search (TS). Meanwhile, the integration of K-means clustering and Nearest neighbor strategy is applied to generate the initial solution. To evaluate the performance of IVND, experiments are conducted by comparing IVND with VND, SA, TS, variants of VND, and large neighborhood search (LNS) on instances with different scales. Several critical factors are tested to verify the robustness of IVND. Moreover, the experimental results on a practical instance further demonstrate the superior performance of IVND.

19 October 2021 in IEEE Transactions on Intelligent Transportation Systems
Verified
Journal Article
Closed access
QLQizhang Luo
Qizhang Luo
GWGuohua Wu
Guohua Wu
Bin JiBin Ji
Bin Ji
LWLing Wang
Ling Wang
PSPonnuthurai Nagaratnam Suganthan
Ponnuthurai Nagaratnam Suganthan
The collaboration of drones and trucks for last-mile delivery has attracted much attention. In this paper, we address a collaborative routing problem of the truck-drone system, in which a truck collaborates with multiple drones to perform parcel deliveries and each customer can be served earlier and later than the required time with a given tolerance. To meet the practical demands of logistics companies, we build a multi-objective optimization model that minimizes total distribution cost and maximizes overall customer satisfaction simultaneously. We propose a hybrid multi-objective genetic optimization approach incorporated with a Pareto local search algorithm to solve the problem. Particularly, we develop a greedy-based heuristic method to create initial solutions and introduce a problem-specific solution representation, genetic operations, as well as six heuristic neighborhood strategies for the hybrid algorithm. Besides, an adaptive strategy is adopted to further balance the convergence and the diversity of the hybrid algorithm. The performance of the proposed algorithm is evaluated by using a set of benchmark instances. The experimental results show that the proposed algorithm outperforms three competitors. Furthermore, we investigate the sensitivity of the proposed model and hybrid algorithm based on a real-world case in Changsha city, China.

19 April 2023 in IEEE Transactions on Intelligent Transportation Systems
Verified
Journal Article
Closed access
QLQizhang Luo
Qizhang Luo
GWGuohua Wu
Guohua Wu
ATAnupam Trivedi
Anupam Trivedi
FHFangyu Hong
Fangyu Hong
LWLing Wang
Ling Wang
DSDipti Srinivasan
Dipti Srinivasan
To efficiently implement the truck-drone collaborative logistics system, we introduce a multi-objective truck-drone collaborative routing problem with delivery and pick-up services (MCRP-DP). A truck collaborating with a fleet of drones serves three types of customers that require delivery, pick-up, and simultaneous delivery & pick-up services, respectively. Different from most of the existing studies where the drone visits only one customer in a flight, we allow the drone to serve another customer requiring pick-up service when it completes a delivery service. Meanwhile, we simultaneously optimize three objectives: transportation costs, waiting time of vehicles (i.e., truck and drone), and service reliability. To solve MCRP-DP, we propose an objective space decomposition-based multi-objective evolutionary algorithm with adaptive resource allocation (ODEA-ARA) In ODEA-ARA, an objective space decomposition strategy is used to maintain the diversity while an adaptive resource allocation strategy is designed to improve convergence. We design an ensemble of relative improvement and relative contribution to assist the resource allocation and a variable neighborhood Pareto local search integrating 7 problem-specific neighborhood structures to improve the solution. Extensive computational experiments are carried out to evaluate the performance of ODEA-ARA. The experimental results show that ODEA-ARA outperforms its competitors. Meanwhile, several useful managerial insights are presented.

22 March 2022 in IEEE Transactions on Aerospace and Electronic Systems
Verified
Journal Article
Closed access
GWGuohua Wu
Guohua Wu
QLQizhang Luo
Qizhang Luo
XDXiao Du
Xiao Du
YCYingguo Chen
Yingguo Chen
PSPonnuthurai Nagaratnam Suganthan
Ponnuthurai Nagaratnam Suganthan
XWXinwei Wang
Xinwei Wang
Satellite observation scheduling plays a significant role in improving the efficiency of Earth observation systems. To solve the large-scale multisatellite observation scheduling problem, this article proposes an ensemble of metaheuristic and exact algorithms based on a divide-and-conquer framework (EHE-DCF), including a task allocation phase and a task scheduling phase. In the task allocation phase, each task is allocated to a proper orbit based on a metaheuristic incorporated with a probabilistic selection and a tabu mechanism derived from ant colony optimization and tabu search, respectively. In the task scheduling phase, we construct a task scheduling model for every single orbit and solve the model by using an exact method (i.e., branch and bound, B&B). The task allocation and task scheduling phases are performed iteratively to obtain a promising solution. To validate the performance of the EHE-DCF, we compare it with B&B, three divide-and-conquer-based metaheuristics, and a state-of-the-art metaheuristic. Experimental results show that the EHE-DCF can obtain higher scheduling profits and complete more tasks compared with existing algorithms. The EHE-DCF is especially efficient for large-scale satellite observation scheduling problems.

9 May 2023 in IEEE Transactions on Intelligent Transportation Systems
Verified
Journal Article
Closed access
FHFangyu Hong
Fangyu Hong
GWGuohua Wu
Guohua Wu
QLQizhang Luo
Qizhang Luo
HLHuan Liu
Huan Liu
XFXiaoping Fang
Xiaoping Fang
WPWitold Pedrycz
Witold Pedrycz
The application of drones in last-mile distribution has been a contentious research topic in recent years. Existing urban distribution modes mostly depend on trucks. This paper proposes a novel package pickup and delivery mode and system wherein multiple drones collaborate with automatic devices. The proposed mode uses free areas on top of residential buildings to set automatic devices as delivery and pickup points of packages, and employs drones to transport packages between buildings and depots. The integrated scheduling problem of package drop-pickup considering m -drones, m -depots, and m -customers is crucial for the system. Therefore, we propose a simulated-annealing-based two-phase optimization (SATO) approach to solve this problem. In the first phase, tasks are allocated to depots for serving, such that the initial problem is decomposed into multiple single-depot scheduling problems with m -drone. In the second phase, considering the drone capability and task demand constraints, we generated a route-planning scheme for drones in each depot. Concurrently, an improved variable neighborhood descent (IVND) algorithm was designed in the first phase to reallocate tasks, and a local search (LS) algorithm was proposed to search for high-quality solutions in the second phase. Finally, extensive experiments and comparative studies were conducted to verify the effectiveness of the proposed approach.

22 December 2020 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
XCXinjiang Chen
Xinjiang Chen
XLXiamiao Li
Xiamiao Li
XWXinwei Wang
Xinwei Wang
QLQizhang Luo
Qizhang Luo
GWGuohua Wu
Guohua Wu
The increasing demands for space-based data transmission pose a great challenge to task scheduling of tracking and data relay satellites (TDRSs). In order to improve the working efficiency and task completion rate of the data relay satellite network (DRSN), for the first time, we propose a novel application mode for DRSN, in which data breakpoint transmission is considered. In the mode of data breakpoint transmission, a single task can be reasonably split into multiple subtasks and thus scheduled in multiple time windows. At first, the task scheduling model of DRSN considering breakpoint transmission is defined. In addition, a two-stage method is designed to generate a high-quality initial solution. Moreover, we propose an adaptive variable neighborhood descent combined with a tabu list (AVND-TL) to iteratively improve the initial solution. In AVND-TL, two task reallocation neighborhood structures are incorporated and adaptively selected during the solution search process, which effectively prevent the algorithm from falling into local optimum. Finally, extensive experiments are carried out to verify that the proposed breakpoint transmission mode and AVND-TL together can significantly improve the task completion rate and resource utilization rate.