CN109345166A - Method and apparatus for generating information - Google Patents
Method and apparatus for generating information Download PDFInfo
- Publication number
- CN109345166A CN109345166A CN201811101727.3A CN201811101727A CN109345166A CN 109345166 A CN109345166 A CN 109345166A CN 201811101727 A CN201811101727 A CN 201811101727A CN 109345166 A CN109345166 A CN 109345166A
- Authority
- CN
- China
- Prior art keywords
- target location
- location information
- subset
- vehicle
- limit 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.)
- Granted
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
- G06Q10/083—Shipping
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock 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/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
- G06Q10/06312—Adjustment or analysis of established resource schedule, e.g. resource or task levelling, or dynamic rescheduling
Landscapes
- Business, Economics & Management (AREA)
- Engineering & Computer Science (AREA)
- Human Resources & Organizations (AREA)
- Economics (AREA)
- Strategic Management (AREA)
- Entrepreneurship & Innovation (AREA)
- Physics & Mathematics (AREA)
- Marketing (AREA)
- Operations Research (AREA)
- Quality & Reliability (AREA)
- Tourism & Hospitality (AREA)
- Development Economics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Game Theory and Decision Science (AREA)
- Educational Administration (AREA)
- Traffic Control Systems (AREA)
- Navigation (AREA)
Abstract
The embodiment of the present application discloses the method and apparatus for generating information.One specific embodiment of this method includes: to receive target location information aggregate and subset upper limit value；In response to determining that the quantity of target location information in target location information aggregate is greater than subset upper limit value, target location information aggregate is divided at least two target location information subsets；For the target location information subset at least two target location information subsets, the vehicle scheduling scheme for being directed to the target location information subset is solved based on heuritic approach；Merge at least two vehicle scheduling schemes obtained at least two target location information subsets；Using the vehicle scheduling scheme after merging as the initial vehicle scheduling scheme for being directed to target location information aggregate, initial vehicle scheduling scheme is optimized based on heuritic approach, obtains the final vehicle scheduling scheme for target location information aggregate.The embodiment realizes quickly generating for the vehicle scheduling scheme of large-scale dispatching problem.
Description
Technical field
The invention relates to logistics technology, and in particular to the method and apparatus for generating information.
Background technique
With on line to (Online To Offline, O2O) under line and the sustainable development being newly sold, daily from center storehouse
Library is also steeply rising goods delivery to scale the problem of being scattered in each trade company in city.New retail short, goods with path
The features such as object is generally less than normal, requires immediate distribution, and delivery point is largely assembled.How large-scale dispatching problem is carried out efficient
Distribution scheduling planning, be a urgent problem to save distribution cost.It can be asked at present based on heuritic approach
Distribution project is solved, distribution scheduling planning can also be carried out by artificial mode.Heuritic approach can be within reasonable time
The small-scale distribution scheduling task of centering provides preferable distribution scheduling scheme, but as the scale of distribution scheduling task expands
Greatly, solution space is exponentially increased, and the solution time sharply increases.Distribution scheduling planning is carried out using artificial mode, result
Superiority and inferiority is largely dependent on experience accumulation and the quality height of operation personnel itself, heavy dependence senior staff.For order
Biggish scene is measured, the scheduling scheme generated using artificial experience is very uncontrollable, and distribution cost can not be effectively reduced.
Summary of the invention
The embodiment of the present application proposes the method and apparatus for generating information.
In a first aspect, the embodiment of the present application provides a kind of method for generating information, this method comprises: receiving target
Location information set and subset upper limit value, wherein target location information in above-mentioned target location information aggregate includes target
The mark of point；It is greater than the above-mentioned subset upper limit in response to the quantity of target location information in the above-mentioned target location information aggregate of determination
Value, is divided at least two target location information subsets for above-mentioned target location information aggregate；For at least two target locations
Target location information subset in information subset solves the vehicle tune for being directed to the target location information subset based on heuritic approach
Degree scheme, wherein vehicle scheduling scheme includes the vehicle line and target location mark sequence of vehicle；Merge and is directed at least two
At least two vehicle scheduling schemes that target location information subset obtains, the vehicle scheduling scheme after being merged；After merging
Vehicle scheduling scheme as be directed to above-mentioned target location information aggregate initial vehicle scheduling scheme, be based on heuritic approach pair
Above-mentioned initial vehicle scheduling scheme optimizes, and obtains the final vehicle scheduling scheme for above-mentioned target location information aggregate.
In some embodiments, above-mentioned that above-mentioned target location information aggregate is divided at least two target location information
Collection, comprising: the division numbers of target location information subset are determined according to above-mentioned subset upper limit value；Based on above-mentioned division numbers and gather
Class algorithm divides above-mentioned target location information aggregate, obtains above-mentioned division numbers target location information subset.
In some embodiments, the above-mentioned division numbers that target location information subset is determined according to above-mentioned subset upper limit value,
Comprise determining that the ratio of the quantity of target location information and above-mentioned subset upper limit value in above-mentioned target location information aggregate, and
Above-mentioned ratio is rounded downwards, the first value is obtained；By the sum of above-mentioned first value and preset value as target location information subset
Division numbers.
In some embodiments, the above method further include: receive subset lower limit value, wherein above-mentioned subset lower limit value is less than
Or it is equal to above-mentioned subset upper limit value；And above-mentioned target location information aggregate is being divided at least two target location information
After collection, the above method further include: for the target location information in obtained above-mentioned at least two target locations information subset
Subset execute following steps: by the quantity of target location information in the target location information subset respectively with above-mentioned subset lower limit value
It is compared with above-mentioned subset upper limit value；In response to determining that the quantity of target location information in the target location information subset is greater than
Above-mentioned subset upper limit value divides the target location information subset；In response to determining mesh in the target location information subset
The quantity for marking location information is less than above-mentioned subset lower limit value, which is merged into other target location information
Subset.
In some embodiments, above-mentioned target location information in above-mentioned at least two target locations information subset
Collection solves the vehicle scheduling scheme for being directed to the target location information subset based on heuritic approach, comprising: is based on heuristic calculation
Method, the vehicle scheduling scheme of target location information subset at least two target location information subset of Parallel implementation.
In some embodiments, above-mentioned that the vehicle scheduling for being directed to the target location information subset is solved based on heuritic approach
Scheme, comprising: receive model setting parameter and algorithm parameter, wherein above-mentioned model setting parameter includes cost function and constraint
Condition, above-mentioned algorithm parameter include the number of iterations；Use above-mentioned cost function and above-mentioned constraint condition founding mathematical models；It utilizes
Above-mentioned algorithm parameter and heuritic approach solve above-mentioned mathematical model, obtain vehicle scheduling scheme, wherein obtained vehicle
Scheduling scheme includes the vehicle line and target location mark sequence of vehicle.
In some embodiments, above-mentioned cost function be totle drilling cost, wherein above-mentioned totle drilling cost by route total travel away from
Depreciable cost from vehicle in, the unit mileage cost of route and route is calculated.
Second aspect, the embodiment of the present application provide a kind of for generating the device of information, and above-mentioned apparatus includes: first to connect
Unit is received, is configured to receive target location information aggregate and subset upper limit value, wherein in above-mentioned target location information aggregate
Target location information includes the mark of target location；Division unit is configured in response to determine above-mentioned target location information collection
The quantity of target location information is greater than above-mentioned subset upper limit value in conjunction, and above-mentioned target location information aggregate is divided at least two
Target location information subset；Unit is solved, is configured to for the target location letter at least two target location information subsets
Subset is ceased, the vehicle scheduling scheme for being directed to the target location information subset is solved based on heuritic approach, wherein vehicle scheduling side
Case includes the vehicle line and target location mark sequence of vehicle；Combining unit is configured to merge at least two targets
At least two vehicle scheduling schemes that location information subset obtains, the vehicle scheduling scheme after being merged；Optimize unit, is matched
It is set to using the vehicle scheduling scheme after merging as the initial vehicle scheduling scheme for being directed to above-mentioned target location information aggregate, is based on
Heuritic approach optimizes above-mentioned initial vehicle scheduling scheme, obtains the final vehicle for above-mentioned target location information aggregate
Scheduling scheme.
In some embodiments, above-mentioned division unit comprises determining that subelement, is configured to according to above-mentioned subset upper limit value
Determine the division numbers of target location information subset；Subelement is divided, is configured to based on above-mentioned division numbers and clustering algorithm
Above-mentioned target location information aggregate is divided, above-mentioned division numbers target location information subset is obtained.
In some embodiments, above-mentioned determining subelement is further configured to: determining above-mentioned target location information aggregate
The ratio of the quantity of middle target location information and above-mentioned subset upper limit value, and above-mentioned ratio is rounded downwards, obtain the first value；
Division numbers by the sum of above-mentioned first value and preset value as target location information subset.
In some embodiments, above-mentioned apparatus further include: the second receiving unit is configured to receive subset lower limit value,
In, above-mentioned subset lower limit value is less than or equal to above-mentioned subset upper limit value；Execution unit, be configured to for obtain it is above-mentioned at least
Target location information subset in two target location information subsets executes following steps: by mesh in the target location information subset
The quantity of mark location information is compared with above-mentioned subset lower limit value and above-mentioned subset upper limit value respectively；In response to determining the target
The quantity of target location information is greater than above-mentioned subset upper limit value in location information subset, draws to the target location information subset
Point；In response to determining that the quantity of target location information in the target location information subset is less than above-mentioned subset lower limit value, by the mesh
Mark location information subset is merged into other target location information subsets.
In some embodiments, above-mentioned solution unit is further configured to: being based on heuritic approach, Parallel implementation is at least
The vehicle scheduling scheme of target location information subset in two target location information subsets.
In some embodiments, above-mentioned solution unit is further configured to: model setting parameter and algorithm parameter are received,
Wherein, above-mentioned model setting parameter includes cost function and constraint condition, and above-mentioned algorithm parameter includes the number of iterations；Using above-mentioned
Cost function and above-mentioned constraint condition founding mathematical models；Using above-mentioned algorithm parameter and heuritic approach to above-mentioned mathematical model
It is solved, obtains vehicle scheduling scheme, wherein obtained vehicle scheduling scheme includes the vehicle line and target location of vehicle
Identify sequence.
In some embodiments, above-mentioned cost function be totle drilling cost, wherein above-mentioned totle drilling cost by route total travel away from
Depreciable cost from vehicle in, the unit mileage cost of route and route is calculated.
The third aspect, the embodiment of the present application provide a kind of equipment, which includes: one or more processors；Storage
Device is stored thereon with one or more programs, when said one or multiple programs are executed by said one or multiple processors
When, so that said one or multiple processors realize the method as described in implementation any in first aspect.
Fourth aspect, the embodiment of the present application provide a kind of computer-readable medium, are stored thereon with computer program,
In, the method as described in implementation any in first aspect is realized when which is executed by processor.
Method and apparatus provided by the embodiments of the present application for generating information, first reception target location information aggregate and
Subset upper limit value, in response to determining that the quantity of target location information in target location information aggregate is greater than subset upper limit value, by mesh
Mark location information set is divided at least two target location information subsets.Then, at least two target location information
Each of collection target location information subset, the vehicle tune for being directed to the target location information subset is solved based on heuritic approach
Degree scheme.Then, merge at least two vehicle scheduling schemes obtained at least two target location information subsets, closed
Vehicle scheduling scheme after and.Finally, using the vehicle scheduling scheme after merging as the initial of target location information aggregate
Vehicle scheduling scheme optimizes initial vehicle scheduling scheme based on heuritic approach, obtains for target location information collection
The final vehicle scheduling scheme closed.To realize quickly generating for the large-scale vehicle scheduling scheme for dispensing problem.
Detailed description of the invention
By reading a detailed description of non-restrictive embodiments in the light of the attached drawings below, the application's is other
Feature, objects and advantages will become more apparent upon:
Fig. 1 is that one embodiment of the application can be applied to exemplary system architecture figure therein；
Fig. 2 is the flow chart according to one embodiment of the method for generating information of the application；
Fig. 3 is the schematic diagram according to an application scenarios of the method for generating information of the application；
Fig. 4 is the flow chart according to another embodiment of the method for generating information of the application；
Fig. 5 is the structural schematic diagram according to one embodiment of the device for generating information of the application；
Fig. 6 is adapted for the structural schematic diagram for the computer system for realizing the equipment of the embodiment of the present application.
Specific embodiment
The application is described in further detail with reference to the accompanying drawings and examples.It is understood that this place is retouched
The specific embodiment stated is used only for explaining related invention, rather than the restriction to the invention.It also should be noted that in order to
Convenient for description, part relevant to related invention is illustrated only in attached drawing.
It should be noted that in the absence of conflict, the features in the embodiments and the embodiments of the present application can phase
Mutually combination.The application is described in detail below with reference to the accompanying drawings and in conjunction with the embodiments.
Fig. 1 is shown can the method for generating information using the embodiment of the present application or the device for generating information
Exemplary system architecture 100.
As shown in Figure 1, system architecture 100 may include terminal device 101,102,103, network 104 and server 105.
Network 104 between terminal device 101,102,103 and server 105 to provide the medium of communication link.Network 104 can be with
Including various connection types, such as wired, wireless communication link or fiber optic cables etc..
User can be used terminal device 101,102,103 and be interacted by network 104 with server 105, to receive or send out
Send message etc..Various telecommunication customer end applications can be installed, such as vehicle scheduling class is soft on terminal device 101,102,103
Part, web browser applications, shopping class application, searching class application, instant messaging tools, mailbox client, social platform software
Deng.
Terminal device 101,102,103 can be hardware, be also possible to software.When terminal device 101,102,103 is hard
When part, it can be the various electronic equipments with display screen and supported web page browsing, including but not limited to smart phone, plate
Computer, pocket computer on knee and desktop computer etc..When terminal device 101,102,103 is software, can install
In above-mentioned cited electronic equipment.Multiple softwares or software module may be implemented into (such as providing distributed clothes in it
Business), single software or software module also may be implemented into.It is not specifically limited herein.
Server 105 can be to provide the server of various services, such as to showing on terminal device 101,102,103
Information provides the background server supported.Background server can to receive target location information aggregate, subset upper limit value
Etc. data carry out the processing such as analyzing, and processing result (such as final vehicle scheduling scheme) is fed back into terminal device.
It should be noted that server can be hardware, it is also possible to software.When server is hardware, may be implemented
At the distributed server cluster that multiple servers form, individual server also may be implemented into.It, can when server is software
To be implemented as multiple softwares or software module (such as providing Distributed Services), single software or software also may be implemented into
Module.It is not specifically limited herein.
It should be noted that the embodiment of the present application provided by for generate information method can by terminal device 101,
102, it 103 executes, can also be executed by server 105.Correspondingly, for generating the device of information, it can be set and set in terminal
In standby 101,102,103, also it can be set in server 105, herein without limitation.
It should be understood that the number of terminal device, network and server in Fig. 1 is only schematical.According to realization need
It wants, can have any number of terminal device, network and server.
With continued reference to Fig. 2, the process of one embodiment of the method for generating information according to the application is shown
200.The method for being used to generate information, comprising the following steps:
Step 201, target location information aggregate and subset upper limit value are received.
In the present embodiment, for generate the method for information executing subject (such as terminal device shown in FIG. 1 101,
102,103 or server 105) can receive target location information aggregate and subset upper limit value.As an example, when executing subject is
When terminal device 101,102,103 shown in FIG. 1, executing subject can directly receive the target location information collection that user is inputted
It closes and subset upper limit value.When executing subject is server 105 shown in FIG. 1, executing subject can pass through wired connection mode
Or radio connection receives target location information aggregate and the subset upper limit using its terminal for carrying out information input from user
Value.
Herein, the corresponding target location of each target location information in target location information aggregate can refer to that needs are matched
Client's point of delivery object.For example, the location information of target location can be the mesh of article order dispatching in logistics distribution scene
Address and the coordinate of target location etc. are marked, for example, residential building, commercial building, counter etc..In order to facilitate scheduling, Ke Yiwei
Corresponding unique identification is arranged in each target location.The mark of target location can include but is not limited to the following terms: number,
Letter, text etc..Herein, each target location information in target location information aggregate is with can include but is not limited to target
The order note identification and Item Weight of article order corresponding to the location information of point, the mark and target location of target location
Etc..Order note identification can be used for one order of unique identification, for example, order number.Herein, subset upper limit value can be one
Numerical value, for after characterizing target location information aggregate being divided at least two subsets, target that each subset may include
The maximum value of the quantity of location information.
Step 202, in response to determining that the quantity of target location information in target location information aggregate is greater than subset upper limit value,
Target location information aggregate is divided at least two target location information subsets.
In the present embodiment, executing subject can be by the quantity of the target location information in target location information aggregate and son
Collection upper limit value is compared.In response to determining that the quantity of target location information in target location information aggregate is greater than the subset upper limit
Target information set can be divided at least two target location information subsets by value, executing subject.As an example, executing subject
Can the location information of the target location according to corresponding to the target location information in target location information aggregate divided, example
Such as, the corresponding target location information of several target locations that distance is less than certain threshold value is divided into target location information
Collection.
In general, in response to determining that the quantity of target location information in target location information aggregate is less than or equal to the subset upper limit
Value, executing subject can directly solve the vehicle scheduling scheme for being directed to target location information aggregate using heuritic approach.It needs
Illustrate, solving vehicle scheduling scheme using heuritic approach is the technology studied and applied extensively at present, no longer superfluous herein
It states.
In some optional implementations of the present embodiment, target location information aggregate is divided at least two targets
Location information subset can be accomplished by the following way:
Firstly, determining the division numbers of target location information subset according to subset upper limit value.As an example, above-mentioned execution master
Body can be according to the quantity and above-mentioned subset upper limit value of the target location information in above-mentioned target location information aggregate, by various
Mode determines the division numbers of target location information subset.It is understood that the division numbers determined need to meet following public affairs
Formula: the quantity of the target location information in division numbers × subset upper limit value >=target location information aggregate.
Then, target location information aggregate is divided based on division numbers and clustering algorithm, obtains division numbers
Target location information subset.Herein, above-mentioned executing subject can use cluster using above-mentioned division numbers as target number of clusters K
Algorithm clusters the target location information in above-mentioned target location information aggregate.As an example, can believe by destination
The location information of target location in breath is clustered, to obtain K cluster of target number of clusters, cluster is target location information
Collection.Herein, above-mentioned clustering algorithm can be various clustering algorithms, including but not limited to: K-means (K mean value) algorithm, K-
Means++ algorithm, K- central point clustering algorithm (K-Medoide), ISODATA algorithm etc..In addition, used in cluster process
Can include but is not limited to apart from calculation: manhatton distance, Euclidean distance, spherical surface linear distance, navigation distance
Matrix etc..
In some optional implementations, the above-mentioned division number that target location information subset is determined according to subset upper limit value
Amount, can specifically include the following contents: firstly, above-mentioned executing subject is with can determining in above-mentioned target location information aggregate target
The quantity of point information and the ratio of above-mentioned subset upper limit value, and above-mentioned ratio is rounded downwards, obtain the first value.Then, on
Stating executing subject can division numbers by the sum of above-mentioned first value and preset value as target location information subset.
Herein, above-mentioned preset value is positive integer, and the size of preset value can be set according to actual needs, herein not
It limits.As an example, the size of above-mentioned preset value can be 1, at this point, the division numbers K of target location information subset can be with
It is calculated by following formula (1):
Wherein, NtotalIndicate the quantity of target location information in target location information aggregate, NclusterMaxIt indicates in subset
Limit value.
In some optional implementations of the present embodiment, the above-mentioned method for generating information can also include Fig. 2
In unshowned following steps:
Above-mentioned executing subject can receive subset lower limit value, wherein above-mentioned subset lower limit value can be less than or equal to above-mentioned
Subset upper limit value.Herein, subset lower limit value can be a numerical value, for characterize by target location information aggregate be divided into
After few two subsets, the minimum value of the quantity for the target location information that each subset may include.And
After step 202, the above-mentioned method for generating information can also include unshowned the following contents in Fig. 2:
For of each of at least two target location information subsets target location information obtained in step 202
Collection, above-mentioned executing subject can execute following steps:
Step S1: by the quantity of target location information in the target location information subset respectively with above-mentioned subset lower limit value and
Above-mentioned subset upper limit value compares.
Step S2: in response to determining that the quantity of target location information in the target location information subset is greater than in above-mentioned subset
Limit value, above-mentioned executing subject can divide the target location information subset.As an example, above-mentioned executing subject can adopt
The a plurality of target location information in the target location information subset two or more target locations are divided into various manners to believe
Cease subset.For example, random division.In another example by corresponding to each target location information in the target location information subset
The distance between target location divide etc..For another example being drawn using clustering algorithm to the target location information subset
Point.
Step S3: in response to determining that the quantity of target location information in the target location information subset is less than under above-mentioned subset
The target location information subset is merged into other target location information subsets by limit value.As an example, above-mentioned executing subject can be with
The target location information subset is merged into other target location information subsets using various sides.For example, above-mentioned executing subject can
Calculated between the cluster centre of the target location information subset and the cluster centre of other target location information subsets first
Distance, and will be apart from the corresponding target location information subset of minimum value as target location information subset to be combined.Later, by this
Target location information subset is merged with above-mentioned target location information subset to be combined.
It should be noted that above-mentioned executing subject can repeat step S1, step S2 and step S3, until it is above-mentioned extremely
The quantity for the target location information for including in each of few two target location information subsets target location information subset is all
Between above-mentioned subset lower limit value and above-mentioned subset upper limit value.By this implementation, it is ensured that finally obtained at least two
The quantity substantially phase for the target location information for including in each of a target location information subset destination information subset
Together.In this way, using heuritic approach for each target location information subset solve vehicle scheduling scheme when, can to avoid by
In the quantity of target location information excessive the problem of causing solution vehicle scheduling scheme to take long time.
Step 203, for the target location information subset at least two target location information subsets, it is based on heuristic calculation
Method solves the vehicle scheduling scheme for being directed to the target location information subset.
In the present embodiment, for each in at least two target location information subsets that are divided in step 202
A target location information subset, executing subject can solve the vehicle for being directed to the target location information subset based on heuritic approach
Scheduling scheme.Wherein, the vehicle scheduling scheme solved may include the travel route and target of the vehicle of at least one vehicle
Site identifications sequence.Herein, target location mark sequence can be used for characterizing vehicle required visit along travel route driving process
The sequence for each target location asked.Herein, above-mentioned heuritic approach can include but is not limited to genetic algorithm, simulated annealing
Algorithm, ant group algorithm, tabu search algorithm etc..It should be noted that solving vehicle scheduling scheme based on heuritic approach
Technology is the well-known technique studied and applied extensively at present, therefore which is not described herein again.
In some optional implementations of the present embodiment, above-mentioned solved based on heuritic approach is directed to the target location
The vehicle scheduling scheme of information subset, can specifically include the following contents:
Firstly, above-mentioned executing subject can receive model setting parameter and algorithm parameter, wherein parameter is arranged in above-mentioned model
It may include cost function and constraint condition, above-mentioned algorithm parameter may include the number of iterations.Then, above-mentioned executing subject can be with
Use above-mentioned cost function and above-mentioned constraint condition founding mathematical models.Finally, above-mentioned executing subject can use above-mentioned algorithm
Parameter and heuritic approach solve above-mentioned mathematical model, obtain vehicle scheduling scheme, wherein obtained vehicle scheduling side
Case includes the vehicle line and target location mark sequence of vehicle.
Herein, cost function can be used to indicate that the outstanding degree of vehicle scheduling scheme.For example, the value of cost function is got over
It is small, indicate that the outstanding degree of vehicle scheduling scheme is higher.In practice, cost function can be set according to actual needs.Example
Such as, following one can be set as cost function: 1) vehicle driving total distance, indicate it is all participate in scheduling vehicle drivings away from
The sum of from；2) vehicle number is used, indicates the total quantity for participating in the vehicle of scheduling；3) vehicle distances are very poor, indicate vehicle scheduling side
Mileage in case between operating range longest and the shortest vehicle of operating range is poor, and the value is smaller, represents the vehicle scheduling scheme
The load balancing in fleet can more be taken into account.In addition, the superior and inferior evaluating index of some vehicle scheduling scheme can also include but unlimited
In the following contents: average weight charging ratio, average volume charging ratio.Wherein, the weight of average weight charging ratio, single vehicle loads
Rate is ratio of the sum of the goods weight for transporting order with vehicle weight limitation, average value that is average then being each car weight charging ratio,
This index is higher, and scheme is more excellent.Average volume charging ratio, the volumetric loading rate of single vehicle be transport order measurement of cargo it
With the ratio with vehicular container nominal volume, then it is averaged to the volumetric loading rate of all vehicles, the higher expression of this index
Scheme is more outstanding.
Constraint condition can be used to indicate that every limitation for solving vehicle scheduling scheme, often with inequality or equation
Form occur.In practice, constraint condition can be set according to actual needs, for example, following one or more works can be set
For constraint condition: the vehicle for participating in scheduling is no more than vehicle fleet, and each target location can only be primary by a vehicle access, cargo
Time windows constraints, vehicle loading capacity constraint, priority restrictions of goods delivery etc..
It in practical applications, can be with after above-mentioned executing subject utilization cost function and constraint condition founding mathematical models
Mathematical model is solved using algorithm parameter and heuritic approach.In solution procedure, it can be determined that whether the number of iterations
Reach the number of iterations included by algorithm parameter or whether implementing result meets cut-off condition, if the number of iterations reaches algorithm ginseng
The included the number of iterations of number or implementing result meet cut-off condition, then export vehicle scheduling scheme.Wherein, section of implementing result
Only condition can be according to the demand flexible setting of practical application scene, for example, the cut-off condition of implementing result may include vehicle
The value of the cost function of scheduling scheme is less than a certain numerical value.
In some optional implementations, above-mentioned cost function can be totle drilling cost, wherein above-mentioned totle drilling cost is by route
Total travel distance, the depreciable cost of vehicle is calculated on the unit mileage cost of route and route.As an example it is supposed that
Totle drilling cost is cost, then the calculation formula of cost can be as shown in formula (2)；
Wherein, route_distanceiIndicate the total travel distance on i-th line road, unit_costiIndicate i-th line road
The unit mileage cost of upper vehicle, fixed_costiIndicate the depreciation of fixed assets cost of i-th line road vehicle, n indicates total line
Number amount.
Step 204, merge at least two vehicle scheduling schemes obtained at least two target location information subsets, obtain
Vehicle scheduling scheme after to merging.
In the present embodiment, executing subject can merge for above-mentioned at least two target locations information subset obtain to
Few two vehicle scheduling schemes, the vehicle scheduling scheme after being merged.As an example, for each target location information
Collect, the set of the available solution of executing subject, includes the vehicle line and target of at least one vehicle in the set of the solution
Site identifications sequence merges the set of the solution of each target location information subset, and the vehicle tune after merging can be obtained
Degree scheme.
Step 205, it is dispatched the vehicle scheduling scheme after merging as the initial vehicle for target location information aggregate
Scheme optimizes initial vehicle scheduling scheme based on heuritic approach, obtains for the final of target location information aggregate
Vehicle scheduling scheme.
In the present embodiment, above-mentioned executing subject can will step 204 merge after obtain vehicle scheduling scheme as being directed to
The initial vehicle scheduling scheme of target location information aggregate, and above-mentioned initial vehicle scheduling scheme is carried out based on heuritic approach
Optimization, to obtain the final vehicle scheduling scheme for target location information aggregate.As an example, executing subject can will be upper
Initial vehicle scheduling scheme is stated as the initial solution for being directed to target location information aggregate, and since the initial solution, uses inspiration
Formula algorithm iteration optimizing, to obtain the final vehicle scheduling scheme for target location information aggregate.It should be noted that this
Heuritic approach used in heuritic approach used in locating and step 203 can be identical, also cannot be different, herein not
It limits.
With continued reference to the signal that Fig. 3, Fig. 3 are according to the application scenarios of the method for generating information of the present embodiment
Figure.In the application scenarios of Fig. 3, user inputs target location information aggregate and subset upper limit value to terminal device 301 first,
In, target location information aggregate includes the mark of target location: S1, S2, S3, S4, S5, S6, S7, S8, S9 and S10.Secondly, ringing
Subset upper limit value should be greater than in determining the quantity of target location information in target location information aggregate, terminal device 301 can incite somebody to action
Target location information aggregate be divided into two target location information subsets { S1, S2, S4, S5, S9 } and S3, S6, S7, S8,
S10}.Later, for each of two target location information subsets target location information subset, terminal device 301 can be with
The vehicle scheduling scheme for being directed to the target location information subset is solved based on heuritic approach.For target location information subset
{ S1, S2, S4, S5, S9 } obtains vehicle scheduling scheme: route L1 and target location mark sequence S1, S4, S5 of vehicle A, vehicle
The route L2 and target location of B identifies sequence S2, S9.Vehicle is obtained for target location information subset { S3, S6, S7, S8, S10 }
Scheduling scheme: the route L3 and target location of vehicle C identifies sequence S3, S6, S8, S10, S7.Then, merge and be directed to two mesh
The obtained two vehicle scheduling schemes of mark location information subset, the vehicle scheduling scheme after being merged: the route L1 of vehicle A with
Target location identifies sequence S1, S4, S5, and the route L2 and target location of vehicle B identify sequence S2, S9, the route L3 of vehicle C and
Target location identifies sequence S3, S6, S8, S10, S7.Finally, terminal device 301 is using the vehicle scheduling scheme after merging as needle
To the initial vehicle scheduling scheme of target location information aggregate, initial vehicle scheduling scheme is carried out based on heuritic approach excellent
Change, obtains the final vehicle scheduling scheme for target location information aggregate.
The method provided by the above embodiment of the application, by dividing target location information aggregate, then based on opening
Hairdo algorithm solves the vehicle scheduling scheme of each target location information subset for dividing and obtaining, and will solve obtain it is multiple
After vehicle scheduling scheme merges, using the vehicle scheduling scheme after merging as the initial vehicle for being directed to target location information aggregate
Scheduling scheme, reuses heuritic approach and optimizes to initial vehicle scheduling scheme, obtains for target location information
The final vehicle scheduling scheme of set.It is multiple subproblems to which PROBLEM DECOMPOSITION will be dispensed on a large scale, and by multiple subproblems
Solution merge after initial solution as mass distribution problem, which can greatly accelerate to open as a more excellent solution
Hairdo algorithm is directed to speed when mass distribution problem solving, and can guarantee final vehicle scheduling scheme generated more
Add outstanding.
With further reference to Fig. 4, it illustrates the processes 400 of another embodiment of the method for generating information.The use
In the process 400 for the method for generating information, comprising the following steps:
Step 401, target location information aggregate and subset upper limit value are received.
In the present embodiment, step 401 is similar with step 201 principle in embodiment illustrated in fig. 2, and details are not described herein again.
Step 402, in response to determining that the quantity of target location information in target location information aggregate is greater than subset upper limit value,
Target location information aggregate is divided at least two target location information subsets.
In the present embodiment, step 402 is similar with step 202 principle in embodiment illustrated in fig. 2, and details are not described herein again.
Step 403, heuritic approach, target location information at least two target location information subset of Parallel implementation are based on
The vehicle scheduling scheme of subset.
In the present embodiment, at least two target location information subset obtained in step 402.Above-mentioned executing subject
It can be based on heuritic approach, the vehicle scheduling scheme of at least two target location information subset of Parallel implementation.As an example, holding
Row main body can create the thread pool of K thread first, then create the algorithm examples of K heuritic approach, then will be each
Target location information subset respectively as each heuritic approach example input, by each heuritic approach example of K in K thread
Upper parallel execution, to obtain the vehicle scheduling scheme of K target location information subset.
Step 404, merge at least two vehicle scheduling schemes obtained at least two target location information subsets, obtain
Vehicle scheduling scheme after to merging.
In the present embodiment, step 404 is similar with step 204 principle in embodiment illustrated in fig. 2, and details are not described herein again.
Step 405, it is dispatched the vehicle scheduling scheme after merging as the initial vehicle for target location information aggregate
Scheme optimizes initial vehicle scheduling scheme based on heuritic approach, obtains for the final of target location information aggregate
Vehicle scheduling scheme.
In the present embodiment, step 405 is similar with step 205 principle in embodiment illustrated in fig. 2, and details are not described herein again.
Figure 4, it is seen that the method for generating information compared with the corresponding embodiment of Fig. 2, in the present embodiment
Process 400 the step of highlighting the vehicle scheduling scheme of at least two target location information subset of Parallel implementation.This reality as a result,
The scheme for applying example description can reduce the time for solving the vehicle scheduling scheme of at least two target location information subsets, to make
The speed that final vehicle scheduling scheme must be solved is further speeded up.
With further reference to Fig. 5, as the realization to method shown in above-mentioned each figure, this application provides one kind for generating letter
One embodiment of the device of breath, the Installation practice is corresponding with embodiment of the method shown in Fig. 2, which can specifically answer
For in various electronic equipments.
As shown in figure 5, the device 500 for generating information of the present embodiment includes: the first receiving unit 501, divides list
Member 502 solves unit 503, combining unit 504 and optimization unit 505.First receiving unit 501 is with being configured to receive target
Point information aggregate and subset upper limit value, wherein the target location information in above-mentioned target location information aggregate includes target location
Mark；Division unit 502 is configured in response to determine the quantity of target location information in above-mentioned target location information aggregate
Greater than above-mentioned subset upper limit value, above-mentioned target location information aggregate is divided at least two target location information subsets；It solves
Unit 503 is configured to be based on heuristic calculation for the target location information subset at least two target location information subsets
Method solves the vehicle scheduling scheme for being directed to the target location information subset, wherein vehicle scheduling scheme includes the driving line of vehicle
Road and target location identify sequence；Combining unit 504 is configured to merge and obtain at least two target location information subsets
At least two vehicle scheduling schemes, the vehicle scheduling scheme after being merged；After optimization unit 505 is configured to merge
Vehicle scheduling scheme is as the initial vehicle scheduling scheme for being directed to above-mentioned target location information aggregate, based on heuritic approach to upper
It states initial vehicle scheduling scheme to optimize, obtains the final vehicle scheduling scheme for above-mentioned target location information aggregate.
In the present embodiment, for generating the first receiving unit 501 of the device 500 of information, division unit 502, solving
Unit 503, the specific processing of combining unit 504 and optimization unit 505 and its brought technical effect can refer to Fig. 2 pairs respectively
The related description of step 201 in embodiment, step 202, step 203, step 204 and step 205 is answered, details are not described herein.
In some optional implementations of the present embodiment, above-mentioned division unit 502 comprises determining that subelement (in figure
It is not shown), it is configured to determine the division numbers of target location information subset according to above-mentioned subset upper limit value；Divide subelement
(not shown) is configured to draw above-mentioned target location information aggregate based on above-mentioned division numbers and clustering algorithm
Point, obtain above-mentioned division numbers target location information subset.
In some optional implementations of the present embodiment, above-mentioned determining subelement is further configured to: in determination
State the ratio of the quantity of target location information and above-mentioned subset upper limit value in target location information aggregate, and to above-mentioned ratio to
Lower rounding, obtains the first value；Division numbers by the sum of above-mentioned first value and preset value as target location information subset.
In some optional implementations of the present embodiment, above-mentioned apparatus 500 further include: the second receiving unit is (in figure
It is not shown), it is configured to receive subset lower limit value, wherein above-mentioned subset lower limit value is less than or equal to above-mentioned subset upper limit value；It holds
Row unit (not shown) is configured to for the target location in obtained above-mentioned at least two target locations information subset
Information subset executes following steps: by the quantity of target location information in the target location information subset respectively and under above-mentioned subset
Limit value and above-mentioned subset upper limit value compare；In response to determining the quantity of target location information in the target location information subset
Greater than above-mentioned subset upper limit value, which is divided；In response to determining the target location information subset
The quantity of middle target location information is less than above-mentioned subset lower limit value, which is merged into other target locations
Information subset.
In some optional implementations of the present embodiment, above-mentioned solution unit 503 is further configured to: based on opening
Hairdo algorithm, the vehicle scheduling scheme of target location information subset at least two target location information subset of Parallel implementation.
In some optional implementations of the present embodiment, above-mentioned solution unit 503 is further configured to: receiving mould
Parameter and algorithm parameter is arranged in type, wherein above-mentioned model setting parameter includes cost function and constraint condition, above-mentioned algorithm parameter
Including the number of iterations；Use above-mentioned cost function and above-mentioned constraint condition founding mathematical models；Using above-mentioned algorithm parameter and open
Hairdo algorithm solves above-mentioned mathematical model, obtains vehicle scheduling scheme, wherein obtained vehicle scheduling scheme includes vehicle
Vehicle line and target location identify sequence.
In some optional implementations of the present embodiment, above-mentioned cost function is totle drilling cost, wherein above-mentioned totle drilling cost
It is calculated by the depreciable cost of vehicle on the total travel distance of route, the unit mileage cost of route and route.
Below with reference to Fig. 6, it illustrates the knots of the computer system 600 for the equipment for being suitable for being used to realize the embodiment of the present application
Structure schematic diagram.Equipment shown in Fig. 6 is only an example, should not function to the embodiment of the present application and use scope bring and appoint
What is limited.
As shown in fig. 6, computer system 600 includes central processing unit (CPU) 601, it can be read-only according to being stored in
Program in memory (ROM) 602 or be loaded into the program in random access storage device (RAM) 603 from storage section 608 and
Execute various movements appropriate and processing.In RAM 603, also it is stored with system 600 and operates required various programs and data.
CPU 601, ROM 602 and RAM 603 are connected with each other by bus 604.Input/output (I/O) interface 605 is also connected to always
Line 604.
I/O interface 605 is connected to lower component: the importation 606 including keyboard, mouse etc.；It is penetrated including such as cathode
The output par, c 607 of spool (CRT), liquid crystal display (LCD) etc. and loudspeaker etc.；Storage section 608 including hard disk etc.；
And the communications portion 609 of the network interface card including LAN card, modem etc..Communications portion 609 via such as because
The network of spy's net executes communication process.Driver 610 is also connected to I/O interface 605 as needed.Detachable media 611, such as
Disk, CD, magneto-optic disk, semiconductor memory etc. are mounted on as needed on driver 610, in order to read from thereon
Computer program be mounted into storage section 608 as needed.
Particularly, in accordance with an embodiment of the present disclosure, it may be implemented as computer above with reference to the process of flow chart description
Software program.For example, embodiment of the disclosure includes a kind of computer program product comprising be carried on computer-readable medium
On computer program, which includes the program code for method shown in execution flow chart.In such reality
It applies in example, which can be downloaded and installed from network by communications portion 609, and/or from detachable media
611 are mounted.When the computer program is executed by central processing unit (CPU) 601, limited in execution the present processes
Above-mentioned function.
It should be noted that computer-readable medium described herein can be computer-readable signal media or meter
Calculation machine readable storage medium storing program for executing either the two any combination.Computer readable storage medium for example can be --- but not
Be limited to --- electricity, magnetic, optical, electromagnetic, infrared ray or semiconductor system, device or device, or any above combination.Meter
The more specific example of calculation machine readable storage medium storing program for executing can include but is not limited to: have the electrical connection, just of one or more conducting wires
Taking formula computer disk, hard disk, random access storage device (RAM), read-only memory (ROM), erasable type may be programmed read-only storage
Device (EPROM or flash memory), optical fiber, portable compact disc read-only memory (CD-ROM), light storage device, magnetic memory device,
Or above-mentioned any appropriate combination.In this application, computer readable storage medium can be it is any include or storage journey
The tangible medium of sequence, the program can be commanded execution system, device or device use or in connection.And at this
In application, computer-readable signal media may include in a base band or as carrier wave a part propagate data-signal,
Wherein carry computer-readable program code.The data-signal of this propagation can take various forms, including but unlimited
In electromagnetic signal, optical signal or above-mentioned any appropriate combination.Computer-readable signal media can also be that computer can
Any computer-readable medium other than storage medium is read, which can send, propagates or transmit and be used for
By the use of instruction execution system, device or device or program in connection.Include on computer-readable medium
Program code can transmit with any suitable medium, including but not limited to: wireless, electric wire, optical cable, RF etc. are above-mentioned
Any appropriate combination.
The calculating of the operation for executing the application can be write with one or more programming languages or combinations thereof
Machine program code, described program design language include object oriented program language-such as Java, Smalltalk, C+
+, it further include conventional procedural programming language-such as " C " language or similar programming language.Program code can
Fully to execute, partly execute on the user computer on the user computer, be executed as an independent software package,
Part executes on the remote computer or executes on a remote computer or server completely on the user computer for part.
In situations involving remote computers, remote computer can pass through the network of any kind --- including local area network (LAN)
Or wide area network (WAN)-is connected to subscriber computer, or, it may be connected to outer computer (such as utilize Internet service
Provider is connected by internet).
Flow chart and block diagram in attached drawing are illustrated according to the system of the various embodiments of the application, method and computer journey
The architecture, function and operation in the cards of sequence product.In this regard, each box in flowchart or block diagram can generation
A part of one module, program segment or code of table, a part of the module, program segment or code include one or more use
The executable instruction of the logic function as defined in realizing.It should also be noted that in some implementations as replacements, being marked in box
The function of note can also occur in a different order than that indicated in the drawings.For example, two boxes succeedingly indicated are actually
It can be basically executed in parallel, they can also be executed in the opposite order sometimes, and this depends on the function involved.Also it to infuse
Meaning, the combination of each box in block diagram and or flow chart and the box in block diagram and or flow chart can be with holding
The dedicated hardware based system of functions or operations as defined in row is realized, or can use specialized hardware and computer instruction
Combination realize.
Being described in unit involved in the embodiment of the present application can be realized by way of software, can also be by hard
The mode of part is realized.Described unit also can be set in the processor, for example, can be described as: a kind of processor packet
It includes the first receiving unit, division unit, solve unit, combining unit and optimization unit.Wherein, the title of these units is at certain
In the case of do not constitute restriction to the unit itself, for example, the first receiving unit is also described as " receiving target location
The unit of information aggregate and subset upper limit value ".
As on the other hand, present invention also provides a kind of computer-readable medium, which be can be
Included in device described in above-described embodiment；It is also possible to individualism, and without in the supplying device.Above-mentioned calculating
Machine readable medium carries one or more program, when said one or multiple programs are executed by the device, so that should
Device: target location information aggregate and subset upper limit value are received, wherein the target location letter in above-mentioned target location information aggregate
Breath includes the mark of target location；In response to target location information in the above-mentioned target location information aggregate of determination quantity be greater than it is upper
Subset upper limit value is stated, above-mentioned target location information aggregate is divided at least two target location information subsets；For at least two
Target location information subset in a target location information subset is solved based on heuritic approach for target location information
The vehicle scheduling scheme of collection, wherein vehicle scheduling scheme includes the vehicle line and target location mark sequence of vehicle；Merge needle
Vehicle scheduling side at least two vehicle scheduling schemes that at least two target location information subsets obtain, after being merged
Case；Using the vehicle scheduling scheme after merging as the initial vehicle scheduling scheme for being directed to above-mentioned target location information aggregate, it is based on
Heuritic approach optimizes above-mentioned initial vehicle scheduling scheme, obtains the final vehicle for above-mentioned target location information aggregate
Scheduling scheme.
Above description is only the preferred embodiment of the application and the explanation to institute's application technology principle.Those skilled in the art
Member is it should be appreciated that invention scope involved in the application, however it is not limited to technology made of the specific combination of above-mentioned technical characteristic
Scheme, while should also cover in the case where not departing from foregoing invention design, it is carried out by above-mentioned technical characteristic or its equivalent feature
Any combination and the other technical solutions formed.Such as features described above has similar function with (but being not limited to) disclosed herein
Can technical characteristic replaced mutually and the technical solution that is formed.
Claims (16)
1. a kind of method for generating information, comprising:
Receive target location information aggregate and subset upper limit value, wherein the target location letter in the target location information aggregate
Breath includes the mark of target location；
It is greater than the subset upper limit value in response to the quantity of target location information in the determination target location information aggregate, by institute
It states target location information aggregate and is divided at least two target location information subsets；
For the target location information subset at least two target location information subsets, solves to be directed to based on heuritic approach and be somebody's turn to do
The vehicle scheduling scheme of target location information subset, wherein vehicle scheduling scheme includes the vehicle line and target location of vehicle
Identify sequence；
Merge at least two vehicle scheduling schemes obtained at least two target location information subsets, the vehicle after being merged
Scheduling scheme；
Using the vehicle scheduling scheme after merging as the initial vehicle scheduling scheme for being directed to the target location information aggregate, it is based on
Heuritic approach optimizes the initial vehicle scheduling scheme, obtains the final vehicle for the target location information aggregate
Scheduling scheme.
2. described that the target location information aggregate is divided at least two mesh according to the method described in claim 1, wherein
Mark location information subset, comprising:
The division numbers of target location information subset are determined according to the subset upper limit value；
The target location information aggregate is divided based on the division numbers and clustering algorithm, obtains the division numbers
A target location information subset.
3. described to determine target location information subset according to the subset upper limit value according to the method described in claim 2, wherein
Division numbers, comprising:
Determine in the target location information aggregate ratio of the quantity of target location information and the subset upper limit value and right
The ratio is rounded downwards, obtains the first value；
Division numbers by the sum of first value and preset value as target location information subset.
4. according to the method described in claim 2, wherein, the method also includes:
Receive subset lower limit value, wherein the subset lower limit value is less than or equal to the subset upper limit value；And
After the target location information aggregate is divided at least two target location information subsets, the method is also wrapped
It includes:
Following steps are executed for the target location information subset in the obtained at least two target locations information subset: will
In the target location information subset quantity of target location information respectively with the subset lower limit value and the subset upper limit value into
Row comparison；It is right in response to determining that the quantity of target location information in the target location information subset is greater than the subset upper limit value
The target location information subset is divided；Quantity in response to determining target location information in the target location information subset is small
In the subset lower limit value, which is merged into other target location information subsets.
5. according to the method described in claim 1, wherein, the mesh in at least two target locations information subset
Location information subset is marked, the vehicle scheduling scheme for being directed to the target location information subset is solved based on heuritic approach, comprising:
Based on heuritic approach, the vehicle tune of target location information subset at least two target location information subset of Parallel implementation
Degree scheme.
6. according to the method described in claim 1, wherein, described solved based on heuritic approach is directed to target location information
The vehicle scheduling scheme of collection, comprising:
Receive model setting parameter and algorithm parameter, wherein the model setting parameter includes cost function and constraint condition, institute
Stating algorithm parameter includes the number of iterations；
Use the cost function and the constraint condition founding mathematical models；
The mathematical model is solved using the algorithm parameter and heuritic approach, obtains vehicle scheduling scheme, wherein
Obtained vehicle scheduling scheme includes the vehicle line and target location mark sequence of vehicle.
7. according to the method described in claim 6, wherein, the cost function is totle drilling cost, wherein the totle drilling cost is by route
Total travel distance, the depreciable cost of vehicle is calculated on the unit mileage cost of route and route.
8. a kind of for generating the device of information, comprising:
First receiving unit is configured to receive target location information aggregate and subset upper limit value, wherein the target location letter
Target location information in breath set includes the mark of target location；
Division unit is configured in response to determine that the quantity of target location information in the target location information aggregate is greater than institute
Subset upper limit value is stated, the target location information aggregate is divided at least two target location information subsets；
Unit is solved, is configured to for the target location information subset at least two target location information subsets, based on opening
Hairdo algorithm solves the vehicle scheduling scheme for being directed to the target location information subset, wherein vehicle scheduling scheme includes vehicle
Vehicle line and target location identify sequence；
Combining unit is configured to merge at least two vehicle scheduling sides obtained at least two target location information subsets
Case, the vehicle scheduling scheme after being merged；
Optimize unit, the vehicle scheduling scheme after being configured to merge is as the initial of the target location information aggregate
Vehicle scheduling scheme optimizes the initial vehicle scheduling scheme based on heuritic approach, obtains for the target
The final vehicle scheduling scheme of point information aggregate.
9. device according to claim 8, wherein the division unit includes:
It determines subelement, is configured to determine the division numbers of target location information subset according to the subset upper limit value；
Subelement is divided, is configured to draw the target location information aggregate based on the division numbers and clustering algorithm
Point, obtain the division numbers target location information subset.
10. device according to claim 9, wherein the determining subelement is further configured to:
Determine in the target location information aggregate ratio of the quantity of target location information and the subset upper limit value and right
The ratio is rounded downwards, obtains the first value；
Division numbers by the sum of first value and preset value as target location information subset.
11. device according to claim 9, wherein described device further include:
Second receiving unit is configured to receive subset lower limit value, wherein the subset lower limit value is less than or equal to the subset
Upper limit value；
Execution unit is configured to for target location information in the obtained at least two target locations information subset
Collection execute following steps: by the quantity of target location information in the target location information subset respectively with the subset lower limit value and
The subset upper limit value compares；In response to determining that the quantity of target location information in the target location information subset is greater than institute
Subset upper limit value is stated, which is divided；In response to determining target in the target location information subset
The quantity of location information is less than the subset lower limit value, which is merged into other target location information
Collection.
12. device according to claim 8, wherein the solution unit is further configured to:
Based on heuritic approach, the vehicle tune of target location information subset at least two target location information subset of Parallel implementation
Degree scheme.
13. device according to claim 8, wherein the solution unit is further configured to:
Receive model setting parameter and algorithm parameter, wherein the model setting parameter includes cost function and constraint condition, institute
Stating algorithm parameter includes the number of iterations；
Use the cost function and the constraint condition founding mathematical models；
The mathematical model is solved using the algorithm parameter and heuritic approach, obtains vehicle scheduling scheme, wherein
Obtained vehicle scheduling scheme includes the vehicle line and target location mark sequence of vehicle.
14. device according to claim 13, wherein the cost function is totle drilling cost, wherein the totle drilling cost is by line
The depreciable cost of vehicle is calculated on the total travel distance on road, the unit mileage cost of route and route.
15. a kind of equipment, comprising:
One or more processors；
Storage device is stored thereon with one or more programs,
When one or more of programs are executed by one or more of processors, so that one or more of processors are real
The now method as described in any in claim 1-7.
16. a kind of computer-readable medium, is stored thereon with computer program, wherein real when described program is executed by processor
The now method as described in any in claim 1-7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811101727.3A CN109345166B (en) | 2018-09-20 | 2018-09-20 | Method and apparatus for generating information |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811101727.3A CN109345166B (en) | 2018-09-20 | 2018-09-20 | Method and apparatus for generating information |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109345166A true CN109345166A (en) | 2019-02-15 |
| CN109345166B CN109345166B (en) | 2022-04-22 |
Family
ID=65306301
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811101727.3A Active CN109345166B (en) | 2018-09-20 | 2018-09-20 | Method and apparatus for generating information |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109345166B (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111126688A (en) * | 2019-12-19 | 2020-05-08 | 北京顺丰同城科技有限公司 | Distribution route determining method and device, electronic equipment and readable storage medium |
| CN111461430A (en) * | 2020-03-31 | 2020-07-28 | 北京百度网讯科技有限公司 | Method and device for generating route information |
| CN111784045A (en) * | 2020-06-29 | 2020-10-16 | 北京百度网讯科技有限公司 | Method, device, equipment and storage medium for optimizing delivery vehicle |
| CN112650794A (en) * | 2020-12-30 | 2021-04-13 | 北京嘀嘀无限科技发展有限公司 | Position data processing method and device, electronic equipment and storage medium |
| CN113762577A (en) * | 2020-12-24 | 2021-12-07 | 北京京东振世信息技术有限公司 | Site determination method, device, equipment and computer readable storage medium |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8352382B1 (en) * | 2008-08-15 | 2013-01-08 | Amazon Technologies, Inc. | Heuristic methods for customer order fulfillment planning |
| CN103699982A (en) * | 2013-12-26 | 2014-04-02 | 浙江工业大学 | Logistics distribution control method with soft time windows |
| CN104951850A (en) * | 2015-06-25 | 2015-09-30 | 广东工业大学 | Method for solving multiple-depot logistics transportation vehicle routing problem |
| CN108108883A (en) * | 2017-12-13 | 2018-06-01 | 西安交通大学 | A kind of vehicle scheduling network resilience based on clustering algorithm simplifies method |
-
2018
- 2018-09-20 CN CN201811101727.3A patent/CN109345166B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8352382B1 (en) * | 2008-08-15 | 2013-01-08 | Amazon Technologies, Inc. | Heuristic methods for customer order fulfillment planning |
| CN103699982A (en) * | 2013-12-26 | 2014-04-02 | 浙江工业大学 | Logistics distribution control method with soft time windows |
| CN104951850A (en) * | 2015-06-25 | 2015-09-30 | 广东工业大学 | Method for solving multiple-depot logistics transportation vehicle routing problem |
| CN108108883A (en) * | 2017-12-13 | 2018-06-01 | 西安交通大学 | A kind of vehicle scheduling network resilience based on clustering algorithm simplifies method |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111126688A (en) * | 2019-12-19 | 2020-05-08 | 北京顺丰同城科技有限公司 | Distribution route determining method and device, electronic equipment and readable storage medium |
| CN111126688B (en) * | 2019-12-19 | 2023-05-26 | 北京顺丰同城科技有限公司 | Distribution route determining method, distribution route determining device, electronic equipment and readable storage medium |
| CN111461430A (en) * | 2020-03-31 | 2020-07-28 | 北京百度网讯科技有限公司 | Method and device for generating route information |
| CN111784045A (en) * | 2020-06-29 | 2020-10-16 | 北京百度网讯科技有限公司 | Method, device, equipment and storage medium for optimizing delivery vehicle |
| CN111784045B (en) * | 2020-06-29 | 2023-09-22 | 北京百度网讯科技有限公司 | Optimization method, device, equipment and storage medium for delivery vehicle |
| CN113762577A (en) * | 2020-12-24 | 2021-12-07 | 北京京东振世信息技术有限公司 | Site determination method, device, equipment and computer readable storage medium |
| CN113762577B (en) * | 2020-12-24 | 2023-09-26 | 北京京东振世信息技术有限公司 | Site determining method, device, equipment and computer readable storage medium |
| CN112650794A (en) * | 2020-12-30 | 2021-04-13 | 北京嘀嘀无限科技发展有限公司 | Position data processing method and device, electronic equipment and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109345166B (en) | 2022-04-22 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109345166A (en) | Method and apparatus for generating information | |
| CN109003028A (en) | Method and apparatus for dividing logistics region | |
| CN109426885A (en) | Order allocation method and device | |
| CN108985694A (en) | Method and apparatus for determining home-delivery center address | |
| CN107908740A (en) | Information output method and device | |
| CN109647719A (en) | Method and apparatus for sorting cargo | |
| CN109840648A (en) | Method and apparatus for exporting bit information | |
| CN111366160A (en) | Path planning method, path planning device and terminal equipment | |
| CN110443533A (en) | Commodity divide storehouse storage method, device, electronic equipment and computer-readable medium | |
| CN110555640A (en) | Method and device for route planning | |
| CN109947565A (en) | Method and apparatus for distributing calculating task | |
| CN108492068A (en) | Method and apparatus for path planning | |
| CN109544076A (en) | Method and apparatus for generating information | |
| CN111178810B (en) | Method and device for generating information | |
| CN110348771A (en) | The method and apparatus that a kind of pair of order carries out group list | |
| CN109919167A (en) | Goods sorting method and apparatus, the goods sorting system of sortation hubs | |
| CN109685589A (en) | Method and apparatus for pushed information | |
| CN113128744A (en) | Distribution planning method and device | |
| CN113259144A (en) | Storage network planning method and device | |
| CN109902986A (en) | Method and apparatus for output information | |
| CN109242551A (en) | Sales lead management method, device, medium and electronic equipment based on block chain | |
| CN111428925B (en) | Method and device for determining distribution route | |
| CN110222860A (en) | A kind of method and apparatus for the dispatching storehouse list generating order | |
| CN109934427A (en) | The method and apparatus for generating article allocation plan | |
| CN109978213A (en) | A kind of task path planning 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 |