Fleet assignment and routing with schedule synchronization constraints

Article Abstract:

A new kind of constraints, related to schedule synchronization, is presented in the problem formulation of aircraft fleet assignment and routing problems. An optimal solution strategy is suggested. The strategy is based on Dantzig-Wolfe decomposition/column generation. The resulting master problem is composed of flight coverage constraints, as in usual applications, and of schedule synchronization constraints. The corresponding subproblem is a shortest path problem with time windows and linear costs on the time variables, and is solved by an optimal dynamic programming algorithm.

User Contributions:

Comment about this article or add new information about this topic:

Comment:  (50-4000 characters)

Name:

E-mail:

Security Code:

Locomotive assignment with heterogeneous consists at CN North America

Article Abstract:

Computational experiments were performed to schedule the assignment of locomotives to train segments for a large railroad network. The nonlinear integer programming problem, which was characterized as a multi-commodity network flow problem and decomposed into many subproblems, was solved using a branch-and-bound procedure involving Dantzwig-Wolfe decomposition. The results indicated an improvement of seven percent over existing solutions using actual data from Canadian National North America.

User Contributions:

Comment about this article or add new information about this topic:

Comment:  (50-4000 characters)

Name:

E-mail:

Security Code:

Periodic airline fleet assignment with time windows, spacing constraints, and time dependent revenues

Article Abstract:

Solving the periodic airline fleet assignment problems with time windows, using integer programming, is analyzed.

User Contributions:

Comment about this article or add new information about this topic:

Comment:  (50-4000 characters)

Name:

E-mail:

Security Code: