Books : Time-dependent shortest paths through a fixed sequence of nodes: application to a travel planning problem [An article from: Computers and Operations Research]
In association with Amazon.com![: Time-dependent shortest paths through a fixed sequence of nodes: application to a travel planning problem [An article from: Computers and Operations Research]](http://ecx.images-amazon.com/images/I/41SS7GZHX6L._SL160_.jpg)
Availability: Available for download now
Format: HTML
Label: Elsevier
Manufacturer: Elsevier
Number Of Pages: 18
Publication Date: June 01, 2006
Publisher: Elsevier
Studio: Elsevier
Editorial Review:
Product Description:
This digital document is a journal article from Computers and Operations Research, published by Elsevier in 2006. The article is delivered in HTML format and is available in your Amazon.com Media Library immediately after purchase. You can view it with any web browser.
Description:
In this paper, we introduce a travel planning problem which is solved by computing time-dependent shortest paths through a fixed sequence of nodes. Given a predetermined itinerary, our travel planning problem consists in finding the best travel plan, involving planes and hotels, based on the traveler's preferences. Our time-dependent framework therefore models plane flights, hotels, stays in each city as well as global time constraints. Given the large size of time-dependent networks, an exact decomposition algorithm is devised to solve instances of realistic size in reasonable computation times.
Browse for similar items by category:
- HTML - Formats - eDocs - Formats - Custom Stores - Specialty Stores - Books - Travel
- Travel - Subjects - Books - General
- Travel - Subjects - Books - General AAS
- Format (feature_browse-bin) - Refinements - Books - HTML
