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

References

• Bai Y, Zhang W, Jin Z (2006) A new self-organizing maps strategy for solving the traveling salesman problem. Chaos Solitons Fractals 28(4):1082–1089.Crossref, Google Scholar
• Bartholdi JJ III, Platzman LK, Collins RL, Warden WH III (1983) A minimal technology routing system for meals on wheels. Interfaces 13(3):1–8.Link, Google Scholar
• Bauers A (2010) Self-organizing map resources. Accessed April 20, 2013, http://www.unc.edu/~bauers/digital_library/nn_som.html.Google Scholar
• Bräysy O, Dullaert W, Hasle G, Mester D, Gendreau M (2008) An effective multirestart deterministic annealing metaheuristic for the fleet size and mix vehicle-routing problem with time windows. Transportation Sci. 42(3):371–386.Link, Google Scholar
• Brocki L, Korvzinek D (2007) Kohonen self-organizing map for the traveling salesperson problem. Jabłoński R, Turkowski M, Szewczyk R, eds. Recent Advances in Mechatronics (Springer, Berlin, Heidelberg), 116–119.Crossref, Google Scholar
• Budinich M (1996) A self-organizing neural network for the traveling salesman problem that is competitive with simulated annealing. Neural Comput. 8(2):416–424.Crossref, Google Scholar
• Crainic T, Perboli G, Rei W, Tadei R (2011) Efficient lower bounds and heuristics for the variable cost and size bin packing problem. Comput. Oper. Res. 38(11):1474–1482.Crossref, Google Scholar
• Créput J, Koukam A, Hajjam A (2007) Self-organizing maps in evolutionary approach for the vehicle routing problem with time windows. Internat. J. Comput. Sci. Network Security 7(1):103–110.Google Scholar
• Dell’Amico M, Monaci M, Pagani C, Vigo D (2007) Heuristic approaches for the fleet size and mix vehicle routing problem with time windows. Transportation Sci. 41(4):516–526.Link, Google Scholar
• Dondo R, Cerdá J (2007) A cluster-based optimization approach for the multi-depot heterogeneous fleet vehicle routing problem with time windows. Eur. J. Oper. Res. 176(3):1478–1507.Crossref, Google Scholar
• Ferland J, Michelon P (1988) The vehicle scheduling problem with multiple vehicle types. J. Oper. Res. Soc. 39(6):577–583.Google Scholar
• Fisher M, Jaikumar R (1981) A generalized assignment heuristic for vehicle routing. Networks 11(2):109–124.Crossref, Google Scholar
• Fröhlich J (2004) Neural Networks with Java: 3D travelling salesman problem applet using SOM. Accessed April 20, 2013, http://www.nnwj.de/sample-applet.html.Google Scholar
• Geetha S, Poonthalir G, Vanathi P (2009) Improved K-means algorithm for capacitated clustering problem. Internat. INFOCOMP J. Comput. Sci. 8(4):52–59.Google Scholar
• Gendreau M, Laporte G, Potvin J (2002) Metaheuristics for the capacitated VRP. Toth P, Vigo D, eds. The Vehicle Routing Problem (SIAM, Philadelphia), 129–154.Crossref, Google Scholar
• Ghatak S (2010) Performance of the mid-day meal scheme. Accessed June 30, 2012, http://zunia.org/uploads/media/knowledge/Mid_Day_Meal_Scheme1.pdf.Google Scholar
• Haouari M, Serairi M (2009) Heuristics for the variable sized bin-packing problem. Comput. Oper. Res. 36(10):2877–2884.Crossref, Google Scholar
• Kohonen T (1990) The self-organizing map. Accessed April 20, 2013, http://www.eicstes.org/EICSTES_PDF/PAPERS/The%20Self-Organizing%20Map%20(Kohonen).pdf.Google Scholar
• Krishna K, Narasimha Murty M (1999) Genetic K-means algorithm. Accessed April 20, 2013, http://eprints.iisc.ernet.in/2937/1/genetic-k.pdf.Google Scholar
• Laporte G, Louveaux FV, van Hamme L (2002) An integer L-shaped algorithm for the capacitated vehicle routing problem with stochastic demands. Oper. Res. 50(3):415–423.Link, Google Scholar
• Lattin J, Carroll J, Green P (2003) Analyzing Multivariate Data (Cengage Learning India Private Limited, New Delhi).Google Scholar
• Li F, Golden B, Wasil E (2007) A record-to-record travel algorithm for solving the heterogeneous fleet vehicle routing problem. Comput. Oper. Res. 34(9):2734–2742.Crossref, Google Scholar
• Lu Y, Lu S, Fotouhi F, Deng Y, Brown S (2004) FGKA: A fast genetic K-means clustering algorithm. Proc. 2004 ACM Sympos. Appl. Comput. (ACM, New York), 622–623.Google Scholar
• Modares A, Somhom S, Enkawa T (1999) A self-organizing neural network approach for multiple traveling salesman and vehicle routing problems. Internat. Trans. Oper. Res. 6(6):591–606.Crossref, Google Scholar
• Nilsson C (2003) Heuristics for the traveling salesman problem. Working paper, Department of Computer Science, Linköping University, Linköping, Sweden.Google Scholar
• Privé J, Renaud J, Boctor F, Laporte G (2005) Solving a vehicle-routing problem arising in soft-drink distribution. J. Oper. Res. Soc. 57(9):1045–1052.Crossref, Google Scholar
• Right-to-Food-India (2010) Mid-day meals: Introduction. Accessed June 29, 2012, http://www.righttofoodindia.org/mdm/mdm_intro.html.Google Scholar
• Tan K, Lee L, Zhu Q, Ou K (2001) Heuristic methods for vehicle routing problem with time windows. Artificial Intelligence Engrg. 15(3):281–295.Crossref, Google Scholar
• Tarantilis C, Kiranoudis C, Vassiliadis V (2003) A list based threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem. J. Oper. Res. Soc. 54(1):65–71.Crossref, Google Scholar
• Thangiah S, Osman I, Sun T (1994) Hybrid genetic algorithm, simulated annealing and tabu search methods for vehicle routing problems with time windows. Technical report, Slippery Rock University, Slippery Rock, PA.Google Scholar
• Upton D, Ellis C, Lucas S, Yamner A (2007) Akshaya Patra: Feeding India’s schoolchildren. Accessed April 20, 2013, http://www.akshayapatra.org/sites/default/files/images/harvard_business_school_study.pdf.Google Scholar
• Zalik K (2008) An efficient k-means clustering algorithm. Pattern Recognition Lett. 29(9):1385–1391.Crossref, Google Scholar