2022
DOI: 10.1016/j.cie.2021.107887
|View full text |Cite
|
Sign up to set email alerts
|

VRP variants applicable to collecting donations and similar problems: A taxonomic review

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0
1

Year Published

2022
2022
2025
2025

Publication Types

Select...
6
3

Relationship

0
9

Authors

Journals

citations
Cited by 19 publications
(7 citation statements)
references
References 125 publications
0
6
0
1
Order By: Relevance
“…The ship speed optimization problem with a time window refers to a more complex class of VRP problems in which not only the quantity of cargo demanded by each customer should be considered when developing a transportation route and cargo ships should not be overloaded, but also the requirements of each customer for cargo reception time [19].…”
Section: Modeling Of Cw Saving Algorithm With Time Windowsmentioning
confidence: 99%
“…The ship speed optimization problem with a time window refers to a more complex class of VRP problems in which not only the quantity of cargo demanded by each customer should be considered when developing a transportation route and cargo ships should not be overloaded, but also the requirements of each customer for cargo reception time [19].…”
Section: Modeling Of Cw Saving Algorithm With Time Windowsmentioning
confidence: 99%
“…Hence, it is important to clarify how to arrange a special vehicle, that is, select feasible nodes from all massive-cargo transportation nodes and determine the order of the vehicle visiting these nodes, so as to transport massive cargos from the origin to the destination. Without loss of generality, the model assumes that: (1) The random interference of the traffic network and the impact of the time window of massive cargos on massive-cargo transportation routes are not considered; (2) The conflicts between multiple massive-cargo logistics transportation routes are ignored; (3) The throughput capacity information of massivecargo transportation networks is obtained in advance. According to the problem description, the symbols and definitions of relevant variables are shown in Table 1, and the mathematical model is established as follows.…”
Section: Massive-cargo Logistics Transportation Routing Modelmentioning
confidence: 99%
“…Previous studies of vehicle routes focused on the related problems considering vehicle constraints and related problem variants [1]. Leng et al [2] established a mathematical model for the vehicle routing problem of multiple distribution centers based on the logistics distribution system of urban rail transit and proposed a new concentration immune algorithm-based particle swarm algorithm to solve the vehicle routing problem by combining the concept of antibody concentration.…”
Section: Introductionmentioning
confidence: 99%
“…The VRP and its more complex variations are constantly being studied by the research community as more variants are emerging in recent years. Additional information can be read in the following works: [15][16][17][18].…”
Section: The Vehicle Routing Problemmentioning
confidence: 99%