IDEAS home Printed from https://ideas.repec.org/a/gam/jlogis/v9y2025i1p28-d1589591.html
   My bibliography  Save this article

A Capacitated Vehicle Routing Model for Distribution and Repair with a Service Center

Author

Listed:
  • Irma-Delia Rojas-Cuevas

    (Departamento de Ingenierías, Tecnológico Nacional de México Campus Puebla, Av. Tecnológico 420, Puebla 72000, Puebla, Mexico)

  • Elias Olivares-Benitez

    (Facultad de Ingenieria, Universidad Panamericana, Alvaro del Portillo 49, Zapopan 45010, Jalisco, Mexico)

  • Alfredo S. Ramos

    (Facultad de Ingenieria, Universidad Panamericana, Alvaro del Portillo 49, Zapopan 45010, Jalisco, Mexico)

  • Samuel Nucamendi-Guillén

    (Facultad de Ingenieria, Universidad Panamericana, Alvaro del Portillo 49, Zapopan 45010, Jalisco, Mexico)

Abstract

Background: Distribution systems often face the dual challenge of delivering products to customers and retrieving damaged items for repair, especially when the service center is separate from the depot. An optimized solution to this logistics problem produces benefits in terms of costs, greenhouse gas emissions, and disposal reduction. Methods: This research proposes a Capacitated Vehicle Routing Problem with Service Center (CVRPwSC) model to determine optimal routes involving customers, the depot, and the service center. AMPL-Gurobi was used to solve the model on adapted instances and new instances developed for the CVRPwSC. Additionally, a Variable Neighborhood Search (VNS) algorithm was implemented and compared with AMPL-Gurobi. Results: The model was applied to a real-world case study, achieving a 40% reduction in fuel costs, a reduction from 5 to 3 routes, and a sustainable logistics operations model with potential reductions of greenhouse gas emissions and item disposals. Conclusions: The main contribution of the proposal is a minimum-cost routing model integrating item returns for repair with customer deliveries, while the limitation is the exclusion of scenarios where return items exceed vehicle capacity. Finally, future research will enhance the CVRPwSC model by incorporating additional constraints and decision variables to address such scenarios.

Suggested Citation

  • Irma-Delia Rojas-Cuevas & Elias Olivares-Benitez & Alfredo S. Ramos & Samuel Nucamendi-Guillén, 2025. "A Capacitated Vehicle Routing Model for Distribution and Repair with a Service Center," Logistics, MDPI, vol. 9(1), pages 1-36, February.
    • Handle: RePEc:gam:jlogis:v:9:y:2025:i:1:p:28-:d:1589591
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2305-6290/9/1/28/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2305-6290/9/1/28/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Pawel Sitek & Jarosław Wikarek, 2019. "Capacitated vehicle routing problem with pick-up and alternative delivery (CVRPPAD): model and implementation using hybrid approach," Annals of Operations Research, Springer, vol. 273(1), pages 257-277, February.
    2. Augerat, P. & Belenguer, J. M. & Benavent, E. & Corberan, A. & Naddef, D., 1998. "Separating capacity constraints in the CVRP using tabu search," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 546-557, April.
    3. 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.
    4. Wang, Yong & Peng, Shouguo & Zhou, Xuesong & Mahmoudi, Monirehalsadat & Zhen, Lu, 2020. "Green logistics location-routing problem with eco-packages," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 143(C).
    Full references (including those not matched with items on IDEAS)

    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. Cai, Yutong & Ong, Ghim Ping & Meng, Qiang, 2022. "Dynamic bicycle relocation problem with broken bicycles," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 165(C).
    2. Gilberto F. Sousa Filho & Teobaldo L. Bulhões Júnior & Lucidio A. F. Cabral & Luiz Satoru Ochi & Fábio Protti, 2017. "New heuristics for the Bicluster Editing Problem," Annals of Operations Research, Springer, vol. 258(2), pages 781-814, November.
    3. Bektaş, Tolga & Gouveia, Luis & Martínez-Sykora, Antonio & Salazar-González, Juan-José, 2019. "Balanced vehicle routing: Polyhedral analysis and branch-and-cut algorithm," European Journal of Operational Research, Elsevier, vol. 273(2), pages 452-463.
    4. Malaguti, Enrico & Martello, Silvano & Santini, Alberto, 2018. "The traveling salesman problem with pickups, deliveries, and draft limits," Omega, Elsevier, vol. 74(C), pages 50-58.
    5. Pardis Pourmohammadi & Reza Tavakkoli-Moghaddam & Yaser Rahimi & Chefi Triki, 2023. "Solving a hub location-routing problem with a queue system under social responsibility by a fuzzy meta-heuristic algorithm," Annals of Operations Research, Springer, vol. 324(1), pages 1099-1128, May.
    6. Bulhões, Teobaldo & Subramanian, Anand & Erdoğan, Güneş & Laporte, Gilbert, 2018. "The static bike relocation problem with multiple vehicles and visits," European Journal of Operational Research, Elsevier, vol. 264(2), pages 508-523.
    7. Martín Barragán, Belén, 2016. "A Partial parametric path algorithm for multiclass classification," DES - Working Papers. Statistics and Econometrics. WS 22390, Universidad Carlos III de Madrid. Departamento de Estadística.
    8. Venkatesh Pandiri & Alok Singh, 2020. "Two multi-start heuristics for the k-traveling salesman problem," OPSEARCH, Springer;Operational Research Society of India, vol. 57(4), pages 1164-1204, December.
    9. R. Baldacci & E. Hadjiconstantinou & A. Mingozzi, 2004. "An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation," Operations Research, INFORMS, vol. 52(5), pages 723-738, October.
    10. Martinhon, Carlos & Lucena, Abilio & Maculan, Nelson, 2004. "Stronger K-tree relaxations for the vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 158(1), pages 56-71, October.
    11. Guan, Yunlin & Xiang, Wang & Wang, Yun & Yan, Xuedong & Zhao, Yi, 2023. "Bi-level optimization for customized bus routing serving passengers with multiple-trips based on state–space–time network," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 614(C).
    12. Zhang, Ruijuan & Dai, Ying & Yang, Fei & Ma, Zujun, 2024. "A cooperative vehicle routing problem with delivery options for simultaneous pickup and delivery services in rural areas," Socio-Economic Planning Sciences, Elsevier, vol. 93(C).
    13. H. Asefi & S. Lim & M. Maghrebi & S. Shahparvari, 2019. "Mathematical modelling and heuristic approaches to the location-routing problem of a cost-effective integrated solid waste management," Annals of Operations Research, Springer, vol. 273(1), pages 75-110, February.
    14. Zhang, Lele & Ding, Pengyuan & Thompson, Russell G., 2023. "A stochastic formulation of the two-echelon vehicle routing and loading bay reservation problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 177(C).
    15. Amira Saker & Amr Eltawil & Islam Ali, 2023. "Adaptive Large Neighborhood Search Metaheuristic for the Capacitated Vehicle Routing Problem with Parcel Lockers," Logistics, MDPI, vol. 7(4), pages 1-27, October.
    16. Zhaowei Miao & Feng Yang & Ke Fu & Dongsheng Xu, 2012. "Transshipment service through crossdocks with both soft and hard time windows," Annals of Operations Research, Springer, vol. 192(1), pages 21-47, January.
    17. Wu, Weitiao & Li, Yu, 2024. "The multi-compartment truck and trailer petrol station replenishment problem with domino hazard risks," Transportation Research Part B: Methodological, Elsevier, vol. 190(C).
    18. Shubhechyya Ghosal & Wolfram Wiesemann, 2020. "The Distributionally Robust Chance-Constrained Vehicle Routing Problem," Operations Research, INFORMS, vol. 68(3), pages 716-732, May.
    19. Xuecheng Tian & Yanxia Guan & Shuaian Wang, 2023. "Data Transformation in the Predict-Then-Optimize Framework: Enhancing Decision Making under Uncertainty," Mathematics, MDPI, vol. 11(17), pages 1-12, September.
    20. Van Woensel, T. & Kerbache, L. & Peremans, H. & Vandaele, N., 2008. "Vehicle routing with dynamic travel times: A queueing approach," European Journal of Operational Research, Elsevier, vol. 186(3), pages 990-1007, May.

    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:gam:jlogis:v:9:y:2025:i:1:p:28-:d:1589591. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    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.