2019
DOI: 10.1007/s12652-019-01446-4
|View full text |Cite
|
Sign up to set email alerts
|

An optimization model for the transportation network with hierarchical structure: the case of China Post

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(2 citation statements)
references
References 17 publications
0
2
0
Order By: Relevance
“…Studies [3][4][5][6] have shown that, without compression and at 10-s collection intervals, 100 megabytes (MB) are stored for every 400 objects in a single day. Longer-term studies highlight that if you collect movement data from 10,000 users based on their geographic position every 15 s, you generate more than 50 million data per day and approximately 20 trillion data per year [7][8][9].…”
Section: Related Workmentioning
confidence: 99%
“…Studies [3][4][5][6] have shown that, without compression and at 10-s collection intervals, 100 megabytes (MB) are stored for every 400 objects in a single day. Longer-term studies highlight that if you collect movement data from 10,000 users based on their geographic position every 15 s, you generate more than 50 million data per day and approximately 20 trillion data per year [7][8][9].…”
Section: Related Workmentioning
confidence: 99%
“…Wang et al's paper entitled "An optimization model for the transportation network with hierarchical structure: the case of China Post" (Wang et al 2019) focuses on the vehicle routing problem of China Post Group with time windows (VRP CPG TW). The authors established a three-level hub model, including the determination of the number, location of hubs and their service area, and the routes between hubs and local post office.…”
Section: Contributions Of This Special Issuementioning
confidence: 99%