IDEAS home Printed from https://ideas.repec.org/a/eee/proeco/v216y2019icp305-320.html
   My bibliography  Save this article

A multiobjective post-sales guarantee and repair services network design problem

Author

Listed:
  • Yıldız, Gazi Bilal
  • Soylu, Banu

Abstract

In this paper, we consider a biobjective post-sales guarantee and repair services network design problem. One of the objective functions minimizes the total transportation cost of the network, while the other one minimizes the total tardiness of returned products from the targeted delivery duration. Although the motivation of our problem emanates from the repair services network of a mobile phone company, proposed models and algorithms can easily be adapted to any type of products. The mobile phone customers are sensitive to delays and thus decreasing the tardiness improves the customer satisfaction. However, due to intense competition among mobile phone companies, the total cost of the repair services network should also be minimized. We analyze the tradeoff between these objective functions and discuss the properties of the Pareto frontier. We are able to find the Pareto frontier exactly for small size networks. For large size networks, we propose a variable neighborhood search (VNS) based heuristic to approximate the Pareto frontier. We perform an application and experiments on the current network of a mobile company and present alternatives to the decision maker.

Suggested Citation

  • Yıldız, Gazi Bilal & Soylu, Banu, 2019. "A multiobjective post-sales guarantee and repair services network design problem," International Journal of Production Economics, Elsevier, vol. 216(C), pages 305-320.
    • Handle: RePEc:eee:proeco:v:216:y:2019:i:c:p:305-320
    DOI: 10.1016/j.ijpe.2019.06.006
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S092552731930218X
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ijpe.2019.06.006?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Srivastava, Samir K., 2008. "Network design for reverse logistics," Omega, Elsevier, vol. 36(4), pages 535-548, August.
    2. Abraham Duarte & Juan Pantrigo & Eduardo Pardo & Nenad Mladenovic, 2015. "Multi-objective variable neighborhood search: an application to combinatorial optimization problems," Journal of Global Optimization, Springer, vol. 63(3), pages 515-536, November.
    3. de Brito, M.P. & Dekker, R., 2002. "Reverse logistics - a framework," Econometric Institute Research Papers EI 2002-38, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    4. Soylu, Banu, 2015. "Heuristic approaches for biobjective mixed 0–1 integer linear programming problems," European Journal of Operational Research, Elsevier, vol. 245(3), pages 690-703.
    5. Y. P. Aneja & K. P. K. Nair, 1979. "Bicriteria Transportation Problem," Management Science, INFORMS, vol. 25(1), pages 73-78, January.
    6. Hansen, Pierre & Mladenovic, Nenad, 2001. "Variable neighborhood search: Principles and applications," European Journal of Operational Research, Elsevier, vol. 130(3), pages 449-467, May.
    7. Thomas Stidsen & Kim Allan Andersen & Bernd Dammann, 2014. "A Branch and Bound Algorithm for a Class of Biobjective Mixed Integer Programs," Management Science, INFORMS, vol. 60(4), pages 1009-1032, April.
    8. Murphy, Paul R. & Poist, Richard F., 1988. "Management of Logistical Retromovements: An Empirical Analysis of Literature Suggestions," Journal of the Transportation Research Forum, Transportation Research Forum, vol. 29(1).
    9. Pierre Hansen & Nenad Mladenović & José Moreno Pérez, 2010. "Variable neighbourhood search: methods and applications," Annals of Operations Research, Springer, vol. 175(1), pages 367-407, March.
    10. Shad Dowlatshahi, 2000. "Developing a Theory of Reverse Logistics," Interfaces, INFORMS, vol. 30(3), pages 143-155, June.
    11. Min, Hokey & Jeung Ko, Hyun & Seong Ko, Chang, 2006. "A genetic algorithm approach to developing the multi-echelon reverse logistics network for product returns," Omega, Elsevier, vol. 34(1), pages 56-69, January.
    12. Pierre Hansen & Nenad Mladenović & Raca Todosijević & Saïd Hanafi, 2017. "Variable neighborhood search: basics and variants," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 5(3), pages 423-454, September.
    13. Fleischmann, Moritz & Bloemhof-Ruwaard, Jacqueline M. & Dekker, Rommert & van der Laan, Erwin & van Nunen, Jo A. E. E. & Van Wassenhove, Luk N., 1997. "Quantitative models for reverse logistics: A review," European Journal of Operational Research, Elsevier, vol. 103(1), pages 1-17, November.
    14. Govindan, Kannan & Soleimani, Hamed & Kannan, Devika, 2015. "Reverse logistics and closed-loop supply chain: A comprehensive review to explore the future," European Journal of Operational Research, Elsevier, vol. 240(3), pages 603-626.
    15. Lee, Der-Horng & Dong, Meng, 2008. "A heuristic approach to logistics network design for end-of-lease computer products recovery," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 44(3), pages 455-474, May.
    16. Alumur, Sibel A. & Nickel, Stefan & Saldanha-da-Gama, Francisco & Verter, Vedat, 2012. "Multi-period reverse logistics network design," European Journal of Operational Research, Elsevier, vol. 220(1), pages 67-78.
    17. Eskandarpour, Majid & Zegordi, Seyed Hessameddin & Nikbakhsh, Ehsan, 2013. "A parallel variable neighborhood search for the multi-objective sustainable post-sales network design problem," International Journal of Production Economics, Elsevier, vol. 145(1), pages 117-131.
    18. Mavrotas, G. & Diakoulaki, D., 1998. "A branch and bound algorithm for mixed zero-one multiple objective linear programming," European Journal of Operational Research, Elsevier, vol. 107(3), pages 530-541, June.
    19. Natashia Boland & Hadi Charkhgard & Martin Savelsbergh, 2015. "A Criterion Space Search Algorithm for Biobjective Integer Programming: The Balanced Box Method," INFORMS Journal on Computing, INFORMS, vol. 27(4), pages 735-754, November.
    20. Natashia Boland & Hadi Charkhgard & Martin Savelsbergh, 2015. "A Criterion Space Search Algorithm for Biobjective Mixed Integer Programming: The Triangle Splitting Method," INFORMS Journal on Computing, INFORMS, vol. 27(4), pages 597-618, November.
    21. Jayaraman, Vaidyanathan & Patterson, Raymond A. & Rolland, Erik, 2003. "The design of reverse distribution networks: Models and solution procedures," European Journal of Operational Research, Elsevier, vol. 150(1), pages 128-149, October.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Duong, Quang Huy & Zhou, Li & Meng, Meng & Nguyen, Truong Van & Ieromonachou, Petros & Nguyen, Duy Tiep, 2022. "Understanding product returns: A systematic literature review using machine learning and bibliometric analysis," International Journal of Production Economics, Elsevier, vol. 243(C).

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Agrawal, Saurabh & Singh, Rajesh K. & Murtaza, Qasim, 2015. "A literature review and perspectives in reverse logistics," Resources, Conservation & Recycling, Elsevier, vol. 97(C), pages 76-92.
    2. Soylu, Banu & Katip, Hatice, 2019. "A multiobjective hub-airport location problem for an airline network design," European Journal of Operational Research, Elsevier, vol. 277(2), pages 412-425.
    3. Soylu, Banu, 2018. "The search-and-remove algorithm for biobjective mixed-integer linear programming problems," European Journal of Operational Research, Elsevier, vol. 268(1), pages 281-299.
    4. Przybylski, Anthony & Gandibleux, Xavier, 2017. "Multi-objective branch and bound," European Journal of Operational Research, Elsevier, vol. 260(3), pages 856-872.
    5. Konur, Dinçer & Campbell, James F. & Monfared, Sepideh A., 2017. "Economic and environmental considerations in a stochastic inventory control model with order splitting under different delivery schedules among suppliers," Omega, Elsevier, vol. 71(C), pages 46-65.
    6. Cacchiani, Valentina & D’Ambrosio, Claudia, 2017. "A branch-and-bound based heuristic algorithm for convex multi-objective MINLPs," European Journal of Operational Research, Elsevier, vol. 260(3), pages 920-933.
    7. Daniel Jornada & V. Jorge Leon, 2020. "Filtering Algorithms for Biobjective Mixed Binary Linear Optimization Problems with a Multiple-Choice Constraint," INFORMS Journal on Computing, INFORMS, vol. 32(1), pages 57-73, January.
    8. Diabat, Ali & Kannan, Devika & Kaliyan, Mathiyazhagan & Svetinovic, Davor, 2013. "An optimization model for product returns using genetic algorithms and artificial immune system," Resources, Conservation & Recycling, Elsevier, vol. 74(C), pages 156-169.
    9. Melo, M.T. & Nickel, S. & Saldanha-da-Gama, F., 2009. "Facility location and supply chain management - A review," European Journal of Operational Research, Elsevier, vol. 196(2), pages 401-412, July.
    10. Schweiger, Katharina & Sahamie, Ramin, 2013. "A hybrid Tabu Search approach for the design of a paper recycling network," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 50(C), pages 98-119.
    11. Chao Chen & Shenle Pan & Zhu Wang & Ray Y. Zhong, 2017. "Using taxis to collect citywide E-commerce reverse flows: a crowdsourcing solution," International Journal of Production Research, Taylor & Francis Journals, vol. 55(7), pages 1833-1844, April.
    12. Boland, Natashia & Charkhgard, Hadi & Savelsbergh, Martin, 2017. "The Quadrant Shrinking Method: A simple and efficient algorithm for solving tri-objective integer programs," European Journal of Operational Research, Elsevier, vol. 260(3), pages 873-885.
    13. Fattahi, Ali & Turkay, Metin, 2018. "A one direction search method to find the exact nondominated frontier of biobjective mixed-binary linear programming problems," European Journal of Operational Research, Elsevier, vol. 266(2), pages 415-425.
    14. Van Engeland, Jens & Beliën, Jeroen & De Boeck, Liesje & De Jaeger, Simon, 2020. "Literature review: Strategic network optimization models in waste reverse supply chains," Omega, Elsevier, vol. 91(C).
    15. Masar Al-Rabeeah & Santosh Kumar & Ali Al-Hasani & Elias Munapo & Andrew Eberhard, 2019. "Bi-objective integer programming analysis based on the characteristic equation," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 10(5), pages 937-944, October.
    16. De Santis, Marianna & Grani, Giorgio & Palagi, Laura, 2020. "Branching with hyperplanes in the criterion space: The frontier partitioner algorithm for biobjective integer programming," European Journal of Operational Research, Elsevier, vol. 283(1), pages 57-69.
    17. Guillermo Cabrera-Guerrero & Matthias Ehrgott & Andrew J. Mason & Andrea Raith, 2022. "Bi-objective optimisation over a set of convex sub-problems," Annals of Operations Research, Springer, vol. 319(2), pages 1507-1532, December.
    18. Toso, Eli Angela V. & Alem, Douglas, 2014. "Effective location models for sorting recyclables in public management," European Journal of Operational Research, Elsevier, vol. 234(3), pages 839-860.
    19. Gamberini, Rita & Gebennini, Elisa & Manzini, Riccardo & Ziveri, Andrea, 2010. "On the integration of planning and environmental impact assessment for a WEEE transportation network—A case study," Resources, Conservation & Recycling, Elsevier, vol. 54(11), pages 937-951.
    20. Esmaeili, Somayeh & Bashiri, Mahdi & Amiri, Amirhossein, 2023. "An exact criterion space search algorithm for a bi-objective blood collection problem," European Journal of Operational Research, Elsevier, vol. 311(1), pages 210-232.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:proeco:v:216:y:2019:i:c:p:305-320. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/ijpe .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.