IDEAS home Printed from https://ideas.repec.org/a/inm/ortrsc/v49y2015i4p784-795.html
   My bibliography  Save this article

A Two-Phase Iterative Heuristic Approach for the Production Routing Problem

Author

Listed:
  • N. Absi

    (Department of Manufacturing Sciences and Logistics, Ecole des Mines de Saint-Etienne, F-13541 Gardanne, France)

  • C. Archetti

    (Department of Economics and Management, University of Brescia, Brescia I-25122, Italy)

  • S. Dauzère-Pérès

    (Department of Manufacturing Sciences and Logistics, Ecole des Mines de Saint-Etienne, F-13541 Gardanne, France)

  • D. Feillet

    (Department of Manufacturing Sciences and Logistics, Ecole des Mines de Saint-Etienne, F-13541 Gardanne, France)

Abstract

This paper investigates the integrated optimization of production, distribution, and inventory decisions related to supplying multiple retailers from a central production facility. A single-item capacitated lot-sizing problem is defined for optimizing production decisions and inventory management. The optimization of daily distribution is modeled as a traveling salesman problem or a vehicle routing problem depending on the number of vehicles. A two-phase iterative method, from which several heuristics are derived, is proposed that iteratively focuses on lot-sizing and distribution decisions. Computational results show that our best heuristic outperforms existing methods.

Suggested Citation

  • N. Absi & C. Archetti & S. Dauzère-Pérès & D. Feillet, 2015. "A Two-Phase Iterative Heuristic Approach for the Production Routing Problem," Transportation Science, INFORMS, vol. 49(4), pages 784-795, November.
  • Handle: RePEc:inm:ortrsc:v:49:y:2015:i:4:p:784-795
    DOI: 10.1287/trsc.2014.0523
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.2014.0523
    Download Restriction: no

    File URL: https://libkey.io/10.1287/trsc.2014.0523?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
    ---><---

    References listed on IDEAS

    as
    1. Yossiri Adulyasak & Jean-François Cordeau & Raf Jans, 2014. "Optimization-Based Adaptive Large Neighborhood Search for the Production Routing Problem," Transportation Science, INFORMS, vol. 48(1), pages 20-45, February.
    2. Dauzere-Peres, Stephane & Lasserre, Jean-Bernard, 1994. "Integration of lotsizing and scheduling decisions in a job-shop," European Journal of Operational Research, Elsevier, vol. 75(2), pages 413-426, June.
    3. Gabriel R. Bitran & Horacio H. Yanasse, 1982. "Computational Complexity of the Capacitated Lot Size Problem," Management Science, INFORMS, vol. 28(10), pages 1174-1186, October.
    4. Boudia, M. & Prins, C., 2009. "A memetic algorithm with dynamic population management for an integrated production-distribution problem," European Journal of Operational Research, Elsevier, vol. 195(3), pages 703-715, June.
    5. S. Lin & B. W. Kernighan, 1973. "An Effective Heuristic Algorithm for the Traveling-Salesman Problem," Operations Research, INFORMS, vol. 21(2), pages 498-516, April.
    6. Yossiri Adulyasak & Jean-François Cordeau & Raf Jans, 2014. "Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems," INFORMS Journal on Computing, INFORMS, vol. 26(1), pages 103-120, February.
    7. Chandra, Pankaj & Fisher, Marshall L., 1994. "Coordination of production and distribution planning," European Journal of Operational Research, Elsevier, vol. 72(3), pages 503-517, February.
    8. F. Fumero & C. Vercellis, 1999. "Synchronized Development of Production, Inventory, and Distribution Schedules," Transportation Science, INFORMS, vol. 33(3), pages 330-340, August.
    9. M. Florian & J. K. Lenstra & A. H. G. Rinnooy Kan, 1980. "Deterministic Production Planning: Algorithms and Complexity," Management Science, INFORMS, vol. 26(7), pages 669-679, July.
    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. Qiu, Yuzhuo & Qiao, Jun & Pardalos, Panos M., 2019. "Optimal production, replenishment, delivery, routing and inventory management policies for products with perishable inventory," Omega, Elsevier, vol. 82(C), pages 193-204.
    2. Qiu, Yuzhuo & Zhou, Dan & Du, Yanan & Liu, Jie & Pardalos, Panos M. & Qiao, Jun, 2021. "The two-echelon production routing problem with cross-docking satellites," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 147(C).
    3. Zakaria Chekoubi & Wajdi Trabelsi & Nathalie Sauer & Ilias Majdouline, 2022. "The Integrated Production-Inventory-Routing Problem with Reverse Logistics and Remanufacturing: A Two-Phase Decomposition Heuristic," Sustainability, MDPI, vol. 14(20), pages 1-30, October.
    4. Manousakis, Eleftherios G. & Kasapidis, Grigoris A. & Kiranoudis, Chris T. & Zachariadis, Emmanouil E., 2022. "An infeasible space exploring matheuristic for the Production Routing Problem," European Journal of Operational Research, Elsevier, vol. 298(2), pages 478-495.
    5. Alvarez, Aldair & Miranda, Pedro & Rohmer, S.U.K., 2022. "Production routing for perishable products," Omega, Elsevier, vol. 111(C).
    6. Qiu, Yuzhuo & Ni, Ming & Wang, Liang & Li, Qinqin & Fang, Xuanjing & Pardalos, Panos M., 2018. "Production routing problems with reverse logistics and remanufacturing," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 111(C), pages 87-100.
    7. Camur, Mustafa C. & Sharkey, Thomas C. & Vogiatzis, Chrysafis, 2023. "The stochastic pseudo-star degree centrality problem," European Journal of Operational Research, Elsevier, vol. 308(2), pages 525-539.
    8. Absi, Nabil & Archetti, Claudia & Dauzère-Pérès, Stéphane & Feillet, Dominique & Speranza, M. Grazia, 2018. "Comparing sequential and integrated approaches for the production routing problem," European Journal of Operational Research, Elsevier, vol. 269(2), pages 633-646.
    9. Vidal, Thibaut & Laporte, Gilbert & Matl, Piotr, 2020. "A concise guide to existing and emerging vehicle routing problem variants," European Journal of Operational Research, Elsevier, vol. 286(2), pages 401-416.
    10. Brahimi, Nadjib & Absi, Nabil & Dauzère-Pérès, Stéphane & Nordli, Atle, 2017. "Single-item dynamic lot-sizing problems: An updated survey," European Journal of Operational Research, Elsevier, vol. 263(3), pages 838-863.
    11. Liu, Wenqian & Ke, Ginger Y. & Chen, Jian & Zhang, Lianmin, 2020. "Scheduling the distribution of blood products: A vendor-managed inventory routing approach," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 140(C).
    12. Neves-Moreira, Fábio & Almada-Lobo, Bernardo & Guimarães, Luís & Amorim, Pedro, 2022. "The multi-product inventory-routing problem with pickups and deliveries: Mitigating fluctuating demand via rolling horizon heuristics," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 164(C).
    13. Chevroton, Hugo & Kergosien, Yannick & Berghman, Lotte & Billaut, Jean-Charles, 2021. "Solving an integrated scheduling and routing problem with inventory, routing and penalty costs," European Journal of Operational Research, Elsevier, vol. 294(2), pages 571-589.
    14. Baller, Annelieke C. & Dabia, Said & Dullaert, Wout E.H. & Vigo, Daniele, 2019. "The Dynamic-Demand Joint Replenishment Problem with Approximated Transportation Costs," European Journal of Operational Research, Elsevier, vol. 276(3), pages 1013-1033.
    15. Hu, Weihong & Toriello, Alejandro & Dessouky, Maged, 2018. "Integrated inventory routing and freight consolidation for perishable goods," European Journal of Operational Research, Elsevier, vol. 271(2), pages 548-560.
    16. Avci, Mustafa & Yildiz, Seyda Topaloglu, 2019. "A matheuristic solution approach for the production routing problem with visit spacing policy," European Journal of Operational Research, Elsevier, vol. 279(2), pages 572-588.
    17. Schenekemberg, Cleder M. & Scarpin, Cassius T. & Pécora, José E. & Guimarães, Thiago A. & Coelho, Leandro C., 2021. "The two-echelon production-routing problem," European Journal of Operational Research, Elsevier, vol. 288(2), pages 436-449.
    18. Neves-Moreira, Fábio & Almada-Lobo, Bernardo & Cordeau, Jean-François & Guimarães, Luís & Jans, Raf, 2019. "Solving a large multi-product production-routing problem with delivery time windows," Omega, Elsevier, vol. 86(C), pages 154-172.
    19. Xuanjing Fang & Yanan Du & Yuzhuo Qiu, 2017. "Reducing Carbon Emissions in a Closed-Loop Production Routing Problem with Simultaneous Pickups and Deliveries under Carbon Cap-and-Trade," Sustainability, MDPI, vol. 9(12), pages 1-15, November.
    20. Qiu, Yuzhuo & Qiao, Jun & Pardalos, Panos M., 2017. "A branch-and-price algorithm for production routing problems with carbon cap-and-trade," Omega, Elsevier, vol. 68(C), pages 49-61.

    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. Xuanjing Fang & Yanan Du & Yuzhuo Qiu, 2017. "Reducing Carbon Emissions in a Closed-Loop Production Routing Problem with Simultaneous Pickups and Deliveries under Carbon Cap-and-Trade," Sustainability, MDPI, vol. 9(12), pages 1-15, November.
    2. Qiu, Yuzhuo & Zhou, Dan & Du, Yanan & Liu, Jie & Pardalos, Panos M. & Qiao, Jun, 2021. "The two-echelon production routing problem with cross-docking satellites," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 147(C).
    3. Li, Yantong & Chu, Feng & Chu, Chengbin & Zhu, Zhanguo, 2019. "An efficient three-level heuristic for the large-scaled multi-product production routing problem with outsourcing," European Journal of Operational Research, Elsevier, vol. 272(3), pages 914-927.
    4. Qiu, Yuzhuo & Ni, Ming & Wang, Liang & Li, Qinqin & Fang, Xuanjing & Pardalos, Panos M., 2018. "Production routing problems with reverse logistics and remanufacturing," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 111(C), pages 87-100.
    5. Hrabec, Dušan & Hvattum, Lars Magnus & Hoff, Arild, 2022. "The value of integrated planning for production, inventory, and routing decisions: A systematic review and meta-analysis," International Journal of Production Economics, Elsevier, vol. 248(C).
    6. Alvarez, Aldair & Miranda, Pedro & Rohmer, S.U.K., 2022. "Production routing for perishable products," Omega, Elsevier, vol. 111(C).
    7. Zakaria Chekoubi & Wajdi Trabelsi & Nathalie Sauer & Ilias Majdouline, 2022. "The Integrated Production-Inventory-Routing Problem with Reverse Logistics and Remanufacturing: A Two-Phase Decomposition Heuristic," Sustainability, MDPI, vol. 14(20), pages 1-30, October.
    8. Pedro L. Miranda & Reinaldo Morabito & Deisemara Ferreira, 2018. "Optimization model for a production, inventory, distribution and routing problem in small furniture companies," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 26(1), pages 30-67, April.
    9. Hu, Weihong & Toriello, Alejandro & Dessouky, Maged, 2018. "Integrated inventory routing and freight consolidation for perishable goods," European Journal of Operational Research, Elsevier, vol. 271(2), pages 548-560.
    10. Neves-Moreira, Fábio & Almada-Lobo, Bernardo & Cordeau, Jean-François & Guimarães, Luís & Jans, Raf, 2019. "Solving a large multi-product production-routing problem with delivery time windows," Omega, Elsevier, vol. 86(C), pages 154-172.
    11. Qiu, Yuzhuo & Qiao, Jun & Pardalos, Panos M., 2019. "Optimal production, replenishment, delivery, routing and inventory management policies for products with perishable inventory," Omega, Elsevier, vol. 82(C), pages 193-204.
    12. Qiu, Yuzhuo & Qiao, Jun & Pardalos, Panos M., 2017. "A branch-and-price algorithm for production routing problems with carbon cap-and-trade," Omega, Elsevier, vol. 68(C), pages 49-61.
    13. Masoud Chitsaz & Jean-François Cordeau & Raf Jans, 2019. "A Unified Decomposition Matheuristic for Assembly, Production, and Inventory Routing," INFORMS Journal on Computing, INFORMS, vol. 31(1), pages 134-152, February.
    14. Avci, Mustafa & Yildiz, Seyda Topaloglu, 2019. "A matheuristic solution approach for the production routing problem with visit spacing policy," European Journal of Operational Research, Elsevier, vol. 279(2), pages 572-588.
    15. Russell, Robert A., 2017. "Mathematical programming heuristics for the production routing problem," International Journal of Production Economics, Elsevier, vol. 193(C), pages 40-49.
    16. Drexl, A. & Kimms, A., 1997. "Lot sizing and scheduling -- Survey and extensions," European Journal of Operational Research, Elsevier, vol. 99(2), pages 221-235, June.
    17. Manousakis, Eleftherios G. & Kasapidis, Grigoris A. & Kiranoudis, Chris T. & Zachariadis, Emmanouil E., 2022. "An infeasible space exploring matheuristic for the Production Routing Problem," European Journal of Operational Research, Elsevier, vol. 298(2), pages 478-495.
    18. Leandro C. Coelho & Jean-François Cordeau & Gilbert Laporte, 2014. "Thirty Years of Inventory Routing," Transportation Science, INFORMS, vol. 48(1), pages 1-19, February.
    19. Nadjib Brahimi & Tarik Aouam, 2016. "Multi-item production routing problem with backordering: a MILP approach," International Journal of Production Research, Taylor & Francis Journals, vol. 54(4), pages 1076-1093, February.
    20. Drexl, Andreas & Kimms, Alf, 1996. "Lot sizing and scheduling: Survey and extensions," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 421, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.

    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:inm:ortrsc:v:49:y:2015:i:4:p:784-795. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.