Pickup and delivery supply chain network with semi soft time windows: metaheuristic approach

References

• Albareda-Sambola, M. Dı́az, J. A., & Fernández, E. (2005). A compact model and tight bounds for a combined location-routing problem. Computers & Operations Research, 32, 407–428.
   Web of Science ®Google Scholar
• Berbeglia, G., Cordeau, J. F., Gribkovskaia, I., & Laporte, G. (2007). Static pickup and delivery problems: a classification scheme and survey. Top, 15(1), 1–31.10.1007/s11750-007-0009-0
   Web of Science ®Google Scholar
• Chiang, W. C. & Russell, R. A. (1996). Simulated annealing metaheuristics for the vehicle routing problem with time windows. Annals of Operations Research, 63, 3–27.10.1007/BF02601637
   Web of Science ®Google Scholar
• Govindan, K., Jafarian, A., Khodaverdi, R., & Devika, K. (2014). Two-echelon multiple-vehicle location–routing problem with time windows for optimization of sustainable supply chain network of perishable food. International Journal of Production Economics, 152, 9–28.10.1016/j.ijpe.2013.12.028
   Web of Science ®Google Scholar
• Jacobsen, S. K., & Madsen, O. B. (1980). A comparative study of heuristics for a two-level routing-location problem. European Journal of Operational Research, 5, 378–387.10.1016/0377-2217(80)90124-1
   Web of Science ®Google Scholar
• Karaoglan, I., Altiparmak, F., Kara, I., & Dengiz, B. (2012). The location-routing problem with simultaneous pickup and delivery: Formulations and a heuristic approach. Omega, 40, 465–477.10.1016/j.omega.2011.09.002
   Web of Science ®Google Scholar
• Marinakis, Y. & Marinaki, M. (2008). A particle swarm optimization algorithm with path relinking for the location routing problem. Journal of Mathematical Modelling and Algorithms, 7, 59–78.10.1007/s10852-007-9073-6
   Google Scholar
• Melechovský, J., Prins, C., & Calvo, R. W. (2005). A metaheuristic to solve a location-routing problem with non-linear costs. Journal of Heuristics, 11, 375–391.10.1007/s10732-005-3601-1
   Web of Science ®Google Scholar
• Min, H., Jayaraman, V., & Srivastava, R. (1998). Combined location-routing problems: A synthesis and future research directions. European Journal of Operational Research, 108(1), 1–15.10.1016/S0377-2217(97)00172-0
   Web of Science ®Google Scholar
• Nagy, G., & Salhi, S. (2007). Location-routing: Issues, models and methods. European Journal of Operational Research, 177, 649–672.10.1016/j.ejor.2006.04.004
   Web of Science ®Google Scholar
• Parragh, S. N., Doerner, K. F., & Hartl, R. F. (2008). A survey on pickup and delivery problems. Journal für Betriebswirtschaft, 58, 21–51.10.1007/s11301-008-0033-7
   Google Scholar
• Polat, O., Kalayci, C. B., Kulak, O., & Günther, H. O. (2015). A perturbation based variable neighborhood search heuristic for solving the Vehicle Routing Problem with Simultaneous Pickup and Delivery with Time Limit. European Journal of Operational Research, 242, 369–382.10.1016/j.ejor.2014.10.010
   Web of Science ®Google Scholar
• Prins, C., Prodhon, C., & Calvo, R. W. (2006). A memetic algorithm with population management (MA| PM) for the capacitated location-routing problem. In Evolutionary computation in combinatorial optimization (pp. 183–194). Springer Berlin Heidelberg.
   Google Scholar
• Qureshi, A.G., Taniguchi, E., & Yamada, T. (2010). Exact solution for the vehicle routing problem with semi soft time windows and its application.Procedia-Social and Behavioral Sciences, 2, 5931–5943.10.1016/j.sbspro.2010.04.008
   Google Scholar
• Rodger, J. A., Pankaj, P., & Gonzalez, S. P. (2014). Decision making using a fuzzy induced linguistic ordered weighted averaging approach for evaluating risk in a supply chain. The International Journal of Advanced Manufacturing Technology, 70, 711–723.10.1007/s00170-013-5311-4
   Web of Science ®Google Scholar
• Setak, M., Bolhassani, S. J., & Karimi, H. (2013). A node-based mathematical model towards the location routing problem with intermediate replenishment facilities under capacity constraint. International Journal of Engineering-Transactions C: Aspects, 27, 911.
   Google Scholar
• Setak, M., Habibi, M., Karimi, H., & Abedzadeh, M. (2015). A time-dependent vehicle routing problem in multigraph with FIFO property. Journal of Manufacturing Systems, 35, 37–45.10.1016/j.jmsy.2014.11.016
   Web of Science ®Google Scholar
• Taş, D., Dellaert, N., Van Woensel, T., & De Kok, T. (2013). Vehicle routing problem with stochastic travel times including soft time windows and service costs. Computers & Operations Research, 40, 214–224.
   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.10.1016/S0377-2217(98)00107-6
   Web of Science ®Google Scholar
• Vincent, F. Y., & Lin, S. W. (2014). Multi-start simulated annealing heuristic for the location routing problem with simultaneous pickup and delivery. Applied Soft Computing, 24, 284–290.
   Web of Science ®Google Scholar
• Watson-Gandy, C. D. T., & Dohrn, P. J. (1973). Depot location with van salemen—a practical approach. Omega, 1, 321–329.10.1016/0305-0483(73)90108-4
   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
• Yu, V. F., Lin, S. W., Lee, W., & Ting, C. J. (2010). A simulated annealing heuristic for the capacitated location routing problem. Computers & Industrial Engineering, 58, 288–299.
   Web of Science ®Google Scholar