Optimal Routing and Assignment of Consultants for Energy Education, Inc.

References

• Beck JC, Prosser P, Selensky E. (2003) Vehicle routing and job shop scheduling: What’s the difference. Proc. 13th Internat. Conf. Automated Planning Scheduling , Trento, Italy, 267–276.Google Scholar
• Bard J, Kontoravdis G, Yu G. (2002) A branch-and-cut procedure for the vehicle routing problem with time windows. Transporatation Sci. 36(2):250–269.Link, Google Scholar
• Cheng CB, Wang KP. (2009) Solving a vehicle routing problem with time windows by a decomposition technique and a generic algorithm. Expert Systems Appl. 36(4):7758–7763.Crossref, Google Scholar
• Diaz J. (2005) A compact model and tight bounds for a combined location-routing problem. Comput. Oper. Res. 32(3):407–428.Crossref, Google Scholar
• Mastrogiannis N, Giannikos I, Boutsinas B. (2011) Solving the set covering problem based on a new clustering heuristic. Presentation, Department of Business Administration, University of Patras, Greece.Google Scholar
• Toregas C, Swain R, ReVelle C, Bergman L. (1971) The location of emergency service facilities. Oper. Res. 19(6):1363–1373.Link, Google Scholar
• Toth P, Vigo D. (2002) The Vehicle Routing Problem (Society for Industrial and Applied Mathematics, Philadelphia).Crossref, Google Scholar