2022
DOI: 10.1155/2022/5099008
|View full text |Cite
|
Sign up to set email alerts
|

A Time-Dependent Vehicle Routing Problem for Instant Delivery Based on Memetic Algorithm

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 varia… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(2 citation statements)
references
References 16 publications
0
2
0
Order By: Relevance
“…Sun et al [35] re-established a dynamic vehicle route planning model for pick-up and delivery according to the impact of four dynamic events on vehicle route planning and distribution services, and they designed a dynamic algorithm framework to solve it. Cui et al [36] proposed a vehicle routing problem model considering two types of customer time windows under time-dependent road networks, and they designed a memetic algorithm combined with genetic algorithm and variable neighborhood search to solve the problem. Bi et al [37] proposed an improved ant lion optimizer (IALO) to solve the problem.…”
Section: Takeout Deliverymentioning
confidence: 99%
“…Sun et al [35] re-established a dynamic vehicle route planning model for pick-up and delivery according to the impact of four dynamic events on vehicle route planning and distribution services, and they designed a dynamic algorithm framework to solve it. Cui et al [36] proposed a vehicle routing problem model considering two types of customer time windows under time-dependent road networks, and they designed a memetic algorithm combined with genetic algorithm and variable neighborhood search to solve the problem. Bi et al [37] proposed an improved ant lion optimizer (IALO) to solve the problem.…”
Section: Takeout Deliverymentioning
confidence: 99%
“…Chen et al (2022) and Wang et al (2020) proposed a hybrid algorithm to enable the platform to respond to instant delivery at the city level. Cui et al (2022) and Y. Zhang et al (2020) respectively established models for optimizing customer satisfaction under the timely delivery service.…”
Section: Literature Reviewmentioning
confidence: 99%