IDEAS home Printed from https://ideas.repec.org/a/inm/orinte/v43y2013i6p530-546.html
   My bibliography  Save this article

Redesigning Midday Meal Logistics for the Akshaya Patra Foundation: OR at Work in Feeding Hungry School Children

Author

Listed:
  • B. Mahadevan

    (Indian Institute of Management, Bangalore 560076, India)

  • S. Sivakumar

    (Indian Institute of Management, Bangalore 560076, India)

  • D. Dinesh Kumar

    (Unisys Corporation, Bangalore 560066, India)

  • K. Ganeshram

    (Flipkart India Private Limited, Bangalore 560034, India)

Abstract

Midday meal programs at schools are prevalent in countries such as India. The Akshaya Patra Foundation, a not-for-profit organization, operates such a program in India for about 1.3 million children in more than 9,000 schools in nine states. The foundation faced a logistics problem in efficiently distributing food within the available time window. This paper discusses the challenges it faced, how we used OR modeling to overcome them, and how we designed, developed, and implemented a software solution. To address the logistics problem, we proposed a three-stage decomposition heuristic solution, which consists of clustering schools, assigning appropriate distribution vehicles to clusters, and routing vehicles within the clusters. We implemented our solution, AMRUTA, on a pilot basis in one location. Based on this pilot, the projected annual cost savings are US$75,000, which would enable the foundation to add 2,400 more children. When the program is fully implemented, we estimate that the annual cost savings will be about US$1.96 million. This project demonstrates how operations research can be useful for solving social sector problems in a developing country such as India.

Suggested Citation

  • B. Mahadevan & S. Sivakumar & D. Dinesh Kumar & K. Ganeshram, 2013. "Redesigning Midday Meal Logistics for the Akshaya Patra Foundation: OR at Work in Feeding Hungry School Children," Interfaces, INFORMS, vol. 43(6), pages 530-546, December.
    • Handle: RePEc:inm:orinte:v:43:y:2013:i:6:p:530-546
    DOI: 10.1287/inte.2013.0714
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/inte.2013.0714
    Download Restriction: no
    File URL: https://libkey.io/10.1287/inte.2013.0714?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. Dondo, Rodolfo & Cerda, Jaime, 2007. "A cluster-based optimization approach for the multi-depot heterogeneous fleet vehicle routing problem with time windows," European Journal of Operational Research, Elsevier, vol. 176(3), pages 1478-1507, February.
    2. John J. Bartholdi & Loren K. Platzman & R. Lee Collins & William H. Warden, 1983. "A Minimal Technology Routing System for Meals on Wheels," Interfaces, INFORMS, vol. 13(3), pages 1-8, June.
    3. Gilbert Laporte & FranÇois V. Louveaux & Luc van Hamme, 2002. "An Integer L -Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands," Operations Research, INFORMS, vol. 50(3), pages 415-423, June.
    4. Bai, Yanping & Zhang, Wendong & Jin, Zhen, 2006. "An new self-organizing maps strategy for solving the traveling salesman problem," Chaos, Solitons & Fractals, Elsevier, vol. 28(4), pages 1082-1089.
    5. Mauro Dell'Amico & Michele Monaci & Corrado Pagani & Daniele Vigo, 2007. "Heuristic Approaches for the Fleet Size and Mix Vehicle Routing Problem with Time Windows," Transportation Science, INFORMS, vol. 41(4), pages 516-526, November.
    6. Olli Bräysy & Wout Dullaert & Geir Hasle & David Mester & Michel Gendreau, 2008. "An Effective Multirestart Deterministic Annealing Metaheuristic for the Fleet Size and Mix Vehicle-Routing Problem with Time Windows," Transportation Science, INFORMS, vol. 42(3), pages 371-386, August.
    7. C D Tarantilis & C T Kiranoudis & V S Vassiliadis, 2003. "A list based threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(1), pages 65-71, January.
    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. Granillo-Macías, Rafael, 2021. "Logistics optimization through a social approach for food distribution," Socio-Economic Planning Sciences, Elsevier, vol. 76(C).
    2. Andrew S. Manikas & James R. Kroes & Thomas F. Gattiker, 2016. "Metro Meals on Wheels Treasure Valley Employs a Low-Cost Routing Tool to Improve Deliveries," Interfaces, INFORMS, vol. 46(2), pages 154-167, April.

    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. Puca Huachi Vaz Penna & Anand Subramanian & Luiz Satoru Ochi & Thibaut Vidal & Christian Prins, 2019. "A hybrid heuristic for a broad class of vehicle routing problems with heterogeneous fleet," Annals of Operations Research, Springer, vol. 273(1), pages 5-74, February.
    2. Koç, Çağrı & Bektaş, Tolga & Jabali, Ola & Laporte, Gilbert, 2016. "Thirty years of heterogeneous vehicle routing," European Journal of Operational Research, Elsevier, vol. 249(1), pages 1-21.
    3. Schneider, M., 2016. "The vehicle-routing problem with time windows and driver-specific times," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 65941, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    4. C E Cortés & M Gendreau & D Leng & A Weintraub, 2011. "A simulation-based approach for fleet design in a technician dispatch problem with stochastic demand," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(8), pages 1510-1523, August.
    5. Koç, Çağrı & Bektaş, Tolga & Jabali, Ola & Laporte, Gilbert, 2016. "The fleet size and mix location-routing problem with time windows: Formulations and a heuristic algorithm," European Journal of Operational Research, Elsevier, vol. 248(1), pages 33-51.
    6. Hiermann, Gerhard & Puchinger, Jakob & Ropke, Stefan & Hartl, Richard F., 2016. "The Electric Fleet Size and Mix Vehicle Routing Problem with Time Windows and Recharging Stations," European Journal of Operational Research, Elsevier, vol. 252(3), pages 995-1018.
    7. Schneider, Michael, 2016. "The vehicle-routing problem with time windows and driver-specific times," European Journal of Operational Research, Elsevier, vol. 250(1), pages 101-119.
    8. Olli Bräysy & Wout Dullaert & Geir Hasle & David Mester & Michel Gendreau, 2008. "An Effective Multirestart Deterministic Annealing Metaheuristic for the Fleet Size and Mix Vehicle-Routing Problem with Time Windows," Transportation Science, INFORMS, vol. 42(3), pages 371-386, August.
    9. Imran, Arif & Salhi, Said & Wassan, Niaz A., 2009. "A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 197(2), pages 509-518, September.
    10. Houda Derbel & Bassem Jarboui & Rim Bhiri, 2019. "A skewed general variable neighborhood search algorithm with fixed threshold for the heterogeneous fleet vehicle routing problem," Annals of Operations Research, Springer, vol. 272(1), pages 243-272, January.
    11. Gong, Manlin & Hu, Yucong & Chen, Zhiwei & Li, Xiaopeng, 2021. "Transfer-based customized modular bus system design with passenger-route assignment optimization," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 153(C).
    12. Kaplan, Edward H., 2008. "Adventures in policy modeling! Operations research in the community and beyond," Omega, Elsevier, vol. 36(1), pages 1-9, February.
    13. Goodson, Justin C. & Ohlmann, Jeffrey W. & Thomas, Barrett W., 2012. "Cyclic-order neighborhoods with application to the vehicle routing problem with stochastic demand," European Journal of Operational Research, Elsevier, vol. 217(2), pages 312-323.
    14. Lars M. Hvattum & Arne Løkketangen & Gilbert Laporte, 2006. "Solving a Dynamic and Stochastic Vehicle Routing Problem with a Sample Scenario Hedging Heuristic," Transportation Science, INFORMS, vol. 40(4), pages 421-438, November.
    15. Florent Hernandez & Michel Gendreau & Ola Jabali & Walter Rei, 2019. "A local branching matheuristic for the multi-vehicle routing problem with stochastic demands," Journal of Heuristics, Springer, vol. 25(2), pages 215-245, April.
    16. Özgün Elçi & John Hooker, 2022. "Stochastic Planning and Scheduling with Logic-Based Benders Decomposition," INFORMS Journal on Computing, INFORMS, vol. 34(5), pages 2428-2442, September.
    17. E. Mijangos, 2015. "An algorithm for two-stage stochastic mixed-integer nonlinear convex problems," Annals of Operations Research, Springer, vol. 235(1), pages 581-598, December.
    18. Gustavo Angulo & Shabbir Ahmed & Santanu S. Dey, 2016. "Improving the Integer L-Shaped Method," INFORMS Journal on Computing, INFORMS, vol. 28(3), pages 483-499, August.
    19. Rey, David & Almi’ani, Khaled & Nair, Divya J., 2018. "Exact and heuristic algorithms for finding envy-free allocations in food rescue pickup and delivery logistics," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 112(C), pages 19-46.
    20. Xiao, Yiyong & Zhang, Yue & Kaku, Ikou & Kang, Rui & Pan, Xing, 2021. "Electric vehicle routing problem: A systematic review and a new comprehensive model with nonlinear energy recharging and consumption," Renewable and Sustainable Energy Reviews, Elsevier, vol. 151(C).

    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:orinte:v:43:y:2013:i:6:p:530-546. 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.