CN108550004A - A kind of warehouse management system of high degree of automation - Google Patents
A kind of warehouse management system of high degree of automation Download PDFInfo
- Publication number
- CN108550004A CN108550004A CN201810284998.0A CN201810284998A CN108550004A CN 108550004 A CN108550004 A CN 108550004A CN 201810284998 A CN201810284998 A CN 201810284998A CN 108550004 A CN108550004 A CN 108550004A
- Authority
- CN
- China
- Prior art keywords
- serviced
- article
- user
- logistics vehicles
- indicate
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
- G06Q10/087—Inventory or stock management, e.g. order filling, procurement or balancing against orders
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
- G06Q10/047—Optimisation of routes or paths, e.g. travelling salesman problem
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
- G06Q10/083—Shipping
- G06Q10/0835—Relationships between shipper or supplier and carriers
- G06Q10/08355—Routing methods
Landscapes
- Business, Economics & Management (AREA)
- Engineering & Computer Science (AREA)
- Economics (AREA)
- Human Resources & Organizations (AREA)
- Strategic Management (AREA)
- Marketing (AREA)
- Physics & Mathematics (AREA)
- Entrepreneurship & Innovation (AREA)
- Development Economics (AREA)
- Operations Research (AREA)
- Quality & Reliability (AREA)
- Tourism & Hospitality (AREA)
- Theoretical Computer Science (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Game Theory and Decision Science (AREA)
- Accounting & Taxation (AREA)
- Finance (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The present invention provides a kind of warehouse management systems of high degree of automation, including article receiving module, memory module, processing module and item dispenser module, the article receiving module is for receiving the article sent to warehouse, the memory module be used for preserve the article sent into warehouse shipment destination and shipment to the article of each shipment destination information, the information of the article of the shipment destination includes the corresponding user information to be serviced of the article, the processing module is used to determine the optimal delivery path of logistics vehicles according to the shipment destination of article and the information of shipment to the article of each shipment destination stocked up into warehouse, logistics vehicles are assigned to carry out delivery in the optimal delivery path of logistics vehicles that the item dispenser module is used to be determined according to processing module.Beneficial effects of the present invention are:A kind of warehouse management system of high degree of automation is established, realizes warehouse from the comprehensive management for entering library storage and being dispensed to outbound.
Description
Technical field
The present invention relates to warehousing management technical fields, and in particular to a kind of warehouse management system of high degree of automation.
Background technology
With production-scale expansion and expanding economy, warehousing management is more and more important.
Compared with European and American developed countries, in China's delivery industry starting evening, development level is low.In logistics distribution, vehicle route
Whether rationally, distribution time, expense, income are had a major impact.With economic continuous development, logistics distribution scale is drastically
Expand, the especially fast development of e-commerce so that number of users rapid expanding, transportation network is increasingly complicated in addition, dispenses road
The phenomenon that line is unreasonable, and the dispatching task of the different each vehicles of different routes is unbalanced, and vehicle load factor is not high or even empty driving is often
Occur, seriously reduces logistic efficiency, constrain the development of delivery industry.Therefore, how the planning vehicle driving route of science, it is right
In reducing distribution cost, improves logistic efficiency and be of great significance.
Invention content
In view of the above-mentioned problems, the present invention is intended to provide a kind of warehouse management system of high degree of automation.
The purpose of the present invention is realized using following technical scheme:
Provide a kind of warehouse management system of high degree of automation, including article receiving module, memory module, processing mould
Block and item dispenser module, the article receiving module is for receiving the article sent to warehouse, and the memory module is for preserving
Send the article into warehouse shipment destination and shipment to the information of the article of each shipment destination, the shipment destination
The information of article include the corresponding user information to be serviced of the article, the processing module is used for according to stocking up into warehouse
The shipment destination of article and the information of shipment to the article of each shipment destination determine the optimal delivery path of logistics vehicles,
Logistics vehicles are assigned to be sent in the optimal delivery path of logistics vehicles that the item dispenser module is used to be determined according to processing module
Goods.
The article receiving module includes receiving unit and sorting unit, and the receiving unit is sent for receiving to warehouse
Article, the sorting unit are used for basis and the shipment destination to the article in warehouse are sent to sort the article.
The processing module includes single treatment unit, after-treatment unit and processing unit three times, the single treatment
Unit is used to determine logistics according to logistics vehicles path model for establishing logistics vehicles path model, the after-treatment unit
The object function of vehicle routing optimization, the processing unit three times are used to determine the optimal road of logistics vehicles according to object function
Diameter.
Beneficial effects of the present invention are:Establish a kind of warehouse management system of high degree of automation, realize warehouse from
Enter the comprehensive management that library storage is dispensed to outbound.
Description of the drawings
Using attached drawing, the invention will be further described, but the embodiment in attached drawing does not constitute any limit to the present invention
System, for those of ordinary skill in the art, without creative efforts, can also obtain according to the following drawings
Other attached drawings.
Fig. 1 is the structural schematic diagram of the present invention;
Reference numeral:
Article receiving module 1, memory module 2, processing module 3, item dispenser module 4.
Specific implementation mode
The invention will be further described with the following Examples.
Referring to Fig. 1, a kind of warehouse management system of high degree of automation of the present embodiment, including article receiving module 1, deposit
Module 2, processing module 3 and item dispenser module 4 are stored up, the article receiving module 1 is described for receiving the article sent to warehouse
Memory module 2 be used for preserve the article sent into warehouse shipment destination and shipment to the article of each shipment destination letter
Breath, the information of the article of the shipment destination includes the corresponding user information to be serviced of the article, and the processing module 3 is used for
Logistics is determined according to the information of the shipment destination for the article stocked up into warehouse and shipment to the article of each shipment destination
The optimal delivery path of vehicle, the optimal delivery road of logistics vehicles that the item dispenser module 4 is used to be determined according to processing module 3
Diameter assigns logistics vehicles to carry out delivery.
The present embodiment establishes a kind of warehouse management system of high degree of automation, realizes warehouse from library storage is entered to going out
The comprehensive management of library dispatching.
Preferably, the article receiving module 1 includes receiving unit and sorting unit, and the receiving unit is sent for receiving
To the article in warehouse, the sorting unit is used for basis and the shipment destination to the article in warehouse is sent to divide the article
It picks.
The processing module 3 includes single treatment unit, after-treatment unit and processing unit three times, the single treatment
Unit is used to determine logistics according to logistics vehicles path model for establishing logistics vehicles path model, the after-treatment unit
The object function of vehicle routing optimization, the processing unit three times are used to determine the optimal road of logistics vehicles according to object function
Diameter.
The accurate acquisition of logistics vehicles optimal paths of this preferred embodiment processing modules implement, further improves logistics
Service level and reduce logistics service cost.
Preferably, the single treatment unit is for establishing logistics vehicles path model, specially:Use complete graph GT=
(MH, DT, C) indicates logistics vehicle route, wherein MH={ 0,1,2 ..., n } indicates that node set, node 0 represent warehouse 1,
Other each node on behalf users to be serviced, n indicate the quantity of user to be serviced, DT=(i, j) | and i, j ∈ MH } indicate side collection,
(i, j) represents the path that node connects and composes, and C={ 1,2 ..., K } indicates that logistics vehicles set, K indicate the number of logistics vehicles
Amount;
Weight FN is assigned to each edgeij, i ≠ j uses FNijIndicate the expense between node:In formula
In, f1Indicate the fuel cost that unit distance generates, dijIndicate the distance between node, f2Indicate unit distance manpower at
This;
This preferred embodiment single treatment unit has fully considered more vehicles in logistics vehicles path model modeling process
Dispatching and dispatching expense, practical problem is simplified, and the object function subsequently to establish logistics vehicles path optimization is established
Basis is to have fully considered that fuel cost and human cost, the weights of acquisition can more reflect practical feelings during side is entitled
Condition.
Preferably, the after-treatment unit is used to determine logistics vehicles path optimization according to logistics vehicles path model
Object function, specially:It is assumed that the vehicle for providing service to a certain user to be serviced has and only one, logistics vehicles road is determined
Diameter optimization object function:In formula, RX indicates logistic car
Path optimization's object function, k indicate logistics vehicles, k=1,2 ..., K,
Determine logistics vehicles path optimization bound for objective function:In formula, riIndicate that the demand of user to be serviced, R indicate the capacity of each vehicle;
This preferred embodiment after-treatment unit fully considers the delivered payload capability of vehicle, by expense minimum mesh as an optimization
Mark, establishes logistics vehicles path optimization object function, which disclosure satisfy that warehouse is waited for into certain territorial scope
Service user is serviced.
Preferably, the processing unit three times is used to determine the optimal path of logistics vehicles according to object function, specially:
The distance between user to be serviced distance is divided into M classes by the first step using k-means clusters, and M ∈ [1, K], K indicate logistics
The quantity of vehicle;Second step:It will be per class user to be serviced as a virtual user to be serviced, the virtual user to be serviced
, the optimal path for the virtual user to be serviced that each car is dispensed is calculated using ant colony optimization algorithm;Third walks:For
Per class user to be serviced, optimal path in a class is determined using ant colony optimization algorithm:4th step:In conjunction with virtual user to be serviced
Optimal path and class per class user to be serviced in optimal path, obtain the optimal path of each car, wherein virtual to be serviced
It is connected by boundary user to be serviced between user.
The boundary user to be serviced obtains in the following ways:If U classes and V classes are that two adjacent users to be serviced are poly-
Class,Indicate u-th of user to be serviced in U classes, wUIndicate the number of users to be serviced in U classes,Indicate v-th of user to be serviced in V classes, wVIndicate the number of users to be serviced in V classes, then U classes
Boundary user to be serviced with V classes is:In formula,Indicate determining boundary user to be serviced,It indicatesWithBetween expense;
Processing unit converts large-scale user to be serviced to a small number of virtual use to be serviced to this preferred embodiment three times
Family substantially increases computational efficiency, by determining that boundary user to be serviced, the accurate reproduction optimal path of each car realize
Accurately and fast the determining of logistics vehicles optimal paths.
Logistics distribution is carried out using the warehouse management system of high degree of automation of the present invention, 5 cities is chosen and is tested,
Respectively city 1, city 2, city 3, city 4, city 5 count dispatching efficiency and distribution cost, compared with logistics system
System is compared, and generation has the beneficial effect that shown in table:
Efficiency is dispensed to improve | Distribution cost reduces | |
City 1 | 29% | 27% |
City 2 | 27% | 26% |
City 3 | 26% | 26% |
City 4 | 25% | 24% |
City 5 | 24% | 22% |
Finally it should be noted that the above embodiments are merely illustrative of the technical solutions of the present invention, rather than the present invention is protected
The limitation of range is protected, although being explained in detail to the present invention with reference to preferred embodiment, those skilled in the art answer
Work as understanding, technical scheme of the present invention can be modified or replaced equivalently, without departing from the reality of technical solution of the present invention
Matter and range.
Claims (6)
1. a kind of warehouse management system of high degree of automation, which is characterized in that including article receiving module, memory module, place
Module and item dispenser module are managed, for receiving the article sent to warehouse, the memory module is used for the article receiving module
The shipment destination for sending article into warehouse and shipment are preserved to the information of the article of each shipment destination, the shipment mesh
The information of article on ground include the corresponding user information to be serviced of the article, the processing module is used for according to stocking up to warehouse
In the shipment destination of article and the information of shipment to the article of each shipment destination determine the optimal delivery of logistics vehicles
Path, the optimal delivery path appointment logistics vehicles of logistics vehicles that the item dispenser module is used to be determined according to processing module into
Row delivery.
2. the warehouse management system of high degree of automation according to claim 1, which is characterized in that the article receives mould
Block includes receiving unit and sorting unit, and for receiving the article sent to warehouse, the sorting unit is used for the receiving unit
The article is sorted according to the shipment destination to the article in warehouse is sent.
3. the warehouse management system of high degree of automation according to claim 2, which is characterized in that the processing module packet
It includes single treatment unit, after-treatment unit and processing unit, the single treatment unit is used to establish logistics vehicles road three times
Diameter model, the after-treatment unit are used to determine the target letter of logistics vehicles path optimization according to logistics vehicles path model
Number, the processing unit three times are used to determine the optimal path of logistics vehicles according to object function.
4. the warehouse management system of high degree of automation according to claim 3, which is characterized in that the single treatment list
Member is for establishing logistics vehicles path model, specially:Logistics vehicle route is indicated using complete graph GT=(MH, DT, C),
Wherein, MH={ 0,1,2 ..., n } indicates that node set, node 0 represent warehouse 1, other each node on behalf users to be serviced, n tables
Show the quantity of user to be serviced, DT=(i, j) | and i, j ∈ MH } indicate side collection, (i, j) represents the path that node connects and composes, C
={ 1,2 ..., K } indicates that logistics vehicles set, K indicate the quantity of logistics vehicles;
Weight FN is assigned to each edgeij, i ≠ j uses FNijIndicate the expense between node:In formula, f1Table
Show the fuel cost that unit distance generates, dijIndicate the distance between node, f2Indicate the human cost of unit distance.
5. the warehouse management system of high degree of automation according to claim 4, which is characterized in that the after-treatment list
Object function of the member for determining logistics vehicles path optimization according to logistics vehicles path model, specially:It is assumed that being waited for a certain
The vehicle that service user provides service has and only one, determines logistics vehicles path optimization object function: In formula, RX indicates that logistics vehicle routing optimization object function, k indicate
Logistics vehicles, k=1,2 ..., K,
Determine logistics vehicles path optimization bound for objective function:In formula, riIndicate that the demand of user to be serviced, R indicate the capacity of each vehicle.
6. the warehouse management system of high degree of automation according to claim 5, which is characterized in that the processing three times is single
Optimal path of the member for determining logistics vehicles according to object function, specially:The first step will wait taking using k-means clusters
The distance between business user distance is divided into M classes, and M ∈ [1, K], K indicate the quantity of logistics vehicles;Second step:It will wait taking per class
User be engaged in as a virtual user to be serviced, the virtually user's to be serviced, it is calculated often using ant colony optimization algorithm
The optimal path for the virtual user to be serviced that vehicle is dispensed;Third walks:For every class user to be serviced, calculated using ant group optimization
Method determines optimal path in a class:4th step:In conjunction with the optimal path of virtual user to be serviced and per class user's to be serviced
Optimal path in class obtains the optimal path of each car, wherein is connected by boundary user to be serviced between virtual user to be serviced
It connects;
The boundary user to be serviced obtains in the following ways:If U classes and V classes are two adjacent user clusterings to be serviced,Indicate u-th of user to be serviced in U classes, wUIndicate the number of users to be serviced in U classes,Indicate v-th of user to be serviced in V classes, wVIndicate the number of users to be serviced in V classes, then U
The boundary of class and V classes user to be serviced is:In formula,Indicate determining boundary user to be serviced,It indicatesWithBetween expense.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201810284998.0A CN108550004A (en) | 2018-04-02 | 2018-04-02 | A kind of warehouse management system of high degree of automation |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201810284998.0A CN108550004A (en) | 2018-04-02 | 2018-04-02 | A kind of warehouse management system of high degree of automation |
Publications (1)
Publication Number | Publication Date |
---|---|
CN108550004A true CN108550004A (en) | 2018-09-18 |
Family
ID=63513813
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201810284998.0A Pending CN108550004A (en) | 2018-04-02 | 2018-04-02 | A kind of warehouse management system of high degree of automation |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN108550004A (en) |
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN111369189A (en) * | 2020-02-28 | 2020-07-03 | 北京三快在线科技有限公司 | Method and device for generating picking task, storage medium and electronic equipment |
CN116777180A (en) * | 2023-08-07 | 2023-09-19 | 中资国恒科技有限公司 | Visual logistics scheduling method and system based on Internet of things |
Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN107408285A (en) * | 2015-02-20 | 2017-11-28 | 株式会社日立物流 | Warehouse management system, warehouse and warehouse management method |
CN108596535A (en) * | 2018-04-02 | 2018-09-28 | 深圳市益鑫智能科技有限公司 | A kind of Modern Materials Circulation system that intelligence degree is high |
-
2018
- 2018-04-02 CN CN201810284998.0A patent/CN108550004A/en active Pending
Patent Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN107408285A (en) * | 2015-02-20 | 2017-11-28 | 株式会社日立物流 | Warehouse management system, warehouse and warehouse management method |
CN108596535A (en) * | 2018-04-02 | 2018-09-28 | 深圳市益鑫智能科技有限公司 | A kind of Modern Materials Circulation system that intelligence degree is high |
Non-Patent Citations (1)
Title |
---|
张家善: ""基于改进蚁群算法的物流配送车辆路径优化研究"", 《中国博士学位论文全文数据库》 * |
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN111369189A (en) * | 2020-02-28 | 2020-07-03 | 北京三快在线科技有限公司 | Method and device for generating picking task, storage medium and electronic equipment |
CN116777180A (en) * | 2023-08-07 | 2023-09-19 | 中资国恒科技有限公司 | Visual logistics scheduling method and system based on Internet of things |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN103927643B (en) | A kind of method that large-scale order form treatment optimizes with Distribution path | |
US8131607B2 (en) | Device and method of planning and managing real-time postal delivery work | |
CN104766188B (en) | A kind of method and system of logistics distribution | |
CN107133705B (en) | Intelligent packaging service modeling and distribution task dynamic optimization method facing green logistics | |
CN107145971A (en) | A kind of express delivery dispatching optimization method of dynamic adjustment | |
CN103111425A (en) | Express sorting and delivering system and method | |
CN103544589A (en) | Intelligent logistics goods delivery method and system based on cloud platform | |
Rieck et al. | A new mixed integer linear model for a rich vehicle routing problem with docking constraints | |
CN108734422A (en) | Method for acquiring logistics sorting information and related device | |
CN109919532B (en) | Logistics node determining method and device | |
CN109523202B (en) | Order processing method, device, equipment and computer readable storage medium | |
CN101706887A (en) | Quick sorting method by grouping | |
CN110826968A (en) | Urban crowdsourcing distribution task optimal scheduling method based on path planning | |
Wolfson et al. | Fairness versus optimality in ridesharing | |
CN114548723A (en) | Real-time vehicle and goods matching and path recommendation method and system based on cloud edge cooperation | |
CN108550004A (en) | A kind of warehouse management system of high degree of automation | |
CN114580750A (en) | Improved analysis method of regional vehicle path planning dynamic analysis model | |
CN111047102B (en) | Express delivery route optimization method based on elite-driven particle swarm algorithm | |
CN111626663B (en) | Scattered express delivery cooperation sending method facing heterogeneous express delivery points | |
AU2012261487B2 (en) | A method of processing mailpieces, the method including aggregating the batches of mailpieces | |
CN113127176A (en) | Multi-role task allocation method and system for working platform | |
CN108596535A (en) | A kind of Modern Materials Circulation system that intelligence degree is high | |
CN116187092A (en) | Dynamic distribution order allocation optimization method considering supply and demand states of transport capacity system | |
CN111882123A (en) | Intelligent community logistics terminal site selection method for big data intelligent decision | |
CN113935685A (en) | Method and system for realizing logistics tail end differential allocation |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
PB01 | Publication | ||
PB01 | Publication | ||
SE01 | Entry into force of request for substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
RJ01 | Rejection of invention patent application after publication |
Application publication date: 20180918 |
|
RJ01 | Rejection of invention patent application after publication |