Self-adaptive heuristic algorithm for solving ship traffic organization and scheduling problem
A heuristic algorithm and scheduling problem technology, applied in the field of adaptive heuristic algorithm, to shorten the total time of ships entering and leaving the port and improve efficiency
- Summary
- Abstract
- Description
- Claims
- Application Information
 AI Technical Summary 
Problems solved by technology
Method used
Image
Examples
Embodiment
[0120] In this embodiment, dispatching experiments are carried out based on ships in the comprehensive port area of Huanghua Port. There are 8 anchorages and 15 berths in the comprehensive port area of Huanghua Port. For the convenience of calculation, the anchorage numbers are marked as 1-8, and the berth number is marked as 1 -15. Table 4 records the distance between 262# light buoy and each berth, and Table 5 records the distance between 201# light buoy and each anchorage. Table 6 is the basic data of 13 ships. In the reinforcement learning algorithm parameter setting part, the learning rate α=0.75, the discount rate γ=0.2, the greedy rate ε=0.85, in the genetic algorithm parameter setting, the maximum number of iterations MAXGEN=400, the population size NIND=200, and the selection operation probability GGAP =0.9, in the simulated annealing algorithm, the initial temperature T 0 = 2, cooling factor α 1 = 0.9. Other parameters, such as the same direction safety inter...
PUM
 Login to View More
 Login to View More Abstract
Description
Claims
Application Information
 Login to View More
 Login to View More - R&D
- Intellectual Property
- Life Sciences
- Materials
- Tech Scout
- Unparalleled Data Quality
- Higher Quality Content
- 60% Fewer Hallucinations
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2025 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com



