CN103246932A - Optimal path search method and device based on freight profit maximization for truck - Google Patents
Optimal path search method and device based on freight profit maximization for truck Download PDFInfo
- Publication number
- CN103246932A CN103246932A CN 201210030300 CN201210030300A CN103246932A CN 103246932 A CN103246932 A CN 103246932A CN 201210030300 CN201210030300 CN 201210030300 CN 201210030300 A CN201210030300 A CN 201210030300A CN 103246932 A CN103246932 A CN 103246932A
- Authority
- CN
- China
- Prior art keywords
- goods
- lorry
- freight
- route search
- profit maximization
- 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
Images
Abstract
The invention relates to a freight path optimization method and device, and provides an optimal path search method based on freight profit maximization for a truck. The optimal path search method comprises the following steps: step 1, establishing a truck model; step 2, establishing models of selectable goods; step 3, adopting 0-1 code to establish models of goods stations; and step 4, adopting LAE-IGL (learning algorithm from excellent-ibest,gbest and lbest) to optimize the path. The invention further provides an optimal path search device based on freight profit maximization for the truck. The device comprises a goods information sender (1) provided with an information input and output module (11), a network module (12) and a power supply (13), as well as a truck optimal path searcher (2) provided with a power adapter (21), an optimal path search module (22), a network module (23), a display module (24) and a manually setting module (25). The optimal path search method and device have the advantages that profit maximization is achieved for each freight, the accuracy for establishing a transportation production plan is improved, the transportation resource capacity is played sufficiently, and the logistics operation cost is reduced.
Description
Technical field
The present invention relates to a kind of shipping method for optimizing route and device, in particular, relate to a kind of method and apparatus of lorry based on the maximization search optimal path of freight charges profit of freighting.
Background technology
Statistics according to the Committee of Development and Reform, State Statistics Bureau, China Federation of Logistics ﹠ Purchasing's issue on February 28th, 2011 shows: national social logistics total expenses 7.1 trillion yuan in 2010 increase by 16.7% on a year-on-year basis.The ratio of social logistics total expenses in 2010 and GDP is 17.8%.Along with The development in society and economy, lot cargo need betransported.
Because China railways circuit course is shorter relatively, and mainly concentrates on developed regions.Therefore; a large amount of goods and materials are also mainly by Freight Transport; but after lorry is transported to a destination unloading with goods usually; may not find the suitable source of goods in the locality; if can not find the source of goods or the source of goods is improper; often the departure place left go back to by empty wagons, causes on the one hand a large amount of lorries idle unloaded, and large quantities of goods and materials are waited for anxious fortune on the other hand.
At present, providing the platform of the owner of cargo, car owner, warehouse, special line information, all is that the correlative stream information only is provided, and consults for the user, and the delivery path service of optimization further is not provided to the car owner.
Therefore, a kind of method and apparatus is badly in need of in the shipping field, can search for optimum transportation route fast, the coupling of optimal selection lorry and goods; Simultaneously, improve the precision that the transportation production schedule is formulated, give full play to the transport resource ability, reduce logistics operation cost expense.
Summary of the invention
The present invention only provides the correlative stream information to consult for the user in order to solve the shipping platform, the delivery path service problem of optimization but further is not provided to the car owner, provide a kind of lorry of freighting based on the method and apparatus of the maximization of freight charges profit search optimal path, technical scheme of the present invention is as follows:
A kind of lorry optimum route search method based on the freight charges profit maximization is characterized in that, comprises:
Step 1: set up the lorry model;
Step 2: foundation can be selected the goods model;
Step 3: adopt the 0-1 coding to set up the freight station point model;
Step 4: adopt LAE~IGL algorithm that the path is optimized.
A kind of lorry optimum route search method based on the freight charges profit maximization as above, wherein, the lorry model comprises cargo type, transportation goods tonnage, measurement of cargo, haulage time in this step 1.
A kind of lorry optimum route search method based on the freight charges profit maximization as above, wherein, optional goods model comprises type, weight, volume, transportation starting point, destination, departure time, time of arrival, the traffic expense of goods to be carried in this step 2.
A kind of lorry optimum route search method based on the freight charges profit maximization as above wherein, 0 represents goods and does not satisfy traffic condition in the freight station point model in this step 3, and 1 represents goods satisfies traffic condition.
The present invention also provides a kind of lorry optimum route search device based on the freight charges profit maximization, it is characterized in that, comprises:
Goods information transmitter (1) has information input/output module (11), mixed-media network modules mixed-media (12) and power supply (13);
Lorry optimum route search device (2) has power supply adaptor (21), optimum route search module (22), mixed-media network modules mixed-media (23), display module (24) and module (25) manually is set.
A kind of lorry optimum route search device based on the freight charges profit maximization as above, wherein, the external interface of power supply adaptor 21 is data line interface.
The invention has the beneficial effects as follows:
1. according to lorry self parameter optimization shipping path, make each shipping profit maximization.
2. improve the precision that the transportation production schedule is formulated, give full play to the transport resource ability, reduce logistics operation cost expense.
3. realize suitable being extensive use of easily.
Description of drawings
Describe the present invention in detail below in conjunction with the drawings and specific embodiments:
Fig. 1 is the structural drawing of a kind of lorry optimum route search device based on the freight charges profit maximization of the present invention.
Fig. 2 is the process flow diagram of a kind of lorry optimum route search method based on the freight charges profit maximization of the present invention.
Fig. 3 adopts LAE~IGL to optimize the mode figure of freight transportation point for a kind of lorry optimum route search method based on the freight charges profit maximization of the present invention.
Embodiment
For technological means, creation characteristic that the present invention is realized, reach purpose and effect is easy to understand, below in conjunction with concrete diagram, further set forth the present invention.
Fig. 1 is the structural drawing of a kind of lorry optimum route search device based on the freight charges profit maximization of the present invention.Apparatus of the present invention comprise:
One or more goods information transmitter 1 is arranged at each owner of cargo's warehouse.Goods information transmitter 1 has information input/output module 11, mixed-media network modules mixed-media 12 and power supply 13, needs the owner of cargo of transportation by the information of MIM message input module 11 input goods H, and sends to the shipping car owner by first mixed-media network modules mixed-media 12.Goods information comprises: the type of goods to be carried, weight, volume, transportation starting point, destination, departure time, time of arrival, trucking costs etc.Goods information can also oneself define content.Power supply 13 is information input/output module 11 and mixed-media network modules mixed-media 12 power supplies.
One or more lorry optimum route search device 2 is arranged on each car owner's the car.Lorry optimum route search device 2 has power supply adaptor 21, optimum route search module 22, mixed-media network modules mixed-media 23, display module 24 and module 25 manually is set, the external interface of power supply adaptor 21 is data line interface, by the cigar lighter socket on the data line connection car, be 2 power supplies of lorry optimum route search device by car.Optimum route search module 22 calculates the optimal path based on the freight charges profit maximization, and be presented on the display module 24, the car owner can confirm these paths by module 25 manually is set, and also can manually delete certain or certain several paths (selecting not transport the goods in certain warehouse).When the path is confirmed, this confirmation sends to the goods information transmitter 1 of (owner of cargo) on warehouse on all these paths, the goods node respectively by mixed-media network modules mixed-media 23, the information of this shipments will no longer continue to send to other car owners, in order to avoid repeat picking with a batch of goods multidigit car owner.
Fig. 2 is the process flow diagram of a kind of lorry optimum route search method based on the freight charges profit maximization of the present invention.This method operates in the optimum route search module 22 of lorry optimum route search device 2 of apparatus of the present invention.This method comprises the steps:
Step 1: set up the lorry model.
Set up lorry A, its movement capacity is [M, W, V, T],
Wherein, M is the transportation cargo type; But W is the load-carrying tonnage; V is the maximum load volume; T is that goods needs time of return.
Step 2: foundation can select to transport the goods model.
Described alternative transportation goods H, face matrix, wherein m as follows
i, w
i, v
i, d
Si, d
Fi, t
Si, t
Fi, c
i(i=1,2 ... n) represent the type, weight, volume, transportation starting point, destination, departure time, time of arrival, trucking costs etc. of the goods to be carried of n transportation base respectively.As follows in detail:
Step 3: adopt the 0-1 coding to set up the freight station point model.
The described mode of setting up the freight station point model is, as long as measurement of cargo considers no longer that smaller or equal to the volume restrictions of lorry the restriction of length can be loaded; It is d that the current place of lorry is set
Si, in addition, the goods of each transportation base needs disposable transportation intact, if can not transport, namely abandons the transportation of this website goods.
It is [x that described goods is counted website
1, x
2..., x
n], x wherein
i(i=1,2 ..., be 0 or 1 n), when being 1, represent to transport this goods, be to represent not transport in 0 o'clock, namely without this transportation base.
Described model is as follows:
In the described model, d
Fi=d
SuThe destination of expression goods j is the starting point of goods to be carried u, or at areal.t
Fi≤ t
SuExpression goods j arrives the time of destination, is less than the departure time of goods u.
Step 4: adopt LAE~IGL algorithm that the path is optimized.
Described LAE~IGL algorithm is, (Learning Algorithm from Excellent~Ibest, Gbest and Lbest are called for short LAE~IGL) to " to the IGL type of excellent study " learning algorithm.
Described LAE~IGL algorithm is, the target search space of a D dimension is set, and wherein forms a collective by m scholar, and wherein i scholar is expressed as a D dimensional vector X
i=(x
I1, x
I2..., x
ID), i=1,2 ..., m, namely the knowledge of i scholar in the search volume of D dimension is X
iI
Best=(i
I1, i
I2, i
ID) be the optimum knowledge Ibest that i scholar searches up to now; G
Best=(g
1, g
2..., g
D) be the optimum knowledge Gbest that whole scholar collective searches up to now; L
Lest=(l
K1, l
K2, l
KD) be the local optimum knowledge Lbest that k searches for scholar collective.
Described LAE~IGL algorithm is that scholars are to the historical optimum I of individuality
Best, the current G of global optimum
BestWith per generation subclass body optimal L
LestStudy, its recurrence equation is as follows:
In the described recurrence equation, k is study algebraically;
Be the X of scholar collective
i(k) to the outstanding I of collective of individuality
Best(k) study, and select scholar collective after excellent;
Be the X of scholar collective
i(k) to the outstanding scholar G of the current overall situation
Lest(k) study, and select scholar collective after excellent;
Be the X of scholar collective
i(k) to working as former generation scholar collective optimal L
Best(k) study, and select scholar collective after excellent; Described algorithm symbolization coding or natural number coding, i.e. scholar X
i(k) knowledge (x
I1(k), x
I2(k) ..., x
ID(k)) is-symbol or natural number, other is similar; Described
Be the learning method symbol, represent two scholars or scholar collective and learn; Described ∩ is that scholar collective selects excellent symbol, namely compares in twos, selects wherein optimum as the follow-on knowledge of scholar collective; Described stopping criterion for iteration according to particular problem generally elect as maximum iteration time or (with) the optimum knowledge that searches up to now of scholar collective satisfies the predetermined minimum Fujian value that adapts to.
Fig. 3 adopts LAE~IGL to optimize the mode figure of freight transportation point for a kind of lorry optimum route search method based on the freight charges profit maximization of the present invention.
One, two sections study (ML1, ML2) mode is: select two study points of counting n less than the goods to be carried website at random, 1. the goods website correspondence in learning the schoolmate a little copies to the prematurity scholar, 2. the goods website outside corresponding study is put with the schoolmate then copies and the prematurity scholar constitutes new scholar together; Multistage study is identical with one, two section study.
When the present invention specifically implements, at first set up the lorry model, set up optional goods model then, set up optional site paths model then; Set the shipping number of times afterwards, the starting station and terminus according to actual goods to be carried, select the study path less than the approach path at random, generate initial selected path and current historical optimal path at random, utilize LAE~IGL algorithm optimization to go out optimal path, afterwards, path website goods information and the lorry information of optimization are mated; If coupling, then this path is optimal path; If do not match, then from newly being optimized, until the optimization optimal path.
More than show and described ultimate principle of the present invention, principal character and advantage of the present invention.The technician of the industry should understand; the present invention is not restricted to the described embodiments; that describes in above-described embodiment and the instructions just illustrates principle of the present invention; the present invention also has various changes and modifications without departing from the spirit and scope of the present invention, and these changes and improvements all fall in the claimed scope of the invention.The claimed scope of the present invention is defined by appending claims and equivalent thereof.
Claims (6)
1. the lorry optimum route search method based on the freight charges profit maximization is characterized in that, comprises:
Step 1: set up the lorry model;
Step 2: foundation can be selected the goods model;
Step 3: adopt the 0-1 coding to set up the freight station point model;
Step 4: adopt LAE~IGL algorithm that the path is optimized.
2. a kind of lorry optimum route search method based on the freight charges profit maximization as claimed in claim 1 is characterized in that, the lorry model comprises cargo type, transportation goods tonnage, measurement of cargo, haulage time in this step 1.
3. a kind of lorry optimum route search method based on the freight charges profit maximization as claimed in claim 1, it is characterized in that optional goods model comprises type, weight, volume, transportation starting point, destination, departure time, time of arrival, the traffic expense of goods to be carried in this step 2.
4. a kind of lorry optimum route search method based on the freight charges profit maximization as claimed in claim 1 is characterized in that, 0 represents goods and does not satisfy traffic condition in the freight station point model in this step 3, and 1 represents goods satisfies traffic condition.
5. the lorry optimum route search device based on the freight charges profit maximization is characterized in that, comprises:
Goods information transmitter (1) has information input/output module (11), mixed-media network modules mixed-media (12) and power supply (13);
Lorry optimum route search device (2) has power supply adaptor (21), optimum route search module (22), mixed-media network modules mixed-media (23), display module (24) and module (25) manually is set.
6. a kind of lorry optimum route search device based on the freight charges profit maximization as claimed in claim 5 is characterized in that the external interface of power supply adaptor 21 is data line interface.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN 201210030300 CN103246932A (en) | 2012-02-10 | 2012-02-10 | Optimal path search method and device based on freight profit maximization for truck |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN 201210030300 CN103246932A (en) | 2012-02-10 | 2012-02-10 | Optimal path search method and device based on freight profit maximization for truck |
Publications (1)
Publication Number | Publication Date |
---|---|
CN103246932A true CN103246932A (en) | 2013-08-14 |
Family
ID=48926443
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN 201210030300 Pending CN103246932A (en) | 2012-02-10 | 2012-02-10 | Optimal path search method and device based on freight profit maximization for truck |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN103246932A (en) |
Cited By (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN105809401A (en) * | 2016-03-11 | 2016-07-27 | 惠龙易通国际物流股份有限公司 | Freight information processing method and system based on dynamic programming algorithm |
CN107679646A (en) * | 2017-09-04 | 2018-02-09 | 安徽共生物流科技有限公司 | A kind of optimal transit route intelligent optimization method of benefit |
CN110046844A (en) * | 2019-03-06 | 2019-07-23 | 天津五八到家科技有限公司 | Shipment request processing method, device, equipment and storage medium |
CN110472902A (en) * | 2019-06-25 | 2019-11-19 | 天津五八到家科技有限公司 | Shipping handles method, apparatus, equipment and storage medium |
-
2012
- 2012-02-10 CN CN 201210030300 patent/CN103246932A/en active Pending
Cited By (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN105809401A (en) * | 2016-03-11 | 2016-07-27 | 惠龙易通国际物流股份有限公司 | Freight information processing method and system based on dynamic programming algorithm |
CN107679646A (en) * | 2017-09-04 | 2018-02-09 | 安徽共生物流科技有限公司 | A kind of optimal transit route intelligent optimization method of benefit |
CN110046844A (en) * | 2019-03-06 | 2019-07-23 | 天津五八到家科技有限公司 | Shipment request processing method, device, equipment and storage medium |
CN110472902A (en) * | 2019-06-25 | 2019-11-19 | 天津五八到家科技有限公司 | Shipping handles method, apparatus, equipment and storage medium |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
Hu et al. | Using system dynamics to analyze the development of urban freight transportation system based on rail transit: A case study of Beijing | |
CN103903475B (en) | A kind of intelligent parking service system towards City-level and dispatching method of parking | |
CN103699982A (en) | Logistics distribution control method with soft time windows | |
CN203224900U (en) | Intelligent hand-held terminal used for express delivery staff member | |
CN102542395A (en) | Emergency material dispatching system and calculating method | |
CN103246932A (en) | Optimal path search method and device based on freight profit maximization for truck | |
CN105117879A (en) | Vehicle and cargo intelligent matching method, device and system | |
CN105096011A (en) | Improved chromosome coding based logistic transportation and scheduling method | |
CN104504459A (en) | Method and system for optimizing logistics transportation | |
CN111967828A (en) | Whole-process logistics-oriented road-rail combined transport product collaborative optimization method | |
Shen et al. | A new urban logistics transport system based on a public transit service | |
Skrúcaný et al. | Energy intensity and greenhouse gases production of the road and rail cargo transport using a software to simulate the energy consumption of a train | |
CN102073941A (en) | Method and system for optimizing distributed collaborative loading | |
CN101937540A (en) | Logistics transaction matchmaking system and realization method thereof | |
CN116596349A (en) | Night underground logistics planning method and system based on urban rail transit network | |
CN112598851A (en) | Lending system for automobile | |
Zhang et al. | Multidepot two-echelon vehicle routing problem for earthwork allocation optimization | |
Lu | The three-stage integrated optimization of automated container terminal scheduling based on improved genetic algorithm | |
CN113610453A (en) | Multi-transportation-mode combined container transportation path selection method | |
Deng et al. | Optimizing research of an improved simulated annealing algorithm to soft time windows vehicle routing problem with pick-up and delivery | |
CN108038649A (en) | Transportation management method and system | |
Brzeziński et al. | Carbon dioxide emission from diesel engine vehicles in intermodal transport | |
He et al. | Parcel delivery by collaborative use of truck fleets and bus-transit vehicles | |
CN112836858B (en) | Multi-type intermodal transportation emission reduction path selection method, system and device for containers | |
CN102314648A (en) | Optimization method of trucking path |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
C06 | Publication | ||
PB01 | Publication | ||
C05 | Deemed withdrawal (patent law before 1993) | ||
WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20130814 |