Related Experiment Video
Updated: Aug 31, 2025

Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit
Published on: September 8, 2023
A Time-Dependent Vehicle Routing Problem for Instant Delivery Based on Memetic Algorithm
Shuxian Cui1, Qian Sun1, Qian Zhang1
1School of E-business and Logistics, Beijing Technology and Business University, Beijing 100048, China.
Abstract:
Instant delivery is an intermediary bridge for same-city O2O services and an important part of urban short-distance logistics. The route planning and scheduling of instant delivery need to balance cost and customer satisfaction and consider the impact of traffic conditions on the distribution process. In this paper, we propose a vehicle routing problem model considering two types of customer time windows under time-dependent road networks and design a memetic algorithm combined with genetic algorithm and variable neighborhood search to solve the problem. By comparing the results of the different time periods and conducting sensitivity analysis for the two types of customer time windows, the effectiveness of the model and algorithm is verified.
Related Concept Videos
Distributed Loads: Problem Solving
Short-distance Transport of Resources
Social Traps
Introduction to Membrane Traffic
The transport of soluble and membrane proteins is mediated by transport vesicles that collect cargo from one cellular compartment and deliver it to another by fusing with the target organelle membrane. The Rab...
Regulated mRNA Transport
Mutation, Gene Flow, and Genetic Drift

