Cargando…

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

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 proces...

Descripción completa

Detalles Bibliográficos
Autores principales: Cui, Shuxian, Sun, Qian, Zhang, Qian
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Hindawi 2022
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9385335/
https://www.ncbi.nlm.nih.gov/pubmed/35990156
http://dx.doi.org/10.1155/2022/5099008
_version_ 1784769568868139008
author Cui, Shuxian
Sun, Qian
Zhang, Qian
author_facet Cui, Shuxian
Sun, Qian
Zhang, Qian
author_sort Cui, Shuxian
collection PubMed
description 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.
format Online
Article
Text
id pubmed-9385335
institution National Center for Biotechnology Information
language English
publishDate 2022
publisher Hindawi
record_format MEDLINE/PubMed
spelling pubmed-93853352022-08-18 A Time-Dependent Vehicle Routing Problem for Instant Delivery Based on Memetic Algorithm Cui, Shuxian Sun, Qian Zhang, Qian Comput Intell Neurosci Research Article 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. Hindawi 2022-08-10 /pmc/articles/PMC9385335/ /pubmed/35990156 http://dx.doi.org/10.1155/2022/5099008 Text en Copyright © 2022 Shuxian Cui et al. https://creativecommons.org/licenses/by/4.0/This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
spellingShingle Research Article
Cui, Shuxian
Sun, Qian
Zhang, Qian
A Time-Dependent Vehicle Routing Problem for Instant Delivery Based on Memetic Algorithm
title A Time-Dependent Vehicle Routing Problem for Instant Delivery Based on Memetic Algorithm
title_full A Time-Dependent Vehicle Routing Problem for Instant Delivery Based on Memetic Algorithm
title_fullStr A Time-Dependent Vehicle Routing Problem for Instant Delivery Based on Memetic Algorithm
title_full_unstemmed A Time-Dependent Vehicle Routing Problem for Instant Delivery Based on Memetic Algorithm
title_short A Time-Dependent Vehicle Routing Problem for Instant Delivery Based on Memetic Algorithm
title_sort time-dependent vehicle routing problem for instant delivery based on memetic algorithm
topic Research Article
url https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9385335/
https://www.ncbi.nlm.nih.gov/pubmed/35990156
http://dx.doi.org/10.1155/2022/5099008
work_keys_str_mv AT cuishuxian atimedependentvehicleroutingproblemforinstantdeliverybasedonmemeticalgorithm
AT sunqian atimedependentvehicleroutingproblemforinstantdeliverybasedonmemeticalgorithm
AT zhangqian atimedependentvehicleroutingproblemforinstantdeliverybasedonmemeticalgorithm
AT cuishuxian timedependentvehicleroutingproblemforinstantdeliverybasedonmemeticalgorithm
AT sunqian timedependentvehicleroutingproblemforinstantdeliverybasedonmemeticalgorithm
AT zhangqian timedependentvehicleroutingproblemforinstantdeliverybasedonmemeticalgorithm