CN108921353A - A kind of optimization method, device and the electronic equipment of parking lot dispatching - Google Patents
A kind of optimization method, device and the electronic equipment of parking lot dispatching Download PDFInfo
- Publication number
- CN108921353A CN108921353A CN201810738287.6A CN201810738287A CN108921353A CN 108921353 A CN108921353 A CN 108921353A CN 201810738287 A CN201810738287 A CN 201810738287A CN 108921353 A CN108921353 A CN 108921353A
- Authority
- CN
- China
- Prior art keywords
- client
- parking lot
- collating sequence
- customers
- sequence
- 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/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
-
- 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
Landscapes
- Business, Economics & Management (AREA)
- Engineering & Computer Science (AREA)
- Human Resources & Organizations (AREA)
- Economics (AREA)
- Strategic Management (AREA)
- Entrepreneurship & Innovation (AREA)
- Quality & Reliability (AREA)
- Operations Research (AREA)
- Marketing (AREA)
- Development Economics (AREA)
- Tourism & Hospitality (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Game Theory and Decision Science (AREA)
- Educational Administration (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The present embodiments relate to logistics technology, disclose the optimization method, device and electronic equipment of a kind of vehicle delivery.In the present invention, the optimization method of vehicle delivery includes：Determine client's collating sequence in the customers and customers serviced required for parking lot；Adjust client's collating sequence in customers；Client's collating sequence adjusted is assessed, determines final client's collating sequence；The distribution project of vehicle in parking lot is determined according to final client's collating sequence；Control vehicle is transported according to determining distribution project.By determining the customers of service required for departure yard, and it is adjusted according to initial client's collating sequence, assesses final client's collating sequence for being determined to determine reasonable parking lot distribution project.It is transported by control vehicle according to determining parking lot distribution project, to reduce the cost of parking lot transport and improve conevying efficiency.
Description
Technical field
The present embodiments relate to logistics technology, in particular to a kind of optimization method, device and the electricity of parking lot dispatching
Sub- equipment.
Background technique
With the fast development of e-commerce, the quantity of shopping online client is increasing, therefore the package of logistics distribution
Quantity sharply increases, and horizontal to logistics service more stringent requirements are proposed.Shopping online customer complaint is concentrated mainly on package and prolongs
Slow and terminal delivery service.Therefore, last one kilometer distribution is extremely important for online shopping offering customers service.
At least there are the following problems in the prior art for inventor's discovery：Vehicle in parking lot (home-delivery center) is mentioned for client
When for package delivery service, parking lot often none reasonable transport distribution project, cause transportation cost increase and
The reduction of conevying efficiency.
Summary of the invention
Optimization method, device and the electronic equipment for being designed to provide a kind of parking lot dispatching of embodiment of the present invention, energy
It enough determines the customers serviced required for departure yard, and is adjusted according to initial client's collating sequence, assesses and determine
Final client's collating sequence out determines reasonable parking lot distribution project, to reduce the cost of parking lot transport and mention
High conevying efficiency.
In order to solve the above technical problems, embodiments of the present invention provide a kind of optimization method of parking lot dispatching, including
Following steps：
Determine client's collating sequence in the customers and customers serviced required for parking lot；Adjust the visitor in customers
Family collating sequence；Client's collating sequence adjusted is assessed, determines final client's collating sequence；According to final visitor
Family collating sequence determines the distribution project of vehicle in parking lot；Control vehicle is transported according to determining distribution project.
Embodiments of the present invention additionally provide a kind of optimization device of parking lot dispatching, including：First determining module, is used for
Determine client's collating sequence in the customers and customers serviced required for parking lot；Module is adjusted, for adjusting visitor
Client's collating sequence in the group of family；Evaluation module determines final visitor for assessing client's collating sequence adjusted
Family collating sequence；Second determining module, for determining the distribution project of vehicle in parking lot according to final client's collating sequence；Fortune
Defeated module is transported for controlling vehicle according to determining distribution project.
Embodiments of the present invention additionally provide a kind of electronic equipment, including at least one processor；And at least one
The memory of a processor communication connection；Wherein, memory is stored with the instruction that can be executed by least one processor, instructs quilt
At least one processor executes, so that at least one processor is able to carry out the optimization method of above-mentioned parking lot dispatching.
Embodiments of the present invention additionally provide a kind of computer readable storage medium, are stored with computer program, calculate
Machine program realizes the optimization method of above-mentioned parking lot dispatching when being executed by processor.
Embodiment of the present invention in terms of existing technologies, by determine departure yard required for service customers, with
And be adjusted according to initial client's collating sequence, assess the final client's collating sequence determined, to determine to close
The parking lot distribution project of reason.It is transported by control vehicle according to determining parking lot distribution project, to reduce parking lot fortune
Defeated cost simultaneously improves conevying efficiency.
In addition, determine client's collating sequence in the customers and customers serviced required for parking lot, including：Using opening
Hairdo algorithm determines the customers serviced required for parking lot, and the client's sequence generated in customers at random according to customers is suitable
Sequence, wherein heuritic approach includes genetic algorithm or particle swarm algorithm.Departure yard can be quickly determined by heuritic approach
The customers of required service, and be initial order according to client's collating sequence that determining customers determine, it is subsequent adjustment
Client's collating sequence provides basis.
In addition, determining that the sequence of the client in the customers and customers of service required for parking lot is suitable using heuritic approach
Sequence, including：Each client is encoded；It is respective random that each client of initialization acquisition is carried out to each client after coding
Position numerical value；According to the respective random site numerical value of each client, the customers serviced required for parking lot are determined；And according to client
The random client's collating sequence generated in customers of group.
In addition, client's collating sequence in adjustment customers, including：Using the change neighborhood search of movement, exchange or reversing
Strategy is adjusted client's collating sequence in customers.Change neighborhood search is carried out by using movement, transformation and reversing,
It ensure that the diversity of client's collating sequence method of adjustment in customers.
In addition, assessing client's collating sequence adjusted, final client's collating sequence is determined, including：It calculates
The parking lot cost of the parking lot cost of client's collating sequence before adjustment and client's collating sequence adjusted；Judge visitor adjusted
Whether the parking lot cost of family collating sequence is less than the parking lot cost of client's collating sequence before adjustment, if so, by adjusted
Client's collating sequence is as final client's collating sequence, otherwise, using client's collating sequence before adjustment as final client
Collating sequence；Wherein, parking lot cost includes vehicle route cost, time violation punishment cost and capacity of carriage violation punishment cost.
By carrying out Cost comparisons to client's collating sequence before client's collating sequence adjusted and adjustment, client adjusted is arranged
The quality of sequence sequence is assessed, and the preferable client's collating sequence of quality is determined as final client according to assessment result and is arranged
Sequence sequence.
In addition, the distribution project of vehicle in parking lot is determined according to final client's collating sequence, including:According to final visitor
Family collating sequence determines the label of client, and the distribution project of vehicle in parking lot is determined according to the label of client.
In addition, the label of client includes：The vehicle driving of services client next time the pot life of stroke, client it is previous
Parking lot cost when vehicle transport in the index of a client, parking lot is to client.
Detailed description of the invention
One or more embodiments are illustrated by the picture in corresponding attached drawing, these exemplary theorys
The bright restriction not constituted to embodiment, the element in attached drawing with same reference numbers label are expressed as similar element, remove
Non- to have special statement, composition does not limit the figure in attached drawing.
Fig. 1 is the flow chart for the optimization method that parking lot dispenses in the application first embodiment；
Fig. 2 is the schematic diagram for becoming neighborhood search mode in the application first embodiment；
Fig. 3 is the flow chart for the optimization method that parking lot dispenses in the application second embodiment；
Fig. 4 is the block diagram for the optimization device that parking lot dispenses in the application 3rd embodiment；
Fig. 5 is the block diagram for the optimization device that parking lot dispenses in the application fourth embodiment；
Fig. 6 is the structural schematic diagram of electronic equipment in the 5th embodiment of the application.
Specific embodiment
In order to make the object, technical scheme and advantages of the embodiment of the invention clearer, below in conjunction with attached drawing to the present invention
Each embodiment be explained in detail.However, it will be understood by those skilled in the art that in each embodiment party of the present invention
In formula, in order to make the reader understand this application better, many technical details are proposed.But even if without these technical details
And various changes and modifications based on the following respective embodiments, the application technical solution claimed also may be implemented.
The first embodiment of the present invention is related to a kind of optimization methods of parking lot dispatching.Detailed process is as shown in Figure 1, include
Following steps：
Step 101, client's collating sequence in the customers and the customers serviced required for parking lot is determined.
Specifically, in the present embodiment, the customers of required service in parking lot can be determined using heuritic approach,
And generating client's collating sequence in customers at random according to customers, the heuritic approach in present embodiment includes that heredity is calculated
Method or particle swarm algorithm.
It wherein, is by being carried out to each client in the customers for determining service required for parking lot by heuritic approach
Coding carries out initialization to each client after coding and obtains each respective random site numerical value of client, according to each client
Respective random site numerical value determines the customers serviced required for parking lot.
At one in the specific implementation, determining the customers of service required for parking lot by particle swarm algorithm, if the number of client
Amount is N, and the quantity in parking lot is Dk, and the value of N is 10, DkValue be 2.By the way that each client is carried out to be encoded into particle,
Client after coding is initialized, particle is initialized, by determining that each client is respective to particle initialization
Random site numerical value, and the random site numerical value of each client is the decimal between (0,2).As shown in table 1 for volume
Random site number list obtained after each client initialization after code.
Table 1
Wherein, according to the respective random site numerical value of each client, the customers serviced required for parking lot are determined, for example,
According to table 1, the random site numeric distribution of client { 1,2,4,5,8 } [0,1) in, therefore distribute by parking lot { 0 } service.
The random site of client { 0,3,6,7 } be distributed in [1,2) in, therefore distribute and serviced by parking lot { 1 }, and parking lot { 0 } and parking lot
{ 1 } specific location and specific name is known.Therefore it is directed to a parking lot { 0 } having determined, can determine the vehicle
The customers that place needs to service are as shown in table 2 below.And after determining the customers serviced required for departure yard { 0 }, according to
The sequence of the random site numerical value of client from small to large arranges in customers, determines that client's sequence in customers is suitable
Sequence, as shown in table 3 below.
It should be noted that client's collating sequence in the customers according to determined by random site numerical value is in determination
It, can be on the basis of the initial order for an initial order of its distribution after the customers serviced required for departure yard
Client's collating sequence in customers is adjusted.
Table 2
| 1 | 2 | 4 | 5 | 8 |
| 0.65 | 0.37 | 0.91 | 0.29 | 0.42 |
Table 3
| 5 | 2 | 8 | 1 | 4 |
| 0.29 | 0.37 | 0.42 | 0.65 | 0.91 |
It should be noted that the client of service required for parking lot can also be determined in present embodiment by genetic algorithm
Group, but be by each encoder client into chromosome, and lead to when determining the customers of service required for parking lot by genetic algorithm
It crosses to initialize the client after coding and chromosome is initialized, by determining each client to chromosome initialization
Respective random site numerical value.And by genetic algorithm to chromosome initialized determined by random site numerical value be it is non-
Negative integer works as DkValue be 2 when, the random site numerical value of each client is only 0 and 1.Determine that random site is 0 visitor
Family, distribution are serviced by parking lot { 0 }, and the random site numerical value of client is 0 in the customers due to distributing to parking lot { 0 } service, institute
An initial order for passing through random alignment determination with client's collating sequence in parking lot { 0 } interior customers.It is initial suitable at this
Client's collating sequence in customers can be adjusted on the basis of sequence.
Step 102, client's collating sequence in customers is adjusted.
It specifically, specifically can be using movement, exchange and reversing when adjusting client's collating sequence in customers
Become neighborhood search mode, client's collating sequence in customers is adjusted respectively.
At one in the specific implementation, when determining that the customers serviced required for parking lot { 0 } and initial client sequence are suitable
Sequence is after { 2, Isosorbide-5-Nitrae, 5,8 }, as shown in Fig. 2, (a) is to be adjusted by move mode, expression is heavy from a position by client
New definition is to another position in client's collating sequence；(b) to be adjusted by exchanged form, expression exists two clients
Position is exchanged in client's collating sequence；(c) to be adjusted by inversion mode, a part in reverse client's collating sequence is indicated
The position of continuous client's collating sequence.
Step 103, the parking lot cost of client's collating sequence before adjustment and the vehicle of client's collating sequence adjusted are calculated
Field cost.
Wherein, it after client's collating sequence in adjustment customers, needs to comment client's collating sequence adjusted
Estimate, concrete mode be by adjusting preceding client's collating sequence parking lot cost and client's collating sequence adjusted parking lot at
Relationship between this is assessed.
It should be noted that dispensing according to a kind of client's collating sequence of determination can under a determining parking lot
To include multiple strokes：Assuming that d indicates parking lot, the client's collating sequence determined in the d of parking lot is { a, b, c }, then according to the determination
Client's collating sequence dispense, may include multiple strokes, be if any a stroke：d→a→b→c→d；There are two rows
Journey is respectively：D → a → b → d and d → c → d or d → a → d and d → b → c → d；It is respectively there are three stroke：d→a→
D, d → b → d and d → c → d.The process that vehicle returns to parking lot from parking lot again as can be seen from the above description is considered a row
Journey.Also, a parking lot may include more vehicles, parking lot in carrying out delivery process in the case where including multiple strokes, it is more
A stroke can be completed by a vehicle, can also be completed at the same time by more vehicles.Parking lot is not limited in the embodiment of the present application
The particular number of interior vehicle.
It should be noted that parking lot cost includes that vehicle route cost, time violation punishment cost and the capacity of carriage are punished in violation of rules and regulations
Penalize cost.Under determining client's collating sequence, shown in the following formula of parking lot cost (1)：
Wherein, SdIndicate determining client's collating sequence in the d of parking lot, ρ indicates the stroke in the d of parking lot, D (ρ) table
Show the travel distance of stroke ρ, TV (ρ) indicates that the time in stroke ρ measures in violation of rules and regulations, and LV (ρ) indicates that load of the vehicle in stroke ρ is disobeyed
Rule amount, WdIndicate the quantity of all available travels in the d of parking lot.Q indicates the car load upper limit, and θ indicates time penalty coefficient, λ table
Show capacity of carriage penalty coefficient, and θ and λ can be manually arranged automatically according to the actual situation.
It should be noted that if client's collating sequence before the adjustment determined is Wd1, the client adjusted that determines
Collating sequence is Wd2, then the parking lot cost C (S of client's collating sequence before adjustment can be determined according to formula (1)d1) and adjustment
The parking lot cost C (S of client's collating sequence afterwardsd2)。
Step 104, judge that client's sequence before whether the parking lot cost of client's collating sequence adjusted is less than adjustment is suitable
Otherwise the parking lot cost of sequence, executes step 106 if so, thening follow the steps 105.
Step 105, using client's collating sequence adjusted as final client's collating sequence.
Step 106, using client's collating sequence before adjustment as final client's collating sequence.
Step 107, the distribution project of vehicle in parking lot is determined according to final client's collating sequence.
It should be noted that determining the label of client according to final client's collating sequence, and true according to the label of client
Determine the distribution project of vehicle in parking lot.
Wherein, the label of client includes：The vehicle driving of services client next time the pot life of stroke, client it is previous
Whether parking lot cost, label when vehicle transport in the index of a client, parking lot is to client are eliminated mark and label point
Five elements of feasibility with scheme.
It should be noted that in client's collating sequence, each client can be generated due in the delivery process of parking lot
Many labels (in addition to first client only one label).Since the client of first position in client's collating sequence,
The label of each client is sequentially generated, but only finish and remove the quilt " governance " of the client in the label generation of previous client
After label, the label of next client can be just generated.
Wherein, will be rejected by the label of " governance ", thus in determining client's collating sequence subsequent clients label
When, it will not be generated based on the label being rejected.Therefore front client is more by the label of " governance " in client's collating sequence, after
The label that face client generates is fewer, and the calculating speed of tag program is faster.When determining whether some label is ruled, only
The label and remaining label under same client are compared, without being compared with the label under other clients.
For example, with labelAnd labelFor, rule is ruled to label and is illustrated, and coincidence formula (2) and public affairs
When formula (3), it is determined that labelRule label
γ≥1 (5)
Wherein,Indicate labelParking lot cost,LabelParking lot cost,Indicate label's
J-th of element,Indicate labelParking lot cost, γ indicate client number of labels dynamically-adjusting parameter.
And γ is updated according to formula (6), and formula (6) is as follows：
Wherein, | υi| indicate the number of labels in client's collating sequence on i-th of client, υthrIndicate threshold parameter.
At one in the specific implementation, if final client's collating sequence is { c1,c2,c3, distribute to vehicle d, and parking lot
Specifically there is two cars k in d0And k1, the vehicle loading gage lotus upper limit is 200, and the maximum row number of passes of each car is set as 5, λ for 2, θ and is set as
5。
Customer information shown in table 4, the first column of figure tsIndicate vehicle between the loading of parking lot d and the service of three clients
Time；Second column of figure qiIndicate the cargo demand (parking lot demand is 0) of each client, third column eiIndicate that time window is earliest
Start service time (parking lot is since 0 moment), the 4th column liIndicate that time window starts service time (parking lot 200) the latest；
5th column tRIndicate that (parking lot does not have cargo demand, is set as 0) for the cargo ready time of the required cargo of each client；Table 5 is any
The distance between two points matrix；The label information of the client determined shown in table 6 according to final client's collating sequence, each
The first row time of client's label indicates the pot life of the vehicle driving of services client stroke next time, and according to non-ascending order
Numerical values recited is ranked up, and secondary series P indicates that the index of the previous client of client, third column cost indicate the vehicle in parking lot
Transport parking lot cost when client, the 4th column dom indicates whether label is eliminated mark, and the 5th column fesi indicates that label distributes
The feasibility of scheme.
Table 4
| ts | qi | ei | li | tR | |
| d | 20 | 0 | 0 | 200 | 0 |
| c1 | 5 | 20 | 100 | 120 | 60 |
| c2 | 5 | 20 | 50 | 100 | 20 |
| c3 | 5 | 20 | 130 | 160 | 60 |
Table 5
| d | c1 | c2 | c3 | |
| d | 0 | 5 | 10 | 15 |
| c1 | 5 | 0 | 10 | 20 |
| c2 | 10 | 10 | 0 | 30 |
| c3 | 15 | 20 | 30 | 0 |
Table 6
It should be noted that the label determination process of client according to final client's collating sequence specifically, generate corresponding
Label, firstly generate c1Label, then generate c2Label, ultimately produce c3Label, below to generate c1Label and
c2Label for be illustrated, because of c1Label be to be generated based on the d of parking lot, c2Label be with parking lot d and visitor
Family c1Label based on generate, c3Label be with parking lot d, client c1Label and client c2Label based on
It generates, so c3Label generating principle and c2Label generating principle it is identical, no longer repeated herein.
Wherein, c is generated1Label process be：Parking lot d, which distributes a vehicle, (might as well be denoted as k0) it is c1Cargo is dispensed, is then returned
Turn-round (each label, which requires, returns to parking lot), an only stroke is known, c by table 41Cargo demand be 20, cargo
Ready time is 60, and parking lot loading time is 20, therefore k0It is 80 from the time in parking lot.Parking lot d to c is known by table 41Away from
From being 5, therefore k0Reach c1Time be that 85 (running time that 1 unit distance is assumed in the embodiment of the present application is also 1 list
Position).In table 4, c1Time window be [100,120], the meaning of time window is exactly to require vehicle must be in time window defined
Client is dispensed in time range, so vehicle is directed to client c1For need to wait until the ability break bulk of 100 moment, unload
ETCD estimated time of commencing discharging is 5, therefore k0Goods is unsnatched at 105 moment, starts to return to parking lot, by the time of 5 units, is reached at 110 moment
Parking lot d.In this stroke, without the violation of time window and cargo dead-weight.
Therefore, in c1This label in, indicate service c1Vehicle driving next time stroke pot life be (110,
0), notice that this group number need to be arranged according to descending sequence, wanting for descending sequence has been met in this label
It asks；Followed by " P " is arranged, we, which see in this stroke, contains only client c1Part, i.e. { c1, previous point is parking lot d, is remembered " P "
The value of column is d；" cost " of so this stroke is vehicle route 10；For first client in sequence, only have only
One label (distribution project, or perhaps vehicle travel arrangement), therefore, without others vehicle delivery schemes compared to
The distribution project of above-mentioned stroke is more excellent, therefore the label will not be eliminated, then " dom " column note No；Due to there is no the time in violation of rules and regulations
With the capacity of carriage in violation of rules and regulations, therefore this label allocation plan be it is feasible, then " fesi " column note Yes.
Wherein, first client's point c in the sequence1After label generates, second client's point c is generated2Label,
Generate c2Label process be：As shown in Table 6, c2There are three labels, respectively correspond three kinds of distribution projects, the first is arrangement one
Vehicle is continuously client c in a stroke1And c2Dispense cargo (due in this client's sequence, c1In c2Before, therefore
It is first c in the same stroke1Service), then return to parking lot (i.e. a vehicle has been gone one time, and another vehicle is not used)；Second
Kind situation is to distribute a vehicle, and first carrying out a stroke is c1Cargo is dispensed, parking lot is then returned to, is executing second stroke
For c2Dispatching returns again to parking lot (i.e. a vehicle has been run twice, and another vehicle is not used)；The third situation is to distribute a vehicle
For c1Dispatching, distributing another vehicle is c2Dispatching, two cars return to parking lot immediately all after unsnatching goods, and (i.e. two cars, each car is all
It has gone one time).
For the first situation, the sum of the car loading of two clients is 15, will not generate the capacity of carriage in violation of rules and regulations, ready time takes
Maximum value, be 60, then with generate c1Label it is similar, vehicle has serviced c at 105 moment1, but next destination is c2, by
C known to table 51And c2The distance between be 10, therefore time of the vehicle Jing Guo 10 units, in 115 moment arrival c2, but this
Moment is later than c2Time window service start times 100 the latest, because this time violation punishment cost is 5* (115-100)=75；
Caravan is c at this time2For 100, (after generation time window is punished in violation of rules and regulations, the time is withdrawn into time window and takes the latest at the beginning of service
It is engaged in the time started), the time by 5 units unsnatches goods, parking lot is returned to immediately at 105 moment, by the time of 10 units,
Parking lot is reached at 115 moment.And another vehicle is not used, then vehicle is ready for travelling the time of next stroke, i.e. " time "
(115,0) are classified as, the part of sequence client, i.e. { c are contained only in this stroke1,c2, previous point is parking lot d, note " P " column
Value is d；Vehicle journeys distance is 5+10+10=25, then vehicle route cost " cost " is classified as 25+75=100；" dom " column are temporary
Shi Weizhi is needed in c2All labels generate after, it is better to judge whether there is the distribution project, whether just can determine that the label
It is eliminated；It in violation of rules and regulations due to having time, is infeasible scheme, " fesi " arranges No；
For second situation, a vehicle is allowed (k might as well to be denoted as0) two strokes of traveling, due to first stroke and c1Uniquely
Label it is identical, therefore k0Second of stroke can be ready at all times from 110.Due to c2Cargo ready time be 20, therefore k0From
110 moment started to freight, by 20 chronomeres, i.e., at 130 moment from parking lot d, and by 10 chronomeres,
140 moment reached c2, then the time violation punishment cost generated is 5* (140-100)=200；At this time since 100 moment
Service starts to return to parking lot at 105 moment, by the time of 10 units, reach at 115 moment by the time of 5 units
Parking lot, " time " column are denoted as (115,0)；Include c2Stroke previous point be c1, therefore, " P " column are denoted as c1；Vehicle route
Distance is 5*2+10*2=30, and therefore the value of " cost " column is 200+30=230.At calculating " dom ", because being greater than the first
The cost of situation, therefore the label is eliminated, and is that infeasible scheme " Fesi " is classified as No in violation of rules and regulations due to having time.
For the third situation, k is remembered0For c1Service, k1For c2It services, then k0Correlation and c1Unique tags it is identical.
For vehicle k1, c2Cargo ready time be 20, therefore k1Start to freight at 20 moment, by the time of 20 units, 40
Moment from parking lot, then passes through 10 chronomeres, i.e. 50 moment reach c2, due to c2Time window early start service
Time is 50, so k1In the break bulk of 50 moment, by the time of 5 units, c is left at 55 moment2Parking lot is gone to, so
Afterwards by the time of 10 units, i.e. 65 moment reach parking lot.At this time in violation of rules and regulations without time violation and the capacity of carriage." time " is classified as
(110,65)；Include c2Stroke, the previous point in client's sequence is c1, therefore " P " of the label is classified as c1；"cost"
For two cars transport to client when the sum of parking lot cost be 30, i.e. 5*2+10*2=30；Due to not having in violation of rules and regulations, being can
Row scheme " fesi " is Yes.Then " dom " column are calculated, because cost is less than the first situation, which is not eliminated.
It should be noted that " P " column are c for second situation and the third situation1, that is to say, that second of feelings
The label of condition and the third situation is based on c1Label generate (c1An only unique label), that is to say, that retaining
Scheme (the k that front has been arranged properly0For c1Service, then returns to parking lot) it is not altered, it is then added below possible new
Arrange (k0Run second travel service c2, or use another vehicle service c2)。
Wherein, for c3Label generating process, rule with front c2Label generating process it is identical, which is not described herein again.
As shown in table 6, there are two label least cost 60 having the same, and they be all it is feasible, then select the in them
One label, and finally the distribution project of vehicle is in determining parking lot：k0Execute stroke { d → c twice1→ d, d → c3→ d },
k1Execute one stroke { d → c2→d}。
Step 108, control vehicle is transported according to determining distribution project.
Wherein, it is determined in parking lot after the distribution project of vehicle according to final client's collating sequence, parking lot will be controlled
It is transported according to determining distribution project.
For example, determining that distribution project is：k0Execute stroke { d → c twice1→ d, d → c3→ d }, k1Execute primary row
Journey { d → c2→ d } after, parking lot can control vehicle k0It is client c from parking lot1It is dispensed, and controls vehicle amount k1For client c2
It is dispensed, in vehicle k0After having executed first stroke, in control vehicle k0It is client c from parking lot3It is dispensed.From
And keep the dispatching in parking lot more reasonable, the waste of parking lot transport resource and the unreasonable distribution of time are avoided, transport is improved
Efficiency.
Compared with prior art, present embodiment passes through the customers serviced required for determining departure yard, and according to first
Client's collating sequence of beginning is adjusted, assesses final client's collating sequence for being determined to determine that reasonable parking lot is matched
Send scheme.It is transported by control vehicle according to determining parking lot distribution project, to reduce the cost of parking lot transport simultaneously
Improve conevying efficiency.
Second embodiment of the present invention is related to a kind of optimization method of parking lot dispatching.The present embodiment is in first embodiment
On the basis of be further improved, specific improvements are：Client's collating sequence in adjustment customers specifically retouch
It states.The process of the optimization method of parking lot dispatching in the present embodiment is as shown in Figure 3.Including step specifically, in the present embodiment,
Rapid 201 to step 210, and wherein step 201 is roughly the same with the step 101 in first embodiment, step 205 to step 210
Roughly the same to step 108 with the step 103 in first embodiment, details are not described herein again, mainly introduces difference below,
The not technical detail of detailed description in the present embodiment, reference can be made to substance detecting method provided by first embodiment, herein
It repeats no more.
After step 201, step 202 is executed.
In step 202, using client's collating sequence in move mode adjustment customers.
It should be noted that when being sequence in the customers and initial client collating sequence for determining service required for parking lot
When { 2, Isosorbide-5-Nitrae, 5,8 } A, begin trying to move from client { 2 } first, and client { 2 } transportable position have { 1 } with
{ 4 } it between, between { 4 } and { 5 }, between { 5 } and { 8 } and after { 4 }, is put it between { 1 } and { 4 } first, Ke Huxu
Column become sequence B { 1,2,4,5,8 }, and according to evaluation criteria set by user, judge whether sequence B is better than sequence A, if it is not,
Then continuing to attempt next time, i.e., { 2 } is moved between { 4 } and { 5 }, then sequence B becomes sequence C { Isosorbide-5-Nitrae, 2,5,8 }, and
According to evaluation criteria set by user, judge whether C is better than sequence A, and so on, if all shiftings of first client { 2 }
It is dynamic that then second client { 1 } is moved all without the better sequence of discovery, and the moveable position of client { 2 } has { 2 }
Before, between { 4 } and { 5 }, between { 5 } and { 8 } and after { 8 }, if do not found by move mode true according to user
For fixed evaluation criteria, the new sequence of client's collating sequence more better than A sequence thens follow the steps 203, passes through exchanged form
It is adjusted.
In step 203, using client's collating sequence in exchanged form adjustment customers.
Specifically, when the customers and initial client collating sequence for determining service required for parking lot be sequence A 2,
When Isosorbide-5-Nitrae, 5,8 }, and when can not find better client's collating sequence by move mode adjustment, then by way of exchange
Be adjusted, i.e., swap position of two clients in client's collating sequence, first client { 5 } can with client { 2 },
{ 8 }, { 1 } and { 4 } swaps, although can have sequence identical with move mode, two kinds of transformation institutes by exchanged form
The time used there are different, and when being assessed according to evaluation criteria set by user this be also a consideration because
Element, so the different resulting assessment results of mapping mode are different, and so on, if being adjusted by exchanged form, press
According to evaluation criteria set by user, it can not find better sequence, then follow the steps 204, be adjusted by exchanged form.
In step 204, using client's collating sequence in inversion mode adjustment customers.
Specifically, gear the customers and initial client collating sequence for determining service required for parking lot be sequence A 2,
When Isosorbide-5-Nitrae, 5,8 }, and when can not find better client's collating sequence by exchanged form adjustment, then by way of reversing
It is adjusted, i.e., the position of the continuous client's collating sequence of a part in reverse client's collating sequence.Wherein, in order to avoid with friendship
It is identical to change mode, includes at least three clients in the continuous client's collating sequence of a part.When including in a part of client's sequence
It when three clients, then can choose { 2, Isosorbide-5-Nitrae }, { Isosorbide-5-Nitrae, 5 }, { 4,5,8 }, and sequentially reversed.Or work as a part of client
When including four clients in sequence, then it can choose { 2, Isosorbide-5-Nitrae, 5 }, { Isosorbide-5-Nitrae, 5,8 }, and sequentially reversed.To determining
According to better one group of sequence A for evaluation criteria set by user than sequence, if not having, by assessment result most similar one
Group sequence is as client's collating sequence adjusted.
The step of various methods divide above, be intended merely to describe it is clear, when realization can be merged into a step or
Certain steps are split, multiple steps are decomposed into, as long as including identical logical relation, all in the protection scope of this patent
It is interior；To adding inessential modification in algorithm or in process or introducing inessential design, but its algorithm is not changed
Core design with process is all in the protection scope of the patent.
Third embodiment of the invention is related to a kind of optimization device of parking lot dispatching, and specific structure is for example as shown in Figure 4.
As shown in figure 4, the optimization device of parking lot dispatching includes：First determining module 301, adjustment module 302, evaluation module
303, the second determining module 304 and transportation module 305.
Wherein, the first determining module 301, the client in customers and customers for determining service required for parking lot
Collating sequence.
Module 302 is adjusted, for adjusting client's collating sequence in customers.
Evaluation module 303 determines that final client's sequence is suitable for assessing client's collating sequence adjusted
Sequence.
Second determining module 304, for determining the distribution project of vehicle in parking lot according to final client's collating sequence.
Transportation module 305 is transported for controlling vehicle according to determining distribution project.
It is not difficult to find that present embodiment is Installation practice corresponding with first embodiment, present embodiment can be with
First embodiment is worked in coordination implementation.The relevant technical details mentioned in first embodiment still have in the present embodiment
Effect, in order to reduce repetition, which is not described herein again.Correspondingly, the relevant technical details mentioned in present embodiment are also applicable in
In first embodiment.
Four embodiment of the invention is related to a kind of optimization device of parking lot dispatching.The embodiment and third embodiment
Roughly the same, specific structure is as shown in Figure 5.Wherein, it mainly thes improvement is that：4th embodiment is in third embodiment
The structure of adjustment module 302 have been described in detail.
Wherein, adjustment module 302 includes：Mobile adjusting submodule 3021, exchange adjusting submodule 3022 and reversing adjustment
Submodule 3023.
Mobile adjusting submodule 3021, for using client's collating sequence in move mode adjustment customers.
Adjusting submodule 3022 is exchanged, for using client's collating sequence in exchanged form adjustment customers.
Adjusting submodule 3023 is reversed, for using client's collating sequence in inversion mode adjustment customers.
It is not difficult to find that present embodiment is Installation practice corresponding with second embodiment, present embodiment can be with
Second embodiment is worked in coordination implementation.The relevant technical details mentioned in second embodiment still have in the present embodiment
Effect, in order to reduce repetition, which is not described herein again.Correspondingly, the relevant technical details mentioned in present embodiment are also applicable in
In second embodiment.
It is noted that each module involved in present embodiment is logic module, and in practical applications, one
A logic unit can be a physical unit, be also possible to a part of a physical unit, can also be with multiple physics lists
The combination of member is realized.In addition, in order to protrude innovative part of the invention, it will not be with solution institute of the present invention in present embodiment
The technical issues of proposition, the less close unit of relationship introduced, but this does not indicate that there is no other single in present embodiment
Member.
Fifth embodiment of the invention is related to a kind of electronic equipment, as shown in fig. 6, including at least one processor 501；With
And the memory 502 with the communication connection of at least one processor 501；Wherein, be stored with can be by least one for memory 502
The instruction that device 501 executes is managed, instruction is executed by least one processor 501, so that at least one processor 501 is able to carry out
State the optimization method of the parking lot dispatching in embodiment.
In the present embodiment, for processor 501 is with central processing unit (Central Processing Unit, CPU), deposit
For reservoir 502 is with readable and writable memory (Random Access Memory, RAM).Processor 501, memory 502 can lead to
Bus or other modes connection are crossed, is schemed in * * for being connected by bus.Memory 502 is used as a kind of non-volatile calculating
Machine readable storage medium storing program for executing can be used for storing non-volatile software program, non-volatile computer executable program and module, such as
Realize that environmental information determines that the program of method is stored in memory 502 in the embodiment of the present application.Processor 501 passes through operation
Non-volatile software program, instruction and the module being stored in memory 502, thereby executing equipment various function application with
And data processing, that is, realize the optimization method of above-mentioned parking lot dispatching.
Memory 502 may include storing program area and storage data area, wherein storing program area can store operation system
Application program required for system, at least one function；It storage data area can the Save option list etc..In addition, memory can wrap
High-speed random access memory is included, can also include nonvolatile memory, for example, at least disk memory, a flash memories
Part or other non-volatile solid state memory parts.In some embodiments, it includes relative to processor 501 that memory 502 is optional
Remotely located memory, these remote memories can pass through network connection to external equipment.The example of above-mentioned network includes
But be not limited to internet, intranet, local area network, mobile radio communication and combinations thereof.
One or more program module is stored in memory 502, is executed when by one or more processor 501
When, execute the optimization method of the parking lot dispatching in above-mentioned any means embodiment.
Method provided by the embodiment of the present application can be performed in the said goods, has the corresponding functional module of execution method and has
Beneficial effect, the not technical detail of detailed description in the present embodiment, reference can be made to method provided by the embodiment of the present application.
The sixth embodiment of the application is related to a kind of computer readable storage medium, in the computer readable storage medium
It is stored with computer program, which can be realized when being executed by processor involved in any means embodiment of the present invention
Parking lot dispatching optimization method.
It will be understood by those skilled in the art that implementing the method for the above embodiments is that can pass through
Program is completed to instruct relevant hardware, which is stored in a storage medium, including some instructions are used so that one
A equipment (can be single-chip microcontroller, chip etc.) or processor (processor) execute each embodiment the method for the application
All or part of the steps.And storage medium above-mentioned includes：USB flash disk, mobile hard disk, read-only memory (ROM, Read-Only
Memory), random access memory (RAM, Random Access Memory), magnetic or disk etc. are various can store journey
The medium of sequence code.
It will be understood by those skilled in the art that the respective embodiments described above are to realize specific embodiments of the present invention,
And in practical applications, can to it, various changes can be made in the form and details, without departing from the spirit and scope of the present invention.
Claims (10)
1. a kind of optimization method of parking lot dispatching, which is characterized in that including：
Determine client's collating sequence in the customers and the customers serviced required for parking lot；
Adjust client's collating sequence in the customers；
Client's collating sequence adjusted is assessed, determines final client's collating sequence；
The distribution project of vehicle in the parking lot is determined according to final client's collating sequence；
The vehicle is controlled to be transported according to the determining distribution project.
2. the optimization method of parking lot dispatching according to claim 1, which is characterized in that service required for the determining parking lot
Customers and the customers in client's collating sequence, including：
The customers of service required for the parking lot are determined using heuritic approach, and described in generating at random according to the customers
Client's collating sequence in customers, wherein the heuritic approach includes genetic algorithm or particle swarm algorithm.
3. the optimization method of parking lot dispatching according to claim 2, which is characterized in that described to be determined using heuritic approach
The client's collating sequence in customers and the customers serviced required for the parking lot, including：
Each client is encoded；
Initialization is carried out to each client after coding and obtains each respective random site numerical value of client；
According to each respective random site numerical value of client, the customers serviced required for parking lot are determined；
And according to the random site numerical value of client in the customers, client's collating sequence in the customers is determined.
4. the optimization method of parking lot dispatching according to claim 3, which is characterized in that in the adjustment customers
Client's collating sequence, including：
Using the change neighborhood search strategy of movement, exchange or reversing, client's collating sequence in the customers is adjusted.
5. the optimization method of parking lot dispatching according to any one of claims 1 to 4, which is characterized in that after described pair of adjustment
Client's collating sequence assess, determine final client's collating sequence, including：
The parking lot cost of client's collating sequence before calculating adjustment and the parking lot cost of client's collating sequence adjusted；Sentence
The parking lot cost for client's collating sequence adjusted of breaking whether be less than the parking lot of client's collating sequence before the adjustment at
This, if so, using client's collating sequence adjusted as final client's collating sequence, otherwise, by the tune
Client's collating sequence before whole is as final client's collating sequence；
Wherein, the parking lot cost includes vehicle route cost, time violation punishment cost and capacity of carriage violation punishment cost.
6. the optimization method of parking lot dispatching according to claim 5, which is characterized in that described according to the final client
Collating sequence determines the distribution project of vehicle in the parking lot, including:
The label of the client is determined according to final client's collating sequence, and according to the determination of the label of the client
The distribution project of vehicle in parking lot.
7. the optimization method of parking lot according to claim 6 dispatching, which is characterized in that the label of the client includes：
Service the vehicle driving of the client pot life of stroke, the index of the previous client of the client, institute next time
Parking lot cost when stating vehicle transport in parking lot to the client.
8. a kind of optimization device of parking lot dispatching, which is characterized in that including：
First determining module, client's sequence in the customers and the customers for determining service required for parking lot are suitable
Sequence；
Module is adjusted, for adjusting client's collating sequence in the customers；
Evaluation module determines final client's collating sequence for assessing client's collating sequence adjusted；
Second determining module, for determining the distribution project of vehicle in parking lot according to final client's collating sequence；
Transportation module is transported for controlling the vehicle according to the determining distribution project.
9. a kind of electronic equipment, which is characterized in that including
At least one processor；And
The memory being connect at least one described processor communication；Wherein,
The memory is stored with the instruction that can be executed by least one described processor, and described instruction is by described at least one
It manages device to execute, so that at least one described processor is able to carry out the excellent of parking lot dispatching as described in any one of claim 1 to 7
Change method.
10. a kind of computer readable storage medium, is stored with computer program, which is characterized in that the computer program is located
Manage the optimization method that claim 1 to 7 described in any item parking lot dispatchings are realized when device executes.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810738287.6A CN108921353B (en) | 2018-07-06 | 2018-07-06 | Optimization method and device for yard distribution and electronic equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810738287.6A CN108921353B (en) | 2018-07-06 | 2018-07-06 | Optimization method and device for yard distribution and electronic equipment |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108921353A true CN108921353A (en) | 2018-11-30 |
| CN108921353B CN108921353B (en) | 2021-12-07 |
Family
ID=64425577
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810738287.6A Active CN108921353B (en) | 2018-07-06 | 2018-07-06 | Optimization method and device for yard distribution and electronic equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108921353B (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109754638A (en) * | 2019-02-19 | 2019-05-14 | 浙江大学城市学院 | A kind of parking space allocation method based on distributed computing technology |
| CN111353730A (en) * | 2018-12-20 | 2020-06-30 | 顺丰科技有限公司 | Method, device and equipment for sequencing transit vehicles and storage medium |
| CN111353730B (en) * | 2018-12-20 | 2024-07-09 | 顺丰科技有限公司 | Method, device, equipment and storage medium for sequencing transit vehicles |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103049805A (en) * | 2013-01-18 | 2013-04-17 | 中国测绘科学研究院 | Vehicle route optimization method with time window constraint based on improved particle swarm optimization (PSO) |
| CN103617743A (en) * | 2013-11-22 | 2014-03-05 | 冶金自动化研究设计院 | Iron and steel enterprise vehicle locating system and method based on RFID and power line carrier waves |
| CN104951850A (en) * | 2015-06-25 | 2015-09-30 | 广东工业大学 | Method for solving multiple-depot logistics transportation vehicle routing problem |
| US20150356635A1 (en) * | 2014-05-23 | 2015-12-10 | Rochester Institute Of Technology | Method for optimizing asset value based on driver acceleration and braking behavior |
| US20170293296A1 (en) * | 2016-04-12 | 2017-10-12 | Here Global B.V. | Method, apparatus and computer program product for grouping vehicles into a platoon |
| CN107506846A (en) * | 2017-07-10 | 2017-12-22 | 北京石油化工学院 | A kind of vehicle dispatching method and device based on multi-objective particle |
-
2018
- 2018-07-06 CN CN201810738287.6A patent/CN108921353B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103049805A (en) * | 2013-01-18 | 2013-04-17 | 中国测绘科学研究院 | Vehicle route optimization method with time window constraint based on improved particle swarm optimization (PSO) |
| CN103617743A (en) * | 2013-11-22 | 2014-03-05 | 冶金自动化研究设计院 | Iron and steel enterprise vehicle locating system and method based on RFID and power line carrier waves |
| US20150356635A1 (en) * | 2014-05-23 | 2015-12-10 | Rochester Institute Of Technology | Method for optimizing asset value based on driver acceleration and braking behavior |
| CN104951850A (en) * | 2015-06-25 | 2015-09-30 | 广东工业大学 | Method for solving multiple-depot logistics transportation vehicle routing problem |
| US20170293296A1 (en) * | 2016-04-12 | 2017-10-12 | Here Global B.V. | Method, apparatus and computer program product for grouping vehicles into a platoon |
| CN107506846A (en) * | 2017-07-10 | 2017-12-22 | 北京石油化工学院 | A kind of vehicle dispatching method and device based on multi-objective particle |
Non-Patent Citations (1)
| Title |
|---|
| 郭海湘等: "带服务优先级的煤矿物资配送车辆路径问题", 《系统管理学报》 * |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111353730A (en) * | 2018-12-20 | 2020-06-30 | 顺丰科技有限公司 | Method, device and equipment for sequencing transit vehicles and storage medium |
| CN111353730B (en) * | 2018-12-20 | 2024-07-09 | 顺丰科技有限公司 | Method, device, equipment and storage medium for sequencing transit vehicles |
| CN109754638A (en) * | 2019-02-19 | 2019-05-14 | 浙江大学城市学院 | A kind of parking space allocation method based on distributed computing technology |
| CN109754638B (en) * | 2019-02-19 | 2020-09-22 | 浙江大学城市学院 | Parking space allocation method based on distributed technology |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108921353B (en) | 2021-12-07 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Szeto et al. | Chemical reaction optimization for solving a static bike repositioning problem | |
| Fan et al. | Carsharing: Dynamic decision-making problem for vehicle allocation | |
| CN109726863A (en) | A kind of material-flow method and system of multiple-objection optimization | |
| Koo et al. | Fleet sizing and vehicle routing for container transportation in a static environment | |
| CN102542395B (en) | A kind of emergency materials dispatching system and computing method | |
| Sayarshad et al. | A simulated annealing approach for the multi-periodic rail-car fleet sizing problem | |
| CN104504459B (en) | Logistics transportation optimization method and system | |
| CN109063899A (en) | Vehicle transport method and device for planning, electronic equipment and readable storage medium storing program for executing | |
| Fan | Management of dynamic vehicle allocation for carsharing systems: Stochastic programming approach | |
| AU2016333979B2 (en) | Parallel processing for solution space partitions | |
| CN113177752B (en) | Route planning method and device and server | |
| CN108764804A (en) | Warehouse-free parcel transportation method and device by using taxi | |
| Hatzenbühler et al. | Modular vehicle routing for combined passenger and freight transport | |
| Meng et al. | Carrying capacity procurement of rail and shipping services for automobile delivery with uncertain demand | |
| Song et al. | Optimal empty vehicle redistribution for hub‐and‐spoke transportation systems | |
| Basso et al. | An optimization approach and a heuristic procedure to schedule battery charging processes for stackers of palletized cargo | |
| CN108921353A (en) | A kind of optimization method, device and the electronic equipment of parking lot dispatching | |
| Rizkya et al. | Design of Distribution Routes Using Saving Matrix Method to Minimize Transportation Cost | |
| Chow et al. | Real-time Bidding based Vehicle Sharing. | |
| Tschöke et al. | Container supply with multi-trailer trucks: parking strategies to speed up the gantry crane-based loading of freight trains in rail yards | |
| CN104268196B (en) | A kind of ticket library of ticketing system and its update method | |
| Lutter | Optimized load planning for motorail transportation | |
| Oliveira et al. | A heuristic for two-echelon urban distribution systems | |
| KR20220013981A (en) | Apparatus and method of providing freight allocation service based on artificial intelligence | |
| Huber et al. | Dealing with scarce optimization time in complex logistics optimization: A study on the biobjective swap-body inventory routing problem |
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 | ||
| CB02 | Change of applicant information | ||
| CB02 | Change of applicant information |
Address after: No. 99, Baoshan District Road, Shanghai, Shanghai Applicant after: Shanghai University Address before: 2004 School of Management, Building 1, East District, Shanghai University, 99 Shangda Road, Baoshan District, Shanghai Applicant before: Shanghai University |
|
| GR01 | Patent grant | ||
| GR01 | Patent grant |