Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

A multi-objective quay crane-berth scheduling optimization method based on ant colony algorithm

An optimization method and multi-objective technology, applied in the field of multi-objective quay crane-berth scheduling optimization based on ant colony algorithm

Inactive Publication Date: 2020-12-04
THE AFFILIATED HOSPITAL OF QINGDAO UNIV
View PDF5 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

However, this mathematical method has many disadvantages. If the problem scale is large, this method is often difficult to solve.

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • A multi-objective quay crane-berth scheduling optimization method based on ant colony algorithm
  • A multi-objective quay crane-berth scheduling optimization method based on ant colony algorithm
  • A multi-objective quay crane-berth scheduling optimization method based on ant colony algorithm

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0100] Below in conjunction with accompanying drawing and specific embodiment the present invention is described in further detail:

[0101] 1. Basic ant colony algorithm

[0102] 1 Basic Ant Colony Algorithm Principle

[0103] Ants start from A to B, and there are two routes from A to B, ACB and ADB. Suppose there are four ants 1, 2, 3, and 4. At the beginning, the line ACB and the line ADB each allocate one ant. Ant 1 advances along ACB, ant 2 advances along ADB, and the ant walks one step in each time unit , figure 1 It is the walking situation of two ants after eight time units. Ant 1 has reached position B, while ant 2 has just arrived at position D, which is half the distance of line ADB.

[0104] Ant 1 arrives at position B, then returns the same way, and ant 2 moves on. After 16 time units, the progress of Ant 1 and Ant 2 is as follows figure 2As shown, ant 1 returns to the ant nest at point A at this time, and ant 2 has just arrived at point B. If the pheromon...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention discloses a multi-objective quay crane-berth scheduling optimization method based on ant colony algorithm, which belongs to the field of port scheduling. Regarding the multi-objective quay crane-berth scheduling model proposed in this application, this application proposes two algorithms for solving the model based on the ant colony algorithm. This application can optimize the scheduling of container ships arriving at the port through algorithms, thereby improving the execution efficiency of the algorithm and obtaining the Pareto optimal solution we need in a shorter time, thereby improving the efficiency of port operations and not only saving money Port operating costs are also of great significance to promoting regional and national economic development. Finally, this application uses simulation experiments to verify the algorithm proposed in this application. In the experiment, the algorithm is compared with other algorithms in terms of both convergence and algorithm execution time. Comparisons in all aspects have verified the superiority of the algorithm of this application.

Description

technical field [0001] The invention belongs to the field of port scheduling, and in particular relates to an ant colony algorithm-based multi-objective quay crane-berth scheduling optimization method. Background technique [0002] The research on port issues involves a wide range of issues. At first, it only used experience to conduct manual scheduling. However, with the expansion of the port scale and the increase of ships entering and leaving the port, this method of manually allocating berths is increasingly unable to adapt to the rapid development of the global economy. Modern port requirements. Therefore, people try to establish an intelligent allocation system to replace manual allocation. This intelligent optimal scheduling greatly improves the work efficiency of the port, saves the cost of port scheduling, and brings huge economic benefits to the port. K.Shih first proposed the research on the scheduling problem of container ships. [0003] Foreign port dispatchin...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Patents(China)
IPC IPC(8): G06Q10/04G06Q50/30G06N3/00
CPCG06N3/006G06Q10/04G06Q50/40
Inventor 刘庆金李鹏陈军伟
Owner THE AFFILIATED HOSPITAL OF QINGDAO UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com