A network flow model for the dynamic and flexible berth allocation problem |
| |
| Affiliation: | 1. Department of Logistics and Maritime Studies, The Hong Kong Polytechnic University, Kowloon, Hong Kong;2. School of Management, Shanghai University, Shang Da Road 99, Shanghai 200444, China;3. School of Civil and Environmental Engineering, University of Technology Sydney, Sydney, NSW 2007, Australia;1. Department of Mathematics, Hangzhou Dianzi University, Hangzhou 310018, PR China;2. School of Mathematics and Information Engineering, Taizhou University, Linhai 317000, Zhejiang, PR China;1. Department of Marketing, Quantitative Analysis, and Business Law, Mississippi State University, MS 39762, USA;2. Department of Civil and Environmental Engineering, National University of Singapore, 117576, Singapore;3. Institute of Operations Research and Analytics, National University of Singapore, 119077, Singapore |
| |
| Abstract: | This paper presents a new model for the dynamic berth allocation problem (BAP). The model is developed using a berth-flow network modeling approach and is formulated as an integer multi-commodity network flow problem. In addition, an innovative flexible berth-space utilization scheme, based on blocking plans, is incorporated into the proposed model. This is referred to as the dynamic (vessel arrivals) and flexible (berth space) BAP model (or DFBAP), and is designed to better utilize wharf space in a container port. Computational experiments conducted on an instance generated using actual data show that the DFBAP model is more effective and efficient than the method currently used by port authorities. A set of scenario analyses is also performed to obtain insights into important model parameters. |
| |
| Keywords: | Port management Berth allocation Mathematical programming Multi-commodity network flow problem |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
