Show simple item record

dc.contributor.authorAgarwal, Richaen_US
dc.date.accessioned2007-08-16T17:59:24Z
dc.date.available2007-08-16T17:59:24Z
dc.date.issued2007-07-09en_US
dc.identifier.urihttp://hdl.handle.net/1853/16314
dc.description.abstractIn maritime transportation, liner shipping accounts for over 60\% of the value of goods shipped. However, very limited literature is available on the study of various problems in liner shipping. In this thesis we focus on problems related to this industry. Given a set of cargo to be transported, a set of ports and a set of ships, a common problem faced by carriers in liner shipping is the design of their service network. We develop an integrated model to design service network for the ships and to route the available cargo, simultaneously. The proposed model incorporates many relevant constraints, such as the weekly frequency constraint on the operated routes, and emerging trends, such as obtaining benefits from transshipping cargo on two or more service routes, that appear in practice but have not been considered previously in literature. Also, we design exact and heuristic algorithms to solve the integer program efficiently. The proposed algorithms integrate the ship scheduling problem, a tactical planning level decision, and the cargo routing problem, an operational planning level decision, and provide good overall solution strategy. Computational experiments indicate that larger problem instances, as compared to the literature, can be solved using these algorithms in acceptable computational time. Alliance formation is very common among global liner carriers however a quantitative study of liner alliances is missing from literature. We provide a mathematical framework for the quantitative study of these alliances. For the formation of a sustainable alliance, carriers need to agree on an overall service network and resolve issues concerning distribution of benefits and costs among the members of the alliance. We develop mechanisms to design a collaborative service network and to manage the interaction among the carriers through the allocation of profits in a fair way. The mechanism utilizes inverse optimization techniques to obtain resource exchange costs in the network. These costs provide side payments to the members, on top of the revenue generated by them in the collaborative solution, to motivate them to act in the best interest of the alliance while satisfying their own self interests.en_US
dc.publisherGeorgia Institute of Technologyen_US
dc.subjectMaritime tranportationen_US
dc.subjectLiner shippingen_US
dc.subjectNetwork designen_US
dc.subjectAlliance formationen_US
dc.subjectResource allocationen_US
dc.subject.lcshOptimum ship routingen_US
dc.subject.lcshScheduling Mathematical modelsen_US
dc.subject.lcshAlgorithmsen_US
dc.subject.lcshCargo shipsen_US
dc.subject.lcshInterorganizational relationsen_US
dc.titleNetwork design and alliance formation for liner shippingen_US
dc.typeDissertationen_US
dc.description.degreePh.D.en_US
dc.contributor.departmentIndustrial and Systems Engineeringen_US
dc.description.advisorCommittee Chair: Professor Ozlem Ergun; Committee Member: Professor Ellis Johnson; Committee Member: Professor George L. Nemhauser; Committee Member: Professor H. Venkateswaran; Committee Member: Professor Michael D. Meyeren_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record