1 |
Fraley, C. & Raftery, A. E. (1998). How many clusters? Which clustering method? Answers via model-based cluster analysis. The computer journal, 41(8), 578-588.
DOI
|
2 |
Fraley, C. & Raftery, A. E. (2002). Model-based clustering, discriminant analysis, and density estimation. Journal of the American statistical Association, 97(458), 611-631.
DOI
|
3 |
Gendreau, M., Hertz, A. & Laporte, G. (1994). A tabu search heuristic for the vehicle routing problem. Management science, 40(10), 1276-1290.
DOI
|
4 |
Irnich, S. (2000). A multi-depot pickup and delivery problem with a single hub and heterogeneous vehicles. European Journal of Operational Research, 122(2), 310-328.
DOI
|
5 |
Jepsen, M., Spoorendonk, S. & Ropke, S. (2013). A branch-and-cut algorithm for the symmetric two-echelon capacitated vehicle routing problem. Transportation Science, 47(1), 23-37.
DOI
|
6 |
Jin, J., Crainic, T. G. & Lokketangen, A. (2014). A cooperative parallel metaheuristic for the capacitated vehicle routing problem. Computers & Operations Research, 44, 33-41.
DOI
|
7 |
Karadimas, N. V., Doukas, N., Kolokathi, M. & Defteraiou, G. (2008). Routing optimization heuristics algorithms for urban solid waste transportation management. WSEAS Transaction on Computers, 7(12), 2022-2031.
|
8 |
Kaufman, L. & Rousseeuw, P. (1987). Clustering by means of medoids. North-Holland.
|
9 |
Rousseeuw, P. J. (1987). Silhouettes: a graphical aid to the interpretation and validation of cluster analysis. Journal of Computational and Applied Mathematics, 20, 53-65.
DOI
|
10 |
Roodbergen, K. J. & De Koster, R. (2001). Routing order pickers in a warehouse with a middle aisle. European Journal of Operational Research, 133(1), 32-43.
DOI
|
11 |
Ryan, D. M., Hjorring, C. & Glover, F. (1993). Extensions of the petal method for vehicle routeing. Journal of the Operational Research Society, 289-296.
|
12 |
Savelsbergh, M. W. (1992). The vehicle routing problem with time windows: Minimizing route duration. ORSA journal on computing, 4(2), 146-154.
DOI
|
13 |
Beasley, J. E. (1983). Route first-cluster second methods for vehicle routing. Omega, 11(4), 403-408.
DOI
|
14 |
Baker, B. M. & Ayechew, M. (2003). A genetic algorithm for the vehicle routing problem. Computers & Operations Research, 30(5), 787-800.
DOI
|
15 |
Baldacci, R., Mingozzi, A. & Roberti, R. (2012). Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints. European Journal of Operational Research, 218(1), 1-6.
DOI
|
16 |
Bast, H., Delling, D., Goldberg, A., Muller-Hannemann, M., Pajor, T., Sanders, P., Wagner, D. & Werneck, R. F. (2016). Route planning in transportation networks., 19-80.
|
17 |
Calvete, H. I., Gale, C., Oliveros, M. & Sanchez-Valverde, B. (2007). A goal programming approach to vehicle routing problems with soft time windows. European Journal of Operational Research, 177(3), 1720-1733.
DOI
|
18 |
Charrad, M., Ghazzali, N., Boiteau, V., Niknafs, A. & Charrad, M. M. (2014). Package 'NbClust'. J.Stat.Soft, 61, 1-36.
|
19 |
Chen, J. & Wu, T. (2006). Vehicle routing problem with simultaneous deliveries and pickups. Journal of the Operational Research Society, 57(5), 579-587.
DOI
|
20 |
Chun-Hua, L., Hong, Z. & Jian, Z. (2009). Vehicle routing problem with time windows and simultaneous pickups and deliveries., 685-689.
|
21 |
Cordeau, J., Gendreau, M. & Laporte, G. (1997). A tabu search heuristic for periodic and multi‐depot vehicle routing problems. Networks, 30(2), 105-119.
DOI
|
22 |
Grangier, P., Gendreau, M., Lehuede, F. & Rousseau, L. (2016). An adaptive large neighborhood search for the two-echelon multiple-trip vehicle routing problem with satellite synchronization. European Journal of Operational Research, 254(1), 80-91.
DOI
|
23 |
Gillett, B. E. & Miller, L. R. (1974). A heuristic algorithm for the vehicle-dispatch problem. Operations research, 22(2), 340-349.
DOI
|
24 |
Goetschalckx, M. & Jacobs-Blecha, C. (1989). The vehicle routing problem with backhauls. European Journal of Operational Research, 42(1), 39-51.
DOI
|
25 |
Gounaris, C. E., Wiesemann, W. & Floudas, C. A. (2013). The robust capacitated vehicle routing problem under demand uncertainty. Operations research, 61(3), 677-693.
DOI
|
26 |
Gurobi Optimization, I. (2016). Gurobi Optimizer Reference Manual; 2015. URL http://www.gurobi.com.
|
27 |
Han, J., Pei, J. & Kamber, M. (2011). Data mining: concepts and techniques. Elsevier.
|
28 |
Hernandez, F., Feillet, D., Giroudeau, R. & Naud, O. (2016). Branch-and-price algorithms for the solution of the multi-trip vehicle routing problem with time windows. European Journal of Operational Research, 249(2), 551-559.
DOI
|
29 |
Koc, C. & Karaoglan, I. (2016). The green vehicle routing problem: A heuristic based exact solution approach. Applied Soft Computing, 39, 154-164.
DOI
|
30 |
Ko, H. J. & Evans, G. W. (2007). A genetic algorithm-based heuristic for the dynamic integrated forward/reverse logistics network for 3PLs. Computers & Operations Research, 34(2), 346-366.
DOI
|
31 |
Land, A. H. & Doig, A. G. (2010). An automatic method for solving discrete programming problems. 50 Years of Integer Programming 1958-2008, 105-132.
|
32 |
Li, F., Golden, B. & Wasil, E. (2007). A record-to-record travel algorithm for solving the heterogeneous fleet vehicle routing problem. Computers & Operations Research, 34(9), 2734-2742.
DOI
|
33 |
Lim, A. & Wang, F. (2005). Multi-depot vehicle routing problem: A one-stage approach. IEEE transactions on Automation Science and Engineering, 2(4), 397-402.
DOI
|
34 |
Taş, D., Gendreau, M., Dellaert, N., Van Woensel, T. & De Kok, A. (2014). Vehicle routing with soft time windows and stochastic travel times: A column generation and branch-and-price solution approach. European Journal of Operational Research, 236(3), 789-799.
DOI
|
35 |
Scott, A. J. & Symons, M. J. (1971). Clustering methods based on likelihood ratio criteria. Biometrics, 387-397.
|
36 |
Subramanian, A., Penna, P. H. V., Uchoa, E. & Ochi, L. S. (2012). A hybrid algorithm for the heterogeneous fleet vehicle routing problem. European Journal of Operational Research, 221(2), 285-295.
DOI
|
37 |
Taillard, E., Badeau, P., Gendreau, M., Guertin, F. & Potvin, J. (1997). A tabu search heuristic for the vehicle routing problem with soft time windows. Transportation science, 31(2), 170-186.
DOI
|
38 |
Tibshirani, R., Walther, G. & Hastie, T. (2001). Estimating the number of clusters in a data set via the gap statistic. Journal of the Royal Statistical Society: Series B (Statistical Methodology), 63(2), 411-423.
DOI
|
39 |
Wei, L., Zhang, Z., Zhang, D. & Leung, S. C. (2017). A simulated annealing algorithm for the capacitated vehicle routing problem with two-dimensional loading constraints. European Journal of Operational Research.
|
40 |
Lysgaard, J. & Wohlk, S. (2014). A branchand- cut-and-price algorithm for the cumulative capacitated vehicle routing problem. European Journal of Operational Research, 236(3), 800-810.
DOI
|
41 |
Michael, R. G. & David, S. J. (1979). Computers and intractability: a guide to the theory of NP-completeness. WH Free.Co., San Fr, 90-91.
|
42 |
Mittal, P. & Singh, Y. (2016). Development of intelligent transportation system for improving average moving and waiting time with artificial intelligence. Indian Journal of Science and Technology, 9(3).
|
43 |
Nagy, G. & Salhi, S. (2005). Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries. European Journal of Operational Research, 162(1), 126-141.
DOI
|
44 |
Ombuki, B., Ross, B. J. & Hanshar, F. (2006). Multi-objective genetic algorithms for vehicle routing problem with time windows. Applied Intelligence, 24(1), 17-30.
DOI
|
45 |
Ai, T. J. & Kachitvichyanukul, V. (2009). A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery. Computers & Operations Research, 36(5), 1693-1702.
DOI
|
46 |
Yao, B., Yu, B., Hu, P., Gao, J. & Zhang, M. (2016). An improved particle swarm optimization for carton heterogeneous vehicle routing problem with a collection depot. Annals of Operations Research, 242(2), 303-320.
DOI
|
47 |
Cordeau, J., Gendreau, M., Laporte, G., Potvin, J. & Semet, F. (2002). A guide to vehicle routing heuristics. Journal of the Operational Research society, 512-522.
|
48 |
Dantzig, G., Fulkerson, R. & Johnson, S. (1954). Solution of a large-scale traveling-salesman problem. Journal of the operations research society of America, 2(4), 393-410.
DOI
|
49 |
김지수(2014). Refuse collection network design and vehicle routing in reverse logistics, 박사학위논문. 한양대학교 대학원.
|
50 |
나유진, 임현우, 문정민(2016). 시간대별 도로교통 상황을 고려한 도심 식자재 배송서비스 개선 방안에 관한 연구. 로지스틱스연구, 24(4), 79-97.
DOI
|
51 |
Amini, S., Gerostathopoulos, I. & Prehofer, C. (2017). Big data analytics architecture for real-time traffic control., 710-715.
|
52 |
Badeau, P., Guertin, F., Gendreau, M., Potvin, J. & Taillard, E. (1997). A parallel tabu search heuristic for the vehicle routing problem with time windows. Transportation Research Part C: Emerging Technologies, 5(2), 109-122.
DOI
|
53 |
Dondo, R. & Cerda, J. (2007). A cluster-based optimization approach for the multi-depot heterogeneous fleet vehicle routing problem with time windows. European Journal of Operational Research, 176(3), 1478-1507.
DOI
|
54 |
Davies, D. L. & Bouldin, D. W. (1979). A cluster separation measure. IEEE Transactions on Pattern Analysis and Machine Intelligence(2), 224-227.
|
55 |
De Jaegere, N., Defraeye, M. & Van Nieuwenhuyse, I. (2014). The vehicle routing problem: state of the art classification and review.
|
56 |
Dempster, A. P., Laird, N. M. & Rubin, D. B. (1977). Maximum likelihood from incomplete data via the EM algorithm. Journal of the royal statistical society.Series B (methodological), 1-38.
|
57 |
Ester, M., Kriegel, H., Sander, J. & Xu, X. (1996). A density-based algorithm for discovering clusters in large spatial databases with noise., 96(34), 226-231.
|
58 |
Feng, L., Ong, Y., Chen, C. & Chen, X. (2016). Conceptual modeling of evolvable local searches in memetic algorithms using linear genetic programming: a case study on capacitated vehicle routing problem. Soft Computing, 20(9), 3745- 3769.
DOI
|
59 |
Fisher, M. L. & Jaikumar, R. (1981). A generalized assignment heuristic for vehicle routing. Networks, 11(2), 109-124.
DOI
|
60 |
Iassinovskaia, G., Limbourg, S. & Riane, F. (2017). The inventory-routing problem of returnable transport items with time windows and simultaneous pickup and delivery in closed-loop supply chains. International Journal of Production Economics, 183, 570-582.
DOI
|
61 |
Gendreau, M., Laporte, G., Musaraganyi, C. & Taillard, .. D. (1999). A tabu search heuristic for the heterogeneous fleet vehicle routing problem. Computers & Operations Research, 26(12), 1153-1173.
DOI
|
62 |
Imran, A., Salhi, S. & Wassan, N. A. (2009). A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem. European Journal of Operational Research, 197(2), 509-518.
DOI
|
63 |
Renaud, J., Laporte, G. & Boctor, F. F. (1996). A tabu search heuristic for the multi-depot vehicle routing problem. Computers & Operations Research, 23(3), 229-235.
DOI
|
64 |
Penna, P. H. V., Subramanian, A. & Ochi, L. S. (2013). An iterated local search heuristic for the heterogeneous fleet vehicle routing problem. Journal of Heuristics, 1-32.
|
65 |
Potvin, J., Duhamel, C. & Guertin, F. (1996). A genetic algorithm for vehicle routing with backhauling. Applied Intelligence, 6(4), 345-355.
DOI
|
66 |
Reed, M., Yiannakou, A. & Evering, R. (2014). An ant colony algorithm for the multi-compartment vehicle routing problem. Applied Soft Computing, 15, 169-176.
DOI
|
67 |
Rivera, J. C., Afsar, H. M. & Prins, C. (2016). Mathematical formulations and exact algorithm for the multitrip cumulative capacitated single-vehicle routing problem. European Journal of Operational Research, 249(1), 93-104.
DOI
|
68 |
Yu, B., Yang, Z. & Yao, B. (2009). An improved ant colony optimization for vehicle routing problem. European Journal of Operational Research, 196(1), 171-176.
DOI
|