CN103729753A - Three-stage matching tobacco distribution method based on transportation scheduling - Google Patents
Three-stage matching tobacco distribution method based on transportation scheduling Download PDFInfo
- Publication number
- CN103729753A CN103729753A CN201410020039.XA CN201410020039A CN103729753A CN 103729753 A CN103729753 A CN 103729753A CN 201410020039 A CN201410020039 A CN 201410020039A CN 103729753 A CN103729753 A CN 103729753A
- Authority
- CN
- China
- Prior art keywords
- vehicle
- client
- order
- information
- pij
- 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
Landscapes
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention relates to a three-stage matching tobacco distribution method based on transportation scheduling. The method comprises the following steps of A, preprocessing client information, order information and vehicle information and inputting the client information, the order information and the vehicle information, wherein the order information comprises the specifications, the quantity, the destinations and the arrival time of orders; setting a vehicle loading coefficient a, wherein a is larger than 0 and smaller than 1 and only the orders and the vehicles, which reach the vehicle coefficient a, can be matched successfully, and setting Pij which represents the vehicle loading coefficient of a client i on a vehicle j; B, if the Pij is larger than or equal to a and smaller than or equal to 1, determining that the Pij meets a first-stage matching and single vehicle distribution can be directly performed; C, if the Pij is larger than 1, determining that the Pij meets a second-stage matching and multiple vehicle distribution can be performed; D, if the Pij is smaller than a, determining that the Pij meets a third-stage matching and multiple order common distribution can be performed. The three-stage matching tobacco distribution method based on the transportation scheduling can effectively improves the client satisfaction of goods distributions and is the lowest in total cost and the highest in distribution vehicle full loading rate.
Description
Technical field
The invention belongs to a kind of logistics system technical field, specifically a kind of tobacco allocator based on three grades of couplings of transportation dispatching.
Background technology
At present, in China's development rapidly, it has become the connection producer and the requisite link of consumer to logistic industry.The logistic industry of China is in the starting stage, and its structure of most logistics system and complicated, has caused the continuity of logistics progress not good, has not only wasted logistics cost, does not also reach the effect that improves logistic efficiency simultaneously.
For production of cigarettes sales industry, how to meet market demands, accomplish that the supply of material is overstocked, not out of stock; Meet efficiency requirement, delivery fast, accomplishes the fastest exchanges data and logistics running, how to carry out the distribution of logistics inventory structures, reduces and moves storehouse workload, and alleviating outbound pressure is that production and logistic industry are badly in need of the problem solving.
According to the requirement of Chinese tobacco Internet of Things development plan, realize the comprehensive perception of (comprising tobacco shred, part, Turnover Box, pallet, vehicle, fork truck, storage, goods yard) of cigarette logistics resource, guarantee that cigarette logistics resource is all the time in known, controlled, trusted status; The comprehensive optimization of realization to cigarette logistics work flow (comprising: production of cigarettes, go out to put in storage, sort, join the operation flows such as car, transportation), guarantees that work efficiency improves constantly; Realize becoming more meticulous of cigarette logistics basic management (expense, cost, environment, safety, quality etc.), guarantee economic and practical and the high efficiency of cigarette logistics.Arrange more and develop simultaneously, finally reach that cigarette finished product logistics operation is visual, flow process optimization and intellectual management target.
Summary of the invention
In order to realize the comprehensive optimization to cigarette logistics work flow, the object of this invention is to provide a kind of tobacco allocator based on three grades of couplings of transportation dispatching, the method can effectively improve the customer satisfaction of commodity distribution, and the lowest cost, distribution vehicle load factor are the highest.
In order to realize above-mentioned object, the present invention has adopted following technical scheme:
A tobacco allocator based on three grades of couplings of transportation dispatching, comprises the following steps:
A, client, order and information of vehicles are carried out to pre-service, input customer information, sequence information, information of vehicles, described sequence information comprises that product rule, quantity, destination, the order of order need send to the time; Set vehicle loading factor alpha, 0< α <1, the match is successful to reach vehicle loading factor alpha order and vehicle ability,
represent the vehicle loading coefficient that client i is loaded by vehicle j;
If B
, meet one-level coupling, can directly take car load dispensing;
If C
, meet second degree matches, can take many car load dispensings;
If D
, meet three grades of couplings, take a plurality of order Common Distribution :s.
As preferably, in described steps A, input customer information, is divided into ground in other places by client, according to being followed successively by each encoder client apart from home-delivery center's descending order of distance, forms client set C={1,2,, n ..., N}, that coding is less than or equal to n is nonlocal client, and coding is greater than the client for interior ground of n.
As preferably, in described step C, order volume is too large, takes many cars dispensings, sets the set of not mating vehicle to be
, can find a plurality of such vehicles to make
, and
, meet second degree matches.
As preferably, in described step D, take a plurality of order Common Distribution :s, make vehicle loading coefficient be greater than α.
The present invention is owing to having adopted above-mentioned technical scheme, and the vehicle load factor of usining maximizes as optimization aim, has set up integral linear programming model, and has designed three grades of matching principles according to the size of vehicle load factor, and proposes the concept of Common Distribution: radius.Vehicle dispatch system based on the exploitation of three grades of matching principles, can effectively improve the customer satisfaction of commodity distribution, and the lowest cost, distribution vehicle load factor are the highest.
Accompanying drawing explanation
Fig. 1 is the process flow diagram of the specific embodiment of the invention.
Embodiment
Below by drawings and Examples, technical scheme of the present invention is described in further detail.
Below in conjunction with accompanying drawing, the preferred embodiments of the present invention are described, should be appreciated that preferred embodiment described herein, only for description and interpretation the present invention, is not intended to limit the present invention.
As shown in Figure 1, a kind of tobacco allocator based on three grades of couplings of transportation dispatching, the method comprises the following steps:
S101 carries out pre-service to client, order and information of vehicles, input customer information, sequence information, information of vehicles, and described sequence information comprises that product rule, quantity, destination, the order of order need send to the time; Set vehicle loading factor alpha, 0< α <1, the match is successful to reach vehicle loading factor alpha order and vehicle ability,
represent the vehicle loading coefficient that client i is loaded by vehicle j;
If S102
, meet one-level coupling, can directly take car load dispensing;
If S103
, meet second degree matches, can take many car load dispensings;
If S104
, meet three grades of couplings, take a plurality of order Common Distribution :s.
Wherein, in step S101, input customer information, is divided into ground in other places by client, according to being followed successively by each encoder client apart from home-delivery center's descending order of distance, forms client set C={1,2,, n ..., N}, that coding is less than or equal to n is nonlocal client, and coding is greater than the client for interior ground of n.
Wherein, in step S103, consider that a plurality of vehicles are that an order dispensing is that an order dispensing is compared with a vehicle, the marginal cost of sharing on every product is higher, so should take a few car as far as possible, is an order service.For example an order volume is 800, and existing specified struck capacity is respectively the vehicle of 200,310,500 respectively 4,1,1.Although being order dispensing and load factor, the vehicle that is 200 by 4 specified struck capacities reaches 100%, also can be that the vehicle that the vehicle of 310 and 1 specified struck capacity are 500 is that order dispensing and load factor only have 98.77% by 1 specified struck capacity, the cost bringing due to increase vehicle is greater than the cost that residue load factor (1-load factor) itself is brought, and we preferentially select the vehicle that burden rating is large to mate with it.
Wherein, in step S104, the client who adopts a plurality of order Common Distribution :s is in Common Distribution: radius or belong on Common Distribution: route, and we are called Common Distribution: principle.The order in other places should be obeyed Common Distribution: route and Common Distribution: route principle, obeys Common Distribution: radius principle interiorly.
Each order must arrive before order need be sent to, and order is carried out sequential priority principle.
Obviously, the above embodiment of the present invention is only for example of the present invention is clearly described, and is not the restriction to embodiments of the present invention.For those of ordinary skill in the field, can also make other changes in different forms on the basis of the above description.Here cannot give all embodiments exhaustive.Every still row in protection scope of the present invention of apparent variation that technical scheme of the present invention extends out or change that belong to.
Claims (4)
1. the tobacco allocator based on three grades of couplings of transportation dispatching, is characterized in that the method comprises the following steps:
A, client, order and information of vehicles are carried out to pre-service, input customer information, sequence information, information of vehicles, described sequence information comprises that product rule, quantity, destination, the order of order need send to the time; Set vehicle loading factor alpha, 0< α <1, the match is successful to reach vehicle loading factor alpha order and vehicle ability,
represent the vehicle loading coefficient that client i is loaded by vehicle j;
If B
, meet one-level coupling, directly take car load dispensing;
If C
, meet second degree matches, take many car load dispensings;
If D
, meet three grades of couplings, take a plurality of order Common Distribution :s.
2. a kind of tobacco allocator based on three grades of couplings of transportation dispatching according to claim 1, it is characterized in that, in steps A, input customer information, client is divided into ground in other places, according to being followed successively by each encoder client apart from home-delivery center's descending order of distance, form client set C={1,2 ... n ... N}, that coding is less than or equal to n is nonlocal client, coding is greater than the client for interior ground of n.
3. a kind of tobacco allocator based on three grades of couplings of transportation dispatching according to claim 1, is characterized in that, in step C, order volume is too large, takes many car dispensings, and the set that vehicle is not mated in setting is
, can find a plurality of such vehicles to make
, and
, meet second degree matches.
4. a kind of tobacco allocator based on three grades of couplings of transportation dispatching according to claim 1, is characterized in that, in step D, takes a plurality of order Common Distribution :s, makes vehicle loading coefficient be greater than α.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410020039.XA CN103729753A (en) | 2014-01-16 | 2014-01-16 | Three-stage matching tobacco distribution method based on transportation scheduling |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410020039.XA CN103729753A (en) | 2014-01-16 | 2014-01-16 | Three-stage matching tobacco distribution method based on transportation scheduling |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN103729753A true CN103729753A (en) | 2014-04-16 |
Family
ID=50453815
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410020039.XA Pending CN103729753A (en) | 2014-01-16 | 2014-01-16 | Three-stage matching tobacco distribution method based on transportation scheduling |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103729753A (en) |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104408606A (en) * | 2014-12-21 | 2015-03-11 | 江苏省烟草公司常州市公司 | Multi-level distribution system for cigarettes |
| CN109215333A (en) * | 2017-07-07 | 2019-01-15 | 杭州中策车空间汽车服务有限公司 | Dispatch configuration method and system |
| CN109784804A (en) * | 2018-12-12 | 2019-05-21 | 兖矿集团有限公司 | A kind of coal mine shipping management method, device and storage medium |
| CN109829674A (en) * | 2019-01-14 | 2019-05-31 | 浙江中烟工业有限责任公司 | Distributed volume tabacco barn storage scheduling system and method applied to cigarette batch optimum management |
| CN111695732A (en) * | 2020-06-09 | 2020-09-22 | 武汉问道信息技术有限公司 | Order batching and path planning method for tobacco finished product logistics |
| CN117236824A (en) * | 2023-11-15 | 2023-12-15 | 新立讯科技股份有限公司 | Logistics scheduling method for agricultural product online transaction platform |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2004075225A (en) * | 2002-08-12 | 2004-03-11 | Fujitsu Ltd | Method and system for assisting vehicle dispatching |
| JP2005178958A (en) * | 2003-12-17 | 2005-07-07 | Denso Corp | Transportation vehicle management system |
| JP2007233804A (en) * | 2006-03-02 | 2007-09-13 | Hitachi Eng Co Ltd | Vehicle allocation plan-equipped physical distribution management method and program therefor |
| CN101673382A (en) * | 2009-10-21 | 2010-03-17 | 北京交通大学 | Combined optimization method for agricultural chain-operation logistics delivering and loading-distribution |
-
2014
- 2014-01-16 CN CN201410020039.XA patent/CN103729753A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2004075225A (en) * | 2002-08-12 | 2004-03-11 | Fujitsu Ltd | Method and system for assisting vehicle dispatching |
| JP2005178958A (en) * | 2003-12-17 | 2005-07-07 | Denso Corp | Transportation vehicle management system |
| JP2007233804A (en) * | 2006-03-02 | 2007-09-13 | Hitachi Eng Co Ltd | Vehicle allocation plan-equipped physical distribution management method and program therefor |
| CN101673382A (en) * | 2009-10-21 | 2010-03-17 | 北京交通大学 | Combined optimization method for agricultural chain-operation logistics delivering and loading-distribution |
Non-Patent Citations (2)
| Title |
|---|
| 王婷等: ""整车汽车物流共同配送模式设计与仿真"", 《计算机***应用》, vol. 20, no. 8, 31 August 2011 (2011-08-31) * |
| 章志华等: ""烟草企业配载运输调度优化研究"", 《武汉理工大学学报(交通科学与工程版)》, vol. 37, no. 6, 31 December 2013 (2013-12-31), pages 1342 - 1346 * |
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104408606A (en) * | 2014-12-21 | 2015-03-11 | 江苏省烟草公司常州市公司 | Multi-level distribution system for cigarettes |
| CN109215333A (en) * | 2017-07-07 | 2019-01-15 | 杭州中策车空间汽车服务有限公司 | Dispatch configuration method and system |
| CN109784804A (en) * | 2018-12-12 | 2019-05-21 | 兖矿集团有限公司 | A kind of coal mine shipping management method, device and storage medium |
| CN109829674A (en) * | 2019-01-14 | 2019-05-31 | 浙江中烟工业有限责任公司 | Distributed volume tabacco barn storage scheduling system and method applied to cigarette batch optimum management |
| CN109829674B (en) * | 2019-01-14 | 2020-10-13 | 浙江中烟工业有限责任公司 | Distributed cigarette warehousing dispatching system and method applied to cigarette batch optimization management |
| CN111695732A (en) * | 2020-06-09 | 2020-09-22 | 武汉问道信息技术有限公司 | Order batching and path planning method for tobacco finished product logistics |
| CN111695732B (en) * | 2020-06-09 | 2022-07-26 | 武汉问道信息技术有限公司 | Order batching and path planning method for tobacco finished product logistics |
| CN117236824A (en) * | 2023-11-15 | 2023-12-15 | 新立讯科技股份有限公司 | Logistics scheduling method for agricultural product online transaction platform |
| CN117236824B (en) * | 2023-11-15 | 2024-02-20 | 新立讯科技股份有限公司 | Logistics scheduling method for agricultural product online transaction platform |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103729753A (en) | Three-stage matching tobacco distribution method based on transportation scheduling | |
| Cafaro et al. | Optimal scheduling of multiproduct pipeline systems using a non-discrete MILP formulation | |
| KR100913837B1 (en) | Method for Optimal Multi-Vehicle Dispatch and System for the Same | |
| CN109784547A (en) | A kind of harbour gantry crane cooperates with Optimization Scheduling with field bridge | |
| CN111768052B (en) | Automatic planning method for whole-vehicle factory approach logistics route based on algorithm model | |
| CN204237263U (en) | A kind of automatic transport of cigarette pallet and the storage of artificial de-stacking divide integrated system | |
| CN103914763A (en) | Three-warehouse coordinated management cigarette logistics system | |
| CA3040382C (en) | Method for sequencing loads in an automated distribution system | |
| CN111967828A (en) | Whole-process logistics-oriented road-rail combined transport product collaborative optimization method | |
| Rakhmangulov et al. | Mathematical model of optimal empty rail car distribution at railway transport nodes | |
| CN111222819B (en) | Method for determining a cargo vehicle, warehouse management device, system, device and medium | |
| CN103761622A (en) | Information system based on supply chain management | |
| KR20220006728A (en) | Device and method for providing optimal cargo delivery route based on artificial intelligence | |
| Küçükoğlu et al. | Simulated annealing approach for transportation problem of cross-docking network design | |
| CN205003534U (en) | Production warehousing and transportation system | |
| Zabihi et al. | Trucks scheduling in a multi-product cross docking system with multiple temporary storages and multiple dock doors | |
| KR101321644B1 (en) | Method for wagon repositioning in railroad transportation | |
| US11630445B2 (en) | Information processing method, information processing apparatus and non-transitory storage medium | |
| Sparks | 07 tesco’s supply chain management | |
| CN105512849A (en) | Novel logistics intelligent warehousing management system | |
| CN113962619A (en) | Freight shift determination method and device for waybill, electronic equipment and storage medium | |
| Cooper et al. | Evaluating cost-to-serve for a retail supply chain | |
| Zhao et al. | Hybrid particle swarm optimization for two-stage cross docking scheduling | |
| CN112070425A (en) | Dispatching method of stock system based on multilayer shuttle and double-speed chain | |
| Zhao et al. | The research on two phase pickup vehicle routing based on the K-means++ and genetic algorithms |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20140416 |