Wenjing Luan
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Wenjing Luan has a total of 33 co-authors. Here are the top co-authors by number of shared publications:
- Liang Qi
Shandong University of Science and Technology
16 shared publications - Xiwang Guo
College of Information and Control Engineering, Liaoning Petrochemical University, Fushun, China
8 shared publications - Guanjun Liu
Department of Computer Science, Key Laboratory of Embedded System and Service Computing, Ministry of Education, Tongji University, Shanghai, China
3 shared publications - Yuyue Du
College of Computer Science and Engineering, Shandong University of Science and Technology, Qingdao 266590, China
3 shared publications - MengChu Zhou
Macau University of Science and Technology
2 shared publications - Weichen Bai
Shandong University of Science and Technology, China
2 shared publications
Latest Publications
- 24 March 2026
- Published by SAGE Publications in Transportation Research Record: Journal of the Transportation Research Board
- Vol. 2680  (11) , 78-96
Modeling and Control of Slope Bottlenecks in Mixed Traffic Flow Using Cellular Automata
Traffic congestion frequently occurs on slope segments of highways, which are typical bottlenecks. With the development of connected and autonomous vehicle (CAV) technology, CAVs and human-driven vehicles (HDVs) are anticipated to coexist on the same roads in the foreseeable future, thereby transforming the traffic environment from predominantly HDVs to a mixture of CAVs and HDVs. To the best of the authors’ knowledge, no studies address slope bottlenecks on highways in mixed traffic flow. Thus, this paper proposes a traffic flow model for slope bottlenecks incorporating CAV platooning based on cellular automata. A novel traffic flow control strategy for slope bottlenecks is proposed, based on variable speed limits (VSL) and vehicle platooning. Firstly, it divides the upstream section of the slope bottleneck into two zones for implementing VSL and vehicle platooning. Via speed restrictions within the VSL zone, the inflow of vehicles into the vehicle platooning zone is effectively mitigated to create low traffic density. In the vehicle platooning zone, a hybrid vehicle platooning method for mixed scenarios is proposed. Extensive experiments are conducted to validate that the proposed strategy increases the traffic flow of the slope bottleneck, improves the average speed, and alleviates traffic congestion.
- 24 March 2026
- Published by SAGE Publications in Transportation Research Record: Journal of the Transportation Research Board
- Vol. 2680  (11) , 78-96
Modeling and Control of Slope Bottlenecks in Mixed Traffic Flow Using Cellular Automata
Traffic congestion frequently occurs on slope segments of highways, which are typical bottlenecks. With the development of connected and autonomous vehicle (CAV) technology, CAVs and human-driven vehicles (HDVs) are anticipated to coexist on the same roads in the foreseeable future, thereby transforming the traffic environment from predominantly HDVs to a mixture of CAVs and HDVs. To the best of the authors’ knowledge, no studies address slope bottlenecks on highways in mixed traffic flow. Thus, this paper proposes a traffic flow model for slope bottlenecks incorporating CAV platooning based on cellular automata. A novel traffic flow control strategy for slope bottlenecks is proposed, based on variable speed limits (VSL) and vehicle platooning. Firstly, it divides the upstream section of the slope bottleneck into two zones for implementing VSL and vehicle platooning. Via speed restrictions within the VSL zone, the inflow of vehicles into the vehicle platooning zone is effectively mitigated to create low traffic density. In the vehicle platooning zone, a hybrid vehicle platooning method for mixed scenarios is proposed. Extensive experiments are conducted to validate that the proposed strategy increases the traffic flow of the slope bottleneck, improves the average speed, and alleviates traffic congestion.
- 13 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Social Systems
- Vol. 13  (3) , 3629-3642
GDB-TR: Graph-Based Double-Layer Bidirectional Model for Query-Based Trip Recommendation
Query-based trip recommendation is an important task in location-based services (LBS), which aims to provide users with a sequence of points of interest (POIs) based on their queries. In trip recommendation, the effect of the visited POIs on the following decisions of users, called a forward effect, is mined by the existing studies. However, the effect of the following POIs on the previously visited ones, called a reverse effect, receives no attention. Therefore, this work proposes a graph-based double-layer bidirectional model for trip recommendation (GDB-TR), which is designed to mine both forward and reverse effects through bidirectional computation. Forward computation explores the influence of user’s history preferences on the next choice; reverse computation explores the influence of future goals on the current decision. Specifically, the model uses a heterogeneous graph to model users’ check-in trajectories with spatial and temporal information. Subgraphs are extracted from the heterogeneous graph, and an adjacency matrix is built for each subgraph. Vector representations of POIs and POI categories are obtained by fusing matrices based on a neural network. The double-layer bidirectional neural network is used to recommend a trip based on the user query, with one layer mining users’ preferences for POIs and the other layer mining the preferences for POI categories. Bidirectional computation is performed between the initial and destination nodes in each layer, capturing both forward and reverse effects. Specifically, a forward computation mines the influence of preceding POIs or POI categories on following ones, while a reverse computation does that reversely. Finally, experiments are conducted on five popular real data sets. The results show that GDB-TR outperforms all baseline models on F 1 and pairs-F 1 values, which validates the effectiveness of the proposed approach.
- 13 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Social Systems
- Vol. 13  (3) , 3629-3642
GDB-TR: Graph-Based Double-Layer Bidirectional Model for Query-Based Trip Recommendation
Query-based trip recommendation is an important task in location-based services (LBS), which aims to provide users with a sequence of points of interest (POIs) based on their queries. In trip recommendation, the effect of the visited POIs on the following decisions of users, called a forward effect, is mined by the existing studies. However, the effect of the following POIs on the previously visited ones, called a reverse effect, receives no attention. Therefore, this work proposes a graph-based double-layer bidirectional model for trip recommendation (GDB-TR), which is designed to mine both forward and reverse effects through bidirectional computation. Forward computation explores the influence of user’s history preferences on the next choice; reverse computation explores the influence of future goals on the current decision. Specifically, the model uses a heterogeneous graph to model users’ check-in trajectories with spatial and temporal information. Subgraphs are extracted from the heterogeneous graph, and an adjacency matrix is built for each subgraph. Vector representations of POIs and POI categories are obtained by fusing matrices based on a neural network. The double-layer bidirectional neural network is used to recommend a trip based on the user query, with one layer mining users’ preferences for POIs and the other layer mining the preferences for POI categories. Bidirectional computation is performed between the initial and destination nodes in each layer, capturing both forward and reverse effects. Specifically, a forward computation mines the influence of preceding POIs or POI categories on following ones, while a reverse computation does that reversely. Finally, experiments are conducted on five popular real data sets. The results show that GDB-TR outperforms all baseline models on F 1 and pairs-F 1 values, which validates the effectiveness of the proposed approach.
- 19 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 27  (4) , 4672-4686
Modeling and Optimization of a Share-a-Ride Problem With Flexible Pick-Up and Drop-Off Points
A share-a-ride problem (SARP), which integrates the transportation of both passengers and parcels by the ride-hailing platforms such as Uber and Lyft, has drawn considerable attention. This work introduces a novel share-a-ride problem with flexible pick-up and drop-off points (SARP-FUO) with the objectives of maximizing the total revenue of the ride-hailing platforms and minimizing the total travel distance of vehicles. A mixed integer programming model is developed to formulate SARP-FUO. Then, a knowledge-based multi-objective brain storm optimization algorithm (KM-BSO) is proposed to solve it. Two knowledge-based local search operators are specifically designed to enhance the exploration capability of KM-BSO for identifying potential nondominated solutions. The first operator employs a dynamic programming algorithm to readjust pick-up and drop-off points, while the second modifies vehicle routes based on four derived properties. Extensive experiments are conducted to compare KM-BSO with nondominated sorting genetic algorithm II, multi-objective evolutionary algorithm based on decomposition, multi-objective artificial bee colony algorithm, and a mathematical programming solver CPLEX. The results and statistical analysis demonstrate the superiority of the proposed approach in solving the studied problem. Finally, a sensitivity analysis is performed with and without flexible pick-up and drop-off points, demonstrating the advantages of the proposed model in developing intelligent public transportation systems.
- 19 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 27  (4) , 4672-4686
Modeling and Optimization of a Share-a-Ride Problem With Flexible Pick-Up and Drop-Off Points
A share-a-ride problem (SARP), which integrates the transportation of both passengers and parcels by the ride-hailing platforms such as Uber and Lyft, has drawn considerable attention. This work introduces a novel share-a-ride problem with flexible pick-up and drop-off points (SARP-FUO) with the objectives of maximizing the total revenue of the ride-hailing platforms and minimizing the total travel distance of vehicles. A mixed integer programming model is developed to formulate SARP-FUO. Then, a knowledge-based multi-objective brain storm optimization algorithm (KM-BSO) is proposed to solve it. Two knowledge-based local search operators are specifically designed to enhance the exploration capability of KM-BSO for identifying potential nondominated solutions. The first operator employs a dynamic programming algorithm to readjust pick-up and drop-off points, while the second modifies vehicle routes based on four derived properties. Extensive experiments are conducted to compare KM-BSO with nondominated sorting genetic algorithm II, multi-objective evolutionary algorithm based on decomposition, multi-objective artificial bee colony algorithm, and a mathematical programming solver CPLEX. The results and statistical analysis demonstrate the superiority of the proposed approach in solving the studied problem. Finally, a sensitivity analysis is performed with and without flexible pick-up and drop-off points, demonstrating the advantages of the proposed model in developing intelligent public transportation systems.
- 4 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 26  (12) , 22524-22537
Optimization of Robotaxi Dispatch With Pick-Up/Drop-Off-Point and Boarding-Time Recommendation
With the advancement of vehicular automation and communication technology, autonomous driving has emerged as a significant trend in future transportation. Robotaxis, an innovative mode of transportation that integrates robotics and artificial intelligence, are anticipated to become widely used, thereby revolutionizing urban mobility. This work proposes a multi-objective mixed integer programming model for robotaxi dispatch. Unlike previous approaches, it can recommend passengers’ pick-up points, drop-off points, and boarding time (BT) that may deviate from their initial origins, destinations, and BT, respectively. It encourages passengers to accept the recommended pick-up and drop-off (UO) points or to be picked up slightly earlier or later. The objectives are to maximize the profit per kilometer of robotaxis and to minimize the total travel expense of passengers. Subsequently, a nondominated sorting genetic algorithm with mass center (NSGA-MC) is proposed to solve the model. It outperforms nondominated sorting genetic algorithm II (NSGA-II) and multi-objective evolutionary algorithm based on decomposition (MOEA/D) across several metrics. Some instances provide detailed results that illustrate the effectiveness of the proposed algorithm. Additionally, a sensitivity analysis is performed, comparing scenarios with and without UO-point and boarding-time recommendations. An experiment is also conducted to examine various recommendation acceptance rates, demonstrating the advantages of the proposed model in developing intelligent public transportation systems.
- 4 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 26  (12) , 22524-22537
Optimization of Robotaxi Dispatch With Pick-Up/Drop-Off-Point and Boarding-Time Recommendation
With the advancement of vehicular automation and communication technology, autonomous driving has emerged as a significant trend in future transportation. Robotaxis, an innovative mode of transportation that integrates robotics and artificial intelligence, are anticipated to become widely used, thereby revolutionizing urban mobility. This work proposes a multi-objective mixed integer programming model for robotaxi dispatch. Unlike previous approaches, it can recommend passengers’ pick-up points, drop-off points, and boarding time (BT) that may deviate from their initial origins, destinations, and BT, respectively. It encourages passengers to accept the recommended pick-up and drop-off (UO) points or to be picked up slightly earlier or later. The objectives are to maximize the profit per kilometer of robotaxis and to minimize the total travel expense of passengers. Subsequently, a nondominated sorting genetic algorithm with mass center (NSGA-MC) is proposed to solve the model. It outperforms nondominated sorting genetic algorithm II (NSGA-II) and multi-objective evolutionary algorithm based on decomposition (MOEA/D) across several metrics. Some instances provide detailed results that illustrate the effectiveness of the proposed algorithm. Additionally, a sensitivity analysis is performed, comparing scenarios with and without UO-point and boarding-time recommendations. An experiment is also conducted to examine various recommendation acceptance rates, demonstrating the advantages of the proposed model in developing intelligent public transportation systems.
- 6 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 26  (1) , 878-891
Multi-Objective Optimization for Robotaxi Dispatch With Safety-Carpooling Mode in Pandemic Era
Autonomous driving has been successfully implemented in such particular areas as logistics distribution centers, container terminals, and university campuses. Robotaxi represents one of its important applications. This work studies a robotaxi dispatch problem during the pandemic era. It aims to design a robotaxi dispatch approach according to a defined severity degree of the pandemic, which can decrease a virus infection rate by reducing contact among passengers. It develops a multi-objective optimization model to minimize travel cost of robotaxis, waiting time of both robotaxis and passengers, and contact among passengers. A two-stage nondominated sorting genetic algorithm (NSGA-TS) is proposed to solve the problem. Three operations are designed to generate new solutions, which can ensure its solution diversity and speed up its convergence. Its effectiveness is verified via its comparison with two popular multi-objective optimization algorithms, i.e., multi-objective evolutionary algorithm based on decomposition (MOEA/D) and nondominated sorting genetic algorithm II (NSGA-II). Experimental results show that the proposed model can effectively reduce travel cost and waiting time. Besides, it can reduce the virus infection rate by decreasing contact among passengers at different severity degrees of the pandemic. This work is conducive for our society to building intelligent transportation systems in the post-pandemic era.
- 6 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 26  (1) , 878-891
Multi-Objective Optimization for Robotaxi Dispatch With Safety-Carpooling Mode in Pandemic Era
Autonomous driving has been successfully implemented in such particular areas as logistics distribution centers, container terminals, and university campuses. Robotaxi represents one of its important applications. This work studies a robotaxi dispatch problem during the pandemic era. It aims to design a robotaxi dispatch approach according to a defined severity degree of the pandemic, which can decrease a virus infection rate by reducing contact among passengers. It develops a multi-objective optimization model to minimize travel cost of robotaxis, waiting time of both robotaxis and passengers, and contact among passengers. A two-stage nondominated sorting genetic algorithm (NSGA-TS) is proposed to solve the problem. Three operations are designed to generate new solutions, which can ensure its solution diversity and speed up its convergence. Its effectiveness is verified via its comparison with two popular multi-objective optimization algorithms, i.e., multi-objective evolutionary algorithm based on decomposition (MOEA/D) and nondominated sorting genetic algorithm II (NSGA-II). Experimental results show that the proposed model can effectively reduce travel cost and waiting time. Besides, it can reduce the virus infection rate by decreasing contact among passengers at different severity degrees of the pandemic. This work is conducive for our society to building intelligent transportation systems in the post-pandemic era.
- Open Access
- 21 December 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 12, 1092-1101
Large-Scale Traffic Signal Control Based on Multi-Agent Q-Learning and Pressure
Traffic congestion has become an increasingly severe problem and needs to be solved urgently. Reinforcement learning (RL) is an advanced data-driven approach for large-scale adaptive traffic signal control (ATSC) in the complex urban traffic network. The decentralized multi-agent RL (MARL) framework is feasible for multi-intersection scenarios. However, the environment becomes partially observable and nonstationary without effective communication among agents from the perspective of each local agent. Previous studies solve this problem by improving the observation of each local agent and using a spatial discount factor. In this paper, we are motivated by achieving coordination among intersections in the RL settings and better performance in ATSC and solve the problem of traffic signal control at multiple intersections in large-scale networks based on RL techniques. Pressure is used as an indicator to represent the traffic conditions of an intersection considering its neighbor intersections. A new reward function with pressure and vehicle waiting time is designed to achieve coordination among intersections. The above three control policies are innovatively applied to a multi-agent Q-learning method for ATSC at multiple intersections. Experiments are carried out on a large synthetic traffic grid under simulated peak-hour traffic dynamics. Results demonstrate that our approach outperforms the state-of-the-art decentralized MARL algorithms in average queue length and intersection delay.
- 21 December 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 12, 1092-1101
Open AccessLarge-Scale Traffic Signal Control Based on Multi-Agent Q-Learning and Pressure
Traffic congestion has become an increasingly severe problem and needs to be solved urgently. Reinforcement learning (RL) is an advanced data-driven approach for large-scale adaptive traffic signal control (ATSC) in the complex urban traffic network. The decentralized multi-agent RL (MARL) framework is feasible for multi-intersection scenarios. However, the environment becomes partially observable and nonstationary without effective communication among agents from the perspective of each local agent. Previous studies solve this problem by improving the observation of each local agent and using a spatial discount factor. In this paper, we are motivated by achieving coordination among intersections in the RL settings and better performance in ATSC and solve the problem of traffic signal control at multiple intersections in large-scale networks based on RL techniques. Pressure is used as an indicator to represent the traffic conditions of an intersection considering its neighbor intersections. A new reward function with pressure and vehicle waiting time is designed to achieve coordination among intersections. The above three control policies are innovatively applied to a multi-agent Q-learning method for ATSC at multiple intersections. Experiments are carried out on a large synthetic traffic grid under simulated peak-hour traffic dynamics. Results demonstrate that our approach outperforms the state-of-the-art decentralized MARL algorithms in average queue length and intersection delay.
- 1 October 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 5154-5159
Optimization of a Robotaxi Dispatch Problem in Pandemic Era
Autonomous driving has been successfully realized in particular areas such as logistics distribution centers, container terminals, and university campuses. Robotaxi could be another potential application in the near future. This work studies a robotaxi dispatch problem during the pandemic time. It proposes a multi-objective optimization model to minimize the number, waiting time, and driving distance of the robotaxis. Besides, a dispatch strategy is innovatively designed according to a defined severity degree of the pandemic. A virus infection rate can be decreased by reducing contact among passengers. A two-stage nondominated sorting genetic algorithm (NSGA-TS) is proposed to solve the problem. Three operations are used to generate offspring solutions, which can ensure the diversity of the population and speed up the convergence of the algorithm. The effectiveness of NSGA-TS is verified compared with two popular multi-objective optimization algorithms, i.e., multi-objective evolutionary algorithm based on decomposition (MOEA/D) and nondominated sorting genetic algorithm II (NSGA-II). Experimental results show that the proposed model performs well on the studied problem. It can reduce the virus infection rate by decreasing contact among passengers at different risk levels of the pandemic while accomplishing passenger orders. This work is conducive to society building intelligent transportation in the post-pandemic era.
- 1 October 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 5154-5159
Optimization of a Robotaxi Dispatch Problem in Pandemic Era
Autonomous driving has been successfully realized in particular areas such as logistics distribution centers, container terminals, and university campuses. Robotaxi could be another potential application in the near future. This work studies a robotaxi dispatch problem during the pandemic time. It proposes a multi-objective optimization model to minimize the number, waiting time, and driving distance of the robotaxis. Besides, a dispatch strategy is innovatively designed according to a defined severity degree of the pandemic. A virus infection rate can be decreased by reducing contact among passengers. A two-stage nondominated sorting genetic algorithm (NSGA-TS) is proposed to solve the problem. Three operations are used to generate offspring solutions, which can ensure the diversity of the population and speed up the convergence of the algorithm. The effectiveness of NSGA-TS is verified compared with two popular multi-objective optimization algorithms, i.e., multi-objective evolutionary algorithm based on decomposition (MOEA/D) and nondominated sorting genetic algorithm II (NSGA-II). Experimental results show that the proposed model performs well on the studied problem. It can reduce the virus infection rate by decreasing contact among passengers at different risk levels of the pandemic while accomplishing passenger orders. This work is conducive to society building intelligent transportation in the post-pandemic era.
- 1 October 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1579-1584
A Novel Approach for Smoothing the Path of Emergency Vehicles in Urban Areas
Emergency vehicles (EVs) are crucial in responding to time-critical events such as traffic accidents, medical emergencies, and fires in urban areas. Most traffic control approaches try to reduce the travel time of EVs by giving them the highest road-use priority, which may cause delays for other nearby traffic participants and reduce the smoothness of normal traffic. This work proposes a novel approach to reduce both the travel time of an EV and the negative impact on normal traffic by dynamically evacuating traffic adjacent to an emergency path. The approach periodically acquires a subnet for each road segment of the emergency path based on dynamic traffic conditions. Regular vehicles on the subnet are restricted from using the emergency path, which minimizes the time for emergency service delivery. The experimental results show that the proposed approach outperforms the existing approach in many metrics, such as the travel time of the EV and the additional delay of normal traffic. In addition, this work performs sensitivity analysis on regular vehicles' compliance rate to evacuation. The experimental results show the superiority of the proposed approach at different compliance rates.
- 1 October 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1579-1584
A Novel Approach for Smoothing the Path of Emergency Vehicles in Urban Areas
Emergency vehicles (EVs) are crucial in responding to time-critical events such as traffic accidents, medical emergencies, and fires in urban areas. Most traffic control approaches try to reduce the travel time of EVs by giving them the highest road-use priority, which may cause delays for other nearby traffic participants and reduce the smoothness of normal traffic. This work proposes a novel approach to reduce both the travel time of an EV and the negative impact on normal traffic by dynamically evacuating traffic adjacent to an emergency path. The approach periodically acquires a subnet for each road segment of the emergency path based on dynamic traffic conditions. Regular vehicles on the subnet are restricted from using the emergency path, which minimizes the time for emergency service delivery. The experimental results show that the proposed approach outperforms the existing approach in many metrics, such as the travel time of the EV and the additional delay of normal traffic. In addition, this work performs sensitivity analysis on regular vehicles' compliance rate to evacuation. The experimental results show the superiority of the proposed approach at different compliance rates.
- Open Access
- 12 October 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 10, 109729-109742
State-of-the-Art Review on Traffic Control Strategies for Emergency Vehicles
Emergency vehicles (EVs) play an essential role in emergency services. One of the most intuitive indicators of the emergency service process is the response time of EVs. This survey reviews the latest traffic control strategies to reduce response time during EV’s traveling. Firstly, it classifies traffic control strategies into route optimization, signal preemption, lane reservation, and mixed traffic control strategies. Then, a systematic literature review of traffic control strategies with different algorithms is presented. Besides, this survey classifies the articles by objective metrics. In addition to response time, several other objective metrics are summarized. Finally, this survey reviews the limitations of existing emergency traffic control strategies and critically analyzes them. Based on this, it indicates the core problems and proposes potential research areas to be explored.
- 12 October 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 10, 109729-109742
Open AccessState-of-the-Art Review on Traffic Control Strategies for Emergency Vehicles
Emergency vehicles (EVs) play an essential role in emergency services. One of the most intuitive indicators of the emergency service process is the response time of EVs. This survey reviews the latest traffic control strategies to reduce response time during EV’s traveling. Firstly, it classifies traffic control strategies into route optimization, signal preemption, lane reservation, and mixed traffic control strategies. Then, a systematic literature review of traffic control strategies with different algorithms is presented. Besides, this survey classifies the articles by objective metrics. In addition to response time, several other objective metrics are summarized. Finally, this survey reviews the limitations of existing emergency traffic control strategies and critically analyzes them. Based on this, it indicates the core problems and proposes potential research areas to be explored.
- Open Access
- 10 May 2022
- Published by MDPI AG in Applied Sciences
- Vol. 12  (10) , 4820
Double-Cycling AGV Scheduling Considering Uncertain Crane Operational Time at Container Terminals
Container terminals (CTs) play an important role in the modern logistics and transportation industry. The utilization of automated guided vehicles (AGVs) can be effectively facilitated by reducing their empty running. The existing strategies cannot guarantee the full load of AGVs during their transportation because of the complex constraints of container scheduling. This work proposes a double-cycling AGV scheduling model that ensures a full load of AGVs between the quayside and the yard. The objective is to minimize the total waiting time of AGVs and ensure a high loading rate of AGVs by scheduling loading/unloading containers. Furthermore, it takes the randomness of the quay crane’s operational time into consideration. By assigning a time interval to AGVs’ arrival at a quayside, a container scheduling sequence is obtained based on a Hybrid Particle Swarm Optimization (HPSO) algorithm with a penalty function. Via experiments, it shows that the proposed model can obtain the least number of AGVs for container transportation, minimize AGVs’ total waiting time, and ensure the high loading rate of AGVs.
- 10 May 2022
- Published by MDPI AG in Applied Sciences
- Vol. 12  (10) , 4820
Open AccessDouble-Cycling AGV Scheduling Considering Uncertain Crane Operational Time at Container Terminals
Container terminals (CTs) play an important role in the modern logistics and transportation industry. The utilization of automated guided vehicles (AGVs) can be effectively facilitated by reducing their empty running. The existing strategies cannot guarantee the full load of AGVs during their transportation because of the complex constraints of container scheduling. This work proposes a double-cycling AGV scheduling model that ensures a full load of AGVs between the quayside and the yard. The objective is to minimize the total waiting time of AGVs and ensure a high loading rate of AGVs by scheduling loading/unloading containers. Furthermore, it takes the randomness of the quay crane’s operational time into consideration. By assigning a time interval to AGVs’ arrival at a quayside, a container scheduling sequence is obtained based on a Hybrid Particle Swarm Optimization (HPSO) algorithm with a penalty function. Via experiments, it shows that the proposed model can obtain the least number of AGVs for container transportation, minimize AGVs’ total waiting time, and ensure the high loading rate of AGVs.