CN110428089A - Method, system and the equipment of a kind of bicycle field logistics transportation scheduling - Google Patents
Method, system and the equipment of a kind of bicycle field logistics transportation scheduling Download PDFInfo
- Publication number
- CN110428089A CN110428089A CN201910594652.5A CN201910594652A CN110428089A CN 110428089 A CN110428089 A CN 110428089A CN 201910594652 A CN201910594652 A CN 201910594652A CN 110428089 A CN110428089 A CN 110428089A
- Authority
- CN
- China
- Prior art keywords
- harmony
- logistics transportation
- bicycle field
- new
- field logistics
- 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
- G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N20/00—Machine learning
-
- 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
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02T—CLIMATE CHANGE MITIGATION TECHNOLOGIES RELATED TO TRANSPORTATION
- Y02T10/00—Road transport of goods or passengers
- Y02T10/10—Internal combustion engine [ICE] based vehicles
- Y02T10/40—Engine management systems
Abstract
This application discloses a kind of methods of bicycle field logistics transportation scheduling, comprising: obtains the bicycle field logistics transportation scheduling parameter information of input；Bicycle field logistics transportation scheduling model is established according to bicycle field logistics transportation scheduling parameter information, generates objective function；Bicycle field logistics transportation scheduling model is calculated using harmonic search algorithm, determines the optimal solution of objective function；The optimal transportation route of bicycle field logistics transportation scheduling is determined according to the optimal solution of objective function.The application introduces the mode of harmony search, enhances the ability of searching optimum to bicycle field logistics transportation scheduling model, so that determining that the optimal transportation route of logistics transportation scheduling has the characteristics that the speed of service is fast, Searching efficiency is high.The application additionally provides system, equipment and the computer readable storage medium of a kind of scheduling of bicycle field logistics transportation simultaneously, has above-mentioned beneficial effect.
Description
Technical field
This application involves transportation dispatching field, in particular to a kind of method of bicycle field logistics transportation scheduling, is set system
Standby and computer readable storage medium.
Background technique
Material flow industry is considered as the basic industry of the national economic development in the world, and development degree is to measure country
The one of the important signs that of up-to-dateness and overall national strength.The running of logistics not only determine the overall operation of business enterprise at
This, and directly influence the stability and harmony of entire business system running.So logistics transportation scheduling in bicycle field is then
One of core activity of logistics.
In the scheduling of bicycle field logistics transportation, a kind of most basic bicycle field logistics transportation scheduling model be can be described as: one
A home-delivery center has more trolleys to go for several client's point delivery, and each car is needed from home-delivery center by the vehicle
After all clients being responsible for, home-delivery center is returned to, how to select travelling route, so that total stroke is most short.Wherein,
The capacity of carriage of the vehicle need to be greater than or equal to total cargo demand of its all client's point being responsible for；All clients have and only
It can be by a vehicle by primary.
However, existing logistics transportation dispatching technique there is the speeds of service not high, convergence capabilities are not strong, Searching efficiency not
The problems such as high.
Summary of the invention
The purpose of the application is to provide the method, system, equipment and computer-readable of a kind of bicycle field logistics transportation scheduling
Storage medium, for improving the speed of service, convergence capabilities and the Searching efficiency of logistics transportation scheduling.
In order to solve the above technical problems, the application provides a kind of method of bicycle field logistics transportation scheduling, this method packet
It includes:
Obtain the bicycle field logistics transportation scheduling parameter information of input；
Bicycle field logistics transportation scheduling model is established according to the bicycle field logistics transportation scheduling parameter information, generates mesh
Scalar functions；
The bicycle field logistics transportation scheduling model is calculated using harmonic search algorithm, determines the target letter
Several optimal solutions；
The optimal transportation route of bicycle field logistics transportation scheduling is determined according to the optimal solution of the objective function.
Optionally, bicycle field logistics transportation scheduling model is established according to the bicycle field logistics transportation scheduling parameter information,
Generate objective function, comprising:
Objective function is generated according to the logistics transportation scheduling parameter information
Wherein, D for haulage vehicle by path total length, K be haulage vehicle sum, N be client's point number
Amount, dijIt is travelled by client's point i to the linear distance of client's point j, r for haulage vehicleijkFor non-zero i.e. 1 variable.
Optionally, the bicycle field logistics transportation scheduling model is calculated using harmonic search algorithm, described in determination
The optimal solution of objective function, comprising:
Initialize control parameter and harmony data base；
Calculate the corresponding function fitness value of each harmony in the harmony data base；
Worst harmony is determined according to each function fitness value；
New harmony is generated according to preset strategy, and calculates the fitness value of the new harmony；
If the fitness value of the new harmony is greater than the fitness value of the worst harmony, by the worst harmony
Value replaces with the value of the new harmony；
Judge whether the maximum number of iterations for reaching setting；
If it is not, then returning, execution is described to generate new harmony according to preset strategy, and calculates the fitness value of the new harmony
The step of；
If so, determining that the fitness value of optimal harmony and the optimal harmony in the harmony data base is described
The optimal solution of objective function.
Optionally, the initialization control parameter and harmony data base, comprising:
A chaos vector Y is generated at random0=[y01,y02,…,y0j,…,y0N]；Wherein, the chaos vector Y0In
J-th of characteristic value is y0j；
According to formula y(i+1)j=μ yij(1-yij) to the chaos vector Y0=[y01,y02,…,y0j,…,y0N] carry out
It calculates, obtains HMS chaos vector；Wherein, i-th of chaos vector is Yi=[yi1,yi2,…,yij,…,yiN]；
According to formula Xi=Yi* K obtains HMS strategy by the HMS chaos DUAL PROBLEMS OF VECTOR MAPPING into default value range
Vector；
The HMS strategic vector is put into the harmony data base；
Wherein, HMS is the sum of the chaos vector, and μ, K are constant.
Optionally, the corresponding function fitness value of each harmony in the harmony data base is calculated, comprising:
According to formulaCalculate p-th of harmony Xp=[xp1,xp2,…,xpq,…,xpN]
Function fitness value；
Wherein, fitnesspFor p-th of harmony XpFunction fitness value.
It is optionally, described that new harmony is generated according to preset strategy, comprising:
Generate the random number rand (0,1) between (0,1)；
Judge whether the random number rand (0,1) is less than data base probability；
If so, selecting one group of harmony at random from the harmony data base forms the new harmony Xnew=rand [X1,
X2,,XHMS], and the new harmony is adjusted using lion group's algorithm；
If it is not, then according to formulaGenerate each component of the new harmonyAnd form institute
State new harmony
Wherein, random number of the rand (0,1) between (0,1), XnewFor the new harmony.
It is optionally, described that the new harmony is adjusted using lion group's algorithm, comprising:
Determine the new harmony XnewFor the position of randomly selected lion during the lion group algorithm iteration；
According to formula Xl=Xg+rand()*(Xg-Xnew) update Sambalion XlPosition；
According to formula Xs=Xm+rand()*(Xm-Xg) update lioness XsPosition；
The target function value of each lion in the lion group is calculated, and chooses the highest lion of the target function value
Position be assigned to the new harmony Xnew；
Wherein, XgFor the initial position of the Sambalion, XmFor the initial position of the lioness.
Optionally, the optimal transportation route of bicycle field logistics transportation scheduling is determined according to the optimal solution of the objective function,
Include:
According to formula Cj={ (xbq,q)|j-1≤xbq< j } to optimal harmony Xb=[xb1,xb2,…,xbq,…,xbN]
Inside is grouped, and obtains K set；
Using maximum position method to the element in described K set according to xbqSize order carry out descending arrangement, arrangement
The second dimension value of each element is corresponding vehicle in the bicycle field logistics transportation tune in the K set after the completion
The optimal transportation route of degree；
Wherein, XbFor optimal harmony, CjGather for j-th, xbqFor the optimal harmony XbIn q-th of characteristic value.
The application also provides a kind of system of bicycle field logistics transportation scheduling, which includes:
Module is obtained, for obtaining the bicycle field logistics transportation scheduling parameter information of input；
Module is established, for establishing bicycle field logistics transportation tune according to the bicycle field logistics transportation scheduling parameter information
Model is spent, objective function is generated；
Computing module, for being calculated using harmonic search algorithm the bicycle field logistics transportation scheduling model, really
The optimal solution of the fixed objective function；
Determining module, for determining the optimal fortune of bicycle field logistics transportation scheduling according to the optimal solution of the objective function
Defeated path.
The application also provides a kind of bicycle field logistics transportation controlling equipment, which includes:
Memory, for storing computer program；
Processor realizes the bicycle field logistics transportation tune as described in any of the above-described when for executing the computer program
The step of method of degree.
The application also provides a kind of computer readable storage medium, and meter is stored on the computer readable storage medium
Calculation machine program realizes that bicycle field logistics transportation is dispatched as described in any of the above-described when the computer program is executed by processor
Method the step of.
The method of bicycle field provided herein logistics transportation scheduling, comprising: obtain the bicycle field logistics transportation tune of input
Spend parameter information；Bicycle field logistics transportation scheduling model is established according to bicycle field logistics transportation scheduling parameter information, generates target
Function；Bicycle field logistics transportation scheduling model is calculated using harmonic search algorithm, determines the optimal solution of objective function；
The optimal transportation route of bicycle field logistics transportation scheduling is determined according to the optimal solution of objective function.
Technical solution provided herein, for logistics transportation scheduling problem, by according to bicycle field logistics transportation tune
Degree parameter information establishes bicycle field logistics transportation scheduling model, generates objective function；Then using harmonic search algorithm to bicycle
Field logistics transportation scheduling model is calculated, and the mode of harmony search is introduced, and is enhanced and is dispatched mould to bicycle field logistics transportation
The ability of searching optimum of type, so that determining that the optimal transportation route of logistics transportation scheduling is fast with the speed of service, Searching efficiency is high
The features such as.The application additionally provides system, equipment and the computer-readable storage medium of a kind of scheduling of bicycle field logistics transportation simultaneously
Matter has above-mentioned beneficial effect, and details are not described herein.
Detailed description of the invention
In order to illustrate the technical solutions in the embodiments of the present application or in the prior art more clearly, below will to embodiment or
Attached drawing needed to be used in the description of the prior art is briefly described, it should be apparent that, the accompanying drawings in the following description is only
Embodiments herein for those of ordinary skill in the art without creative efforts, can be with
Other attached drawings are obtained according to the attached drawing of offer.
Fig. 1 is a kind of flow chart of the method for the scheduling of bicycle field logistics transportation provided by the embodiment of the present application；
Fig. 2 is a kind of practical manifestation mode of S103 in a kind of method of the scheduling of bicycle field logistics transportation provided by Fig. 1
Flow chart；
Fig. 3 is a kind of structure chart of the system of the scheduling of bicycle field logistics transportation provided by the embodiment of the present application；
Fig. 4 is the structure chart of the system of the scheduling of another kind bicycle field logistics transportation provided by the embodiment of the present application；
Fig. 5 is a kind of structure chart of bicycle field logistics transportation controlling equipment provided by the embodiment of the present application.
Specific embodiment
The core of the application is to provide the method, system, equipment and computer-readable of a kind of bicycle field logistics transportation scheduling
Storage medium, for improving the speed of service, convergence capabilities and the Searching efficiency of logistics transportation scheduling.
To keep the purposes, technical schemes and advantages of the embodiment of the present application clearer, below in conjunction with the embodiment of the present application
In attached drawing, the technical scheme in the embodiment of the application is clearly and completely described, it is clear that described embodiment is
Some embodiments of the present application, instead of all the embodiments.Based on the embodiment in the application, ordinary skill people
Member's every other embodiment obtained without making creative work, shall fall in the protection scope of this application.
Referring to FIG. 1, Fig. 1 is a kind of stream of the method for the scheduling of bicycle field logistics transportation provided by the embodiment of the present application
Cheng Tu.
It specifically comprises the following steps:
S101: the bicycle field logistics transportation scheduling parameter information of input is obtained；
Material flow industry is considered as the basic industry of the national economic development in the world, and development degree is to measure country
The one of the important signs that of up-to-dateness and overall national strength.The running of logistics not only determine the overall operation of business enterprise at
This, and directly influence the stability and harmony of entire business system running.So logistics transportation scheduling in bicycle field is then
One of core activity of logistics, however existing logistics transportation dispatching technique there is the speeds of service not high, convergence capabilities it is not strong,
The problems such as Searching efficiency is not high, therefore this application provides a kind of methods of bicycle field logistics transportation scheduling, for solving above-mentioned ask
Topic；
Optionally, logistics transportation scheduling parameter information in bicycle field mentioned herein can specifically include haulage vehicle and be passed through
Cross the total length in path, the sum of haulage vehicle, the quantity of client's point, haulage vehicle travels by client's point i to client's point j's
Linear distance etc..
S102: bicycle field logistics transportation scheduling model is established according to bicycle field logistics transportation scheduling parameter information, generates mesh
Scalar functions；
The meaning mentioned herein for establishing bicycle field logistics transportation scheduling model is, determines logistics transportation by model
The optimal transportation route of scheduling is to promote the speed of service that logistics transportation is dispatched；
Optionally, bicycle field logistics transportation scheduling model is established according to bicycle field logistics transportation scheduling parameter information, generated
Objective function is specifically as follows:
Objective function is generated according to logistics transportation scheduling parameter information
Wherein, D for haulage vehicle by path total length, K be haulage vehicle sum, N be client's point number
Amount, dijIt is travelled by client's point i to the linear distance of client's point j, r for haulage vehicleijkFor non-zero i.e. 1 variable.
S103: bicycle field logistics transportation scheduling model is calculated using harmonic search algorithm, determines objective function
Optimal solution；
Harmonic search algorithm mentioned herein is a kind of emerging intelligent optimization algorithm, by adjusting in data base repeatedly
Solution variable, restrain functional value constantly with the increase of the number of iterations, to solve the purpose of optimal solution to complete to optimize
It is that the optimal solution of objective function determines the optimal transportation route of bicycle field logistics transportation scheduling.
S104: the optimal transportation route of bicycle field logistics transportation scheduling is determined according to the optimal solution of objective function.
After the optimal solution of objective function has been determined, logistics transportation scheduling in bicycle field is determined most according to the optimal solution
Excellent transportation route；
Optionally, the optimal solution mentioned herein according to objective function determines the optimal fortune of bicycle field logistics transportation scheduling
Defeated path, is specifically as follows:
According to formula Cj={ (xbq,q)|j-1≤xbq< j } to optimal harmony Xb=[xb1,xb2,…,xbq,…,xbN]
Inside is grouped, and obtains K set；
Using maximum position method to the element in K set according to xbqSize order carry out descending arrangement, arrangement complete
The second dimension value of each element is the optimal transportation route for corresponding to vehicle and dispatching in bicycle field logistics transportation in K set afterwards；
Wherein, XbFor optimal harmony, CjGather for j-th, xbqFor optimal harmony XbIn q-th of characteristic value.
Based on the above-mentioned technical proposal, the method for a kind of bicycle field logistics transportation provided herein scheduling, passes through basis
Bicycle field logistics transportation scheduling parameter information establishes bicycle field logistics transportation scheduling model, generates objective function；Then using and
Sound searching algorithm calculates bicycle field logistics transportation scheduling model, introduces the mode of harmony search, enhances to bicycle
The ability of searching optimum of field logistics transportation scheduling model, so that determining that the optimal transportation route of logistics transportation scheduling has operation
The features such as speed is fast, Searching efficiency is high.
It is directed to the step S103 of an embodiment, wherein described use harmonic search algorithm to the logistics of bicycle field
Transportation dispatching model is calculated, and determines the optimal solution of objective function, specifically may be step as shown in Figure 2, below
It is illustrated in conjunction with Fig. 2.
Referring to FIG. 2, Fig. 2 is a kind of reality of S103 in a kind of method of the scheduling of bicycle field logistics transportation provided by Fig. 1
The flow chart of border manifestation mode.
Itself specifically includes the following steps:
S201: initialization control parameter and harmony data base；
Optionally, mentioned herein, control parameter and harmony data base are initialized, is specifically as follows:
A chaos vector Y is generated at random0=[y01,y02,…,y0j,…,y0N]；Wherein, chaos vector Y0In jth
A characteristic value is y0j；
According to formula y(i+1)j=μ yij(1-yij) to chaos vector Y0=[y01,y02,…,y0j,…,y0N] calculated,
Obtain HMS chaos vector；Wherein, i-th of chaos vector is Yi=[yi1,yi2,…,yij,…,yiN]；
According to formula Xi=Yi* K by HMS chaos DUAL PROBLEMS OF VECTOR MAPPING into default value range, obtain HMS strategy to
Amount；
HMS strategic vector is put into harmony data base；
Wherein, HMS is the sum of chaos vector, and μ, K are constant.
S202: the corresponding function fitness value of each harmony in harmony data base is calculated；
Optionally, the corresponding function fitness value of each harmony in calculating harmony data base mentioned herein, specifically may be used
With are as follows:
According to formulaCalculate p-th of harmony Xp=[xp1,xp2,…,xpq,…,xpN]
Function fitness value；
Wherein, fitnesspFor p-th of harmony XpFunction fitness value.
S203: worst harmony is determined according to each function fitness value；
S204: new harmony is generated according to preset strategy, and calculates the fitness value of new harmony；
Optionally, mentioned herein that new harmony is generated according to preset strategy, it is specifically as follows:
Generate the random number rand (0,1) between (0,1)；
Judge whether random number rand (0,1) is less than data base probability；
If so, selecting one group of harmony at random from harmony data base forms new harmony
Xnew=rand [X1,X2,…,XHMS], and new harmony is adjusted using lion group's algorithm；
If it is not, then according to formulaGenerate each component of new harmonyAnd form new harmony
Wherein, random number of the rand (0,1) between (0,1), XnewFor new harmony；
It is further, mentioned herein that new harmony is adjusted using lion group's algorithm, comprising:
Determine new harmony XnewFor the position of randomly selected lion during lion group's algorithm iteration；
According to formula Xl=Xg+rand()*(Xg-Xnew) update Sambalion XlPosition；
According to formula Xs=Xm+rand()*(Xm-Xg) update lioness XsPosition；
The target function value of each lion in lion group is calculated, and the position for choosing the highest lion of target function value is assigned to
New harmony Xnew；
Wherein, XgFor the initial position of Sambalion, XmFor the initial position of lioness.
S205: if the fitness value of new harmony is greater than the fitness value of worst harmony, the value of worst harmony is replaced with
The value of new harmony；
S206: judge whether the maximum number of iterations for reaching setting；
If it is not, then return step S204；If so, entering step S207.
S207: the fitness value for determining the optimal harmony and optimal harmony in harmony data base is the optimal of objective function
Solution.
Referring to FIG. 3, Fig. 3 is a kind of knot of the system of the scheduling of bicycle field logistics transportation provided by the embodiment of the present application
Composition.
The system may include:
Module 100 is obtained, for obtaining the bicycle field logistics transportation scheduling parameter information of input；
Module 200 is established, for establishing the scheduling of bicycle field logistics transportation according to bicycle field logistics transportation scheduling parameter information
Model generates objective function；
Computing module 300, for being calculated using harmonic search algorithm bicycle field logistics transportation scheduling model, really
Set the goal the optimal solution of function；
Determining module 400 determines the optimal transport of bicycle field logistics transportation scheduling for the optimal solution according to objective function
Path.
Referring to FIG. 4, Fig. 4 is the system of the scheduling of another kind bicycle field logistics transportation provided by the embodiment of the present application
Structure chart.
This establishes module 200
Setting up submodule, for generating objective function according to logistics transportation scheduling parameter information
Wherein, D for haulage vehicle by path total length, K be haulage vehicle sum, N be client's point number
Amount, dijIt is travelled by client's point i to the linear distance of client's point j, r for haulage vehicleijkFor non-zero i.e. 1 variable.
The computing module 300 may include:
Initialization submodule, for initializing control parameter and harmony data base；
Computational submodule, for calculating the corresponding function fitness value of each harmony in harmony data base；
First determines submodule, for determining worst harmony according to each function fitness value；
Submodule is generated, for generating new harmony according to preset strategy, and calculates the fitness value of new harmony；
Submodule is replaced, if the fitness value for new harmony is greater than the fitness value of worst harmony, by worst harmony
Value replace with the value of new harmony；
Judging submodule, the maximum number of iterations for judging whether to reach setting；
Submodule is returned, is executed for when the not up to maximum number of iterations of setting, returning to generation submodule according to pre-
If the new harmony of strategy generating, and the step of calculating the fitness value of new harmony；
Second determines submodule, optimal in harmony data base for determining when reaching the maximum number of iterations of setting
The fitness value of harmony and optimal harmony is the optimal solution of objective function.
Further, which may include:
First generation unit, for generating a chaos vector Y at random0=[y01,y02,…,y0j,…,y0N]；Wherein,
Chaos vector Y0In j-th of characteristic value be y0j；
First computing unit, for according to formula y(i+1)j=μ yij(1-yij) to chaos vector Y0=[y01,y02,…,
y0j,…,y0N] calculated, obtain HMS chaos vector；Wherein, i-th of chaos vector is Yi=[yi1,yi2,…,
yij,…,yiN]；
Map unit, for according to formula Xi=Yi* K is obtained by HMS chaos DUAL PROBLEMS OF VECTOR MAPPING into default value range
HMS strategic vector；
Placement unit, for HMS strategic vector to be put into harmony data base；
Wherein, HMS is the sum of chaos vector, and μ, K are constant.
The computational submodule may include:
Second computing unit, for according to formulaCalculate p-th of harmony
Xp=[xp1,xp2,…,xpq,…,xpN] function fitness value；
Wherein, fitnesspFor p-th of harmony XpFunction fitness value.
The generation submodule may include:
Second generation unit, for generating the random number rand (0,1) between (0,1)；
Judging unit, for judging whether random number rand (0,1) is less than data base probability；
Third generation unit, when being less than data base probability for working as random number rand (0,1), from harmony data base
One group of harmony is selected at random forms new harmony
Xnew=rand [X1,X2,…,XHMS], and new harmony is adjusted using lion group's algorithm；
4th generation unit, when being not less than data base probability for working as random number rand (0,1), according to formulaGenerate each component of new harmonyAnd group
At new harmony
Wherein, random number of the rand (0,1) between (0,1), XnewFor new harmony.
The determining module 400 may include:
It is grouped submodule, for according to formula Cj={ (xbq,q)|j-1≤xbq< j } to optimal harmony Xb=[xb1,
xb2,…,xbq,…,xbN] inside be grouped, obtain K set；
Sorting sub-module, for application maximum position method to the element in K set according to xbqSize order dropped
Sequence arrangement, the second dimension value of each element is that corresponding vehicle is dispatched in bicycle field logistics transportation in K set after the completion of arrangement
Optimal transportation route；
Wherein, XbFor optimal harmony, CjGather for j-th, xbqFor optimal harmony XbIn q-th of characteristic value.
Since the embodiment of components of system as directed is corresponded to each other with the embodiment of method part, the embodiment of components of system as directed
The description of the embodiment of method part is referred to, wouldn't be repeated here.
Referring to FIG. 5, Fig. 5 is a kind of structure of bicycle field logistics transportation controlling equipment provided by the embodiment of the present application
Figure.
The bicycle field logistics transportation controlling equipment 600 can generate bigger difference because configuration or performance are different, can be with
Including one or more processors (central processing units, CPU) 622 (for example, one or one with
Upper processor) and memory 632, the 630 (example of storage medium of one or more storage application programs 642 or data 644
Such as one or more mass memory units).Wherein, memory 632 and storage medium 630 can be of short duration storage or hold
Storage long.The program for being stored in storage medium 630 may include one or more modules (diagram does not mark), Mei Gemo
Block may include to the series of instructions operation in device.Further, central processing unit 622 can be set to and store
Medium 630 communicates, and the series of instructions operation in storage medium 630 is executed on bicycle field logistics transportation controlling equipment 600.
Bicycle field logistics transportation controlling equipment 600 can also include one or more power supplys 626, one or one
The above wired or wireless network interface 650, one or more input/output interfaces 658, and/or, one or more
Operating system 641, such as Windows ServerTM, Mac OS XTM, UnixTM, LinuxTM, FreeBSDTM etc..
Step in the method for the scheduling of bicycle field logistics transportation described in above-mentioned Fig. 1 to Fig. 2 is by bicycle field logistics transportation
Controlling equipment is based on the structure shown in fig. 5 and realizes.
It is apparent to those skilled in the art that for convenience and simplicity of description, foregoing description is
System, the specific work process of device and module can refer to corresponding processes in the foregoing method embodiment, and details are not described herein.
In several embodiments provided herein, it should be understood that disclosed device, device and method, it can be with
It realizes by another way.For example, the apparatus embodiments described above are merely exemplary, for example, module is drawn
Point, only a kind of logical function partition, there may be another division manner in actual implementation, such as multiple module or components
It can be combined or can be integrated into another system, or some features can be ignored or not executed.Another point, it is shown or
The mutual coupling, direct-coupling or communication connection discussed can be through some interfaces, device or module it is indirect
Coupling or communication connection can be electrical property, mechanical or other forms.
Module may or may not be physically separated as illustrated by the separation member, show as module
Component may or may not be physical module, it can it is in one place, or may be distributed over multiple nets
In network module.Some or all of the modules therein can be selected to realize the mesh of this embodiment scheme according to the actual needs
's.
It, can also be in addition, can integrate in a processing module in each functional module in each embodiment of the application
It is that modules physically exist alone, can also be integrated in two or more modules in a module.Above-mentioned integrated mould
Block both can take the form of hardware realization, can also be realized in the form of software function module.
If integrated module is realized and when sold or used as an independent product in the form of software function module,
It can store in a computer readable storage medium.Based on this understanding, the technical solution of the application substantially or
Person says that all or part of the part that contributes to existing technology or the technical solution can body in the form of software products
Reveal and, which is stored in a storage medium, including some instructions are with so that a computer is set
Standby (can be personal computer, funcall device or the network equipment etc.) executes the complete of each embodiment method of the application
Portion or part steps.And storage medium above-mentioned include: USB flash disk, mobile hard disk, read-only memory (Read-Only Memory,
ROM), random access memory (Random Access Memory, RAM), magnetic or disk etc. are various can store program
The medium of code.
It above can to method, system, equipment and the computer of logistics transportation scheduling in a kind of bicycle field provided herein
Storage medium is read to be described in detail.Specific case used herein carries out the principle and embodiment of the application
It illustrates, the description of the example is only used to help understand the method for the present application and its core ideas.It should be pointed out that for
For those skilled in the art, under the premise of not departing from the application principle, if can also be carried out to the application
Dry improvement and modification, these improvement and modification are also fallen into the protection scope of the claim of this application.
It should also be noted that, in the present specification, relational terms such as first and second and the like be used merely to by
One entity or operation are distinguished with another entity or operation, without necessarily requiring or implying these entities or behaviour
There are any actual relationship or orders between work.Moreover, the terms "include", "comprise" or its any other change
Body is intended to non-exclusive inclusion, so that the process, method, article or equipment including a series of elements is not only
It including those elements, but also including other elements that are not explicitly listed, or further include for this process, method, object
Product or the intrinsic element of equipment.In the absence of more restrictions, being wanted by what sentence "including a ..." limited
Element, it is not excluded that there is also other identical elements in the process, method, article or equipment for including element.
Claims (11)
1. a kind of method of bicycle field logistics transportation scheduling characterized by comprising
Obtain the bicycle field logistics transportation scheduling parameter information of input；
Bicycle field logistics transportation scheduling model is established according to the bicycle field logistics transportation scheduling parameter information, generates target letter
Number；
The bicycle field logistics transportation scheduling model is calculated using harmonic search algorithm, determines the objective function most
Excellent solution；
The optimal transportation route of bicycle field logistics transportation scheduling is determined according to the optimal solution of the objective function.
2. the method according to claim 1, wherein being built according to the bicycle field logistics transportation scheduling parameter information
Vertical bicycle field logistics transportation scheduling model, generates objective function, comprising:
Objective function is generated according to the logistics transportation scheduling parameter information
Wherein, D for haulage vehicle by path total length, K be haulage vehicle sum, N be client's point quantity, dijFor
Haulage vehicle is travelled by client's point i to the linear distance of client's point j, rijkFor non-zero i.e. 1 variable.
3. the method according to claim 1, wherein using harmonic search algorithm to bicycle field logistics transportation
Scheduling model is calculated, and determines the optimal solution of the objective function, comprising:
Initialize control parameter and harmony data base；
Calculate the corresponding function fitness value of each harmony in the harmony data base；
Worst harmony is determined according to each function fitness value；
New harmony is generated according to preset strategy, and calculates the fitness value of the new harmony；
If the fitness value of the new harmony is greater than the fitness value of the worst harmony, the value of the worst harmony is replaced
For the value of the new harmony；
Judge whether the maximum number of iterations for reaching setting；
If it is not, then returning, execution is described to generate new harmony according to preset strategy, and calculates the step of the fitness value of the new harmony
Suddenly；
If so, determining that the fitness value of optimal harmony and the optimal harmony in the harmony data base is the target letter
Several optimal solutions.
4. according to the method described in claim 3, it is characterized in that, the initialization control parameter and harmony data base, comprising:
A chaos vector Y is generated at random0=[y01,y02,…,y0j,…,y0N]；Wherein, the chaos vector Y0In j-th
Characteristic value is y0j；
According to formula y(i+1)j=μ yij(1-yij) to the chaos vector Y0=[y01,y02,…,y0j,…,y0N] calculated, it obtains
To HMS chaos vector；Wherein, i-th of chaos vector is Yi=[yi1,yi2,…,yij,…,yiN]；
According to formula Xi=Yi* K obtains HMS strategic vector by the HMS chaos DUAL PROBLEMS OF VECTOR MAPPING into default value range；
The HMS strategic vector is put into the harmony data base；
Wherein, HMS is the sum of the chaos vector, and μ, K are constant.
5. according to the method described in claim 4, it is characterized in that, calculating the corresponding letter of each harmony in the harmony data base
Number fitness value, comprising:
According to formulaCalculate p-th of harmony Xp=[xp1,xp2,…,xpq,…,xpN] function it is suitable
Answer angle value；
Wherein, fitnesspFor p-th of harmony XpFunction fitness value.
6. according to the method described in claim 3, it is characterized in that, described generate new harmony according to preset strategy, comprising:
Generate the random number rand (0,1) between (0,1)；
Judge whether the random number rand (0,1) is less than data base probability；
If so, selecting one group of harmony at random from the harmony data base forms the new harmony Xnew=rand [X1,X2,…,
XHMS], and the new harmony is adjusted using lion group's algorithm；
If it is not, then according to formulaGenerate each component of the new harmonyAnd it forms described new
Harmony
Wherein, random number of the rand (0,1) between (0,1), XnewFor the new harmony.
7. according to the method described in claim 6, it is characterized in that, described adjust the new harmony using lion group's algorithm
It is whole, comprising:
Determine the new harmony XnewFor the position of randomly selected lion during the lion group algorithm iteration；
According to formula Xl=Xg+rand()*(Xg-Xnew) update Sambalion XlPosition；
According to formula Xs=Xm+rand()*(Xm-Xg) update lioness XsPosition；
The target function value of each lion in the lion group is calculated, and chooses the position of the highest lion of the target function value
It is assigned to the new harmony Xnew；
Wherein, XgFor the initial position of the Sambalion, XmFor the initial position of the lioness.
8. according to the method described in claim 3, it is characterized in that, determining bicycle field object according to the optimal solution of the objective function
Flow the optimal transportation route of transportation dispatching, comprising:
According to formula Cj={ (xbq,q)|j-1≤xbq< j } to optimal harmony Xb=[xb1,xb2,…,xbq,…,xbN] inside into
Row grouping obtains K set；
Using maximum position method to the element in described K set according to xbqSize order carry out descending arrangement, arrangement complete
The second dimension value of each element is that corresponding vehicle is dispatched most in bicycle field logistics transportation in the K set afterwards
Excellent transportation route；
Wherein, XbFor optimal harmony, CjGather for j-th, xbqFor the optimal harmony XbIn q-th of characteristic value.
9. a kind of system of bicycle field logistics transportation scheduling characterized by comprising
Module is obtained, for obtaining the bicycle field logistics transportation scheduling parameter information of input；
Module is established, for establishing bicycle field logistics transportation scheduling mould according to the bicycle field logistics transportation scheduling parameter information
Type generates objective function；
Computing module determines institute for calculating using harmonic search algorithm the bicycle field logistics transportation scheduling model
State the optimal solution of objective function；
Determining module, for determining the optimal transport road of bicycle field logistics transportation scheduling according to the optimal solution of the objective function
Diameter.
10. a kind of bicycle field logistics transportation controlling equipment characterized by comprising
Memory, for storing computer program；
Processor realizes the bicycle field logistics transportation as described in any one of claim 1 to 8 when for executing the computer program
The step of method of scheduling.
11. a kind of computer readable storage medium, which is characterized in that be stored with computer on the computer readable storage medium
Program realizes the bicycle field logistics transportation tune as described in any one of claim 1 to 8 when the computer program is executed by processor
The step of method of degree.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910594652.5A CN110428089B (en) | 2019-07-03 | 2019-07-03 | Method, system and equipment for logistics transportation scheduling of bicycle yard |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910594652.5A CN110428089B (en) | 2019-07-03 | 2019-07-03 | Method, system and equipment for logistics transportation scheduling of bicycle yard |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110428089A true CN110428089A (en) | 2019-11-08 |
| CN110428089B CN110428089B (en) | 2022-09-13 |
Family
ID=68410158
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910594652.5A Active CN110428089B (en) | 2019-07-03 | 2019-07-03 | Method, system and equipment for logistics transportation scheduling of bicycle yard |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110428089B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111967672A (en) * | 2020-08-18 | 2020-11-20 | 合肥工业大学 | Lion group evolution algorithm-based path planning method for space crowdsourcing platform |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104036333A (en) * | 2014-06-26 | 2014-09-10 | 广东工业大学 | Algorithm for solving single-depot time-varying associated logistics transportation vehicle routing problem |
| CN104598994A (en) * | 2015-01-23 | 2015-05-06 | 广东易富网络科技有限公司 | Related logistics transportation optimized dispatching method with time-varying time window |
| US20160125097A1 (en) * | 2014-11-05 | 2016-05-05 | Nec Laboratories America, Inc. | Optimizing power flows using harmony search with machine learning |
| CN107230023A (en) * | 2017-06-12 | 2017-10-03 | 合肥工业大学 | Based on the production and transportation coordinated dispatching method and system for improving harmony search |
-
2019
- 2019-07-03 CN CN201910594652.5A patent/CN110428089B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104036333A (en) * | 2014-06-26 | 2014-09-10 | 广东工业大学 | Algorithm for solving single-depot time-varying associated logistics transportation vehicle routing problem |
| US20160125097A1 (en) * | 2014-11-05 | 2016-05-05 | Nec Laboratories America, Inc. | Optimizing power flows using harmony search with machine learning |
| CN104598994A (en) * | 2015-01-23 | 2015-05-06 | 广东易富网络科技有限公司 | Related logistics transportation optimized dispatching method with time-varying time window |
| CN107230023A (en) * | 2017-06-12 | 2017-10-03 | 合肥工业大学 | Based on the production and transportation coordinated dispatching method and system for improving harmony search |
Non-Patent Citations (1)
| Title |
|---|
| 陈世峰: "动态车辆路径问题建模与优化算法研究", 《中国博士学位论文全文数据库 信息科技辑》 * |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111967672A (en) * | 2020-08-18 | 2020-11-20 | 合肥工业大学 | Lion group evolution algorithm-based path planning method for space crowdsourcing platform |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110428089B (en) | 2022-09-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN112286677B (en) | Resource-constrained edge cloud-oriented Internet of things application optimization deployment method | |
| CN108776612A (en) | A kind of cloud computing method for allocating tasks, device, equipment and storage medium | |
| Dalgkitsis et al. | Data driven service orchestration for vehicular networks | |
| Zhao et al. | QoS-aware web service selection with negative selection algorithm | |
| CN104516785B (en) | A kind of cloud computing resources dispatch system and method | |
| CN108694077A (en) | Based on the distributed system method for scheduling task for improving binary system bat algorithm | |
| CN109815541B (en) | Method and device for dividing rail transit vehicle product parts and modules and electronic equipment | |
| CN112784362A (en) | Hybrid optimization method and system for unmanned aerial vehicle-assisted edge calculation | |
| CN104567905A (en) | Generation method and device for planned route of vehicle | |
| CN115032997B (en) | Fourth logistics transportation path planning method based on ant colony algorithm | |
| Li et al. | Resource scheduling based on improved spectral clustering algorithm in edge computing | |
| CN108769907A (en) | The indoor orientation method of fusion WiFi and iBeacon based on deep learning | |
| CN109086791A (en) | A kind of training method, device and the computer equipment of two classifiers | |
| Chou et al. | A clonal selection algorithm for energy-efficient mobile agent itinerary planning in wireless sensor networks | |
| CN109409746A (en) | A kind of production scheduling method and device | |
| CN107329826A (en) | A kind of heuristic fusion resource dynamic dispatching algorithm based on Cloudsim platforms | |
| CN110428089A (en) | Method, system and the equipment of a kind of bicycle field logistics transportation scheduling | |
| CN110503234A (en) | A kind of method, system and the equipment of logistics transportation scheduling | |
| Yi et al. | A DRL-driven intelligent joint optimization strategy for computation offloading and resource allocation in ubiquitous edge IoT systems | |
| Savitha et al. | Energy efficient clustering and routing optimization model for maximizing lifetime of wireless sensor network | |
| CN110972060B (en) | Deployment method of edge control center accessed to terminal on power communication network | |
| CN107545323A (en) | Logistics Distribution Method, device, equipment and the storage medium of commodity | |
| Chantaksinopas et al. | Network selection delay comparison of network selection techniques for safety applications on VANET | |
| Liu et al. | Emergency scheduling optimization simulation of cloud computing platform network public resources | |
| CN109814067A (en) | A kind of tri-dimensional node positioning method and device |
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 |