Professional Documents
Culture Documents
Patrick G. McKeown
4. Enlist Technology
5. Implement Forecasting 6. Apply Optimization (Use Linear programming)
7. Create Teams
8. Execute, Execute, Execute 9. Evaluate Success
MS and MIS
MS is the older of the two fields of study dating back to the 1940s and includes:
Mathematical optimization, simulation, stochastic modeling, statistical analyses, forecasting, cluster analysis, queuing analysis, and so on
Optimize Price
Recalibrate Dynamically
Segmentation based on Forecasts of demand purchasing behavior, and capacity at not just current or past product/price level classifications
Mathematically determine capacity availability and price that maximizes expected profit
Use transaction processing to collect data, data base and data warehousing to store and analyze it
Use TPS, DBMS, and DW to continually monitor performance and update market response
Use simulation to validate demand model and forecasting to forecast future demand
Mathematically determine capacity availability and price that maximizes expected profit
Rerun LP model on daily basis to revise prices; rerun forecasting model and simulations less frequently
Math Programming
Consists of ...
Objective function to be maximized Constraints - a system of equations that bind
Differential calculus (Linear) Algebra
Maximize z R ( x )
Enabling technology
High-speed, large scale computing Optimization software(OSL, CPLEX, Solver)
Maximize z c j x j
j
s.t.
a x
ij i j
bj
where l j x j u j
LP Example
The AHM Corporation has a small plant where they produce two products which we will call A and B. The profit contribution from the two products is $10 and $12 respectively. The products pass through two production departments each with restricted production time. The hours per product and time available in each department are shown below: Department A B Time Available per month 1 2.0 3.0 1500 2 1.0 1.0 600
LP Formulation
Maximize 10A + 12B Subject to 2A + 3B < 1500 1A + 1B < 600 A, B > 0
LP Graphical Solution
Add First Constraint
Units of B
750
500
250
250
500
750
Units of A
LP Formulation
Add second constraint
Units of B
750
500
250
250
500
750
Units of A
LP Formulation
Add Objective Function
Units of B
750
500
250
250
500
750
Units of A
LP Formulation
Determine highest profit feasible solution
Units of B
750
500
250
250
500
750
Units of A
The OD Problem
Revenue management started in the airline
industry in the 1980's where price & availability were managed on a leg basis where a leg is a single takeoff & landing. The problem with this solution is that demand is at an origin-destination (OD) level. For example, on an Houston-Atlanta-NYC flight, there is only one OD pair (HoustonNYC) but two legs (Houston-Atl and Atl-NYC) Want to optimize the OD not the legs
OD Problem (Continued)
Today, airline's have inventory control systems that
can better handle OD controls and OD network optimization is now a core technology in Airline revenue management. Following is an illustrative problem, demonstrating the types of models used in the industry. The 'real' problems are extremely large with millions of OD products to forecast, and thousands of flights (courtesy of Jon Higbee of Manugistics, Inc.)
OD Example Problem
Trans-Europe Airways (TEA) services 5 cities in Europe Dublin (DUB) Madrid (MAD) Frankfurt (FRA) Rome (FCO) Moscow (MOW) TEA operates 8 flights per day using one type of aircraft that has a capacity of 180 passengers The routes are illustrated on the route map on the next slide. Note that all flights pass through Frankfurt with 4 going in and 4 going out.
Connections
The allowable connections and leg capacities are described in the following OD-leg incidence matrix.
The Problem
The pricing department has established fare values for five fare categories and the forecasting group has developed forecasts of demand at these prices for a departure date of November 1, 2005. You as the lead analyst in the optimization group need use the this data to determine the following: What is the optimal number of seats to set aside for each OD fare product on each leg?
The Solution
Use the Excel Solver to formulate and solve the problem: Maximize revenue Subject to: leg capacities Revenue = number on each leg x seat price Leg Capacity = 180 per leg. Note that a seat from DUB to MOW uses capacity on both DUB-FRA and FRA-MOW while DUB to FRA uses only the first leg. The data and setup for this example are available at http://www.terry.uga.edu/~pmckeown/RevMan05/TEA.xls