A Study of Community Group Purchasing Vehicle Routing Problems Considering Service Time Windows

12Citations
Citations of this article
24Readers
Mendeley users who have this article in their library.

Abstract

In this paper, a vehicle routing problem (VRP) model considering delivery time windows and variable service time is established for the delivery problem in community group purchasing. A solution model for an improved ant colony algorithm (ACA) is proposed by improving the initial feasible solution and the neighbourhood search mechanism of the ant colony algorithm. The algorithm of the improved ant colony and the commonly used algorithm are solved for real cases and publicly available benchmark datasets, respectively, for comparative analysis. The results show that the improved ACA has stronger optimization capability, faster convergence speed, and has advantages in solving VRPTW problems with variable service time. The computational efficiency is also improved by 41% over the genetic algorithm (GA) in the solution of the benchmark dataset, which provides a certain reference for solving the community group distribution problem.

Cite

CITATION STYLE

APA

Song, W., Yuan, S., Yang, Y., & He, C. (2022). A Study of Community Group Purchasing Vehicle Routing Problems Considering Service Time Windows. Sustainability (Switzerland), 14(12). https://doi.org/10.3390/su14126968

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free