1 |
国务院. 国务院关于加快建立健全绿色低碳循环发展经济体系的指导意见[EB/OL]. (2021-02-22)[2021-07-28]. http://www.gov.cn/zhengce/content/2021-02/22/content_5588274.htm.
|
2 |
Dantzig G , Ramser R . The truck dispatching problem[J]. Management Science, 1959, 6 (1): 80- 91.
doi: 10.1287/mnsc.6.1.80
|
3 |
Erdogan S , Miller-Hooks E . A green vehicle routing problem[J]. Transportation Research Part E Logistics & Transportation Review, 2012, 48 (1): 100- 114.
|
4 |
Schneider M , Stenger A , Goeke D . The electric vehicle-routing problem with time windows and recharging stations[J]. Transportation Science, 2014, 48 (4): 500- 520.
doi: 10.1287/trsc.2013.0490
|
5 |
Min H . The multiple vehicle routing problem with simultaneous delivery and pick-up points[J]. Transportation Research Part A: General, 1989, 23 (5): 377- 386.
doi: 10.1016/0191-2607(89)90085-X
|
6 |
Dell'Amico M , Righini G , Salani M . A branch-and-price approach to the vehicle routing problem with simultaneous distribution and collection[J]. Transportation Science, 2006, 40 (2): 235- 247.
doi: 10.1287/trsc.1050.0118
|
7 |
Dantzig G , Wolfe P . Decomposition principle for linear programs[J]. Operations Research, 1960, 8 (1): 101- 111.
doi: 10.1287/opre.8.1.101
|
8 |
Desaulniers G , Errico F , Irnich S , et al. Exact algorithms for electric vehicle-routing problems with time windows[J]. Operations Research, 2016, 64 (6): 1388- 1405.
doi: 10.1287/opre.2016.1535
|
9 |
Feillet D , Dejax P , Gendreau M , et al. An exact algorithm for the elementary shortest path problem with resource constraints: application to some vehicle routing problems[J]. Networks, 2004, 44 (3): 216- 229.
doi: 10.1002/net.20033
|
10 |
Righini G , Salani M . Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints[J]. Discrete Optimization, 2006, 3 (3): 255- 273.
doi: 10.1016/j.disopt.2006.05.007
|
11 |
Roberti R , Wen M . The electric traveling salesman problem with time windows[J]. Transportation Research Part E: Logistics & Transportation Review, 2016, 89, 32- 52.
|
12 |
Montane F , Galvao R . A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service[J]. Computers & Operations Research, 2006, 33 (3): 595- 615.
|
13 |
Montane F , Galvao R , Avci M , et al. A hybrid metaheuristic algorithm for heterogeneous vehicle routing problem with simultaneous pickup and delivery[J]. Expert Systems with Applications, 2006, 33 (3): 595- 615.
|
14 |
Montane F , Galvao R . A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service[J]. Computers & Operations Research, 2016, 53, 160- 171.
|
15 |
Chen J , Wu T . Vehicle routing problem with simultaneous deliveries and pickups[J]. Journal of the Operational Research Society, 2006, 57 (5): 579- 587.
doi: 10.1057/palgrave.jors.2602028
|
16 |
Solomon M . Algorithms for the vehicle routing and scheduling problems with time window constraints[J]. Operations Research, 1987, 35 (2): 254- 265.
doi: 10.1287/opre.35.2.254
|
17 |
Salhi S , Nagy G . A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling[J]. Journal of the Operational Research Society, 1999, 50 (10): 1034- 1042.
doi: 10.1057/palgrave.jors.2600808
|
18 |
Ryan D , Foster B . An integer programming approach to scheduling[J]. Computer Scheduling of Public Transport, 1981, 1, 269- 280.
|