A new approach on auxiliary vehicle assignment in capacitated location routing problem

References

• Ambrosino, D., Sciomachen, A., & Scutella, M.G. (2009). A heuristic based on multi-exchange techniques for a regional fleet assignment location- routing problem. Computers & Operations Research, 36, 442–460.
   Web of Science ®Google Scholar
• Army, United States Government. (2013). Army motor transport operations. Washington, DC: Army Techniques Publication.
   Google Scholar
• Barkel, E.K., & Yalkin, T.R. (2013). Feasibility of budget for acquisition of two joint support ships. Ottawa: Office of Parliamentary Budget Officer.
   Google Scholar
• Brand, A.J. (2011). A tabu search algorithm for the heterogeneous fixed fleet vehicle routing problem. Computers & Operations Research, 38, 140–151.
   Web of Science ®Google Scholar
• Ceselli, A., Righini, G., & Tresol, E. (2014). Combined location and routing problems for drug distribution. Discrete Applied Mathematics, 28, 130–145.
   Web of Science ®Google Scholar
• Chan, Y., Carter, W.B., & Burnes, M.D. (2001). A multiple-depot, multiple-vehicle, location-routing problem with stochastically processed demands. Computers & Operations Research, 28, 803–826.
   Web of Science ®Google Scholar
• Choi, E., & Tcha, D.-W. (2007). A column generation approach to the heterogeneous fleet vehicle routing problem. Computers & Operations Research, 34, 2080–2095.
   Web of Science ®Google Scholar
• Desrochers, M., & Laporte, G. (1991). Improvement and extensions to Miller-Tucker-Zemlin subtour elimination constraints. Operation Research Letters, 10, 27–36.
   Web of Science ®Google Scholar
• Dror, M., Laporte, G., & Trudeau, P. (1989). Vehicle routing with stochastic demands: Properties and solution frameworks. Transportation Science, 23, 166–176.
   Web of Science ®Google Scholar
• Ho, H.-P., Chang, C.-T., & Ku, C.-Y. (2013). On the location selection problem using analytic hierarchy process and multi-choice goal programming. International Journal of Systems Science, 44(1), 94–108.
   Web of Science ®Google Scholar
• Jacobsen, S.K., & Madsen, O.B.G. (1980). A comparative study of heuristics for a two-level routing-location problem. European Journal of Operational Research, 5, 378–387.
   Web of Science ®Google Scholar
• Kulcar, T. (1996). Optimizing solid waste collection in Brussels. European Journal of Operational Research, 90, 26–44.
   Web of Science ®Google Scholar
• Laporte, G., Gendreau, M., Potvin, J.-Y., & Semet, F. (2000). Classical and modern heuristics for the vehicle routing problem. International Transactions in Operational Research, 7, 285–300.
   Google Scholar
• Lin, C.K.Y., Chow, C.K., & Chen, A. (2002). A location-routing-loading problem for bill delivery services. Computers & Industrial Engineering, 42(1–2), 5–25.
   Web of Science ®Google Scholar
• Lin, C.K.Y., & Kwok, R.C.W. (2006). Multi-objective metaheuristics for a location-routing problem with multiple use of vehicles on real data and simulated data. European Journal of Operational Research, 175, 1833–1849.
   Web of Science ®Google Scholar
• Lina, S.W., & Yub, V.F. (2012). A simulated annealing heuristic for the team orienteering problem with time windows. European Journal of Operational Research, 217(1), 94–107.
   Web of Science ®Google Scholar
• Madsen, O.B.G. (1983). Methods for solving combined two level location routing problems of realistic dimensions. European Journal of Operational Research, 12, 295–301.
   Web of Science ®Google Scholar
• Michell, S. (2011). The royal fleet auxiliary: Delivering maritime operational support. RUSI Defence Systems, 14, 72–73.
   Google Scholar
• Min, H., Jayaraman, V., & Srivastava, R. (1998). Combined location-routing problems: A synthesis and future research directions. European Journal of Operational Research, 1(108), 1–15.
   Web of Science ®Google Scholar
• Mousavi, M.S., & Tavakkoli-Moghaddam, R. (2013). A hybrid simulated annealing algorithm for location and routing scheduling problems with cross-docking in the supply chain. Journal of Manufacturing Systems, 32(2), 335–347.
   Web of Science ®Google Scholar
• Mousavi, S.M., Niaki, S.T.A., Mehdizadeh, E., & Tavarroth, M.R. (2013). The capacitated multi-facility location–allocation problem with probabilistic customer location and demand: Two hybrid meta-heuristic algorithms. International Journal of Systems Science, 44(10), 1897–1912.
   Web of Science ®Google Scholar
• Nagy, G., & Salhi, S. (2007). Location-routing: Issues, models and methods. European Journal of Operational Research, 177, 649–672.
   Web of Science ®Google Scholar
• Nickodemus, G.K. (1967). Vertical replenishment and the UH-46A. United States Naval Institute Proceedings, United States Department of Defense.
   Google Scholar
• Perl, J. (1983). A unified warehouse location-routing analysis (PhD dissertation). Northwestern University, Evanston, IL.
   Google Scholar
• Prins, C. (2004). A simple and effective evolutionary algorithm for the vehicle routing problem. Computers & Operations Research, 31, 1985–2002.
   Web of Science ®Google Scholar
• Prins, C., Prodhon, C., Ruiz, A., Soriano, P., & Wolfler Calvo, R. (2007). Solving the capacitated location-routing problem by a cooperative Lagrangean relaxation-granular tabu search heuristic. Transportation Science, 4(41), 470–483.
   Web of Science ®Google Scholar
• Ralphs, T.K., Kopman, L., Pulleyblank, W.R., & Trotter, L.E. (2003). On the capacitated vehicle routing problem. Mathematical Programming, 94, 343–359.
   Web of Science ®Google Scholar
• Şahina, M., Çavuşlara, G., Öncanc, T., Şahina, G., & Aksu, D.T. (2013). An efficient heuristic for the multi-vehicle one-to-one pickup and delivery problem with split loads. Transportation Research Part C: Emerging Technologies, 27, 169–188.
   Web of Science ®Google Scholar
• Salhi, S., & Rand, G.K. (1989). The effect of ignoring routes when locating depots. European Journal of Operational Research, 45, 150–156.
   Web of Science ®Google Scholar
• Samaei, F., Bashiri, M., & Tavakkoli-Moghadam, R. (2012). A comparison of four multi-objective meta-heuristics for a capacitated location-routing problem. Journal of Industrial and Systems Engineering, 6(1), 20–33.
   Google Scholar
• Sambola, A.M., D´iaz, J.A., & Fern´andez, E. (2005). A compact model and tight bounds for a combined location-routing problem. Computers & Operations Research, 3(32), 407–428.
   Web of Science ®Google Scholar
• Shen, Z., Ordonez, F., & Dessouky, M. (2009). A two-stage vehicle routing model for large-scale bioterrorism emergencies. Networks, 54(4), 255–269.
   Web of Science ®Google Scholar
• Stengera, A., Schneiderb, M., Schwinda, M., & Vigo, D. (2012). Location routing for small package shippers with subcontracting options. International Journal of Production Economics, 140(2), 702–712.
   Web of Science ®Google Scholar
• Tarantilis, C.D., Kiranoudis, C.T., & Vassiliadis, V.S. (2004). A threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem. European Journal of Operational Research, 152, 148–158.
   Web of Science ®Google Scholar
• Tuzun, D., & Burke, L.I. (1999). A two-phase tabu search approach to the location routing problem. European Journal of Operational Research, 116, 87–99.
   Web of Science ®Google Scholar
• Watson-Gandy, C.D.T., & Dohrn, P.J. (1973). Depot location with van salesmen – a practical approach. Omega, 1, 321–329.
   Google Scholar
• Wu, T.H., Low, C., & Bai, J.W. (2002). Heuristic solutions to multi-depot location-routing problems. Computers & Operations Research, 29, 1393–1415.
   Web of Science ®Google Scholar