Interfaces
HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
 QUICK SEARCH:   [advanced]


     


INTERFACES
Vol. 36, No. 4, July-August 2006, pp. 302-313
DOI: 10.1287/inte.1060.0204
This Article
Right arrow Full Text (PDF)
Right arrow References
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Download to citation manager
Right arrow reprints & permissions
Citing Articles
Right arrow Citing Articles via Google Scholar
Google Scholar
Right arrow Articles by Jang, W.
Right arrow Articles by Perkins, T. E.
Right arrow Search for Related Content

The Missouri Lottery Optimizes Its Scheduling and Routing to Improve Efficiency and Balance

Wooseung Jang, Huay H. Lim, Thomas J. Crowe, Gail Raskin, Thomas E. Perkins

Department of Industrial and Manufacturing Systems Engineering, University of Missouri–Columbia, Columbia, Missouri 65211
Department of Industrial and Manufacturing Systems Engineering, University of Missouri–Columbia, Columbia, Missouri 65211
Department of Industrial and Manufacturing Systems Engineering, University of Missouri–Columbia, Columbia, Missouri 65211
The Missouri Lottery, 1823 Southridge Drive, Jefferson City, Missouri 65109
The Missouri Lottery, 1823 Southridge Drive, Jefferson City, Missouri 65109

jangw{at}missouri.edu
hhl38b{at}mizzou.edu
crowet{at}missouri.edu
raskig{at}molottery.com
perkit{at}molottery.com

The Missouri lottery, a profit-driven nonprofit organization, generates annual revenues of over $800 million by selling lottery tickets; 27.5 percent of the revenue goes to Missouri’s public education programs. The lottery sales representatives (LSRs) play a central role in increasing sales by providing excellent customer service to ticket retailers throughout the state. Hence, LSRs must have equitable, balanced work schedules and efficient routes and navigation sequences. Our objective was to provide scheduling and routing policies that minimize LSRs’ total travel distance while balancing their workloads and meeting visitation constraints. We modeled the problem as a periodic traveling-salesman problem and developed improvement algorithms specifically to solve this problem. The newly implemented schedules and routes decrease the LSRs’ travel distance by 15 percent, improve visitation feasibility by 46 percent, increase the balance of routes by 63 percent, decrease overtime days by 32 percent, and indirectly increase the sales of lottery tickets by improving customer service.

Key Words: games; group decisions; gambling; transportation; vehicle routing






HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
Copyright © 2006 by INFORMS.