Berth allocation in container terminals that service feeder ships and deep-sea vessels. Issue 4 (1st April 2016)

• Record Type: Journal Article
• Authors: Emde, Simon; Boysen, Nils
• Is Part Of: Journal of the Operational Research Society. Volume 67:Issue 4(2016)
• Page Start: 551
• Page End: 563
• Publication Date: 2016-04-01
• Subjects: container terminal operations -- berth allocation -- mathematical programming -- simulated annealing; Operations research -- Periodicals; 658.4034
• DOI: 10.1057/jors.2015.78
• Languages: English
• ISSNs: 0160-5682

Abstract

Abstract: This paper treats a berth allocation problem (BAP) in dedicated container terminals where feeder ships and container vessels are jointly served. When assigning quay space and a service time to each calling ship particular focus is put on the container exchange between feeder ships and mother vessels, so that the weighted number of containers delivered by feeder missing their intended mother vessel (and vice versa) does not exceed a given upper bound. The resulting BAP is formalized, complexity proofs are provided, and suited optimization procedures are presented and tested.