FICO
FICO Xpress Optimization Examples Repository
FICO Optimization Community FICO Xpress Optimization Home
Back to examples browserPrevious exampleNext example

Air transport

Description
Problem name and type, featuresDifficultyRelated examples
F‑1 Flight connections at a hub: Assignment problem * assignment_graph.mos, i1assign.mos, c6assign.mos
F‑2 Composing flight crews: Bipartite matching **** matching_graph.mos
2 problems, data preprocessing, incremental definition of data array, encoding of arcs, logical or (cumulative version) and and, procedure for printing solution, forall-do, max, finalize
F‑3 Scheduling flight landings: Scheduling problem with time windows ***
generalization of model to arbitrary time windows; calculation of specific BigM, forall-do
F‑4 Airline hub location: Hub location problem ***
quadruple indices; improved (re)formulation (first model not usable with student version), union of index (range) sets
F‑5 Planning a flight tour: Symmetric traveling salesman problem ***** tsp_graph.mos
loop over problem solving, TSP subtour elimination algorithm; procedure for generating additional constraints, recursive subroutine calls, working with sets, forall-do, repeat-until, getsize, not


Further explanation of this example: 'Applications of optimization with Xpress-MP', Chapter 11: Air transport

mosel_app_6.zip[download all files]

Source Files

Data Files





f4hub.dat

! Data file for `f4hub.mos'

DIST: [   0  945  605 4667 4749 4394
        945    0  866 3726 3806 3448
        605  866    0 4471 4541 4152
       4667 3726 4471    0  109  415
       4749 3806 4541  109    0  431
       4394 3448 4152  415  431    0]   

QUANT: [   0  500 1000 300 400 1500
        1500    0  250 630 360 1140
         400  510    0 460 320  490
         300  600  810   0 820  310
         400  100  420 730   0  970
         350 1020  260 580 380    0]
         
FACTOR: 0.8         

NAMES: ["Atlanta" "Boston" "Chicago" "Marseille" "Nice" "Paris"]

Back to examples browserPrevious exampleNext example