Problems in Optimal Fleet Deployment
dc.contributor.author | Perakis, Anastassios N. | en_US |
dc.contributor.author | Papadakis, Nikiforos | en_US |
dc.date.accessioned | 2012-06-21T21:26:21Z | |
dc.date.available | 2012-06-21T21:26:21Z | |
dc.date.issued | 1985-05-01 | en_US |
dc.identifier.uri | https://hdl.handle.net/2027.42/91683 | |
dc.description.abstract | The problem of minimum-cost operation of a fleet of ships that has to carry a specific amount of cargo between two ports in a given time period for a specific, fixed contract price is studied. Detailed and realistic operating cost functions are developed. Sensitivity analyses are performed to study the effects of small or large changes of one or more cost components on the total cost. A realistic model for the annual transport capacity as a function of speed is also used, in contrast to the linear relation used in the literature. | en_US |
dc.publisher | University of Michigan | en_US |
dc.title | Problems in Optimal Fleet Deployment | en_US |
dc.type | Technical Report | en_US |
dc.subject.hlbsecondlevel | Naval Architecture and Marine Engineering | en_US |
dc.subject.hlbtoplevel | Engineering | en_US |
dc.contributor.affiliationum | Department of Naval Architecture and Marine Engineering | en_US |
dc.description.bitstreamurl | http://deepblue.lib.umich.edu/bitstream/2027.42/91683/1/Publication_No_295.pdf | |
dc.owningcollname | Naval Architecture & Marine Engineering (NA&ME) |
Files in this item
Remediation of Harmful Language
The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.
Accessibility
If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.