dc.creator | Espinoza González, Daniel | |
dc.creator | García, R. | |
dc.creator | Goycoolea, M. | |
dc.creator | Savelsbergh, M. W. P. | |
dc.creator | Nemhauser, G. L. | |
dc.date.accessioned | 2010-01-20T16:21:00Z | |
dc.date.accessioned | 2019-04-25T23:48:37Z | |
dc.date.available | 2010-01-20T16:21:00Z | |
dc.date.available | 2019-04-25T23:48:37Z | |
dc.date.created | 2010-01-20T16:21:00Z | |
dc.date.issued | 2008-08 | |
dc.identifier | TRANSPORTATION SCIENCE Volume: 42 Issue: 3 Pages: 279-291 Published: AUG 2008 | |
dc.identifier | 0041-1655 | |
dc.identifier | 10.1287/trsc.1070.0228 | |
dc.identifier | http://repositorio.uchile.cl/handle/2250/125191 | |
dc.identifier.uri | http://repositorioslatinoamericanos.uchile.cl/handle/2250/2429518 | |
dc.description.abstract | The availability of relatively cheap small jet aircrafts suggests a new air transportation business: dial-a-flight, an on-demand service in which travelers call a few days in advance to schedule transportation. A successful on-demand air transportation service requires an effective scheduling system to construct minimum-cost pilot and jet itineraries for a set of accepted transportation requests. In Part I, we introduced an integer multicommodity network flow model with side constraints for the dial-a-flight problem and showed that small instances can be solved effectively. Here, we demonstrate that high-quality solutions for large-scale real-life instances can be produced efficiently by embedding the core optimization technology in a local search scheme. To achieve the desired level of performance, metrics were devised to select neighborhoods intelligently, a variety of search diversification techniques were included, and an asynchronous parallel implementation was developed. | |
dc.language | en | |
dc.publisher | INFORMS | |
dc.subject | VEHICLE-ROUTING PROBLEMS | |
dc.title | Per-seat, on-demand air transportation Part II: Parallel local search | |
dc.type | Artículos de revistas | |