Proceedings of the 2024 7th International Symposium on Traffic Transportation and Civil Architecture (ISTTCA 2024)

<Previous Article In Volume
Next Article In Volume>

A Memetic Algorithm for Vehicle Routing Problem with Fresh Food and Heterogeneous Customer Behavior

Authors
Yankai Zhang1, Kaiqi Zhao1, Na Liu1, Shiyi Xu1, Shiwei Liang1, Wenxuan Shan1, *
1School of Transportation Science and Engineering, Beihang University, Beijing, China
*Corresponding author. Email: shanwenxuan@buaa.edu.cn
Corresponding Author
Wenxuan Shan
Available Online 28 September 2024.
DOI
10.2991/978-94-6463-514-0_59How to use a DOI?
Keywords
Vehicle routing problem; Perishability; Online community group-buying; Split delivery
Abstract

The online community group-buying of fresh products is becoming welcomed by the public. Providing customer fresh products with satisfied quality is concerned by community group-buying distributor, as residents have diverse requirements for delivery times and freshness, often overlooked in existing research. This paper proposes a delivery route optimization model tailored for online community group-buying, addressing the heterogeneous behavior of customers, multiple delivery time windows, and the freshness decline of various fresh products. We introduce a memetic algorithm for this non-linear programming problem, incorporating a Split algorithm to handle multi-commodity delivery and time-varying arc costs. A dynamic allocation scheme for delivery time is developed for optimal fixed sequences, allowing vehicles to wait within a reasonable timeframe. Experimental results demonstrate that our method achieves average reductions of 82.01% and 90.92% in comparison to classical algorithms for instances with 50 and 100 nodes, respectively. Additionally, the proposed algorithm with dynamic allocation shows an average objective function decrease of 0.44% compared to without dynamic allocation. The allowance for waiting during delivery enhances refrigeration conditions, offering significant managerial insights into maintaining product freshness.

Copyright
© 2024 The Author(s)
Open Access
Open Access This chapter is licensed under the terms of the Creative Commons Attribution-NonCommercial 4.0 International License (http://creativecommons.org/licenses/by-nc/4.0/), which permits any noncommercial use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license and indicate if changes were made.

Download article (PDF)

<Previous Article In Volume
Next Article In Volume>
Volume Title
Proceedings of the 2024 7th International Symposium on Traffic Transportation and Civil Architecture (ISTTCA 2024)
Series
Advances in Engineering Research
Publication Date
28 September 2024
ISBN
978-94-6463-514-0
ISSN
2352-5401
DOI
10.2991/978-94-6463-514-0_59How to use a DOI?
Copyright
© 2024 The Author(s)
Open Access
Open Access This chapter is licensed under the terms of the Creative Commons Attribution-NonCommercial 4.0 International License (http://creativecommons.org/licenses/by-nc/4.0/), which permits any noncommercial use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license and indicate if changes were made.

Cite this article

risenwbib
TY  - CONF
AU  - Yankai Zhang
AU  - Kaiqi Zhao
AU  - Na Liu
AU  - Shiyi Xu
AU  - Shiwei Liang
AU  - Wenxuan Shan
PY  - 2024
DA  - 2024/09/28
TI  - A Memetic Algorithm for Vehicle Routing Problem with Fresh Food and Heterogeneous Customer Behavior
BT  - Proceedings of the 2024 7th International Symposium on Traffic Transportation and Civil Architecture (ISTTCA 2024)
PB  - Atlantis Press
SP  - 608
EP  - 623
SN  - 2352-5401
UR  - https://doi.org/10.2991/978-94-6463-514-0_59
DO  - 10.2991/978-94-6463-514-0_59
ID  - Zhang2024
ER  -