Abstract
The Berth Allocation Problem (BAP) is an important seaside problem in port logistics, which involves the determination of berthing times and positions of arriving vessels in a wharf. Most studies have considered that vessels arrival and handling times are known fixed quantities available to wharves operators beforehand. However, due to many uncontrollable factors that can affect vessels arrival and handling times, those quantities are highly uncertain and may have a significant impact in the wharf operation. This paper takes fuzzy uncertainty into account and presents a fully fuzzy BAP with two objective functions. Specifically, it is considered the minimisation of the total waiting time of vessels and the makespan of the wharf operation. The problem is solved by using two lexicographic methods for fully fuzzy multi-objective linear programming (FFMOLP). Multiple Pareto optimal fuzzy solutions are obtained using a fuzzy epsilon-constraint method. Results demonstrate the effectiveness of the proposed approaches in handling fuzziness and conflicting objectives in a BAP. Moreover, from a methodological point of view, results show that it is best to use lexicographic ranking criteria instead of linear ranking functions for solving the associated FFMOLP problem.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
