Routing problem with service choices
Name
FTL_R_1986_04.pdf
Size
4.82 MB
Format
Adobe PDF
Checksum (MD5)
c6c608e1c8e8ddc6bf7b7a99a876da20
Author(s)
Lee, Boon Chai
Date Issued
1986
Publisher
Cambridge, Mass. : MIT, Dept. of Aeronautics & Astronautics, Flight Transportation Laboratory, 1986
Series/Report no.
FTL report (Massachusetts Institute of Technology. Flight Transportation Laboratory) ; R86-4
Abstract
This thesis finds solutions to the routing problem with service choices which is formulated as a capacitated minimum cost flow circulation problem with GUB constraints. The routing problem with service choices is solved using a specialized GUB branch and bound algorithm. Methods for node and GUB set selection are presented. A heuristic for finding good feasible solutions to initiate the branch and bound using vehicle size cuts is also derived. Furthermore, a network reduction scheme is formalized to reduce the size of the problem. This reduction is applied between pairs of nodes whose ground arcs have infinite upper-bounds. Initial experiments using the GUB branch and bound on several medium scale test problems appear promising. A variable tracking scheme which updates the status of the branching variables is included, which can be used to fully automate the branch and bound. This work supports the use of LP based GUB branch and bound for solving combinatorial problems with GUB constraints. Extensions to several related problems are also given.
Description
June 1986"--Cover
Also issued as an Ph.D. thesis, Massachusetts Institute of Technology, Dept. of Aeronautics and Astronautics, 1986
Includes bibliographical references (p. 97-100)
Subjects
Airlines
Aeronautics, Commercial
Cost of operation
Management
Persistent DSpace Link
