CN109087045A - A kind of logistics legal method - Google Patents
A kind of logistics legal method Download PDFInfo
- Publication number
- CN109087045A CN109087045A CN201810900060.7A CN201810900060A CN109087045A CN 109087045 A CN109087045 A CN 109087045A CN 201810900060 A CN201810900060 A CN 201810900060A CN 109087045 A CN109087045 A CN 109087045A
- Authority
- CN
- China
- Prior art keywords
- order
- demand
- supply
- transport
- transport task
- 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.)
- Granted
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/083—Shipping
-
- 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/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
- G06Q10/06313—Resource planning in a project environment
-
- 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/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
- G06Q10/06316—Sequencing of tasks or work
Landscapes
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Engineering & Computer Science (AREA)
- Economics (AREA)
- Strategic Management (AREA)
- Entrepreneurship & Innovation (AREA)
- Development Economics (AREA)
- General Business, Economics & Management (AREA)
- Theoretical Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Physics & Mathematics (AREA)
- Marketing (AREA)
- Operations Research (AREA)
- Quality & Reliability (AREA)
- Tourism & Hospitality (AREA)
- Educational Administration (AREA)
- Game Theory and Decision Science (AREA)
- Life Sciences & Earth Sciences (AREA)
- Biodiversity & Conservation Biology (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention discloses a kind of logistics legal methods, this method is for planning the factory of multiple dispersions to the logistics progress in the destination city of multiple dispersions, this method is the following steps are included: (1) server collects the demand order in each destination city by client terminal, and collects the supply of material order of each factory by plant terminal；(2) the demand order in each destination city is aggregated into demand order list, and the supply of material order of each factory is aggregated into supply of material order list；(3) server generates transport task list according to each demand order and supply of material order；(4) each transport task entry in transport task list is issued to the plant terminal of corresponding factory by server.The invention has the advantages that global logistics cost optimization may be implemented in this method, logistics cost and logistics time are significantly reduced.
Description
Technical field
The present invention relates to logistics fields, and in particular to a kind of logistics legal method.
Background technique
In the prior art, logistics legal is usually by being manually scheduled.However complicated route can not manually be carried out poor
Planning is lifted, therefore manual dispatching is usual and will cause the waste of logistics cost.Especially logistics system have multiple departure places and
In the case where destination, optimal scheduling mode is not achieved in the efficiency far of manual dispatching.
Summary of the invention
According to the deficiencies of the prior art described above, It is an object of the present invention to provide a kind of logistics legal method, this method
Solve the problems, such as that logistics cost existing for manual dispatching mode is excessively high.
The object of the invention realization is completed by following technical scheme:
1. a kind of logistics legal method, this method is for planning the factory of multiple dispersions to the destination city of multiple dispersions
Logistics progress, it is characterised in that method includes the following steps:
S1) server collects the demand order in each destination city by client terminal, and passes through plant terminal
Collect the supply of material order of each factory；
S2 the demand order in each destination city) is aggregated into demand order list, and by each factory
The supply of material order be aggregated into the supply of material order list；
S3) server generates transport task list according to each demand order and the supply of material order；The fortune
Defeated task list includes several transport task entries, each transport task entry include factory's title, transport quantity with
And destination city name；
S4) each transport task entry in the transport task list is issued to the corresponding work by the server
The plant terminal of factory.
A further improvement of the present invention is that including several described demand orders in the demand order list, each
The demand order includes the destination city name and corresponding total demand in the destination city；The supply of material order
List includes several described supply of material orders, and each supply of material order includes the factory's title and corresponding confession of the factory
Goods total amount；During generating the task list, the server is successively to each need in the demand order list
Ask order carry out covering path, i-th of demand order is planned specifically includes the following steps:
(1) by each supply of material order in the supply of material order list according to its corresponding factory and the demand order
The distance between corresponding described destination city i is arranged according to descending；
(2) successively by the supply of material order list after sequence each supply of material order and the demand order i into
Row is brought together.
A further improvement of the present invention is that the supply of material of j-th in the supply of material order list after sequence is ordered
Single process brought together with the demand order i specifically includes the following steps:
(1) if the supply of material total amount j of the supply of material order j is greater than 0, and the total demand i of the demand order i
Greater than 0, using the minimum value between the total amount j and total demand i that supplies as transport quantity j；And supply of material total amount j is subtracted into fortune
Defeated quantity j, and the total demand i is subtracted into transport quantity j；And generate transport task entry j；The transport task entry j
The destination city name of factory title j, the transport quantity j and demand order i including the supply of material order j
Claim i；And transport task entry j is incorporated in the transport task list；
(2) if the supply of material total amount j of the supply of material order j is equal to 0, and the total demand i of the demand order i
Greater than 0, then the demand order i is compared displacement with the transport task entry in existing transport task list.
A further improvement of the present invention is that by the transport task in the demand order i and existing transport task list
During entry is compared displacement, the factory of the entitled supply of material order j of factory in existing transport task list is chosen
The transport task entry of title j, as candidate transport task entry set { Mk, and by the demand order i successively with candidate
Transport task entry set { MkIn each transport task entry MkIt is compared displacement；The demand order i and candidate transport
Task entry set { MkIn k-th of transport task entry MkBe compared displacement specifically includes the following steps:
(1) if between the corresponding factory j to the corresponding destination city i of the demand order i of the supply of material order j away from
From LijFactory j corresponding less than the supply of material order j to the transport task entry MkBetween corresponding destination city k away from
From Lki, and the total demand i of the demand order i is greater than 0；Then the total demand i of the demand order i and the transport are appointed
Be engaged in entry MkTransport quantity k between minimum value as transport quantity ik, and the total demand i of the demand order i is subtracted
Transport quantity ik is removed, and by the transport task entry MkTransport quantity k subtract transport quantity ik；Transport task is generated simultaneously
Entry ik, transport task entry ik include factory's title of the supply of material order j, the transport quantity ik and demand order i
Destination city name i；And transport task entry ik is incorporated in the transport task list；
(2) the transport task entry MkTransport quantity k be equal to 0, then will transport quantity k from the transport task list
Middle deletion.
The invention has the advantages that planning by this method logistics task, global logistics cost optimization may be implemented,
Significantly reduce logistics cost and logistics time.Simultaneously in planning process, all logistics plans are stored on server, can
To carry out verification feedback to logistics task conveniently by inquiry logistics plan.
Detailed description of the invention
Fig. 1 is the flow chart of logistics legal method of the present invention.
Specific embodiment
Feature of the invention and other correlated characteristics are described in further detail by embodiment below in conjunction with attached drawing, with
Convenient for the understanding of technical staff of the same trade:
Embodiment: as shown in Figure 1, the present embodiment is specifically related to a kind of logistics legal method, this method is multiple for planning
Logistics progress from the factory of dispersion to the destination city of multiple dispersions, this method application logistics progress in, logistics cost
It is proportional with the total distance of transport；Each factory needs according to the production capacity of itself generation supply of material order during transportation, and to
Each destination city supply of material, to meet the needs of each city order.During planning logistics, need to plan each
Factory is to the logistics capacity between each destination city.In planning process, need meeting each destination city as far as possible
In the case where demand order, transportation cost is reduced to the greatest extent.In this method, the server for logistics legal can be from dedicated map
Server obtains the distance between any factory and any destination city, and the distance obtained from map server is factory and mesh
Ground city between most short transportation range.This method specifically includes the following steps:
S1) server collects the demand order in each destination city by client terminal, and is collected by plant terminal
The supply of material order of each factory；
S2 the demand order in each destination city) is aggregated into demand order list, and the supply of material order of each factory is converged
Assembly supply of material order list；It include several demand orders in demand order list, each demand order includes destination city
Destination city name and corresponding total demand；Supply of material order list includes several supply of material orders, and each supply of material is ordered
Single includes the title and corresponding supply of material total amount of factory；
S3) server generates transport task list according to each demand order and supply of material order；Transport task list packet
Several transport task entries are included, each transport task entry includes factory's title, transport quantity and destination city name；
During generating task list, server successively carries out covering path to each demand order in demand order list；
S4) each transport task entry in transport task list is issued to the plant terminal of corresponding factory by server.
The cargo that factory specifies number according to each transport task entry to each destination municipal transport.Each factory can be according to the fortune received
Defeated task entry specifies the cargo of bibliography to corresponding destination municipal transport.
In the present embodiment, in demand order list include multiple demand orders, step S3) in server to i-th of demand
Order planned specifically includes the following steps:
(1) by each supply of material order in order list of supplying according to its corresponding factory purpose corresponding with demand order i
The distance between ground city i is arranged according to descending；
(2) successively each supply of material order in the supply of material order list after sequence is brought together with demand order i.It will sequence
Process that j-th in supply of material order list afterwards supply of material order and demand order i are brought together specifically includes the following steps:
(2.1) if the supply of material total amount j of the supply of material order j is greater than 0, and the demand of the demand order i is total
It measures i and is greater than 0, using the minimum value between the total amount j and total demand i that supplies as transport quantity j；And supply of material total amount j is subtracted
Transport quantity j is removed, and the total demand i is subtracted into transport quantity j；And generate transport task entry j；The transport task item
Mesh j includes the destination city of the factory title j of the supply of material order j, the transport quantity j and demand order i
City title i；And transport task entry j is incorporated in the transport task list；
(2.2) if the supply of material total amount j of the supply of material order j is equal to 0, and the demand of the demand order i is total
It measures i and is greater than 0, then the demand order i is compared displacement with the transport task entry in existing transport task list；By institute
It states during demand order i is compared displacement with the transport task entry in existing transport task list, chooses existing fortune
The transport task entry of the factory title j of the entitled supply of material order j of factory in defeated task list, as candidate transport task
Entry set { Mk, and by the demand order i successively with candidate transport task entry set { MkIn each transport task item
Mesh MkIt is compared displacement；The demand order i and candidate transport task entry set { MkIn k-th of transport task entry
MkBe compared displacement specifically includes the following steps:
If (a) between the corresponding factory j to the corresponding destination city i of the demand order i of the supply of material order j away from
From LijFactory j corresponding less than the supply of material order j to the transport task entry MkBetween corresponding destination city k away from
From Lki, and the total demand i of the demand order i is greater than 0；Then the total demand i of the demand order i and the transport are appointed
Be engaged in entry MkTransport quantity k between minimum value as transport quantity ik, and the total demand i of the demand order i is subtracted
Transport quantity ik is removed, and by the transport task entry MkTransport quantity k subtract transport quantity ik；Transport task is generated simultaneously
Entry ik, transport task entry ik include factory's title of the supply of material order j, the transport quantity ik and demand order i
Destination city name i；And transport task entry ik is incorporated in the transport task list；It, need to by comparing displacement
Ask order i and existing transport task entry MkBe compared displacement, can limited arrangement apart from shorter transport task entry,
In this way in the case where the supply of material sum of each factory is greater than the total demand in each destination city, it may be implemented more efficient
Transport task planning；
(b) the transport task entry MkTransport quantity k be equal to 0, then by the transport task entry MkFrom the transport
It is deleted in task list.Candidate transport task entry set { MkBe existing transport task list subset, to candidate transport
Task entry set { MkIn each transport task entry MkLook into and change the operation such as additions and deletions, is equal to existing fortune
Corresponding transport task entry in defeated task list carries out identical operation.
The advantageous effects of the present embodiment are as follows: logistics task is planned by this method, global object may be implemented
Cost optimization is flowed, logistics cost and logistics time are significantly reduced.Simultaneously in planning process, all logistics plans are stored in
On server, passes through inquiry logistics plan with can be convenient, verification feedback is carried out to logistics task.
Claims (4)
1. a kind of logistics legal method, this method is for planning the factory of multiple dispersions to the object in the destination city of multiple dispersions
Stream process, it is characterised in that method includes the following steps:
S1) server collects the demand order in each destination city by client terminal, and is collected by plant terminal
The supply of material order of each factory；
S2 the demand order in each destination city) is aggregated into demand order list, and by the institute of each factory
It states supply of material order and is aggregated into the supply of material order list；
S3) server generates transport task list according to each demand order and the supply of material order；The transport is appointed
Business list includes several transport task entries, and each transport task entry includes factory's title, transport quantity and mesh
Ground city name；
S4) each transport task entry in the transport task list is issued to the corresponding factory by the server
The plant terminal.
2. a kind of logistics legal method according to claim 1, which is characterized in that if including in the demand order list
The dry demand order, each demand order include the destination city name in the destination city and corresponding
Total demand；The supply of material order list includes several described supply of material orders, and each supply of material order includes the factory
Factory's title and corresponding supply of material total amount；During generating the task list, the server is successively to the need
It asks each demand order in order list to carry out covering path, planning is carried out to i-th of demand order and is specifically included
Following steps:
(1) by each supply of material order in the supply of material order list according to its corresponding factory and described i pairs of demand order
The distance between described destination city answered is arranged according to descending；
(2) successively each supply of material order in the supply of material order list after sequence is scooped up with the demand order i
It closes.
3. a kind of logistics legal method according to claim 2, which is characterized in that arrange the supply of material order after sequence
Process that j-th in the table supply of material order and the demand order i are brought together specifically includes the following steps:
(1) if the supply of material total amount j of the supply of material order j is greater than 0, and the total demand i of the demand order i is greater than
0, using the minimum value between the total amount j and total demand i that supplies as transport quantity j；And supply of material total amount j is subtracted into transport number
J is measured, and the total demand i is subtracted into transport quantity j；And generate transport task entry j；The transport task entry j includes
The destination city name i of the factory title j of the supply of material order j, the transport quantity j and demand order i；
And transport task entry j is incorporated in the transport task list；
(2) if the supply of material total amount j of the supply of material order j is equal to 0, and the total demand i of the demand order i is greater than
0, then the demand order i is compared displacement with the transport task entry in existing transport task list.
4. a kind of logistics legal method according to claim 3, which is characterized in that by the demand order i and existing fortune
During transport task entry in defeated task list is compared displacement, factory's title in existing transport task list is chosen
For it is described the supply of material order j factory title j transport task entry, as candidate transport task entry set { Mk, and by institute
State demand order i successively with candidate transport task entry set { MkIn each transport task entry MkIt is compared displacement；Institute
State demand order i and candidate transport task entry set { MkIn k-th of transport task entry MkIt is compared the specific packet of displacement
Include following steps:
(1) if the corresponding factory j of the supply of material order j to the distance between the corresponding destination city i of demand order i Lij
Factory j corresponding less than the supply of material order j to the transport task entry MkThe distance between corresponding destination city k
Lki, and the total demand i of the demand order i is greater than 0；Then by the total demand i of the demand order i and the transport task
Entry MkTransport quantity k between minimum value as transport quantity ik, and the total demand i of the demand order i is subtracted
Quantity ik is transported, and by the transport task entry MkTransport quantity k subtract transport quantity ik；Transport task item is generated simultaneously
Mesh ik, transport task entry ik include factory's title of the supply of material order j, the transport quantity ik and demand order i
Destination city name i；And transport task entry ik is incorporated in the transport task list；
(2) the transport task entry MkTransport quantity k be equal to 0, then will transport quantity k deleted from the transport task list
It removes.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810900060.7A CN109087045B (en) | 2018-08-09 | 2018-08-09 | Logistics planning method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810900060.7A CN109087045B (en) | 2018-08-09 | 2018-08-09 | Logistics planning method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109087045A true CN109087045A (en) | 2018-12-25 |
| CN109087045B CN109087045B (en) | 2021-11-19 |
Family
ID=64833927
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810900060.7A Active CN109087045B (en) | 2018-08-09 | 2018-08-09 | Logistics planning method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109087045B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110232540A (en) * | 2019-05-16 | 2019-09-13 | 深圳市中海通供应链管理有限公司 | Service order match method and device |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105574754A (en) * | 2015-12-22 | 2016-05-11 | 保利（北京）能源电子商务发展有限公司 | Method and system for matching transaction information of E-commerce platform and logistics transaction platform |
| CN107274261A (en) * | 2017-06-05 | 2017-10-20 | 杭州王道起兮科技有限公司 | B2B E-commerce supply and demand bipartite matching method and system |
| CN107392523A (en) * | 2017-06-27 | 2017-11-24 | 王帆 | Intelligent cloud goods distribution method and system |
| CN107506964A (en) * | 2017-08-23 | 2017-12-22 | 北京惠赢天下网络技术有限公司 | A kind of Distribution logistics network share method, system and terminal based on standard container |
| CN108229876A (en) * | 2017-12-07 | 2018-06-29 | 黄淮学院 | A kind of electric business method of commerce and electric business transaction system based on big data |
-
2018
- 2018-08-09 CN CN201810900060.7A patent/CN109087045B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105574754A (en) * | 2015-12-22 | 2016-05-11 | 保利（北京）能源电子商务发展有限公司 | Method and system for matching transaction information of E-commerce platform and logistics transaction platform |
| CN107274261A (en) * | 2017-06-05 | 2017-10-20 | 杭州王道起兮科技有限公司 | B2B E-commerce supply and demand bipartite matching method and system |
| CN107392523A (en) * | 2017-06-27 | 2017-11-24 | 王帆 | Intelligent cloud goods distribution method and system |
| CN107506964A (en) * | 2017-08-23 | 2017-12-22 | 北京惠赢天下网络技术有限公司 | A kind of Distribution logistics network share method, system and terminal based on standard container |
| CN108229876A (en) * | 2017-12-07 | 2018-06-29 | 黄淮学院 | A kind of electric business method of commerce and electric business transaction system based on big data |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110232540A (en) * | 2019-05-16 | 2019-09-13 | 深圳市中海通供应链管理有限公司 | Service order match method and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109087045B (en) | 2021-11-19 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Burinskiene et al. | A simulation study for the sustainability and reduction of waste in warehouse logistics | |
| Cao et al. | Deployment strategies of double-rail-mounted gantry crane systems for loading outbound containers in container terminals | |
| CN109214755A (en) | A kind of automatic row single dispatching method in warehousing management | |
| CN104008428B (en) | Service of goods requirement forecasting and resource preferred disposition method | |
| CN108197761A (en) | Fusion milk-Run and the plant-incoming coal dispatching method and system for getting rid of hanging dispatching | |
| Zhou et al. | Information-based allocation strategy for grid-based transshipment automated container terminal | |
| CN116579699B (en) | Wisdom logistics distribution system based on car goods are in coordination | |
| Laipple et al. | Generic data model for semiconductor manufacturing supply chains | |
| Barlatt et al. | Ford motor company implements integrated planning and scheduling in a complex automotive manufacturing environment | |
| CN109087045A (en) | A kind of logistics legal method | |
| CN101236618A (en) | Method and device for selecting working flow path | |
| Sharma et al. | A literature survey on multi-depot vehicle routing problem | |
| Zhen et al. | Scheduling multiple types of equipment in an automated warehouse | |
| CN109800833A (en) | A kind of material tracing and positioning management control system based on B/S framework | |
| Bevilacqua et al. | Supply chain integration in an Italian automotive company: the case of a kitting system implementation | |
| Mostafa et al. | Vertical supply chain integrated decisions: a critical review of recent literature and a future research perspective | |
| Rizzo et al. | AI-CARGO: A data-driven air-cargo revenue management system | |
| Wang et al. | An integrated approach to reactive scheduling subject to machine breakdown | |
| Yener et al. | Simulation of Re-Arrangement and Healing in Robotic Compact Bin-Storage System | |
| Chopra | Design of Lean Manufacturing with the Use of Discrete Event Simulation | |
| CN109801014A (en) | Electric energy metering device dispatching scheduling method and program system based on genetic algorithm | |
| Russkikh et al. | Value stream mapping method for development of a dynamic model of capacity utilization | |
| CN109460949A (en) | A kind of logistics network optimization method based on hybrid automaton | |
| Takeda et al. | A simulation for understanding the role of information systems and information quality in the move towards a green supply chain | |
| Zhou et al. | Research on block storage yard scheduling according to grid method |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |