Please use this identifier to cite or link to this item: https://doi.org/10.1007/s00291-006-0041-8
DC FieldValue
dc.titleSimultaneous fleet assignment and cargo routing using benders decomposition
dc.contributor.authorLi, D.
dc.contributor.authorHuang, H.-C.
dc.contributor.authorMorton, A.D.
dc.contributor.authorChew, E.-P.
dc.date.accessioned2014-06-17T07:02:38Z
dc.date.available2014-06-17T07:02:38Z
dc.date.issued2006-07
dc.identifier.citationLi, D., Huang, H.-C., Morton, A.D., Chew, E.-P. (2006-07). Simultaneous fleet assignment and cargo routing using benders decomposition. OR Spectrum 28 (3) : 319-335. ScholarBank@NUS Repository. https://doi.org/10.1007/s00291-006-0041-8
dc.identifier.issn01716468
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/63315
dc.description.abstractIn this paper, we incorporate the cargo routing problem into fleet assignment to model the fleet assignment more accurately. An integrated model and a Benders decomposition-based approach are developed to simultaneously obtain the optimal assignment of fleet to legs and the routing of forecasted cargo demand over the network. Computational experiments show that this integrated approach converges very fast for all different test scenarios.
dc.description.urihttp://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1007/s00291-006-0041-8
dc.sourceScopus
dc.subjectAirline planning
dc.subjectBenders decomposition
dc.subjectFleet assignment
dc.typeArticle
dc.contributor.departmentINDUSTRIAL & SYSTEMS ENGINEERING
dc.description.doi10.1007/s00291-006-0041-8
dc.description.sourcetitleOR Spectrum
dc.description.volume28
dc.description.issue3
dc.description.page319-335
dc.identifier.isiut000239457400002
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

10
checked on Oct 22, 2021

WEB OF SCIENCETM
Citations

10
checked on Oct 13, 2021

Page view(s)

66
checked on Oct 14, 2021

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.