nach oben

Erschienen in:

2024 | OriginalPaper | Buchkapitel

Production Inventory Technician Routing Problem: A Bi-objective Post-sales Application

verfasst von : Alline Zanette, Michel Gendreau, Walter Rei

Erschienen in: Combinatorial Optimization and Applications

Verlag: Springer Nature Switzerland

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config

KI-gestützte Suche

Aus

Abstract

Dieses Kapitel präsentiert eine umfassende Studie des Production Inventory Technician Routing and Scheduling Problems (PITRSP), inspiriert von einem realen Fall in der Wartung nach dem Verkauf. Es wird ein biobjektives Optimierungsmodell eingeführt, um die Kosten zu minimieren und die Kundenzufriedenheit zu maximieren, wobei Benders Zersetzung als Lösung verwendet wird. Das Problem besteht in der Integration von Produktions-, Lager-, Vertriebs- und Technikerroutingentscheidungen, die für die Senkung der Logistikkosten und die Verbesserung der Servicequalität von entscheidender Bedeutung sind. Das Kapitel enthält außerdem eine detaillierte Problembeschreibung, Literaturrecherche und Computerexperimente, die Einblicke in die Zielkonflikte zwischen Kostenminimierung und Kundenzufriedenheit bieten. Die Ergebnisse zeigen deutliche Verbesserungen der Kundenzufriedenheit bei moderaten Kostensteigerungen, was die praktische Relevanz des vorgeschlagenen Modells unterstreicht.

KI-Generiert

Diese Zusammenfassung des Fachinhalts wurde mit Hilfe von KI generiert.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

über 102.000 Bücher
über 537 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Finance + Banking
Management + Führung
Marketing + Vertrieb
Maschinenbau + Werkstoffe
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 340 Zeitschriften

aus folgenden Fachgebieten:

Bauwesen + Immobilien
Business IT + Informatik
Finance + Banking
Management + Führung
Marketing + Vertrieb
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Vorheriges Kapitel Flow-Based Robustness in Consistent Home Care Service Delivery

Nächstes Kapitel Express Package Delivery Optimization Using Walkers, Cargo Tricycles and Delivery Trucks

Aazami, A., Saidi-Mehrabad, M., & Seyedhosseini, S. M. (2021). A bi-objective robust optimization model for an integrated production-distribution problem of perishable goods with demand improvement strategies: A case study. International Journal of Engineering, Transactions A: Basics, 34(7), 1766–1777.

Absi, N., Archetti, C., Dauzère-Pérès, S., Feillet, D., & Speranza, M. G. (2018). Comparing sequential and integrated approaches for the production routing problem. European Journal of Operational Research, 269(2), 633–646.CrossRef

Adulyasak, Y., Cordeau, J. F., & Jans, R. (2014a). Formulations and branch-and-cut algorithms for multivehicle production and inventory routing problems. INFORMS Journal on Computing, 26(1), 103–120.CrossRef

Adulyasak, Y., Cordeau, J. F., & Jans, R. (2014b). Optimization-based adaptive large neighborhood search for the production routing problem. Transportation Science, 48(1), 20–45.CrossRef

Adulyasak, Y., Cordeau, J. F., & Jans, R. (2015a). Benders decomposition for production routing under demand uncertainty. Operations Research, 63(4), 851–867.CrossRef

Adulyasak, Y., Cordeau, J. F., & Jans, R. (2015b). The production routing problem: A review of formulations and solution algorithms. Computers and Operations Research, 55, 141–152.CrossRef

Alkaabneh, F., Diabat, A., & Gao, H. O. (2020). Benders decomposition for the inventory vehicle routing problem with perishable products and environmental costs. Computers and Operations Research, 113, 1–13.CrossRef

Archetti, C., Bertazzi, L., Paletta, G., & Speranza, M. G. (2011). Analysis of the maximum level policy in a production-distribution system. Computers and Operations Research, 38(12), 1731–1746.CrossRef

Avci, M., & Yildiz, S. T. (2019). A matheuristic solution approach for the production routing problem with visit spacing policy. European Journal of Operational Research, 279(2), 572–588.CrossRef

Benders, J. F. (1962). Partitioning procedures for solving mixed-variables programming problems. Numerische Mathematik, 4, 238–252.CrossRef

Bérubé, J. F., Gendreau, M., & Potvin, J. Y. (2009). An exact \(\epsilon \)lunate-constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits. European Journal of Operational Research, 194(1), 39–50.CrossRef

Brahimi, N., & Aouam, T. (2016). Multi-item production routing problem with backordering: A MILP approach. International Journal of Production Research, 54(4), 1076–1093.CrossRef

Castillo-Salazar, J. A., Landa-Silva, D., & Qu, R. (2016). Workforce scheduling and routing problems: Literature survey and computational study. Annals of Operations Research, 239(1), 39–67.CrossRef

Çetinkaya, S., Üster, H., Easwaran, G., & Keskin, B. B. (2009). An integrated outbound logistics model for Frito-Lay: Coordinating aggregate-level production and distribution decisions. Interfaces, 39(5), 460–475.CrossRef

Chen, X., Thomas, B. W., & Hewitt, M. (2016). The technician routing problem with experience-based service times. Omega, 61, 49–61.CrossRef

Choudhary, D. (2015). An optimization model for scheduling tour of service personnel in aftersale service process with additional side conditions of responsiveness and FCFS service policy. Industrial Engineering and Management, 04, 1–5.CrossRef

Conejo, A. J., Castillo, E., & García-bertrand, R. M. R. (2006). Decomposition techniques in mathematical programming. Berlin: Springer.

Cordeau, J. F., Stojković, G., Soumis, F., & Desrosiers, J. (2001). Benders decomposition for simultaneous aircraft routing and crew scheduling. Transportation Science, 35(4), 375–388.CrossRef

Cordeau, J. F., Laporte, G., Pasin, F., & Ropke, S. (2010). Scheduling technicians and tasks in a telecommunications company. Journal of Scheduling, 13(4), 393–409.CrossRef

Cortés, C. E., Gendreau, M., Rousseau, L. M., Souyris, S., & Weintraub, A. (2014) Branch-and-price and constraint programming for solving a real-life technician dispatching problem. European Journal of Operational Research, 238(1), 300–312.CrossRef

Crainic, T. G., Hewitt, M., Maggioni, F., & Rei, W. (2021). Partial benders decomposition: General methodology and application to stochastic network design. Transportation Science, 55(2), 414–435.CrossRef

de Souza, R., Tan, A. W. K., Othman, H., & Garg, M. (2011). A proposed framework for managing service parts in automotive and aerospace industries. Benchmarking, 18(6), 769–782.CrossRef

Díaz-Madroñero, M., Peidro, D., & Mula, J. (2015) Integrated production and routing planning decisions under uncertainty: A case study. In Proceedings of the 2015 Conference of the International Fuzzy Systems Association and the European Society for Fuzzy Logic and Technology, December 2016 (pp. 1565–1570).

Du, M., Kong, N., & Hu, X. (2019). A new heuristic scheduling method for the make-pack-route problem in make-to-order supply chains. INFOR: Information Systems and Operational Research, 57(2), 296–313.

Ehrgott, M. (2008). Multiobjective optimization. AI Magazine, 29(4), 47–57.CrossRef

Erengüç, S. S., Simpson, N. C., & Vakharia, A. J. (1999). Integrated production/distribution planning in supply chains: An invited review. European Journal of Operational Research, 115(2), 219–236.CrossRef

Farghadani-Chaharsooghi, P., Kamranfar, P., Mirzapour Al-e-Hashem, M. S., & Rekik, Y. (2022). A joint production-workforce-delivery stochastic planning problem for perishable items. International Journal of Production Research, 60, 1–25.CrossRef

Fattahi, P., Tanhatalab, M., & Bashiri, M. (2017). Bi-objectives approach for a multi-period two echelons perishable product inventory-routing problem with production and lateral transshipment. International Journal of Engineering, 30(6), 876–886.

Geoffrion, A. M. (1972). Generalized benders decomposition. Journal of Optimization Theory and Applications, 10(4), 237–260.CrossRef

Grötschel, M., Krumke, S. O., Rambau, J., & Torres, L. M. (2003). Online-dispatching of automobile service units. In Operations Research Proceedings 2002 (pp. 168–173).

Hadjiconstantinou, E., & Roberts, D. (2002). Routing under uncertainty: An application in the scheduling of field service engineers. In P. Toth & D. Vigo (Eds.), The vehicle routing problem (Chap. 13, pp. 331–352). Philadelphia: Society for Industrial and Applied Mathematics.

Hallikas, J., Immonen, M., Pynnönen, M., & Mikkonen, K. (2014). Service purchasing and value creation: Towards systemic purchases. International Journal of Production Economics, 147(Part A), 53–61.

Hooker, J. N. (2019). Logic-based benders decomposition for large-scale optimization. In J. M. Velásquez-Bermúdez, M. Khakifirooz, & M. Fathi (Eds.), Large scale optimization in supply chains and smart manufacturing (Vol. 149, pp. 1–26). Cham: Springer Nature Switzerland AG.CrossRef

Ji, S. F., Peng, X. S., & Luo, R. J. (2019). An integrated model for the production-inventory-distribution problem in the Physical Internet. International Journal of Production Research, 57(4), 1000–1017.CrossRef

Jia, Y. J., Wang, C. J., & Wang, B. (2008). Multi-objective vehicle scheduling problem based on customer satisfaction and hybrid genetic algorithm. In Proceedings of the IEEE International Conference on Automation and Logistics, ICAL 2008 September 1934–1937.

Karamanov, M. (2006). Branch and cut: An empirical study. PhD thesis, Carnegie Mellon University.

Kovacs, A. A., Parragh, S. N., Doerner, K. F., & Hartl, R. F. (2012). Adaptive large neighborhood search for service technician routing and scheduling problems. Journal of Scheduling, 15(5), 579–600.CrossRef

Kumar, R. S., Kondapaneni, K., Dixit, V., Goswami, A., Thakur, L. S., & Tiwari, M. K. (2016). Multi-objective modeling of production and pollution routing problem with time window: A self-learning particle swarm optimization approach. Computers and Industrial Engineering, 99, 29–40.CrossRef

Lei, L., Liu, S., Ruszczynski, A., & Park, S. (2006). On the integrated production, inventory, and distribution routing problem. IIE Transactions, 38(11), 955–970.CrossRef

Li, Y., Chu, F., Chu, C., Zhou, W., & Zhu, Z. (2016). Integrated production inventory routing planning with time windows for perishable food. In IEEE Conference on Intelligent Transportation Systems, Proceedings, ITSC (pp. 2651–2656).

Li, Y., Chu, F., Chu, C., & Zhu, Z. (2019a). An efficient three-level heuristic for the large-scaled multi-product production routing problem with outsourcing. European Journal of Operational Research, 272(3), 914–927.CrossRef

Li, Y., Chu, F., Feng, C., Chu, C., & Zhou, M. C. (2019b). Integrated production inventory routing planning for intelligent food logistics systems. IEEE Transactions on Intelligent Transportation Systems, 20(3), 867–878.CrossRef

Liu, Y., Gao, B., Liu, H., & Wei, M. (2019). Optimal production, delivery and inventory policies for perishable products with replenishment lead time in two-echelon distribution network. In 2019 IEEE 6th International Conference on Industrial Engineering and Applications, ICIEA 2019 (pp. 262–266).

Liu, Z., Zhou, C., Chen, H., & Zhao, R. (2021). Impact of cost uncertainty on supply chain competition under different confidence levels. International Transactions in Operational Research, 28(3), 1465–1504.CrossRef

Lysgaard, J., Letchford, A. N., & Eglese, R. W. (2004). A new branch-and-cut algorithm for the capacitated vehicle routing problem. Mathematical Programming, 100(2), 423–445.CrossRef

Magnanti, T. L., & Wong, R. T. (1981). Accelerating benders decomposition: Algorithmic enhancement and model selection criteria. Operations Research, 29(3), 464–484.CrossRef

Mostafa, N. A., & Eltawil, A. B. (2015). The production-inventory-distribution-routing problem: An integrated formulation and solution framework. In IEOM 2015 - 5th International Conference on Industrial Engineering and Operations Management, Proceeding (pp. 1–10).

Murthy, D. N., Solem, O., & Roren, T. (2004). Product warranty logistics: Issues and challenges. European Journal of Operational Research, 156(1), 110–126.CrossRef

Neves-Moreira, F., Almada-Lobo, B., Cordeau, J. F., Guimarães, L., & Jans, R. (2019). Solving a large multi-product production-routing problem with delivery time windows. Omega, 86, 154–172.CrossRef

Parasuraman, A., Zeithaml, V. A., & Berry, L. L. (1985). A conceptual model of service quality and its implications for future research. Journal of Marketing, 49(4), 41.CrossRef

Peng, X. s., Feng Ji, S., & Ting Ji, T. (2019). Promoting sustainability of the integrated production-inventory-distribution system through the physical Internet. International Journal of Production Research, 58, 6985–7004.CrossRef

Pillac, V., Guéret, C., & Medaglia, A. L. (2013). A parallel matheuristic for the technician routing and scheduling problem. Optimization Letters, 7(7), 1525–1535.CrossRef

Porumbel, D. (2018). From the separation to the intersection sub-problem in Benders decomposition models with prohibitively-many constraints. Discrete Optimization, 29, 148–173.CrossRef

Qiu, Y., Wang, L., Fang, X., Pardalos, P. M., & Goldengorin, B. (2018a). Formulations and branch-and-cut algorithms for production routing problems with time windows. Transportmetrica A: Transport Science, 14(8), 669–690.CrossRef

Qiu, Y., Wang, L., Xu, X., Fang, X., & Pardalos, P. M. (2018b). Formulations and branch-and-cut algorithms for multi-product multi-vehicle production routing problems with startup cost. Expert Systems with Applications, 98, 1–10.CrossRef

Qiu, Y., Qiao, J., & Pardalos, P. M. (2019). Optimal production, replenishment, delivery, routing and inventory management policies for products with perishable inventory. Omega, 82, 193–204.CrossRef

Rahmaniani, R., Crainic, T. G., Gendreau, M., & Rei, W. (2017). The Benders decomposition algorithm: A literature review. European Journal of Operational Research, 259(3), 801–817.CrossRef

Rahmaniani, R., Ahmed, S., Crainic, T. G., Gendreau, M., & Rei, W. (2020). The benders dual decomposition method. Operations Research, 68(3), 878–895.CrossRef

Restrepo, M. I., Gendron, B., & Rousseau, L. M. (2018). Combining benders decomposition and column generation for multi-activity tour scheduling. Computers and Operations Research, 93, 151–165.CrossRef

Ruokokoski, M., Solyali, O., Cordeau, J., Jans, R., & Sural, H. (2010). Efficient formulations and a branch-and-cut algorithm for a production-routing problem. Accessed April 25, 2023. https://numerique.banq.qc.ca/patrimoine/details/52327/2772132

Shiguemoto, A. L., & Armentano, V. A. (2010). A tabu search procedure for coordinating production, inventory and distribution routing problems. International Transactions in Operational Research, 17(2), 179–195.CrossRef

Syahrial, E., Suzuki, H., & Schvaneveldt, S. J. (2019). The impact of serviceability-oriented dimensions on after-sales service cost and customer satisfaction. Total Quality Management and Business Excellence, 30(11–12), 1257–1281.CrossRef

Tang, H., Miller-Hooks, E., & Tomastik, R. (2007). Scheduling technicians for planned maintenance of geographically distributed equipment. Transportation Research Part E: Logistics and Transportation Review, 43(5), 591–609.CrossRef

Tversky, A., & Kahneman, D. (2019). Advances in prospect theory: Cumulative representation of uncertainty. Choices, Values, and Frames, 323, 44–66.

Vahdani, B., Niaki, S. T., & Aslanzade, S. (2017). Production-inventory-routing coordination with capacity and time window constraints for perishable products: Heuristic and meta-heuristic algorithms. Journal of Cleaner Production, 161, 598–618.CrossRef

Wang, S., & Chu, F. (2022). A decomposition-based heuristic method for inventory routing problem. IEEE Transactions on Intelligent Transportation Systems, 23(10), 18352–18360.CrossRef

Weintraub, A., Aboud, J., Fernandez, C., Laporte, G., & Ramirez, E. (1999). An emergency vehicle dispatching system for an electric utility in Chile. Journal of the Operational Research Society, 50(7), 690–696.CrossRef

Wu, B., Jiang, H. J., Wang, C., & Dong, M. (2021). Knowledge and behavior-driven fruit fly optimization algorithm for field service scheduling problem with customer satisfaction. Complexity, 2021

Xu, J., & Chiu, S. Y. (2001). Effective heuristic procedures for a field technician scheduling problem. Journal of Heuristics, 7(5), 495–509.CrossRef

Zhang, Q., Sundaramoorthy, A., Grossmann, I. E., & Pinto, J. M. (2017). Multiscale production routing in multicommodity supply chains with complex production facilities. Computers and Operations Research, 79(April 2016), 207–222.CrossRef

Zhang, Y., Alshraideh, H., & Diabat, A. (2018). A stochastic reverse logistics production routing model with environmental considerations. Annals of Operations Research, 271(2), 1023–1044.CrossRef

Zhang, Z., Luo, Z., Baldacci, R., & Lim, A. (2021). A benders decomposition approach for the multivehicle production routing problem with order-up-to-level policy. Transportation Science, 55(1), 160–178.CrossRef

Titel: Production Inventory Technician Routing Problem: A Bi-objective Post-sales Application
verfasst von: Alline Zanette
Michel Gendreau
Walter Rei
Verlag: Springer Nature Switzerland
Buch: Combinatorial Optimization and Applications
Print ISBN: 978-3-031-57602-7

Electronic ISBN: 978-3-031-57603-4

Copyright-Jahr: 2024
DOI: https://doi.org/10.1007/978-3-031-57603-4_16