01126596

Component

http://dx.doi.org/10.3141/2091-03

The berth-scheduling problem is considered with the objective of increasing customer satisfaction by minimizing the late berthing or departure and maximizing the early and timely berthing or departure of vessels. Vessel priority also is considered through the use of weights. An adaptive local search heuristic is developed to solve the resulting problem using a Markovian walk and a time window partitioning approach to improve convergence patterns and the objective function values. Results obtained from the heuristic are shown to be robust, and convergence rates and patterns are promising.

01141705

09-2668

English

pp 21-30

2009

Transportation Research Record: Journal of the Transportation Research Board

9780309126229

Print

Figures (4) ; References (26) ; Tables (2)

Algorithms; Berth utilization; Customer satisfaction; Docking; Heuristic methods; Schedules and scheduling; Time windows; Vessel operations; Water traffic; Water transportation

Adaptive algorithms

Marine Transportation; Operations and Traffic Management; Terminals and Facilities; I72: Traffic and Transport Planning

TRIS, TRB, ATRI

Oct 29 2009 7:39AM

• Approach to Modeling Demand and Supply for a Short-Notice Evacuation
• Hybrid Route Choice Modeling in Dynamic Traffic Assignment
• Implementation Issues for the Reliable A Priori Shortest Path Problem
• Integrated Evacuation Network Optimization and Emergency Vehicle Assignment
• Long-Haul Shipment Optimization for Less-Than-Truckload Carriers
• Modeling and Performance Assessment of a Transit-Based Evacuation Plan Within a Contraflow Simulation Environment
• Modeling Departure Time Choice Under Stochastic Networks Involved in Network Design
• Modeling the Effects of Turn Delay Uncertainties on Route Choice Behavior in Signalized Road Networks
• Nonnegative Pareto-Improving Tolls with Multiclass Network Equilibria
• User Equilibrium in a Bottleneck Under Multipeak Distribution of Preferred Arrival Time