Routing problem with service choices
June 1986"--Cover
| Egile nagusia: | |
|---|---|
| Beste egile batzuk: | |
| Formatua: | Technical Report |
| Argitaratua: |
Cambridge, Mass. : MIT, Dept. of Aeronautics & Astronautics, Flight Transportation Laboratory, 1986
2012
|
| Gaiak: | |
| Sarrera elektronikoa: | http://hdl.handle.net/1721.1/68085 |
| _version_ | 1826205592979505152 |
|---|---|
| author | Lee, Boon Chai |
| author2 | Massachusetts Institute of Technology. Flight Transportation Laboratory |
| author_facet | Massachusetts Institute of Technology. Flight Transportation Laboratory Lee, Boon Chai |
| author_sort | Lee, Boon Chai |
| collection | MIT |
| description | June 1986"--Cover |
| first_indexed | 2024-09-23T13:15:33Z |
| format | Technical Report |
| id | mit-1721.1/68085 |
| institution | Massachusetts Institute of Technology |
| last_indexed | 2024-09-23T13:15:33Z |
| publishDate | 2012 |
| publisher | Cambridge, Mass. : MIT, Dept. of Aeronautics & Astronautics, Flight Transportation Laboratory, 1986 |
| record_format | dspace |
| spelling | mit-1721.1/680852019-04-10T10:00:22Z Routing problem with service choices Lee, Boon Chai Massachusetts Institute of Technology. Flight Transportation Laboratory Airlines Aeronautics, Commercial Cost of operation Management 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) 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. 2012-01-06T22:09:08Z 2012-01-06T22:09:08Z 1986 Technical Report 16386597 http://hdl.handle.net/1721.1/68085 FTL report (Massachusetts Institute of Technology. Flight Transportation Laboratory) ; R86-4 119 p application/pdf Cambridge, Mass. : MIT, Dept. of Aeronautics & Astronautics, Flight Transportation Laboratory, 1986 |
| spellingShingle | Airlines Aeronautics, Commercial Cost of operation Management Lee, Boon Chai Routing problem with service choices |
| title | Routing problem with service choices |
| title_full | Routing problem with service choices |
| title_fullStr | Routing problem with service choices |
| title_full_unstemmed | Routing problem with service choices |
| title_short | Routing problem with service choices |
| title_sort | routing problem with service choices |
| topic | Airlines Aeronautics, Commercial Cost of operation Management |
| url | http://hdl.handle.net/1721.1/68085 |
| work_keys_str_mv | AT leeboonchai routingproblemwithservicechoices |