Skip to content

Author

Senlai Zhu

2 papers indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Open access Jul 2026

Adaptive Large Neighborhood Search Algorithm for Electric Vehicle Routing Problem with Capacitated Charging Stations and Queueing

With growing emphasis on green and low-carbon development and rising urban delivery demand, electric vehicles (EVs) have been increasingly adopted in logistics distribution systems. However, their limited driving range, relatively long charging durations, and the limited capacity of charging stations pose substantial challenges to real-world electric delivery operations. When multiple vehicles arrive at a station with a limited number of chargers, queueing delays may disrupt subsequent customer service and increase total operating costs. To address this issue, this study investigates an electric vehicle routing problem with capacitated charging stations and queueing delays. A mixed-integer linear programming model is formulated, and an enhanced adaptive large neighborhood search (ALNS) algorithm is developed to efficiently solve medium- and large-scale instances. In the proposed model, each vehicle visit to a charging station is represented as a charging event, while finite station capacity is enforced through charging-event assignment and temporal non-overlap constraints. Computational results show that the enhanced ALNS matches the proven optimal solution for the 10-customer instance. For the 15- and 20-customer instances, the best objective values obtained by the enhanced ALNS were 0.39% and 4.84% lower than the corresponding time-limited Gurobi incumbents, respectively. For the 30-, 50-, and 100-customer instances, the enhanced ALNS consistently generates feasible solutions within the prescribed computational budget, whereas Gurobi does not obtain a feasible incumbent within substantially longer time limits. Compared with the baseline ALNS, the enhanced version generally achieves lower mean objective values and more favorable convergence behavior. Sensitivity analyses further show that increasing the number of chargers and improving the charging rate can reduce queueing delays and total charging duration. The proposed approach provides practical decision support for reliable and sustainable urban electric freight operations.

Zhuoti Huang, Senlai Zhu, Yu-Ming Wang · 0 citations
Open access Aug 2026

Integrated Routing and Controlled-Segment Scheduling in Corridor-Based Drone Logistics Systems Under Minimum Headway Constraints

Predefined low-altitude corridors create a coupled routing–scheduling problem when multiple drone routes enter the same controlled segment. This study separates an upstream control hub from its scarce directed hub–segment resource and develops an event-expanded continuous-time mixed-integer linear programming model with optional fleet activation, complete-route energy and capacity checks, release precedence, minimum entry headway, holding, and downstream delay propagation. A headway-aware large neighborhood search (HA-LNS) combines route neighborhoods with a finite serial event decoder. Gurobi proves optimality on three small instances, and fixed-route timing MILPs exactly match the decoder, including for a repeated physical-hub visit. Across ten matched networks per scale, HA-LNS changes the mean objective relative to route-only LNS by 0.01%, 0.90%, and 2.33% at nominal scales 30, 50, and 100. Under high conflict-resource density, the reduction reaches 5.77%, while mean holding falls from 2.054 to 0.025 min. Simulated annealing is 1.04% better at scale 50 and statistically indistinguishable at scales 30 and 100, showing that the contribution is conflict-aware integration rather than universal heuristic dominance. The framework identifies directed-resource density as the main condition under which temporal coordination materially improves route decisions.

Jien Liu, Senlai Zhu · 0 citations