CN110428089B - Method, system and equipment for logistics transportation scheduling of bicycle yard - Google Patents
Method, system and equipment for logistics transportation scheduling of bicycle yard Download PDFInfo
- Publication number
- CN110428089B CN110428089B CN201910594652.5A CN201910594652A CN110428089B CN 110428089 B CN110428089 B CN 110428089B CN 201910594652 A CN201910594652 A CN 201910594652A CN 110428089 B CN110428089 B CN 110428089B
- Authority
- CN
- China
- Prior art keywords
- harmony
- new
- logistics transportation
- yard
- value
- 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.)
- Active
Links
Images
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
Landscapes
- Engineering & Computer Science (AREA)
- Business, Economics & Management (AREA)
- Theoretical Computer Science (AREA)
- Economics (AREA)
- Human Resources & Organizations (AREA)
- Strategic Management (AREA)
- General Physics & Mathematics (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- Software Systems (AREA)
- Tourism & Hospitality (AREA)
- Operations Research (AREA)
- Marketing (AREA)
- Entrepreneurship & Innovation (AREA)
- Development Economics (AREA)
- Quality & Reliability (AREA)
- Artificial Intelligence (AREA)
- Computer Vision & Pattern Recognition (AREA)
- Data Mining & Analysis (AREA)
- Evolutionary Computation (AREA)
- Medical Informatics (AREA)
- Game Theory and Decision Science (AREA)
- Computing Systems (AREA)
- General Engineering & Computer Science (AREA)
- Mathematical Physics (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The application discloses a method for logistics transportation scheduling of a bicycle yard, which comprises the following steps: acquiring input logistics transportation scheduling parameter information of a single train yard; establishing a single train yard logistics transportation scheduling model according to the single train yard logistics transportation scheduling parameter information to generate a target function; calculating a single-vehicle yard logistics transportation scheduling model by using a harmony search algorithm, and determining an optimal solution of a target function; and determining the optimal transport path of the logistics transport scheduling of the single train yard according to the optimal solution of the objective function. The method and the device introduce a harmony search mode, enhance the global search capability of the logistics transportation scheduling model of the single-vehicle yard, and enable the determined optimal transportation path of the logistics transportation scheduling to have the characteristics of high running speed, high optimization efficiency and the like. The application also provides a system, equipment and computer readable storage medium for the logistics transportation scheduling of the single parking lot, and the system, the equipment and the computer readable storage medium have the beneficial effects.
Description
Technical Field
The present application relates to the field of transportation scheduling, and in particular, to a method, a system, a device, and a computer-readable storage medium for scheduling logistics transportation in a single yard.
Background
The logistics industry is internationally considered as the basic industry for national economic development, and the development degree of the logistics industry is one of the important marks for measuring the national modernization degree and the comprehensive national strength. The logistics operation not only determines the overall operation cost of the business enterprise, but also directly affects the stability and balance of the operation of the whole business system. The single yard logistics transportation scheduling is one of the core activities of logistics.
In the logistics transportation scheduling of the single train yard, the most basic logistics transportation scheduling model of the single train yard can be described as follows: a distribution center has a plurality of vehicles to be delivered to a plurality of customer sites, each vehicle starts from the distribution center, needs to pass through all customers for which the vehicle is responsible, and returns to the distribution center, and how to select a traveling route is required to minimize the total travel. The vehicle capacity is larger than or equal to the total cargo demand of all the client points which are responsible for the vehicle; all customers have and can only be passed once by one vehicle.
However, the existing logistics transportation scheduling technology has the problems of low running speed, low convergence capability, low optimization efficiency and the like.
Disclosure of Invention
The application aims to provide a method, a system, equipment and a computer readable storage medium for single-yard logistics transportation scheduling, which are used for improving the running speed, the convergence capability and the optimizing efficiency of the logistics transportation scheduling.
In order to solve the technical problem, the application provides a method for dispatching logistics transportation in a single yard, which comprises the following steps:
acquiring input logistics transportation scheduling parameter information of a single train yard;
establishing a single-vehicle yard logistics transportation scheduling model according to the single-vehicle yard logistics transportation scheduling parameter information to generate a target function;
calculating the logistics transportation scheduling model of the single-vehicle yard by using a harmony search algorithm, and determining the optimal solution of the objective function;
and determining the optimal transport path of the logistics transport scheduling of the single-vehicle yard according to the optimal solution of the objective function.
Optionally, establishing a single yard logistics transportation scheduling model according to the single yard logistics transportation scheduling parameter information, and generating an objective function, including:
generating an objective function according to the logistics transportation scheduling parameter information
Wherein D is the total length of the path traveled by the transport vehicles, K is the total number of transport vehicles, N is the number of customer sites, D ij For a straight-line distance, r, of a transport vehicle from a customer point i to a customer point j ijk A variable other than 0, i.e., 1.
Optionally, the calculating the single yard logistics transportation scheduling model by using a harmony search algorithm to determine an optimal solution of the objective function includes:
initializing a control parameter and a harmony memory library;
calculating function fitness values corresponding to the harmony sounds in the harmony sound memory library;
determining a worst sum sound according to each function fitness value;
generating a new harmony according to a preset strategy, and calculating the fitness value of the new harmony;
if the fitness value of the new harmony is larger than the fitness value of the worst harmony, replacing the value of the worst harmony with the value of the new harmony;
judging whether the set maximum iteration number is reached or not;
if not, returning to the step of executing the steps of generating new harmony according to the preset strategy and calculating the fitness value of the new harmony;
and if so, determining the optimal harmony in the harmony memory base and the adaptability value of the optimal harmony as the optimal solution of the objective function.
Optionally, the initializing a control parameter and harmony memory library includes:
randomly generating a chaotic vector Y 0 ＝[y 01 ,y 02 ,…,y 0j ,…,y 0N ](ii) a Wherein the chaotic vector Y 0 The j-th characteristic value of (1) is y 0j ；
According to the formula y (i+1)j ＝μy ij (1-y ij ) For the chaos vector Y 0 ＝[y 01 ,y 02 ,…,y 0j ,…,y 0N ]Calculating to obtain HMS chaotic vectors; wherein the ith chaotic vector is Y i ＝[y i1 ,y i2 ,…,y ij ,…,y iN ]；
According to formula X i ＝Y i Mapping the HMS chaotic vectors to a preset value range by the aid of the K to obtain HMS strategy vectors;
placing the HMS policy vectors into the harmony memory bank;
and the HMS is the total number of the chaotic vectors, and the mu and the K are constants.
Optionally, calculating a function fitness value corresponding to each harmony in the harmony memory library, includes:
according to the formula
Computing the pth harmony X p ＝[x p1 ,x p2 ,…,x pq ,…,x pN ]A function fitness value of (a);
wherein, fitness p For the p-th harmonic X p The function fitness value of (1).
Optionally, the generating a new harmony sound according to a preset policy includes:
generating a random number rand (0,1) between (0, 1);
judging whether the random number rand (0,1) is smaller than the value probability of a memory bank;
if yes, randomly selecting a group of harmony from the harmony memory library to form the new harmony X new ＝rand[X 1 ,X 2 ,…,X HMS ]And adjusting the new harmony by utilizing a lion group algorithm;
if not, according to the formula
Generating each component of the new harmony
And compose the new harmony
Wherein rand (0,1) is a random number between (0,1), X new Is the new harmony.
Optionally, the adjusting the new harmony sound by using the lion group algorithm includes:
determining the new harmony X new Randomly selecting the positions of the lions in the iterative process of the lion group algorithm;
according to formula X l ＝X g +rand()*(X g -X new ) Renewing male lion X l The position of (a);
according to formula X s ＝X m +rand()*(X m -X g ) Renewing female lion X s The position of (a);
calculating the objective function value of each lion in the lion group, selecting the position of the lion with the highest objective function value and assigning the position to the new harmony X new ；
Wherein, X g Is the initial position, X, of the male lion m Is the initial position of the female lion.
Optionally, determining an optimal transportation path of the single yard logistics transportation scheduling according to the optimal solution of the objective function includes:
according to formula C j ＝{(x bq ,q)|j-1≤x bq < j } pair optimal harmony X b ＝[x b1 ,x b2 ,…,x bq ,…,x bN ]The interior of the system is grouped to obtain K sets;
applying a maximum position method to the elements in the K sets according to x bq The second dimension value of each element in the K sets is the optimal transportation path of the corresponding vehicle in the single yard logistics transportation scheduling after arrangement is finished;
wherein, X b For optimal harmony, C j Is the jth set, x bq For the optimal harmony X b The qth eigenvalue of (1).
The application also provides a system for the logistics transportation scheduling of the bicycle yard, which comprises:
the acquisition module is used for acquiring the input logistics transportation scheduling parameter information of the single train yard;
the establishing module is used for establishing a single-vehicle yard logistics transportation scheduling model according to the single-vehicle yard logistics transportation scheduling parameter information to generate a target function;
the calculation module is used for calculating the single-train yard logistics transportation scheduling model by using a harmony search algorithm and determining the optimal solution of the objective function;
and the determining module is used for determining the optimal transportation path of the logistics transportation scheduling of the single-vehicle yard according to the optimal solution of the objective function.
The application still provides a bicycle yard commodity circulation transportation scheduling equipment, and this bicycle yard commodity circulation transportation scheduling equipment includes:
a memory for storing a computer program;
a processor for implementing the steps of the method for scheduling the logistic transportation of the single yard as described in any one of the above when the computer program is executed.
The present application further provides a computer readable storage medium having stored thereon a computer program which, when being executed by a processor, implements the steps of the method for scheduling the logistics transportation of the bicycle yard as described in any one of the above.
The application provides a method for dispatching logistics transportation in a bicycle yard, which comprises the following steps: acquiring input logistics transportation scheduling parameter information of a single train yard; establishing a single-vehicle yard logistics transportation scheduling model according to the single-vehicle yard logistics transportation scheduling parameter information to generate a target function; calculating a single-vehicle yard logistics transportation scheduling model by using a harmony search algorithm, and determining an optimal solution of a target function; and determining the optimal transport path of the logistics transport scheduling of the single-vehicle yard according to the optimal solution of the objective function.
According to the technical scheme, aiming at the problem of logistics transportation scheduling, a single-yard logistics transportation scheduling model is established according to the single-yard logistics transportation scheduling parameter information to generate a target function; and then, a harmony search algorithm is adopted to calculate the logistics transportation scheduling model of the single-vehicle yard, a harmony search mode is introduced, the global search capability of the logistics transportation scheduling model of the single-vehicle yard is enhanced, and the characteristics of high running speed, high optimizing efficiency and the like are achieved for determining the optimal transportation path of the logistics transportation scheduling. This application still provides a system, equipment and the readable storage medium of computer of bicycle yard logistics transportation dispatch simultaneously, has above-mentioned beneficial effect, and the no longer gives unnecessary details here.
Drawings
In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings used in the embodiments or the prior art descriptions will be briefly described below, it is obvious that the drawings in the following description are only the embodiments of the present application, and for those skilled in the art, other drawings can be obtained according to the provided drawings without creative efforts.
Fig. 1 is a flowchart of a method for scheduling logistics transportation in a single yard according to an embodiment of the present disclosure;
FIG. 2 is a flow chart of an actual representation of S103 in the method for scheduling the logistics transportation of the single yard as provided in FIG. 1;
fig. 3 is a block diagram of a system for scheduling logistics transportation in a single yard according to an embodiment of the present disclosure;
FIG. 4 is a block diagram of another system for single yard logistics transportation scheduling provided by an embodiment of the present application;
fig. 5 is a structural diagram of a single yard logistics transportation scheduling device according to an embodiment of the present application.
Detailed Description
The core of the application is to provide a method, a system, equipment and a computer readable storage medium for single yard logistics transportation scheduling, which are used for improving the running speed, the convergence capability and the optimizing efficiency of the logistics transportation scheduling.
In order to make the objects, technical solutions and advantages of the embodiments of the present application clearer, the technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are some embodiments of the present application, but not all embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
Referring to fig. 1, fig. 1 is a flowchart of a method for scheduling transportation of a single yard logistics.
The method specifically comprises the following steps:
s101: acquiring input logistics transportation scheduling parameter information of a single train yard;
the logistics industry is internationally considered as the basic industry for national economic development, and the development degree of the logistics industry is one of the important marks for measuring the national modernization degree and the comprehensive national strength. The logistics operation not only determines the total operation cost of the business enterprise, but also directly affects the stability and balance of the operation of the whole business system. The method for dispatching the logistics transportation of the single yard is used for solving the problems that the logistics transportation dispatching of the single yard is one of the core activities of logistics, but the existing logistics transportation dispatching technology has the problems of low running speed, low convergence capability, low optimization efficiency and the like;
optionally, the single yard logistics transportation scheduling parameter information mentioned herein may specifically include a total length of a path traveled by the transportation vehicle, a total number of the transportation vehicles, a number of customer points, a straight distance traveled by the transportation vehicle from the customer point i to the customer point j, and the like.
S102: establishing a single-vehicle yard logistics transportation scheduling model according to the single-vehicle yard logistics transportation scheduling parameter information to generate a target function;
the significance of establishing the single-yard logistics transportation scheduling model is that the optimal transportation path of the logistics transportation scheduling is determined through the model so as to improve the operation speed of the logistics transportation scheduling;
optionally, a single yard logistics transportation scheduling model is established according to the single yard logistics transportation scheduling parameter information to generate an objective function, which may specifically be:
generating an objective function according to the logistics transportation scheduling parameter information
Wherein D is the total length of the path traveled by the transport vehicles, K is the total number of transport vehicles, N is the number of customer sites, D ij For a straight-line distance, r, of a transport vehicle from a customer point i to a customer point j ijk A variable other than 0, i.e., 1.
S103: calculating a single-vehicle yard logistics transportation scheduling model by using a harmony search algorithm, and determining an optimal solution of a target function;
the harmony search algorithm is a novel intelligent optimization algorithm, the function value is continuously converged along with the increase of the iteration times by repeatedly adjusting the solution variables in the memory library, so that the optimization is completed, and the purpose of solving the optimal solution is to determine the optimal transportation path of the logistics transportation scheduling of the single yard by the optimal solution of the objective function.
S104: and determining the optimal transport path of the logistics transport scheduling of the single-vehicle yard according to the optimal solution of the objective function.
After the optimal solution of the objective function is determined, determining the optimal transportation path of the logistics transportation scheduling of the single-vehicle yard according to the optimal solution;
optionally, the determining an optimal transportation path of the logistics transportation scheduling of the single yard according to the optimal solution of the objective function may specifically be:
according to formula C j ＝{(x bq ,q)|j-1≤x bq < j } pair optimal harmony X b ＝[x b1 ,x b2 ,…,x bq ,…,x bN ]The interior of the system is grouped to obtain K sets;
applying maximum position method to elements in K sets according to x bq The second dimension value of each element in the K sets is the optimal transportation path of the corresponding vehicle in the single yard logistics transportation scheduling after the arrangement is finished;
wherein X b For optimal harmony, C j Is the jth set, x bq For optimal harmony X b The qth eigenvalue of (1).
Based on the technical scheme, the method for dispatching the logistics transportation in the single train yard is characterized in that a single train yard logistics transportation dispatching model is established according to the single train yard logistics transportation dispatching parameter information to generate a target function; and then, a harmony search algorithm is adopted to calculate the logistics transportation scheduling model of the single-vehicle yard, a harmony search mode is introduced, the global search capability of the logistics transportation scheduling model of the single-vehicle yard is enhanced, and the characteristics of high running speed, high optimization efficiency and the like are achieved when the optimal transportation path of the logistics transportation scheduling is determined.
With respect to step S103 of the previous embodiment, the harmonic search algorithm is used to calculate the single yard logistics transportation scheduling model and determine the optimal solution of the objective function, which may specifically be the step shown in fig. 2, which is described below with reference to fig. 2.
Referring to fig. 2, fig. 2 is a flowchart illustrating an actual representation manner of S103 in the method for scheduling the logistics transportation of the single yard shown in fig. 1.
The method specifically comprises the following steps:
s201: initializing a control parameter and a harmony memory library;
optionally, as mentioned herein, the initialization control parameter and sound memory library may specifically be:
randomly generating a chaotic vector Y 0 ＝[y 01 ,y 02 ,…,y 0j ,…,y 0N ](ii) a Wherein the chaotic vector Y 0 The j-th characteristic value of (1) is y 0j ；
According to the formula y (i+1)j ＝μy ij (1-y ij ) For chaotic vector Y 0 ＝[y 01 ,y 02 ,…,y 0j ,…,y 0N ]Calculating to obtain HMS chaotic vectors; wherein the ith chaotic vector is Y i ＝[y i1 ,y i2 ,…,y ij ,…,y iN ]；
According to formula X i ＝Y i Mapping the HMS chaotic vectors to a preset value range by the aid of the K to obtain HMS strategy vectors;
putting HMS strategy vectors into a harmony memory base;
wherein HMS is the total number of the chaotic vectors, and mu and K are constants.
S202: calculating function fitness values corresponding to the harmony sounds in the harmony memory base;
optionally, the function fitness value corresponding to each harmonic in the calculation and sound memory library mentioned here may specifically be:
according to the formula
Calculate the p-th sumSound X p ＝[x p1 ,x p2 ,…,x pq ,…,x pN ]A function fitness value of (a);
wherein, fitness p For the p-th harmonic X p The function fitness value of (1).
S203: determining worst sum sound according to the fitness value of each function;
s204: generating new harmony according to a preset strategy, and calculating the fitness value of the new harmony;
optionally, the generating of the new harmony according to the preset policy mentioned here may specifically be:
generating a random number rand (0,1) between (0, 1);
judging whether the random number rand (0,1) is smaller than the value probability of the memory bank;
if yes, randomly selecting a group of harmony from the harmony memory library to form a new harmony X new ＝rand[X 1 ,X 2 ,…,X HMS ]And the new harmony sound is adjusted by utilizing the lion group algorithm;
if not, according to the formula
Generating each component of a new harmony
And compose a new harmony
Wherein rand (0,1) is a random number between (0,1), X new Is new harmony;
further, the use of the lion group algorithm to adjust the new harmony as mentioned herein includes:
determining a New Harmony X new Randomly selecting the positions of the lions in the iterative process of the lion group algorithm;
according to formula X l ＝X g +rand()*(X g -X new ) Renewing male lion X l The position of (a);
according to formula X s ＝X m +rand()*(X m -X g ) Renewing female lion X s The position of (a);
calculating objective function values of the lions in the lions group, selecting the position of the lion with the highest objective function value and assigning the position to the new harmony X new ；
Wherein, X g As the initial position of the lion, X m Is the home position of the lion.
S205: if the fitness value of the new harmony is larger than the fitness value of the worst harmony, replacing the value of the worst harmony with the value of the new harmony;
s206: judging whether the set maximum iteration number is reached;
if not, returning to the step S204; if yes, the process proceeds to step S207.
S207: and determining the optimal harmony in the harmony memory base and the fitness value of the optimal harmony as the optimal solution of the objective function.
Referring to fig. 3, fig. 3 is a structural diagram of a system for dispatching a logistics transportation in a single yard according to an embodiment of the present application.
The system may include:
the acquisition module 100 is configured to acquire input logistics transportation scheduling parameter information of a single yard;
the establishing module 200 is used for establishing a single-vehicle yard logistics transportation scheduling model according to the single-vehicle yard logistics transportation scheduling parameter information to generate a target function;
the calculation module 300 is used for calculating the single yard logistics transportation scheduling model by using a harmony search algorithm and determining the optimal solution of the objective function;
and the determining module 400 is used for determining the optimal transportation path of the logistics transportation scheduling of the single train yard according to the optimal solution of the objective function.
Referring to fig. 4, fig. 4 is a block diagram of another system for dispatching logistics transportation in a single yard according to an embodiment of the present application.
The setup module 200 may include:
the establishing submodule is used for generating an objective function according to the logistics transportation scheduling parameter information
Wherein D is the total length of the path traveled by the transport vehicles, K is the total number of transport vehicles, N is the number of customer sites, D ij For a straight-line distance, r, of a transport vehicle from a customer point i to a customer point j ijk A variable other than 0, i.e., 1.
The calculation module 300 may include:
the initialization submodule is used for initializing the control parameters and the harmony memory library;
the calculation submodule is used for calculating function fitness values corresponding to the harmony sounds in the harmony memory library;
the first determining submodule is used for determining worst sum sound according to the fitness value of each function;
the generating submodule is used for generating new harmony according to a preset strategy and calculating the fitness value of the new harmony;
the replacing submodule is used for replacing the value of the worst harmony with the value of the new harmony if the fitness value of the new harmony is larger than the fitness value of the worst harmony;
the judgment submodule is used for judging whether the set maximum iteration number is reached;
the return submodule is used for returning to the generation submodule to execute the steps of generating new harmony according to a preset strategy and calculating the fitness value of the new harmony when the set maximum iteration times are not reached;
and the second determining submodule is used for determining the optimal harmony in the harmony memory bank and the fitness value of the optimal harmony as the optimal solution of the objective function when the set maximum iteration times is reached.
Further, the initialization submodule may include:
a first generating unit for randomly generating a chaotic vector Y 0 ＝[y 01 ,y 02 ,…,y 0j ,…,y 0N ](ii) a Wherein the chaotic vector Y 0 The j-th characteristic value in (1) is y 0j ；
First computing unitFor according to the formula y (i+1)j ＝μy ij (1-y ij ) For chaotic vector Y 0 ＝[y 01 ,y 02 ,…,y 0j ,…,y 0N ]Calculating to obtain HMS chaotic vectors; wherein the ith chaotic vector is Y i ＝[y i1 ,y i2 ,…,y ij ,…,y iN ]；
A mapping unit for mapping the data according to formula X i ＝Y i Mapping the HMS chaotic vectors to a preset value range by using the K to obtain HMS strategy vectors;
the placement unit is used for placing the HMS strategy vectors into the harmony memory base;
wherein HMS is the total number of the chaotic vectors, and mu and K are constants.
The calculation sub-module may include:
a second calculation unit for calculating
Computing the p-th harmony
X p ＝[x p1 ,x p2 ,…,x pq ,…,x pN ]A function fitness value of (a);
wherein, fitness p For the p-th harmonic X p The function fitness value of (1).
The generation submodule may include:
a second generating unit for generating a random number rand (0,1) between (0, 1);
the judging unit is used for judging whether the random number rand (0,1) is smaller than the value probability of the memory bank;
a third generating unit, for randomly selecting a set of harmony from the harmony memory bank to form a new harmony X when the random number rand (0,1) is less than the memory bank value probability new ＝rand[X 1 ,X 2 ,…,X HMS ]And the new harmony sound is adjusted by utilizing the lion group algorithm;
a fourth generating unit, configured to, when the random number rand (0,1) is not less than the value probability of the memory bank, generate the random number rand according to a formula
Generating each component of a new harmony
And compose a new harmony
Wherein rand (0,1) is a random number between (0,1), X new It is a new harmony.
The determining module 400 may include:
a grouping submodule for grouping according to formula C j ＝{(x bq ,q)|j-1≤x bq < j } pair optimal harmony X b ＝[x b1 ,x b2 ,…,x bq ,…,x bN ]The interior of the system is grouped to obtain K sets;
a sorting submodule for applying a maximum position method to the elements in the K sets according to x bq The second dimension value of each element in the K sets is the optimal transportation path of the corresponding vehicle in the single yard logistics transportation scheduling after the arrangement is finished;
wherein, X b For optimal harmony, C j Is the jth set, x bq To optimize the harmony X b The qth eigenvalue of (1).
Since the embodiment of the system part and the embodiment of the method part correspond to each other, please refer to the description of the embodiment of the method part for the embodiment of the system part, and details are not repeated here.
Referring to fig. 5, fig. 5 is a structural diagram of a single yard logistics transportation scheduling apparatus according to an embodiment of the present application.
The single yard logistics transportation scheduling apparatus 600 may have relatively large differences due to different configurations or performances, and may include one or more processors (CPUs) 622 (e.g., one or more processors) and a memory 632, one or more storage media 630 (e.g., one or more mass storage devices) storing applications 642 or data 644. Memory 632 and storage medium 630 may be, among other things, transient or persistent storage. The program stored in the storage medium 630 may include one or more modules (not shown), each of which may include a sequence of instructions operating on the device. Further, the central processor 622 may be configured to communicate with the storage medium 630, and execute a series of instruction operations in the storage medium 630 on the single yard logistics transportation scheduling apparatus 600.
The single yard logistics transportation scheduling apparatus 600 may also include one or more power supplies 626, one or more wired or wireless network interfaces 650, one or more input-output interfaces 658, and/or one or more operating systems 641, such as Windows Server, Mac OS XTM, UnixTM, LinuxTM, FreeBSDTM, etc.
The steps in the method for scheduling the logistics transportation of the single yard described in fig. 1 to fig. 2 are implemented by the logistics transportation scheduling device of the single yard based on the structure shown in fig. 5.
It can be clearly understood by those skilled in the art that, for convenience and brevity of description, the specific working processes of the system, the apparatus and the module described above may refer to the corresponding processes in the foregoing method embodiments, and are not described herein again.
In the several embodiments provided in the present application, it should be understood that the disclosed apparatus, device and method may be implemented in other ways. For example, the above-described apparatus embodiments are merely illustrative, and for example, a division of modules is merely a logical division, and other divisions may be realized in practice, for example, a plurality of modules or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, devices or modules, and may be in an electrical, mechanical or other form.
Modules described as separate parts may or may not be physically separate, and parts displayed as modules may or may not be physical modules, may be located in one place, or may be distributed on a plurality of network modules. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of the present embodiment.
In addition, functional modules in the embodiments of the present application may be integrated into one processing module, or each of the modules may exist alone physically, or two or more modules are integrated into one module. The integrated module can be realized in a hardware mode, and can also be realized in a software functional module mode.
The integrated module, if implemented in the form of a software functional module and sold or used as a separate product, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present application may be substantially implemented or contributed to by the prior art, or all or part of the technical solution may be embodied in a software product, which is stored in a storage medium and includes instructions for causing a computer device (which may be a personal computer, a function calling device, or a network device) to execute all or part of the steps of the method of the embodiments of the present application. And the aforementioned storage medium includes: various media capable of storing program codes, such as a usb disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk, or an optical disk.
A method, a system, a device and a computer readable storage medium for scheduling the logistics transportation of the single yard provided by the present application are described in detail above. The principles and embodiments of the present application are explained herein using specific examples, which are provided only to help understand the method and the core idea of the present application. It should be noted that, for those skilled in the art, it is possible to make several improvements and modifications to the present application without departing from the principle of the present application, and such improvements and modifications also fall within the scope of the claims of the present application.
It should also be noted that, in this specification, relational terms such as first and second, and the like are used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Also, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other identical elements in the process, method, article, or apparatus that comprises the element.
Claims (8)
1. A method for scheduling logistics transportation of a bicycle yard is characterized by comprising the following steps:
acquiring input logistics transportation scheduling parameter information of a single train yard;
establishing a single train yard logistics transportation scheduling model according to the single train yard logistics transportation scheduling parameter information to generate a target function;
calculating the logistics transportation scheduling model of the single-vehicle yard by using a harmony search algorithm, and determining the optimal solution of the objective function;
determining an optimal transport path of the logistics transport scheduling of the single-vehicle yard according to the optimal solution of the objective function;
calculating the logistics transportation scheduling model of the single-vehicle yard by using a harmony search algorithm, and determining the optimal solution of the objective function, wherein the harmony search algorithm comprises the following steps:
initializing a control parameter and a harmony memory library;
calculating function fitness values corresponding to the harmony sounds in the harmony sound memory library;
determining the worst sum sound according to each function fitness value;
generating a new harmony according to a preset strategy, and calculating a fitness value of the new harmony;
if the fitness value of the new harmony is larger than the fitness value of the worst harmony, replacing the value of the worst harmony with the value of the new harmony;
judging whether the set maximum iteration number is reached or not;
if not, returning to the step of executing the steps of generating new harmony according to the preset strategy and calculating the fitness value of the new harmony;
if yes, determining the optimal harmony in the harmony memory bank and the fitness value of the optimal harmony as the optimal solution of the objective function;
the generating of the new harmony according to the preset strategy comprises the following steps:
generating a random number rand (0,1) between (0, 1);
judging whether the random number rand (0,1) is smaller than the value probability of a memory bank;
if yes, randomly selecting a group of harmony from the harmony memory library to form the new harmony X new ＝rand[X 1 ,X 2 ,...,X HMS ]And adjusting the new harmony by utilizing a lion group algorithm;
if not, according to the formula
Generating each component of the new harmony
And compose the new harmony
Wherein rand (0,1) is a random number between (0,1), X new Is the new harmony;
the adjusting the new harmony sound by utilizing the lion group algorithm comprises the following steps:
determining the new harmony X new Randomly selecting the positions of the lions in the iterative process of the lion group algorithm;
according to formula X l ＝X g +rand(0,1)*(X g -X new ) Renewing male lionX l The position of (a);
according to formula X s ＝X m +rand(0,1)*(X m -X g ) Renewing female lion X s The position of (a);
calculating the objective function value of each lion in the lion group, selecting the position of the lion with the highest objective function value and assigning the position to the new harmony X new ；
Wherein, X g Is the initial position, X, of the male lion m Is the initial position of the female lion.
2. The method according to claim 1, wherein the establishing of the single yard logistics transportation scheduling model according to the single yard logistics transportation scheduling parameter information and the generating of the objective function comprise:
generating an objective function according to the logistics transportation scheduling parameter information
Wherein D is the total length of the path traveled by the transport vehicles, K is the total number of transport vehicles, N is the number of customer sites, D ef For straight-line distance, r, of transport vehicle from customer point e to customer point f efk A variable other than 0, i.e., 1.
3. The method of claim 1, wherein initializing the control parameter and harmony memory bank comprises:
randomly generating a chaotic vector Y 0 ＝[y 01 ,y 02 ,...,y 0v ,...,y 0N ](ii) a Wherein the chaotic vector Y 0 The v-th characteristic value of (1) is y 0v ；
According to the formula y (u+1)v ＝μy uv (1-y uv ) For the chaos vector Y 0 ＝[y 01 ,y 02 ,...,y 0v ,...,y 0N ]Calculating to obtain HMS chaotic vectors; wherein the u-th chaotic vector is Y u ＝[y u1 ,y u2 ,...,y uv ,...,y uN ]；
According to formula X u ＝Y u Mapping the HMS chaotic vectors to a preset value range by the aid of the K to obtain HMS strategy vectors;
placing the HMS policy vectors into the harmony memory bank;
wherein HMS is the total number of the chaotic vectors, mu and K are constants, y uv Representing the v characteristic value in the u chaotic vector; y is u Representing the u-th chaotic vector; x u Representing the u-th policy vector.
4. The method of claim 2, wherein calculating the functional fitness value for each harmonic in the harmonic memory bank comprises:
according to the formula
Computing the p-th harmony X p ＝[x p1 ,x p2 ,...,x pq ,...,x pN ]A function fitness value of (a);
wherein, fitness p For the p-th harmonic X p The function fitness value of (1).
5. The method of claim 1, wherein determining an optimal transportation path for a single yard logistics transportation schedule based on the optimal solution to the objective function comprises:
according to the formula C t ＝{(x bq ,q)|t-1≤x bq < t } pair optimal harmony X b ＝[x b1 ,x b2 ,...,x bq ,...,x bN ]The interior of the system is grouped to obtain K sets;
applying a maximum position method to the elements in the K sets according to x bq The second dimension value of each element in the K sets is the optimal transportation path of the corresponding vehicle in the single yard logistics transportation scheduling after arrangement is finished;
wherein X b For optimal harmony, C t Is the t-th set, x bq For the optimal harmony X b The qth eigenvalue of (1).
6. A system for scheduling the logistics transportation of a bicycle yard, comprising:
the acquisition module is used for acquiring the input logistics transportation scheduling parameter information of the single train yard;
the establishing module is used for establishing a single-vehicle yard logistics transportation scheduling model according to the single-vehicle yard logistics transportation scheduling parameter information to generate a target function;
the calculation module is used for calculating the single-train yard logistics transportation scheduling model by using a harmony search algorithm and determining the optimal solution of the objective function;
the determining module is used for determining the optimal transportation path of the logistics transportation scheduling of the single train yard according to the optimal solution of the objective function;
the calculation module comprises: the initialization submodule is used for initializing the control parameters and the harmony memory library; the calculation submodule is used for calculating function fitness values corresponding to the harmony sounds in the harmony memory library; the first determining submodule is used for determining worst sum sound according to the fitness value of each function; the generating submodule is used for generating new harmony according to a preset strategy and calculating the fitness value of the new harmony; the replacing submodule is used for replacing the value of the worst harmony with the value of the new harmony if the fitness value of the new harmony is larger than the fitness value of the worst harmony; the judgment submodule is used for judging whether the set maximum iteration number is reached; the return submodule is used for returning to the generation submodule to execute the steps of generating new harmony according to a preset strategy and calculating the fitness value of the new harmony when the set maximum iteration times are not reached; the second determining submodule is used for determining the optimal harmony in the harmony memory base and the fitness value of the optimal harmony as the optimal solution of the target function when the set maximum iteration times are reached; the generation submodule comprises: a second generating unit for generating a random number rand (0,1) between (0, 1); the judging unit is used for judging whether the random number rand (0,1) is smaller than the value probability of the memory bank; third generationA harmony unit for randomly selecting a group of harmony from the harmony memory bank to form a new harmony X when the random number rand (0,1) is less than the value probability of the memory bank new ＝rand[X 1 ,X 2 ,...,X HMS ]And the new harmony sound is adjusted by utilizing the lion group algorithm; a fourth generating unit, for generating random number rand (0,1) according to formula when the random number rand is not less than the value probability of the memory bank
Generating each component of a new harmony
And compose a new harmony
Wherein rand (0,1) is a random number between (0,1), X new Is new harmony; and adjusting the new harmony by utilizing a lion group algorithm, wherein the method comprises the following steps: determining a New Harmony X new Randomly selecting the positions of the lions in the iterative process of the lion group algorithm; according to formula X l ＝X g +rand(0,1)*(X g -X new ) Renewing male lion X l The position of (a); according to formula X s ＝X m +rand(0,1)*(X m -X g ) Renewing female lion X s The position of (a); calculating objective function values of the lions in the lion group, selecting the position of the lion with the highest objective function value and assigning the position to the new harmony X new (ii) a Wherein, X g As the initial position of the lion, X m The initial position of the female lion.
7. The utility model provides a bicycle yard commodity circulation transportation scheduling equipment which characterized in that includes:
a memory for storing a computer program;
a processor for implementing the steps of the method of single yard logistics transportation scheduling of any one of claims 1 to 5 when executing said computer program.
8. A computer-readable storage medium, having stored thereon a computer program which, when being executed by a processor, carries out the steps of the method for single yard logistics transportation scheduling of any one of claims 1 to 5.
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 CN110428089A (en) | 2019-11-08 |
| CN110428089B true 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) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111967672B (en) * | 2020-08-18 | 2022-03-15 | 合肥工业大学 | Lion group evolution algorithm-based path planning method for space crowdsourcing platform |
Citations (3)
| 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 |
| CN107230023A (en) * | 2017-06-12 | 2017-10-03 | 合肥工业大学 | Based on the production and transportation coordinated dispatching method and system for improving harmony search |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US10108749B2 (en) * | 2014-11-05 | 2018-10-23 | Nec Corporation | Optimizing power flows using harmony search with machine learning |
-
2019
- 2019-07-03 CN CN201910594652.5A patent/CN110428089B/en active Active
Patent Citations (3)
| 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 |
| 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 |
|---|
| 动态车辆路径问题建模与优化算法研究;陈世峰;《中国博士学位论文全文数据库 信息科技辑》;20190131;第4章 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110428089A (en) | 2019-11-08 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109034468B (en) | Logistics distribution path planning method with time window based on cuckoo algorithm | |
| CN107833002B (en) | Multi-stage low-carbon logistics distribution network planning method based on cooperative multi-objective algorithm | |
| US20240054444A1 (en) | Logistics scheduling method and system for industrial park based on game theory | |
| CN109840648B (en) | Method and device for outputting bin information | |
| CN105389975B (en) | Special train dispatching method and device | |
| CN111428991B (en) | Method and device for determining delivery vehicles | |
| CN110264100B (en) | Multi-yard logistics transportation scheduling method, device, equipment and readable storage medium | |
| CN103019822A (en) | Large-scale processing task scheduling method for income driving under cloud environment | |
| CN110428089B (en) | Method, system and equipment for logistics transportation scheduling of bicycle yard | |
| WO2021222413A1 (en) | Resource capacity planning system | |
| CN110264140B (en) | Logistics transportation scheduling method, device and equipment with time window | |
| CN110851247A (en) | Cost optimization scheduling method for constrained cloud workflow | |
| CN110972060B (en) | Deployment method of edge control center accessed to terminal on power communication network | |
| CN113034228B (en) | Order management method and device | |
| CN117455234A (en) | Method, device, computer equipment and storage medium for determining risk classification model | |
| CN110503234A (en) | A kind of method, system and the equipment of logistics transportation scheduling | |
| CN116167245B (en) | Multi-attribute transfer decision model-based multi-modal grain transportation method and system | |
| CN111489005A (en) | Inventory path optimization method and device | |
| CN112508478B (en) | Flexible logistics distribution task allocation method based on self-organizing automated guided vehicle | |
| CN103595783B (en) | Cloud computing scheduling system and cloud computing scheduling method | |
| CN114298391A (en) | Distribution route determining method, device and equipment | |
| CN110163585B (en) | Method and device for issuing electronic red packet | |
| CN109447471B (en) | Multi-robot multi-region collaborative search task allocation method | |
| CN112465391A (en) | Distributed intelligent factory supply task allocation method based on game theory | |
| Banjar et al. | Intelligent Scheduling Algorithms for the Enhancement of Drone Based Innovative Logistic Supply Chain Systems |
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 |