[1]
|
D. Aksen, O. Kaya, F. S. Salman and Ö. Tuncel, An adaptive large neighbor- hood search algorithm for a selective and periodic inventory routing problem, European Journal of Operational Research, 239 (2014), 413-426.
doi: 10.1016/j.ejor.2014.05.043.
|
[2]
|
E. J. Beltrami and L. D. Bodin, Networks and vehicle routing for municipal waste collection, Networks, 4 (1974), 65-94.
doi: 10.1002/net.3230040106.
|
[3]
|
R. Bent and P. V. Hentenryck, A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows, Computers & Operations Research, 33 (2006), 875-893.
|
[4]
|
N. Christofides and J. E. Beasley, The period routing problem, Networks, 14 (1984), 237-256.
|
[5]
|
A. M. Campbell and H. W. Jill, Forty years of periodic vehicle routing, Networks, 63 (2014), 2-15.
doi: 10.1002/net.21527.
|
[6]
|
I.-M. Chao, B. L. Golden and E. Wasil, An improved heuristic for the period vehicle-routing problem, Networks, 26 (1995), 25-44.
doi: 10.1002/net.3230260104.
|
[7]
|
Z. Chang and H. Chen, Freight buses in three-tiered distribution systems for city logistics: Modeling and evaluation, 7th IESM Conference, (2017).
|
[8]
|
J. F. Cordeau, M. Gendreau and G. Laporte, A guide to vehicle routing heuristics, Journal of the Operational Research Society, 53 (2002), 512-522.
|
[9]
|
G. Clarke and J. W. Wright, Scheduling of vehicles from a central depot to a number of delivery points, Operations Research, 12 (1964), 568-581.
doi: 10.1007/978-3-642-27922-5_18.
|
[10]
|
B. Dai and H. X. Chen, Proportional egalitarian core solution for profit allocation games with an application to collaborative transportation planning, European Journal of Industrial Engineering, 9 (2015), 53-76.
doi: 10.1504/EJIE.2015.067456.
|
[11]
|
L. M. A. Drummond, L. S. Ochi and D. S. Vianna, An asynchronous parallel metaheuristic for the period vehicle routing problem, Future Generation Computer System, 17 (2001), 379-386.
doi: 10.1016/S0167-739X(99)00118-1.
|
[12]
|
E. Demir, T. Bektas and G. Laporte, An adaptive large neighborhood search heuristic for the Pollution-Routing Problem, European Journal of Operational Research, 223 (2012), 346-359.
doi: 10.1016/j.ejor.2012.06.044.
|
[13]
|
B. Dai, H. X. Chen and G. K. Yang, Price-setting based combinatorial auction approach for carrier collaboration with pickup and delivery requests, Operational Research, 14 (2014), 361-386.
doi: 10.1007/s12351-014-0141-1.
|
[14]
|
P. Francis, K. Smilowitz and M. Tzur, The period vehicle routing problem with service choice, Transportation Science, 40 (2006), 439-454.
doi: 10.1287/trsc.1050.0140.
|
[15]
|
L. E. Gill and R. P. Allerheiligen, Co-operation in channels of distribution: Physical distribution leads the way, International Journal of Physical Distribution & Logistics Management, 26 (1996), 49-63.
doi: 10.1108/eb014521.
|
[16]
|
M. Gaudioso and G. Paletta, A heuristic for the periodic vehicle routing problem, Transport Science, 26 (1992), 86-92.
doi: 10.1287/trsc.26.2.86.
|
[17]
|
D. Goeke and M. Schneider, Routing a mixed fleet of electric and conventional vehicles, European Journal of Operational Research, 245 (2015), 81-99.
doi: 10.1016/j.ejor.2015.01.049.
|
[18]
|
Y. Hao and Y. Su, The research on joint distribution mode of the chain retail enterprises, International Conference on Mechatronics, Electronic, Industrial and Control Engineering, MEIC, (2014), 1694–1697.
|
[19]
|
M. Y. Lai, H. M. Yang, S. P. Yang, J. H. Zhao and Y. Xu, Cyber-physical logistics system-based vehicle routing optimization, Journal of Industrial and Management Optimization, 10 (2014), 701-715.
doi: 10.3934/jimo.2014.10.701.
|
[20]
|
L. L. Lv, Z. Zhang, L. Zhang and W. S. Wang, An iterative algorithm for periodic Sylvester matrix equations, Journal of Industrial and Management Optimization, 14 (2018), 413-425.
doi: 10.3934/jimo.2017053.
|
[21]
|
N. Labadie, R. Mansini, J. Melechovský and R. Wolfler-Calvo, The team orienteering problem with time windows: An LP-based granular variable neighborhood search, European Journal of Operational Research, 220 (2012), 15-27.
doi: 10.1016/j.ejor.2012.01.030.
|
[22]
|
Y. Li, H. X. Chen and C. Prins, Adaptive large neighborhood search for the pickup and delivery problem with time windows, profits, and reserved requests, European Journal of Operational Research, 252 (2016), 27-38.
doi: 10.1016/j.ejor.2015.12.032.
|
[23]
|
S. Majidi, S. M. Hosseini-Motlagh and J. Ignatius, Adaptive large neighborhood search heuristic for pollution-routing problem with simultaneous pickup and delivery, Soft Computing, 22 (2018), 2851-2865.
doi: 10.1007/s00500-017-2535-5.
|
[24]
|
A. C. Matos and R. C. Oliverira, An experimental study of the ant colony system for the period vehicle routing problem, Lecture Notes in Computer Science, 3172 (2004), 286-293.
doi: 10.1007/978-3-540-28646-2_26.
|
[25]
|
A. R. Pourghaderi, R. Tavakkoli-Moghaddam, M. Alinaghian and B. Beheshti-Pour, A simple and effective heuristic for periodic vehicle routing problem, Proceedings of the 2008 IEEE International Conference on Industrial Engineering Management, (2008), 133–137.
doi: 10.1109/IEEM.2008.4737846.
|
[26]
|
D. Pisinger and S. Ropker, A general heuristic for vehicle routing problems, Computers and Operations Research, 34 (2007), 2403-2435.
doi: 10.1016/j.cor.2005.09.012.
|
[27]
|
R. Russell and W. Igo, An assignment routing problem, Networks, 9 (1979), 1-17.
doi: 10.1002/net.3230090102.
|
[28]
|
S. Roker and D. Pisinger, An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows, Transportation Science, 40 (2006), 455-472.
|
[29]
|
I. Roozbeh, M. Ozlen and J. W. Hearne, An Adaptive Large Neighborhood Search for asset protection during escaped wildfires, Computers and Operations Research, 97 (2018), 125-134.
doi: 10.1016/j.cor.2018.05.002.
|
[30]
|
X. Shize, Introductions of joint distribution, Circulation and economic study, 8 (1973), 87-94.
|
[31]
|
P. Shaw, Using constraint programming and local search methods to solve vehicle routingproblems, Proceedings of the 4th International Conference on Principles and Practice of Constraint Programming Springer New York, (1998), 417–431.
|
[32]
|
A. Trentini, A. Campi, N. Malhene and F. Boscacci, Shared passengers & goods urban transport solutions: New ideas for milan through en international comparison, Territorio, 59 (2011), 38-44.
|
[33]
|
L. Verdonck, A. Caris, K. Ramaekers and G. K. Janssens, Collaborative logistics from the perspective of road transportation companies, Transport Reviews, 33 (2013), 700-719.
doi: 10.1080/01441647.2013.853706.
|
[34]
|
L. Xu and D. Yang, Research on joint distribution cost allocation model, Boletin Tecnico/Technical Bulletin, 55 (2017), 291-297.
|
[35]
|
N. Yalaoui, L. Amodeo, F. Yalaoui and H. Mahdi, Efficient methods to schedule reentrant flow shop system, Journal of Intelligent and Fuzzy Systems, 26 (2014), 1113-1121.
doi: 10.3233/IFS-130771.
|
[36]
|
S. Zhou, Logistics bottleneck of online retail industry in China, Journal of Supply Chain and Operations Management, 11 (2013), 1-11.
|