|
OR/MS Today - February 2008 DNC Challenges Preparing for the Democratic National Convention Going 'green' adds complexity to convention's not-so-conventional logistics problems. Is O.R. up to the challenge? By Harvey J. Greenberg There are a great many challenging opportunities in preparing for the Democratic National Convention (DNC), to be held Aug. 25-28 in Denver. This article, based on research by the University of Colorado Denver (UCD) students in a Mathematics Clinic, is an introduction to some of those opportunities that seem amenable to quantitative methods. See www-math.cudenver.edu/~hgreenbe/clinicS08/ for more information about this project course. See [3] for a general introduction to event planning, [5] for project management and [6] for a succinct introduction to successful greening initiatives in the hospitality industry. Results will be reported in May on both the content and the process of our work. First, a caveat: This article is based on the best available information from people still working through what needs to be done (see acknowledgments). Circumstances can change during the next few months. The primary goal of any transportation system is to maximize service by minimizing delays and travel time. Specific forms of transportation (bus vs. bike vs. pedi-cabs) will be addressed separately. The DNCC wants to know:
The DNCH wants to know:
The design of bus routes and schedules to transport people between their hotels and the Pepsi Center is called a vehicle routing problem (VRP). This is a hard problem, but it has been studied for decades, so there are useful results in the literature. Our situation is non-standard, partly due to the Green initiative, so we have an opportunity to formulate a new VRP model and exploit what has been done to solve it. Transportation between the airport and hotels is another VRP, but with other non-standard elements. For example, we may want to identify locations for buses to pick up volunteers to greet the arrivals. Some of those volunteers may remain at the airport and some may return with that load of passengers. Besides moving people, transportation challenges could include moving recycled materials. One needs to specify depots and routes for waste management to pick up the recycled materials. Recycle bins could be at multiple locations inside every hotel, and volunteers would move them to a depot. Every depot will have a path to the Pepsi Center, and some distant path could pass another depot to allow the rider to drop it off if there is a problem. Depots can also be located at the light rail Pepsi Center stop, allowing some to ride a short distance to the center's entrance. Volunteers will service the depots and transfer bikes from one depot to another, as needed. The bike inventory challenge is to determine how many bikes to transfer from one depot to another at the end of each shift. One goal is to minimize shortages for a given number of volunteers. Another is to minimize the number of volunteers needed to ensure no shortages (assuming there are enough bikes). We could consider combining bike depots with recycle depots, setting up multi-service green stops. This enables multi-tasking e.g., volunteers can bring recycle bins from a hotel to a green stop, then transfer bikes that need to go to another stop (with greater demand). The Mathematics Clinic can examine where to locate the green stops and specify the pickup schedule and routes. We can (approximately) measure the carbon footprint of transportation, and that will be considered in selecting bus routes and schedules. We also want to estimate the Green initiative's impact on the hospitality industry and individual behavior. Perfect information would be to know each carbon footprint with and without the initiative. This is not practical, but we could use sampling techniques to estimate the aggregate impact of the Green initiative. Part of the sampling could be interviews with randomly selected attendees. Another type of sampling could be random monitoring of bike and walkway usage, and this would be converted to carbon reduction compared to using a bus. Similarly, we could sample people in the hospitality industry to get their estimates of differences; volunteers could randomly sample hotels and restaurants to record their green practices. Again, we would need to translate those differences into carbon reduction. A goal is to measure net benefits for possible future application beyond the DNC. The Mathematics Clinic can consider the design of the sampling process and write a guide for the volunteers to implement it. If time permits, this would be accompanied by a guide to perform the analysis that gives the final estimate. Each task is defined by its key requirements: location, duration and number of volunteers in each skill category. Most of the volunteers will be assigned to tasks before the convention begins (some are working now). Each volunteer signs up for a block of shifts, which are generally four hours each, and the start-end times could overlap. The Mathematics Clinic can consider a pre-assignment model that assigns volunteers to tasks based on what is known about volunteer availability and task requirements. A first version can assume perfect information and seek to fulfill each task while maximizing volunteer preferences. A goal of the pre-assignment model is to provide at least one "reasonable" initial assignment, which can be adjusted as situations change. Once the convention begins, real-time adjustments are likely to be needed, and this challenge has different characteristics than the pre-assignment model. Requests for volunteers arrive at a central service, manned by volunteers with office skills. The arrivals are mostly by phone, but eventually all requests are entered into the computer. A goal of the real-time adjustment model is to provide immediate response to fulfill new tasks or complete some in progress. There is a trade-off between changing some assignments versus the use of standbys. Each has its pros and cons to be considered in a goal-directed objective. Requests for venues are submitted electronically, and they are put on hold until a committee (which meets weekly) decides to deny or grant the request. A denial may be accompanied by a suggested alternative having about the same size and location. The decision to grant a venue (and deny competing requests) is based on several factors. (Venue managers voluntarily cooperate with the DNCH, but they are free to contract their venues directly.) The goal is to maximize request satisfaction. The Mathematics Clinic could develop a model to rank competing requests, taking into account alternatives. This could cascade e.g., there could be many second-best allocations that satisfy all concerned versus another allocation that satisfies one requestor a little more than OK while dissatisfying many other requestors. Such tradeoffs are inherent in a decision model, and highly subjective factors can be handled outside the model's scope. The model could list candidate allocations, based on factor values, and provide sensitivity analysis to changing some of those allocations. A model could answer such questions as, "What requestors are highly dissatisfied if I allocate a particular venue to some requestor?" and "Is there a compromise allocation that does not greatly dissatisfy anyone and satisfies certain specifications?" We shall begin our efforts with a review of prior work, relevant to the challenges we shall address. Some seem generic, such as the VRP [1] as a transportation model; however, there are variations that do not appear to have been explicitly studied. Some challenges are new, such as the Green initiative. Also surprising is the scarcity of quantitative approaches to assigning volunteers, particularly large-scale. I found only two articles that use O.R. [4,8], despite the vast literature on volunteer management. Our review will consider any publications that use mathematical methods and any relevant software, even if designed for more general applications. Our goal is to produce a report that may help by analyzing some of the many challenges with mathematical models and computer algorithms, aimed at supporting decision processes. In conclusion, the convention business is huge, and I have so far identified only a few of the opportunities for O.R. I plan to report our final results in May. Meanwhile, I welcome any information or advice.
Harvey Greenberg (harvey.greenberg@cudenver.edu) is professor of Mathematical Sciences at the University of Colorado Denver. He has been organizing clinics for 25 years. References
OR/MS Today copyright © 2008 by the Institute for Operations Research and the Management Sciences. All rights reserved. Lionheart Publishing, Inc. 506 Roswell Rd., Suite 220, Marietta, GA 30060 USA Phone: 770-431-0867 | Fax: 770-432-6969 E-mail: lpi@lionhrtpub.com URL: http://www.lionhrtpub.com Web Site © Copyright 2008 by Lionheart Publishing, Inc. All rights reserved. |