Development of solution methodologies for berth allocation problem with discrete berth layout (DBL), dynamic arrival of vessels (DAV), deterministic handling time (DHT) of vessels, vessel time windows (VTW)and vessel eligibility criteria (VEC)

By: Contributor(s): Material type: BookBookLanguage: en. Publication details: Bangalore : Indian Institue of science , 2022 .Description: xvii, 209p. e-Thesis col. ill. ; 29.1 cm * 20.5 cm 4.292MbDissertation: PhD; 2022; Management studiesSubject(s): DDC classification:
  • 658.4 PAN
Online resources: Dissertation note: PhD; 2022; Management studies Summary: The Container Terminal (CT) acts as an important node in a supply chain industry that connects water and land for transportation of the containers carrying goods. A CT facilitates a vessel by allocating a berth for unloading and loading of the containers. During this process, the unloaded/loaded containers are stored/retrieved in/from the yard area. The total time taken for various activities for serving a vessel at a CT is an important performance indicator that drives competitiveness among container terminals. Therefore, for enhancing the performance of a CT, a CT is continuously trying to optimize various decisions that are expected to control various activities associated with servicing a vessel at a CT. One of the important operational decisions associated with servicing a vessel is the berth allocation decision, which serves as an important input to various other management decisions at CT and has a major influence on the total service time of the vessel at the CT. In this study, the important decision problem: a berth allocation problem (BAP) is addressed as an independent decision problem. Based on the closely related literature review on BAP, this study defines a new research problem on BAP, considering simultaneously the problem characteristics of BAP such as Discrete Berth Layout (DBL), Dynamic Arrival of Vessel (DAV), Deterministic Handling Time (DHT) of vessel, Vessel Time Windows (VTW), and Vessel Eligibility Criteria (VEC). This newly proposed research problem is referred as BAP with DBL-DAV-DHT-VTW-VEC in this study. The main objective for the newly defined BAP is to simultaneously minimize the sum of the cost (called as minimizing the Net Total Cost (NTC): Handling Cost of Vessel (HCV), Penalty Cost of Waiting of Vessel (PCWV), Penalty Cost due to Late Departure of Vessel (PCLDV) and Benefits due to Early Departure of Vessels (BEDV)). Subsequently, this study tries to incorporate losses due to idle time of berth by including Penalty Cost due to Idle Time of Berth (PCITB) in NTC. In addition, to incorporate unequal priorities to the vessels, this study considers Total Weighted Cost (TWC) as an objective. Furthermore, this study deals with three due-date based objectives: such as minimizing the Number of Tardy/late Vessels (NTV), maximizing the On Time Delivery (OTD) rate of vessels, and minimizing the maximum lateness (ML), applied one at a time, as an objective for the new BAP considered in this study.
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Call number Status Date due Barcode
E-BOOKS E-BOOKS JRD Tata Memorial Library Available ET00007

Incudes bibliographical references and index

PhD; 2022; Management studies

The Container Terminal (CT) acts as an important node in a supply chain industry that connects water and land for transportation of the containers carrying goods. A CT facilitates a vessel by allocating a berth for unloading and loading of the containers. During this process, the unloaded/loaded containers are stored/retrieved in/from the yard area. The total time taken for various activities for serving a vessel at a CT is an important performance indicator that drives competitiveness among container terminals. Therefore, for enhancing the performance of a CT, a CT is continuously trying to optimize various decisions that are expected to control various activities associated with servicing a vessel at a CT. One of the important operational decisions associated with servicing a vessel is the berth allocation decision, which serves as an important input to various other management decisions at CT and has a major influence on the total service time of the vessel at the CT. In this study, the important decision problem: a berth allocation problem (BAP) is addressed as an independent decision problem. Based on the closely related literature review on BAP, this study defines a new research problem on BAP, considering simultaneously the problem characteristics of BAP such as Discrete Berth Layout (DBL), Dynamic Arrival of Vessel (DAV), Deterministic Handling Time (DHT) of vessel, Vessel Time Windows (VTW), and Vessel Eligibility Criteria (VEC). This newly proposed research problem is referred as BAP with DBL-DAV-DHT-VTW-VEC in this study. The main objective for the newly defined BAP is to simultaneously minimize the sum of the cost (called as minimizing the Net Total Cost (NTC): Handling Cost of Vessel (HCV), Penalty Cost of Waiting of Vessel (PCWV), Penalty Cost due to Late Departure of Vessel (PCLDV) and Benefits due to Early Departure of Vessels (BEDV)). Subsequently, this study tries to incorporate losses due to idle time of berth by including Penalty Cost due to Idle Time of Berth (PCITB) in NTC. In addition, to incorporate unequal priorities to the vessels, this study considers Total Weighted Cost (TWC) as an objective. Furthermore, this study deals with three due-date based objectives: such as minimizing the Number of Tardy/late Vessels (NTV), maximizing the On Time Delivery (OTD) rate of vessels, and minimizing the maximum lateness (ML), applied one at a time, as an objective for the new BAP considered in this study.

There are no comments on this title.

to post a comment.

                                                                                                                                                                                                    Facebook    Twitter

                             Copyright © 2023. J.R.D. Tata Memorial Library, Indian Institute of Science, Bengaluru - 560012

                             Contact   Phone: +91 80 2293 2832

Powered by Koha