Eureka AIR delivers breakthrough ideas for toughest innovation challenges, trusted by R&D personnel around the world.

A Three-Stage Meta-heuristic Optimization Method for Parking Slot Allocation

An allocation optimization and heuristic technology, applied in the aviation field, can solve the problems of unsatisfactory allocation results optimization indicators and long parking space allocation time.

Active Publication Date: 2020-11-06
北京富通东方科技有限公司
View PDF5 Cites 2 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0006] The purpose of the present invention is to provide a three-stage meta-heuristic parking space allocation optimization method, which solves the problems in the prior art that under the multi-constraint conditions, the large-scale flight allocation parking space allocation time is too long, and the allocation result optimization index is not ideal.

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 Three-Stage Meta-heuristic Optimization Method for Parking Slot Allocation
  • A Three-Stage Meta-heuristic Optimization Method for Parking Slot Allocation
  • A Three-Stage Meta-heuristic Optimization Method for Parking Slot Allocation

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0080] The present invention will be described in detail below in conjunction with the accompanying drawings and specific embodiments.

[0081] A kind of three-stage meta-heuristic parking space allocation optimization method of the present invention is specifically implemented according to the following steps:

[0082] Step 1. Preprocess the data to obtain the mapping relationship between the flight and the seat. Specifically, follow the steps below:

[0083] Among them, the data includes flight constraint rules and seat constraint rules, and each constraint rule has a weight value representing the importance of the constraint rule;

[0084] Flight constraint rules include: flight number, aircraft type, arrival time, departure time, VIP level, route, mission type, airline, terminal, number of passengers;

[0085] Seat constraint rules include: whether it is close to the plane, the terminal it belongs to, the plane number, the plane category, and the collection of aircraft ty...

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 three-stage meta-heuristic method for optimizing the allocation of parking positions, which is specifically implemented according to the following steps: preprocessing the data to obtain the mapping relationship between flights and aircraft positions; establishing parking position allocation according to the mapping relationship between flights and aircraft positions Model; use the three-stage meta-heuristic optimal solution search to obtain the seat allocation plan. The invention solves the problems in the prior art that the allocation time of large-scale flight allocation is too long and the optimization index of the allocation result is not ideal under the multi-constraint conditions, and can quickly obtain high-quality parking spaces under the large-scale and multi-constraint conditions of the airport. Compared with the traditional method, the core indicators of the parking lot allocation scheme, such as bridge access rate, corridor bridge rate, and allocation satisfaction, have been greatly improved, and it has good adaptability in changing business scenarios.

Description

technical field [0001] The invention belongs to the field of aviation technology, and in particular relates to a three-stage meta-heuristic parking space allocation optimization method. Background technique [0002] With the rapid development of China's civil aviation transportation industry in recent years and the increasing number of flights, maintaining the orderly and efficient operation of airports has become a challenge. Under the condition of limited airport parking space resources, its scientific allocation becomes one of the keys to improve the airport support capability and service level. In order to optimize the allocation of parking slots under the condition of meeting the specific constraints of the airport, for example, a certain aircraft can only park in designated slots, how to carry out large-scale allocation in an orderly and efficient manner and improve key optimization indicators has become a key issue in the allocation of parking slots. [0003] In the ...

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/04G06Q10/06G06Q50/30
CPCG06Q10/04G06Q10/067G06Q50/30
Inventor 赵伟李瑞瑞金楚欣马勇
Owner 北京富通东方科技有限公司
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
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