Neglecting the flight departure time differences as you are now going to estimate the profit earning...

 

Transcribed Image Text:

Neglecting the flight departure time differences as you are now going to estimate the profit earning first, i.e., the current objective function is maximising the total profit. The aircraft routing problem will be handled by the airlines afterwards. Also assume passengers can transfer between airports in the same city, i.e., HND-NRT and ITM-KIX. The following profit per unit table is shown as follows. Table 4 Tableau of the 1" level transportation problem To\From Tokyo Haneda (HND) Osaka Itami (ITM) Sapporo New Chitose (CTS) Aomori (AOJ) Passengers demand Table 5 Tableau of the 2nd level transportation problem To\From Hong Kong (HKG) via HX Hong Kong (HKG) via CX Hong Kong (HKG) via UO Passengers demand 3,000 560 380 320 Tokyo Haneda/Narita (HND/NRT) 200 190 110 Akita (AXT) 2,540 320 1,250 400 150 Osaka Kansai (KIX) 170 120 115 Memanbetsu (MMB) 220 1,460 160 1,750 e. Combine (b) and (d), formulate the integer programming problem. 560 Sapporo New Chitose (CTS) 130 210 180 b. Considering only the problem in Table 4, formulate the integer programming problem. 4,000 a. Considering only the problem in Table 4, initialise the problem by minimum cost method. Then, solve the problem with stepping stone method. (12 marks) Supply 4,000 d. Considering only the problem in Table 5, formulate the integer programming problem. 1,250 1,750 7,000 Supply 2,000 3,000 3,000 (10 marks) c. Considering only the problem in Table 5, initialise the problem by minimum cost method. Then, solve the problem with stepping stone method. (12 marks) (10 marks) (6 marks) Neglecting the flight departure time differences as you are now going to estimate the profit earning first, i.e., the current objective function is maximising the total profit. The aircraft routing problem will be handled by the airlines afterwards. Also assume passengers can transfer between airports in the same city, i.e., HND-NRT and ITM-KIX. The following profit per unit table is shown as follows. Table 4 Tableau of the 1" level transportation problem To\From Tokyo Haneda (HND) Osaka Itami (ITM) Sapporo New Chitose (CTS) Aomori (AOJ) Passengers demand Table 5 Tableau of the 2nd level transportation problem To\From Hong Kong (HKG) via HX Hong Kong (HKG) via CX Hong Kong (HKG) via UO Passengers demand 3,000 560 380 320 Tokyo Haneda/Narita (HND/NRT) 200 190 110 Akita (AXT) 2,540 320 1,250 400 150 Osaka Kansai (KIX) 170 120 115 Memanbetsu (MMB) 220 1,460 160 1,750 e. Combine (b) and (d), formulate the integer programming problem. 560 Sapporo New Chitose (CTS) 130 210 180 b. Considering only the problem in Table 4, formulate the integer programming problem. 4,000 a. Considering only the problem in Table 4, initialise the problem by minimum cost method. Then, solve the problem with stepping stone method. (12 marks) Supply 4,000 d. Considering only the problem in Table 5, formulate the integer programming problem. 1,250 1,750 7,000 Supply 2,000 3,000 3,000 (10 marks) c. Considering only the problem in Table 5, initialise the problem by minimum cost method. Then, solve the problem with stepping stone method. (12 marks) (10 marks) (6 marks)

Answer rating: 100% (QA)

a Initialisation Step 1 Calculate the cost of each route AOJHND AXTHND MMBHND ITMKIX CTSKIX AOJHND 3204004000 012 AXTHND 1504004000 010 MMBHND 2201604000 009 ITMKIX 5603804000 019 CTSKIX 3201204000 00... View the full answer