Bi-objective reliable location-inventory-routing problem with partial backordering under disruption risks: A modified AMOSA approach

Applied Soft Computing Journal

Volumn 59, Issue , 2017, Pages 622-643

  Rayat, Farnaz ^a   Musavi, MirMohammad ^a   Bozorgi Amiri, Ali ^a  

^a UNIVERSITY OF TEHRAN   (Iran)

Author keywords

AMOSA; Disruption risk; Location inventory routing; NSGA II; Partial backordering; Reliable facility location

Indexed keywords

COSTS; HEURISTIC ALGORITHMS; INTEGER PROGRAMMING; NONLINEAR PROGRAMMING; NUMERICAL METHODS; PROBABILITY DISTRIBUTIONS; SIMULATED ANNEALING; STOCHASTIC SYSTEMS; SUPPLY CHAINS; TAGUCHI METHODS; WAREHOUSES;

AMOSA; FACILITY LOCATIONS; INVENTORY ROUTING; NSGA-II; PARTIAL BACKORDERING;

LOCATION;

EID: 85021167724     PISSN: 15684946     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.asoc.2017.06.036     Document Type: Article

References (46)

1. Atamtürk, A., Berenguer, G., Shen, Z.-J., A conic integer programming approach to stochastic joint location-inventory problems. Oper. Res. 60:2 (2012), 366–381.
2. Seyedhosseini, S.M., Bozorgi-Amiri, A., Daraei, S., An integrated location-Routing-Inventory problem by considering supply disruption. I-Business, 6(2), 2014, 29.
3. San-José, L.A., Sicilia, J., Garcيa-Laguna, J., A general model for EOQ inventory systems with partial backlogging and linear shortage costs. Int. J. Syst. Sci. 40:1 (2009), 59–71.
4. Li, Y., Guo, H., Wang, L., Fu, J., A hybrid genetic-simulated annealing algorithm for the location-inventory-routing problem considering returns under E-supply chain environment. Sci. World J., 2013, 2013.
5. Liu, S., Lee, S., A two-phase heuristic method for the multi-depot location routing problem taking inventory control decisions into consideration. Int. J. Adv. Manuf. Technol. 22:11–12 (2003), 941–950.
6. Liu, S., Lin, C., A heuristic method for the combined location routing and inventory problem. Int. J. Adv. Manuf. Technol. 26:4 (2005), 372–381.
7. Shen, Z.-J.M., Qi, L., Incorporating inventory and routing costs in strategic location models. Eur. J. Oper. Res. 179:2 (2007), 372–389.
8. Javid, A.A., Azad, N., Incorporating location, routing and inventory decisions in supply chain network design. Trans. Res. Part E 46:5 (2010), 582–597.
9. Sajjadi, S.R., Cheraghi, S.H., Multi-products location–routing problem integrated with inventory under stochastic demand. Int. J. Ind. Syst. Eng. 7:4 (2011), 454–476.
10. Ahmadi-Javid, A., Seddighi, A.H., A location-routing-inventory model for designing multisource distribution networks. Eng. Optim. 44:6 (2012), 637–656.
11. Forouzanfar, F., Tavakkoli-Moghaddam, R., Using a genetic algorithm to optimize the total cost for a location-routing-inventory problem in a supply chain with risk pooling. J. Appl. Oper. Res. 4:1 (2012), 2–13.
12. Nekooghadirli, N., Tavakkoli-Moghaddam, R., Ghezavati, V., Javanmard, S., Solving a new bi-objective location-routing-inventory problem in a distribution network by meta-heuristics. Comput. Ind. Eng. 76 (2014), 204–221.
13. Nekooghadirli, N., Tavakkoli-Moghaddam, R., Ghezavati, V., Efficiency of a multi-objective imperialist competitive algorithm: a bi-objective location-routing-inventory problem with probabilistic routes. J. AI Data Mining 2:2 (2014), 105–112.
14. Zhang, Y., Qi, M., Miao, L., Liu, E., Hybrid metaheuristic solutions to inventory location routing problem. Transp. Res. Part E 70 (2014), 305–323.
15. Liu, B., Chen, H., Li, Y., Liu, X., A pseudo-Parallel genetic algorithm integrating simulated annealing for stochastic location-inventory-routing problem with consideration of returns in E-commerce. Discrete Dynam. Nat. Soc., 2015, 2015.
16. Guerrero, W., Prodhon, C., Velasco, N., Amaya, C., A relax-and-price heuristic for the inventory-location-routing problem. Int. Trans. Oper. Res. 22:1 (2015), 129–148.
17. Tang, J., Ji, S., Jiang, L., The design of a sustainable location-routing-inventory model considering consumer environmental behavior. Sustainability, 8(3), 2016, 211.
18. Zhalechian, M., Tavakkoli-Moghaddam, R., Zahiri, B., Mohammadi, M., Sustainable design of a closed-loop location-routing-inventory supply chain network under mixed uncertainty. Trans. Res. Part E 89 (2016), 182–214.
19. Lerhlaly, S., Lebbar, M., Allaoui, H., Ouazar, D., Afifi, S., An Integrated Inventory Location Routing Problem Considering CO2 Emissions. 2016.
20. Angazi, H., An integrated location inventory routing model in supply chain network designing under uncertainty. Decis. Sci. Lett. 5:4 (2016), 551–568.
21. Ghorbani, A., Jokar, M.R.A., A hybrid imperialist competitive-simulated annealing algorithm for a multisource multi-product location-routing-inventory problem. Comput. Ind. Eng. 101 (2016), 116–127.
22. Marinakis, Y., An improved particle swarm optimization algorithm for the capacitated location routing problem and for the location routing problem with stochastic demands. Appl. Soft Comput. 37 (2015), 680–701.
23. Mokhtarinejad, M., Ahmadi, A., Karimi, B., Rahmati, S.H.A., A novel learning based approach for a new integrated location-routing and scheduling problem within cross-docking considering direct shipment. Appl. Soft Comput. 34 (2015), 274–285.
24. Snyder, L.V., Daskin, M.S., Reliability models for facility location: the expected failure cost case. Trans. Sci. 39:3 (2005), 400–416.
25. Cui, T., Ouyang, Y., Shen, Z.-J.M., Reliable facility location design under the risk of disruptions. Oper. Res. 58:4-part-1 (2010), 998–1011.
26. Qi, L., Shen, Z.-J.M., Snyder, L.V., The effect of supply disruptions on supply chain design decisions. Trans. Sci. 44:2 (2010), 274–289.
27. Ross, A.M., Rong, Y., Snyder, L.V., Supply disruptions with time-dependent parameters. Comput. Oper. Res. 35:11 (2008), 3504–3529.
28. Qi, L., Shen, Z.J.M., Snyder, L.V., A continuous-review inventory model with disruptions at both supplier and retailer. Prod. Oper. Manage. 18:5 (2009), 516–532.
29. Schmitt, A.J., Snyder, L.V., Shen, Z.-J.M., Inventory systems with stochastic demand and supply: properties and approximations. Eur. J. Oper. Res. 206:2 (2010), 313–328.
30. Zhang, Y., Qi, M., Lin, W.-H., Miao, L., A metaheuristic approach to the reliable location routing problem under disruptions. Trans. Res. Part E 83 (2015), 90–110.
31. Deb, K., Agrawal, S., Pratap, A., Meyarivan, T., A fast elitist non-dominated sorting genetic algorithm for multi-objective optimization: NSGA-II. International Conference on Parallel Problem Solving From Nature, Springer, 2000.
32. Bandyopadhyay, S., Saha, S., Maulik, U., Deb, K., A simulated annealing-based multiobjective optimization algorithm: AMOSA. IEEE Trans. Evol. Comput. 12:3 (2008), 269–283.
33. Zhang, Q., Li, H., MOEA/D: a multiobjective evolutionary algorithm based on decomposition. IEEE Trans. Evol. Comput. 11:6 (2007), 712–731.
34. Shang, R., Jiao, L., Liu, F., Ma, W., A novel immune clonal algorithm for MO problems. IEEE Trans. Evol. Comput. 16:1 (2012), 35–50.
35. Zhalechian, M., Tavakkoli-Moghaddam, R., Rahimi, Y., A self-adaptive evolutionary algorithm for a fuzzy multi-objective hub location problem: an integration of responsiveness and social responsibility. Eng. Appl. Artif. Intell. 62 (2017), 1–16.
36. Zhalechian, M., Tavakkoli-Moghaddam, R., Rahimi, Y., Jolai, F., An interactive possibilistic programming approach for a multi-objective hub location problem: economic and environmental design. Appl. Soft Comput. 52 (2017), 699–713.
37. Kumar, V., Kumar, V., Brady, M., Garza-Reyes, J.A., Simpson, M., Resolving forward-reverse logistics multi-period model using evolutionary algorithms. Int. J. Prod. Econ. 183 (2017), 458–469.
38. Chen, Y.-W., Wang, L.-C., Wang, A., Chen, T.-L., A particle swarm approach for optimizing a multi-stage closed loop supply chain for the solar cell industry. Rob. Comput. Integr. Manuf. 43 (2017), 111–123.
39. Rabbani, M., Farrokhi-Asl, H., Asgarian, B., Solving a bi-objective location routing problem by a NSGA-II combined with clustering approach: application in waste collection problem. J. Ind. Eng. Int. 2016 (2016), 1–15.
40. Hajipour, V., Fattahi, P., Tavana, M., Di Caprio, D., Multi-objective multi-layer congested facility location-allocation problem optimization with Pareto-based meta-heuristics. Appl. Math. Modell. 40:7 (2016), 4948–4969.
41. Mavrotas, G., Effective implementation of the ε-constraint method in multi-objective mathematical programming problems. Appl. Math. Comput. 213:2 (2009), 455–465.
42. Mousavi, S.M., Sadeghi, J., Niaki, S.T.A., Tavana, M., A bi-objective inventory optimization model under inflation and discount using tuned Pareto-based algorithms: NSGA-II, NRGA, and MOPSO. Appl. Soft Comput. 43 (2016), 57–72.
43. Afzalirad, M., Rezaeian, J., A realistic variant of bi-objective unrelated parallel machine scheduling problem: NSGA-II and MOACO approaches. Appl. Soft Comput. 50 (2017), 109–123.
44. Eberhart, R., Kennedy, J., A new optimizer using particle swarm theory. in Micro Machine and Human Science, MHS'95. Proceedings of the Sixth International Symposium On. 1995, IEEE., 1995, 1995.
45. Moore, J., Chapman, R., Application of Particle Swarm to Multiobjective Optimization. 1999, Department of Computer Science and Software Engineering, Auburn University, 32.
46. Amini, A., Tavakkoli-Moghaddam, R., A bi-objective truck scheduling problem in a cross-docking center with probability of breakdown for trucks. Comput. Ind. Eng. 96 (2016), 180–191.