Tramp Ship Scheduling Problem with Berth Allocation Considerations and\n Time-dependent Constraints

2017/05/03 by Francisco López-Ramos, Armando Guarnaschelli, López-Ramos, Francisco +7
Engineering · Environmental Science · #Artificial Intelligence (cs.AI) #FOS: Computer and information sciences #Maritime Ports and Logistics #Maritime Transport Emissions and Efficiency #Vehicle Routing Optimization Methods

paper · pdf · doi:10.48550/arxiv.1705.01681

openalex publication_date 2017/05/03 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

This work presents a model for the Tramp Ship Scheduling problem including\nberth allocation considerations, motivated by a real case of a shipping\ncompany. The aim is to determine the travel schedule for each vessel\nconsidering multiple docking and multiple time windows at the berths. This work\nis innovative due to the consideration of both spatial and temporal attributes\nduring the scheduling process. The resulting model is formulated as a\nmixed-integer linear programming problem, and a heuristic method to deal with\nmultiple vessel schedules is also presented. Numerical experimentation is\nperformed to highlight the benefits of the proposed approach and the\napplicability of the heuristic. Conclusions and recommendations for further\nresearch are provided.\n

Related

• Schedule Design and Container Routing in Liner Shipping
• An adaptive large neighborhood search heuristic for the multi-port continuous berth allocation problem
• The multi-port berth allocation problem with speed optimization: Exact methods and a cooperative game analysis
• The pickup and delivery problem with time windows and scheduling on the edges
• Constraint and Mathematical Programming Models for Integrated Port\n Container Terminal Operations