CN106156897A - Optimum path planning analog systems in logistics distribution - Google Patents
Optimum path planning analog systems in logistics distribution Download PDFInfo
- Publication number
- CN106156897A CN106156897A CN201610694040.XA CN201610694040A CN106156897A CN 106156897 A CN106156897 A CN 106156897A CN 201610694040 A CN201610694040 A CN 201610694040A CN 106156897 A CN106156897 A CN 106156897A
- Authority
- CN
- China
- Prior art keywords
- path
- shortest
- client
- time
- warehouse
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 claims abstract description 39
- 230000008569 process Effects 0.000 claims abstract description 19
- 238000002922 simulated annealing Methods 0.000 claims abstract description 13
- 230000000694 effects Effects 0.000 claims description 9
- 238000004422 calculation algorithm Methods 0.000 claims description 7
- 241001251068 Formica fusca Species 0.000 claims description 6
- 230000008859 change Effects 0.000 claims description 5
- 238000002372 labelling Methods 0.000 claims description 4
- 238000005457 optimization Methods 0.000 claims description 4
- 238000012360 testing method Methods 0.000 claims description 4
- DBPRUZCKPFOVDV-UHFFFAOYSA-N Clorprenaline hydrochloride Chemical compound O.Cl.CC(C)NCC(O)C1=CC=CC=C1Cl DBPRUZCKPFOVDV-UHFFFAOYSA-N 0.000 claims description 2
- 230000000903 blocking effect Effects 0.000 claims description 2
- 238000004364 calculation method Methods 0.000 claims description 2
- 230000008676 import Effects 0.000 claims description 2
- 239000011159 matrix material Substances 0.000 claims description 2
- 239000003016 pheromone Substances 0.000 claims description 2
- 238000007781 pre-processing Methods 0.000 claims description 2
- 230000003068 static effect Effects 0.000 claims description 2
- 230000009466 transformation Effects 0.000 claims description 2
- 238000013461 design Methods 0.000 description 5
- 238000011161 development Methods 0.000 description 2
- 230000006872 improvement Effects 0.000 description 2
- 230000004044 response Effects 0.000 description 2
- 238000004088 simulation Methods 0.000 description 2
- 230000000007 visual effect Effects 0.000 description 2
- 230000009471 action Effects 0.000 description 1
- 238000004458 analytical method Methods 0.000 description 1
- 238000000137 annealing Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000008901 benefit Effects 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 235000013399 edible fruits Nutrition 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 239000000463 material Substances 0.000 description 1
- 230000009467 reduction Effects 0.000 description 1
- 238000011160 research Methods 0.000 description 1
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"
- G06Q10/047—Optimisation of routes or paths, e.g. travelling salesman problem
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
- G06Q10/083—Shipping
- G06Q10/0835—Relationships between shipper or supplier and carriers
- G06Q10/08355—Routing methods
Abstract
The present invention relates to optimum path planning analog systems in logistics distribution.Including the main interface of system, Shortest time programming, shortest path planning module；The main interface module of system, has gathered the various operations of shortest time and shortest path；Shortest path planning module, contains backtracking method and enhanced simulated annealing processes shortest path first；Shortest time programming module, is set to different values according to actual needs by the speed in each section, calculates logistics van by the shortest time needed for all of client.Native system user can be according to practical situation mark warehouse and the address of client on analog systems interface；The Path Planning that analog systems can select according to user；Analog systems can adjust according to certain the section laggard Mobile state of traffic congestion, again plans distribution route, thus reduces logistic car cost in delivery process.
Description
Technical field
The present invention relates to logistics distribution technical field, be specifically related to optimum path planning analog systems in logistics distribution.
Background technology
The fast development of material flow industry has promoted the research of Distribution path problem, and under B2C electronic business mode, commodity need
Ask variation, customer demand personalized, the feature of the dispensing many number of times of small lot, it is thus necessary to determine that suitable distribution route meets visitor
Family individual requirement on distribution time.Choosing whether of Distribution path is reasonable, to accelerating dispensing speed, improving Service Quality
Amount, reduction distribution cost and increase economic benefit have considerable influence.The optimization problem of Distribution path is logistics distribution system
One subject matter, optimizing exactly with minimum operation cost, the most efficiently response speed, the shortest joining of logistics distribution path
Send haulage time, goods is transported in user's hands.
When B2C agricultural product electronic business logistics is provided and delivered, logistic car load the same day need dispensing kinds of goods from warehouse,
It is that each client provides and delivers according to optimum Distribution path planned in advance, finally returns to warehouse.
Along with the development of B2C agricultural product electronic business logistics dispensing, path planning has been not only to ask for path minimum
The problem changed, problem to be considered becomes increasingly complex, and traditional rigorous solution has already fallen behind, and traditional Optimization solution not only takes
Time and try to achieve optimal solution, be a kind of Utopian method for solving.
Summary of the invention
It is an object of the invention to before dispensing can according to the dispensing address of client between line pitch, experience road conditions divide
Analysis, quickly calculates an optimum Distribution path, in delivery process, if the traffic congestion of certain section, it is possible to would dynamically adjust dispensing
Route, for realizing this purpose, the present invention provides optimum path planning analog systems in business logistics distribution.
B2C agricultural product electronic business logistics is provided and delivered, and is with least cost, the completing of fastest response speed high quality and high efficiency
The dispensing demand of client, needs accurate client geographic location data, thus plans optimum Distribution path；In practice can root
Dynamically adjust according to the traffic congestion situation in section between any client.
After the target of optimum path planning is the position of user and the quantity of user determines, system can be all at once
User cook up one from warehouse the optimum Distribution path to all of Customer Location.Logistics carriage when normally travelling, as
There is traffic congestion event in fruit, adjusts travel route immediately, again plan optimal path, it is achieved dynamically adjust distribution route；And energy
Enough on visual interface, carry out lively reality simulation, allow logistics distribution vehicle along the route running of dynamic revised planning,
Interface is embodied optimum Distribution path, reaches optimal reality simulation effect.
The technical solution of the present invention is: optimum path planning analog systems in logistics distribution, including the main interface of system,
Shortest time programming, shortest path planning module；
The main interface module of described system, has gathered the various operations of shortest time and shortest path, and main interface can generate client
Data, including geographical position and the serial number of client of client, and the position etc. in warehouse, also shortest time, shortest path
The button in footpath, the setting in traffic congestion section and the optimal path result of planning show；
Described shortest path planning module, contains backtracking method and enhanced simulated annealing processes shortest path first, with
Centered by warehouse, find the shortest path returning warehouse from warehouse through all clients；
Described Shortest time programming module, is set to different value as required by the speed in each section, calculates logistics van and passes through
Shortest time needed for all of client.
The main interface module of described system, including path display box, operating list, operation box, effect display box, performs prompting
Frame.
Described path display box, is used for showing Customer Location, customer number, warehouse location, programme path, lorry motion feelings
After condition and traffic congestion, the path after dynamic revised planning shows and lorry movement locus；Left mouse button clicks on any position of display box
Put, often click on once, a client will be generated, have corresponding round dot to show labelling；The route of described planning is finally to close
, the one section of straight line being expressed as in display box between some 2 is connected.
Described operating list, includes warehouse location initial block, shortest time and two buttons of shortest path；Warehouse location
Initial block is used for setting the position in warehouse；After selected warehouse location, click on " shortest time " button, to a little, including warehouse
Point and client's point, carry out Shortest time programming；Clicking on " shortest path " button, system can carry out shortest path rule to all points
Draw；Shortest time button, shortest path button can arbitrarily switch.
Described operation box, has a " set " button, and the input prompt of " arranging traffic congestion section " in operation box.
Described effect display box, display section, lorry place, time and path optimal value.
Described execution prompting frame, again to the concrete route in all paths in warehouse from warehouse to client after prompting planning.
Described shortest path planning module, uses backtracking method when customer quantity is less, and backtracking algorithm is as the one of program
Individual function；FunctionReturning shortest path length, the Distribution path of logistic car is by integer arrayReturn；
If there being the section between two clients to block up, then return traffic congestion information；
Recursive search optimal solution in arrangement space tree, logistics class Logistics is that one is necessary
Preprocessing process；
Assuming thatRepresent the integer array preserving current logistic car Distribution path；Represent to preserve and work as preplanning
The integer array of optimum Distribution path；Integer variableRepresent the road preserved between present node
Electrical path length；Integer variableRepresent the length value preserving current optimal solution, be defined as
Static data member in Logistics.
Backtracking method deep search functionSearch theThe process of individual client is as follows:
(1) whenTime, representOn the father node of the leaf node being in permutation tree, now need verify fromArriveHave a limit and fromTo starting pointAlso there is a limit；If two limit all exists, then it represents that be found that one
Individual new route；Verify the optimal path whether this path has now been found that；The most then path and its length are stored in respectivelyWithIn；
(2) whenTime, check currentThe child nodes of node layer, and during and if only if situations below occurs, move to child
One of child node:
1. have fromArriveA limit, Define the paths in network；
2. path Length less than the length of current optimal solution；
3. variablePreserve the length in the path constructed at present；
When finding a more preferable Distribution path, except updating every timeTime time consumption outside,Need time-consuming；Again because needing to occurSecondary renewal and update each time
Consuming isTime, therefore updating required time is；By use increase stronger restrictive conditions can reduce byThe quantity of the tree node of search.
The described restrictive condition reducing search time is as follows:
(1) at that time, current extensions node is positioned at the of permutation treeLayer；Permutation tree exists from summitTo summit's
Bian Shi, thusConstitute a paths；Therefore, if the cost of this road warp is more than current optimal value, then cut off corresponding
Subtree, thus reduce the amount of calculation of search optimal solution；
(2) when logistic car occurs traffic congestion in delivery process, owing to the road passed by is planned through need not again, it is only necessary to right
Unbeaten route is planned；Therefore, only the node not accessed is optimized and can save the substantial amounts of optimization time.
Described shortest path planning module, uses enhanced simulated annealing, the mould of improvement when customer quantity is more
Intend the generation of annealing algorithm new explanation and accept to be divided into following 5 steps:
(1) new explanation being positioned at solution space is produced by ant group algorithm；
(2) calculating is poor with the object function corresponding to new explanation, and object function difference presses incremental computations；
(3) judging whether new explanation is accepted, the foundation of judgement is an acceptance criterion, and acceptance criterion is that Metropolis is accurate
Then；
(4) when new explanation is determined accepting, replace current solution with new explanation, by current solution corresponding to producing transformation component during new explanation
Divide and be achieved, modified objective function value simultaneously；Now, current solution achieves an iteration；Start next round on this basis
Test；When new explanation is judged as giving up, then on the basis of former current solution, continue next round test；
(5) if iterations is also not up to maximum iteration time, then step (2), (3), (4) are repeated；Otherwise, searching process knot
Bundle.
Described ant swarm method, its step is as follows:
Step1: path initializes；WillFormica fusca is put at randomIndividual client's point, the taboo list of every Formica fusca is that Formica fusca is current
Place client point, each side information is initialized as；
Step2: path configuration；Every Formica fusca selects next client's point according to probability transformational rule, go down successively untilBar
Different paths；
Step3: information updating；After finding client's point, pheromone, current path length, optimal path length are entered every time
Row updates；
Step 4: obtain a result；After going to abundant number of times, obtain the approximate solution of optimal path.
In described shortest path planning module, described Shortest time programming module, whole logistic car is in delivery process
State path planning, step is as follows:
(1) dispensing matrix；Import the weight information between client；If clientWith clientBetween can go directly, then；Otherwise,；
(2) optimal path initializes；, whereinRepresent warehouse,Represent
Individual client；
(3) selected warehouse；Order, whereinIt can be setIn any one integer；
(4) optimal path before asking logistic car to set out；Selected successively by backtracking method or enhanced simulated annealing,,,, thenIt it is exactly the optimal path of current logistic car；
(5) dynamic programming in delivery process；If logistic car runs into traffic congestion during advancing, then need according to logistic car
Present case be adjusted；Specifically adjust as follows with backtracking method or enhanced simulated annealing:
If 1. traffic congestion section occurs the section passed through at logistic car, then logistic car need not change distribution route；
If 2. logistic car also has two clients or a client not to provide and deliver, even if then blocking up, logistic car is except waiting
And have no option；
If 3. traffic congestion event is not to occur on the programme path of logistic car, logistic car is again without change distribution route；
4. if not above-mentioned three kinds of situations, then need, by backtracking method, all clients not provided and delivered are planned optimal path again；
(6) circulation；Repeat step (5), until logistic car dispensing terminates.
The invention has the beneficial effects as follows: user can on analog systems interface the address of random labelling warehouse and client；
The Path Planning that analog systems can select according to user, as shortest path, minimum time etc. carry out distribution route planning；Mould
Plan system can adjust according to certain the section laggard Mobile state of traffic congestion, again plans distribution route；On analog systems interface
Can be with simulating vehicle from warehouse, the distribution route along planning is advanced, and finally returns to warehouse.Delivery process can be simulated
Front course traffic congestion event, analog systems can get around traffic congestion section dynamic programming distribution route.
Accompanying drawing explanation
Fig. 1 is optimum path planning analog systems overall construction drawing in logistics distribution.
Fig. 2 is the main surface chart of analog systems.
Fig. 3 is shortest path planning design sketch.
Shortest path planning design sketch when Fig. 4 is to run into traffic congestion.
Fig. 5 is Shortest time programming design sketch.
Fig. 6 is Shortest time programming design sketch.
Detailed description of the invention
Below in conjunction with the accompanying drawings the present invention is described further.
In logistics distribution, optimum path planning analog systems combines backtracking method, simulated annealing, ant group algorithm, works as visitor
Use backtracking method during the negligible amounts of family, when customer quantity is more, use the simulated annealing of the improvement of intelligent algorithm to calculate
Method.
In logistics distribution, optimum path planning analog systems is divided into several relatively independent module.The modularized design of layering
Thought, system uses modeled programming structure, has stronger operability and extensibility as application program；Structure sheaf
Secondary clearly, organize complete, the most concisely.From top to bottom, system calls modules successively, meets user's request；System is responsible for
Accurately call, it is achieved the planning strategy that user selects, i.e. shortest time or shortest path.
Such as Fig. 1, logistics distribution path planning analog systems is divided into the main interface of system, Shortest time programming, shortest path rule
Draw three modules；System running environment: Microsoft Visual C++6.0.
Such as Fig. 2, the various operations of shortest time and shortest path have been gathered at the main interface of system, and main interface can generate client
Data, including geographical position and the serial number of client of client, and the position etc. in warehouse, also shortest time, shortest path
The button in footpath, the setting in traffic congestion section and the optimal path result of planning show.
Shortest path planning module contains backtracking method and enhanced simulated annealing processes shortest route problem, with storehouse
Centered by storehouse, find the shortest path returning warehouse from warehouse through all clients.
The speed in each section is set to different random values by Shortest time programming module, calculates logistics van and pass through institute
Shortest time needed for some clients.
System uses MFC standard interface, and all associative operations are all integrated on this interface.
System interface, in addition to the above essential information, is divided into five parts；Be respectively path display box, operating list,
Operation box, effect display box, execution prompting frame.
Path display box is used to show Customer Location, customer number, warehouse location, programme path, lorry motion conditions
And dynamically path after revised planning show and lorry movement locus after traffic congestion.Left mouse button clicks on any position of display box
Put, often click on once, a client will be generated, have corresponding round dot to show labelling.The route wherein planned is finally to close
, the one section of straight line being expressed as in display box between some 2 is connected.After have selected warehouse location, face at warehouse
Complexion changed is blue, makes readily discernible.
Operating list includes warehouse location initial block, shortest time and two buttons of shortest path.At the beginning of warehouse location
Beginning frame is used to set the position in warehouse, but premise is must first to have client's point, so could select the conduct of a point from which
Warehouse.For convenience of operation, the position in warehouse is defaulted as 1(that is first client's point by system).After only have selected warehouse,
Shortest path or Shortest time programming can be carried out.Click on " shortest time " button, system to a little (include warehouse and all
Client's point) carry out Shortest time programming.Clicking on " shortest path " button, system can carry out shortest path planning to all points.And
And, both can arbitrarily switch.
Operation box has a " set " button, and the input prompt of " arranging traffic congestion section ".The traffic congestion section arranged
Must being that a certain bar planned in the display box of path determines section, if arbitrarily arranging non-existent traffic congestion section, being
System has the information alert of " traffic congestion route does not exists ", if the repeatedly section arranged is correct, but lorry has passed through
Or by set section, system has the prompting in " traffic congestion information alert evening ", and if lorry will
Return to warehouse, be i.e. in finally or on second from the bottom section, at this moment traffic congestion section is set, due to horse back warehouse to be arrived,
Having already been through other all of clients and must walk remaining section, therefore, system has that " traffic congestion information is invalid, will
Return to warehouse " information.Should be noted that, when arranging traffic congestion section, can be according to the lorry performing prompting frame
Running section information is accurately arranged, and the most more specifically, otherwise, if incorrect setting, has corresponding error message
Remind.This " arranges " not only can arrange and once blocks up, it is also possible to repeatedly arrange repeatedly section, it is achieved Multiple Sections blocks up also
Can dynamically adjust dynamic programming.
Effect display box comprises section, lorry place and time (path) optimal value two pieces.Section, lorry place is shown that
The section that lorry is the most travelling, this section is made up of customer number and an arrow at these two ends, section, and, should
Display is dynamic, and i.e. when lorry arrives another section, section, lorry place also can correspondingly show the client in another section
Numbering.When clicking on " shortest time " in operating list, the lower convenient display time optimal value of effect display box, when in action column
When table selects " shortest path ", the lower optimal value that conveniently shows paths of effect display box.
Perform prompting frame prompting be after planning from warehouse to client again to the concrete route in all paths in warehouse.Only
Have selected " shortest time " or " shortest path ", execution prompting frame just has concrete route and shows.Further, prompting frame is performed
Information be also dynamic, switch between " shortest time " and " shortest path ", or traffic congestion section be set when coming into force,
Perform prompting frame and can change the Dynamic Announce carrying out route according to the planning and adjusting of system dynamics.Make that lorry travels all specifically
Route is very clear.
Claims (8)
1. optimum path planning analog systems in logistics distribution, it is characterised in that include the main interface of system, Shortest time programming,
Short path planning module；
The main interface module of described system, has gathered the various operations of shortest time and shortest path, and main interface can generate client
Data, including geographical position and the serial number of client of client, and the position etc. in warehouse, also shortest time, shortest path
The button in footpath, the setting in traffic congestion section and the optimal path result of planning show；
Described shortest path planning module, contains backtracking method and enhanced simulated annealing processes shortest path first, with
Centered by warehouse, find the shortest path returning warehouse from warehouse through all clients；
Described Shortest time programming module, is set to different value as required by the speed in each section, calculates logistics van and passes through
Shortest time needed for all of client.
Optimum path planning analog systems in logistics distribution the most according to claim 1, it is characterised in that described system master
Interface module, including path display box, operating list, operation box, effect display box, performs prompting frame；
Described path display box, be used for show Customer Location, customer number, warehouse location, programme path, lorry motion conditions with
And dynamically path after revised planning show and lorry movement locus after traffic congestion；Left mouse button clicks on the optional position of display box,
Often click on once, a client will be generated, have corresponding round dot to show labelling；The route of described planning is finally to close,
The one section of straight line being expressed as in display box between some 2 is connected；
Described operating list, includes warehouse location initial block, shortest time and two buttons of shortest path；Warehouse location is initial
Frame is used for setting the position in warehouse；After selected warehouse location, click on " shortest time " button, to a little, including warehouse point and
Client's point, carries out Shortest time programming；Clicking on " shortest path " button, system can carry out shortest path planning to all points；?
Short time button, shortest path button can arbitrarily switch；
Described operation box, has a " set " button, and the input prompt of " arranging traffic congestion section " in operation box；
Described effect display box, display section, lorry place, time and path optimal value；
Described execution prompting frame, again to the concrete route in all paths in warehouse from warehouse to client after prompting planning.
Optimum path planning analog systems in logistics distribution the most according to claim 1, it is characterised in that described shortest path
Footpath planning module, uses backtracking method when customer quantity is less, and backtracking algorithm is as a function of program；FunctionReturning shortest path length, the Distribution path of logistic car is by integer arrayReturn；If there being two clients
Between section block up, then return traffic congestion information；
Recursive search optimal solution in arrangement space tree, logistics class Logistics is that one is necessary
Preprocessing process；
Assuming thatRepresent the integer array preserving current logistic car Distribution path；Represent to preserve and work as preplanning
The integer array of optimum Distribution path；Integer variableRepresent the road preserved between present node
Electrical path length；Integer variableRepresent the length value preserving current optimal solution, be defined as
Static data member in Logistics.
Optimum path planning analog systems in logistics distribution the most according to claim 3, it is characterised in that the backtracking method degree of depth
Search functionSearch theThe process of individual client is as follows:
(1) whenTime, representOn the father node of the leaf node being in permutation tree, now need verify fromArriveHave a limit and fromTo starting pointAlso there is a limit；If two limit all exists, then it represents that be found that one
Individual new route；Verify the optimal path whether this path has now been found that；The most then path and its length are stored in respectivelyWithIn；
(2) whenTime, check currentThe child nodes of node layer, and during and if only if situations below occurs, move to child
One of child node:
1. have fromArriveA limit, Define the paths in network；
2. path Length less than the length of current optimal solution；
3. variablePreserve the length in the path constructed at present；
When finding a more preferable Distribution path, except updating every timeTime time consumption outside,Need time-consuming；Again because needing to occurSecondary renewal and update each time
Consuming isTime, therefore updating required time is；By use increase stronger restrictive conditions can reduce byThe quantity of the tree node of search.
Optimum path planning analog systems in logistics distribution the most according to claim 4, it is characterised in that described minimizing is searched
The restrictive condition of rope time is as follows:
(1) at that time, current extensions node is positioned at the of permutation treeLayer；Permutation tree exists from summitTo summitLimit
Time, thusConstitute a paths；Therefore, if the cost of this road warp is more than current optimal value, then corresponding son is cut off
Tree, thus reduce the amount of calculation of search optimal solution；
(2) when logistic car occurs traffic congestion in delivery process, owing to the road passed by is planned through need not again, it is only necessary to right
Unbeaten route is planned；Therefore, only the node not accessed is optimized and can save the substantial amounts of optimization time.
Optimum path planning analog systems in logistics distribution the most according to claim 1, it is characterised in that described shortest path
Footpath planning module, uses enhanced simulated annealing, the product of enhanced simulated annealing new explanation when customer quantity is more
Raw and accept to be divided into following 5 steps:
(1) new explanation being positioned at solution space is produced by ant group algorithm；
(2) calculating is poor with the object function corresponding to new explanation, and object function difference presses incremental computations；
(3) judging whether new explanation is accepted, the foundation of judgement is an acceptance criterion, and acceptance criterion is that Metropolis is accurate
Then；
(4) when new explanation is determined accepting, replace current solution with new explanation, by current solution corresponding to producing transformation component during new explanation
Divide and be achieved, modified objective function value simultaneously；Now, current solution achieves an iteration；Start next round on this basis
Test；When new explanation is judged as giving up, then on the basis of former current solution, continue next round test；
(5) if iterations is also not up to maximum iteration time, then step (2), (3), (4) are repeated；Otherwise, searching process knot
Bundle.
Optimum path planning analog systems in logistics distribution the most according to claim 6, it is characterised in that described ant swarm
Method, its step is as follows:
Step1: path initializes；WillFormica fusca is put at randomIndividual client's point, the taboo list of every Formica fusca is the current institute of Formica fusca
At client's point, each side information is initialized as；
Step2: path configuration；Every Formica fusca selects next client's point according to probability transformational rule, go down successively untilBar is not
Same path；
Step3: information updating；After finding client's point, pheromone, current path length, optimal path length are entered every time
Row updates；
Step 4: obtain a result；After going to abundant number of times, obtain the approximate solution of optimal path.
Optimum path planning analog systems in logistics distribution the most according to claim 1, it is characterised in that described shortest path
In footpath planning module, described Shortest time programming module, whole logistic car is dynamic programming path in delivery process, and step is such as
Under:
(1) dispensing matrix；Import the weight information between client；If clientWith clientBetween can go directly, then
；Otherwise,；
(2) optimal path initializes；, whereinRepresent warehouse,RepresentIndividual
Client；
(3) selected warehouse；Order, whereinIt can be setIn any one integer；
(4) optimal path before asking logistic car to set out；Selected successively by backtracking method or enhanced simulated annealing,,,, thenIt it is exactly the optimal path of current logistic car；
(5) dynamic programming in delivery process；If logistic car runs into traffic congestion during advancing, then need according to logistic car
Present case be adjusted；Specifically adjust as follows with backtracking method or enhanced simulated annealing:
If 1. traffic congestion section occurs the section passed through at logistic car, then logistic car need not change distribution route；
If 2. logistic car also has two clients or a client not to provide and deliver, even if then blocking up, logistic car is except waiting
And have no option；
If 3. traffic congestion event is not to occur on the programme path of logistic car, logistic car is again without change distribution route；
4. if not above-mentioned three kinds of situations, then need, by backtracking method, all clients not provided and delivered are planned optimal path again；
(6) circulation；Repeat step (5), until logistic car dispensing terminates.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610694040.XA CN106156897A (en) | 2016-08-22 | 2016-08-22 | Optimum path planning analog systems in logistics distribution |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610694040.XA CN106156897A (en) | 2016-08-22 | 2016-08-22 | Optimum path planning analog systems in logistics distribution |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN106156897A true CN106156897A (en) | 2016-11-23 |
Family
ID=57341722
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610694040.XA Pending CN106156897A (en) | 2016-08-22 | 2016-08-22 | Optimum path planning analog systems in logistics distribution |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106156897A (en) |
Cited By (36)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106980912A (en) * | 2017-04-07 | 2017-07-25 | 广东电网有限责任公司佛山供电局 | A kind of multiple spot distribution routing planning method and system |
| CN107065865A (en) * | 2017-03-21 | 2017-08-18 | 北京航空航天大学 | A kind of paths planning method based on the quick random search tree algorithm of beta pruning |
| CN107274033A (en) * | 2017-06-29 | 2017-10-20 | 安徽电信规划设计有限责任公司 | A kind of easy-to-use Parts supply method for optimizing route |
| CN107679656A (en) * | 2017-09-28 | 2018-02-09 | 浪潮软件股份有限公司 | A kind of order distribution route generation method and device |
| CN107798423A (en) * | 2017-10-11 | 2018-03-13 | 南京邮电大学 | Vehicle path planning Simulation Experimental Platform based on multi-intelligence algorithm |
| CN108108847A (en) * | 2017-12-29 | 2018-06-01 | 合肥工业大学 | A kind of paths planning method of electric business logistics last one kilometer dispatching |
| CN108133343A (en) * | 2017-12-25 | 2018-06-08 | 东风农业装备（襄阳）有限公司 | For the energy delivery system and its allocator and energy auxiliary point of agricultural machinery and its management system |
| CN108154254A (en) * | 2017-07-24 | 2018-06-12 | 南京交通职业技术学院 | Logistic distribution vehicle dispatching method based on modified A* algorithms |
| CN108182499A (en) * | 2018-01-25 | 2018-06-19 | 上海交通大学 | A kind of hybrid ant colony for VRP problems and its realize system |
| CN108681861A (en) * | 2018-06-19 | 2018-10-19 | 品信科技有限公司 | A kind of Distribution path method and device for planning |
| WO2018195815A1 (en) * | 2017-04-26 | 2018-11-01 | 深圳市元征科技股份有限公司 | Article delivery method and terminal |
| CN108734434A (en) * | 2018-06-13 | 2018-11-02 | 苏州若依玫信息技术有限公司 | A kind of electronic commercial distribution system based on discrete merchandise news |
| CN109034477A (en) * | 2018-07-27 | 2018-12-18 | 重庆大学 | A kind of shortest path searching method of the urban logistics distribution based on time reliability |
| CN109141430A (en) * | 2018-09-04 | 2019-01-04 | 南京理工大学 | Electric inspection process robot path planning method based on simulated annealing ant group algorithm |
| CN109214756A (en) * | 2018-09-17 | 2019-01-15 | 安吉汽车物流股份有限公司 | Based on ant group algorithm and the complete vehicle logistics dispatching method and device of hierarchy optimization, storage medium, terminal |
| CN109325680A (en) * | 2018-09-12 | 2019-02-12 | 山东大学 | Consider the single machine batch sort method of the minimum delay total time of study efficacy |
| CN109615133A (en) * | 2018-12-10 | 2019-04-12 | 达疆网络科技(上海)有限公司 | A kind of determining method of path and device |
| CN109658037A (en) * | 2019-01-10 | 2019-04-19 | 跨越速运集团有限公司 | A kind of logistics route Intelligent planning method and system |
| CN109872111A (en) * | 2019-03-12 | 2019-06-11 | 武汉轻工大学 | Logistics Distribution Method, unmanned plane, storage medium and device based on unmanned plane |
| CN109978274A (en) * | 2019-04-02 | 2019-07-05 | 海南阿凡题科技有限公司 | Dispatch the planing method in path |
| CN110197311A (en) * | 2019-06-12 | 2019-09-03 | 江苏航运职业技术学院 | A kind of logistics distribution paths planning method based on intelligent optimization |
| CN110263986A (en) * | 2019-06-05 | 2019-09-20 | 四川驹马科技有限公司 | A kind of logistics distribution system and method adapting to complicated traffic variation |
| CN110276467A (en) * | 2018-03-14 | 2019-09-24 | 米思米（中国）精密机械贸易有限公司 | Logistic Scheduling method, Logistic Scheduling server and logistic dispatching system |
| CN110851755A (en) * | 2019-09-29 | 2020-02-28 | 口碑(上海)信息技术有限公司 | Method and device for acquiring delivery path information and electronic equipment |
| CN110871979A (en) * | 2018-08-30 | 2020-03-10 | 株式会社日立制作所 | Picking support system and picking support method |
| CN111160654A (en) * | 2019-12-31 | 2020-05-15 | 哈工汇智(深圳)科技有限公司 | Transportation path optimization method for reducing total cost based on fuzzy C-means-simulated annealing algorithm |
| CN111176753A (en) * | 2019-12-20 | 2020-05-19 | 贝壳技术有限公司 | Cloud resource optimal configuration method and device, electronic equipment and readable storage medium |
| CN111311957A (en) * | 2020-05-15 | 2020-06-19 | 南京邮电大学 | Parking guidance system based on RFID and unmanned aerial vehicle and working method |
| CN111311019A (en) * | 2020-03-10 | 2020-06-19 | 山西省地震局 | Logistics distribution system based on population distribution |
| CN111915078A (en) * | 2020-07-29 | 2020-11-10 | 中国烟草总公司湖北省公司 | Data-driven flexible cigarette distribution line planning method and system |
| CN111967811A (en) * | 2020-07-08 | 2020-11-20 | 吉林大学 | Urban traffic environment-oriented hybrid logistics vehicle path planning method and system |
| CN112836844A (en) * | 2019-11-25 | 2021-05-25 | 株式会社日立制作所 | Delivery plan generating device and delivery plan generating method |
| CN112947422A (en) * | 2021-01-28 | 2021-06-11 | 电子科技大学 | Navigation control method and platform for ROS unmanned vehicle |
| CN113222282A (en) * | 2021-05-31 | 2021-08-06 | 北京京东乾石科技有限公司 | Method and device for determining conveying path, readable storage medium and electronic equipment |
| CN114004386A (en) * | 2021-02-24 | 2022-02-01 | 成都知原点科技有限公司 | Virtual logistics transit station site selection and distribution path optimization method based on intelligent algorithm |
| CN116310184A (en) * | 2023-03-30 | 2023-06-23 | 上海勘测设计研究院有限公司 | Pile length determining method, storage medium, equipment and system for photovoltaic power generation precast pile |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104063745A (en) * | 2014-04-21 | 2014-09-24 | 河海大学 | Multi-path planning method based on improved particle swarm optimization |
| CN104616070A (en) * | 2015-01-15 | 2015-05-13 | 北京农业信息技术研究中心 | Method and device for planning logistics distribution route |
| CN104766188A (en) * | 2014-01-02 | 2015-07-08 | 中国移动通信集团江苏有限公司 | Logistics distribution method and logistics distribution system |
-
2016
- 2016-08-22 CN CN201610694040.XA patent/CN106156897A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104766188A (en) * | 2014-01-02 | 2015-07-08 | 中国移动通信集团江苏有限公司 | Logistics distribution method and logistics distribution system |
| CN104063745A (en) * | 2014-04-21 | 2014-09-24 | 河海大学 | Multi-path planning method based on improved particle swarm optimization |
| CN104616070A (en) * | 2015-01-15 | 2015-05-13 | 北京农业信息技术研究中心 | Method and device for planning logistics distribution route |
Non-Patent Citations (2)
| Title |
|---|
| 王防修等: "基于回溯法的Dijkstra算法改进及仿真", 《计算机仿真》 * |
| 苟有HP: "物流配送中的最优路径规划模拟软件说明书", 《HTTPS://WENKE.BAIDU.COM/VIEW/FD27602171FE910EF12DF8F6.HTML》 * |
Cited By (46)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107065865A (en) * | 2017-03-21 | 2017-08-18 | 北京航空航天大学 | A kind of paths planning method based on the quick random search tree algorithm of beta pruning |
| CN106980912B (en) * | 2017-04-07 | 2021-01-08 | 广东电网有限责任公司佛山供电局 | Multipoint distribution line planning method and system |
| CN106980912A (en) * | 2017-04-07 | 2017-07-25 | 广东电网有限责任公司佛山供电局 | A kind of multiple spot distribution routing planning method and system |
| WO2018195815A1 (en) * | 2017-04-26 | 2018-11-01 | 深圳市元征科技股份有限公司 | Article delivery method and terminal |
| CN107274033A (en) * | 2017-06-29 | 2017-10-20 | 安徽电信规划设计有限责任公司 | A kind of easy-to-use Parts supply method for optimizing route |
| CN108154254A (en) * | 2017-07-24 | 2018-06-12 | 南京交通职业技术学院 | Logistic distribution vehicle dispatching method based on modified A* algorithms |
| CN108154254B (en) * | 2017-07-24 | 2022-04-05 | 南京交通职业技术学院 | Logistics distribution vehicle scheduling method based on improved A-x algorithm |
| CN107679656A (en) * | 2017-09-28 | 2018-02-09 | 浪潮软件股份有限公司 | A kind of order distribution route generation method and device |
| CN107798423A (en) * | 2017-10-11 | 2018-03-13 | 南京邮电大学 | Vehicle path planning Simulation Experimental Platform based on multi-intelligence algorithm |
| CN108133343A (en) * | 2017-12-25 | 2018-06-08 | 东风农业装备（襄阳）有限公司 | For the energy delivery system and its allocator and energy auxiliary point of agricultural machinery and its management system |
| CN108108847B (en) * | 2017-12-29 | 2021-05-04 | 合肥工业大学 | Route planning method for last kilometer distribution of E-commerce logistics |
| CN108108847A (en) * | 2017-12-29 | 2018-06-01 | 合肥工业大学 | A kind of paths planning method of electric business logistics last one kilometer dispatching |
| CN108182499B (en) * | 2018-01-25 | 2022-04-08 | 上海交通大学 | Mixed ant colony algorithm aiming at VRP problem and implementation system thereof |
| CN108182499A (en) * | 2018-01-25 | 2018-06-19 | 上海交通大学 | A kind of hybrid ant colony for VRP problems and its realize system |
| CN110276467A (en) * | 2018-03-14 | 2019-09-24 | 米思米（中国）精密机械贸易有限公司 | Logistic Scheduling method, Logistic Scheduling server and logistic dispatching system |
| CN108734434A (en) * | 2018-06-13 | 2018-11-02 | 苏州若依玫信息技术有限公司 | A kind of electronic commercial distribution system based on discrete merchandise news |
| CN108681861A (en) * | 2018-06-19 | 2018-10-19 | 品信科技有限公司 | A kind of Distribution path method and device for planning |
| CN109034477A (en) * | 2018-07-27 | 2018-12-18 | 重庆大学 | A kind of shortest path searching method of the urban logistics distribution based on time reliability |
| CN110871979A (en) * | 2018-08-30 | 2020-03-10 | 株式会社日立制作所 | Picking support system and picking support method |
| CN109141430B (en) * | 2018-09-04 | 2022-02-18 | 南京理工大学 | Power inspection robot path planning method based on simulated annealing ant colony algorithm |
| CN109141430A (en) * | 2018-09-04 | 2019-01-04 | 南京理工大学 | Electric inspection process robot path planning method based on simulated annealing ant group algorithm |
| CN109325680A (en) * | 2018-09-12 | 2019-02-12 | 山东大学 | Consider the single machine batch sort method of the minimum delay total time of study efficacy |
| CN109214756A (en) * | 2018-09-17 | 2019-01-15 | 安吉汽车物流股份有限公司 | Based on ant group algorithm and the complete vehicle logistics dispatching method and device of hierarchy optimization, storage medium, terminal |
| CN109615133A (en) * | 2018-12-10 | 2019-04-12 | 达疆网络科技(上海)有限公司 | A kind of determining method of path and device |
| CN109658037B (en) * | 2019-01-10 | 2021-08-17 | 跨越速运集团有限公司 | Intelligent planning method and system for logistics path |
| CN109658037A (en) * | 2019-01-10 | 2019-04-19 | 跨越速运集团有限公司 | A kind of logistics route Intelligent planning method and system |
| CN109872111A (en) * | 2019-03-12 | 2019-06-11 | 武汉轻工大学 | Logistics Distribution Method, unmanned plane, storage medium and device based on unmanned plane |
| CN109978274A (en) * | 2019-04-02 | 2019-07-05 | 海南阿凡题科技有限公司 | Dispatch the planing method in path |
| CN110263986A (en) * | 2019-06-05 | 2019-09-20 | 四川驹马科技有限公司 | A kind of logistics distribution system and method adapting to complicated traffic variation |
| CN110197311A (en) * | 2019-06-12 | 2019-09-03 | 江苏航运职业技术学院 | A kind of logistics distribution paths planning method based on intelligent optimization |
| CN110851755A (en) * | 2019-09-29 | 2020-02-28 | 口碑(上海)信息技术有限公司 | Method and device for acquiring delivery path information and electronic equipment |
| CN112836844A (en) * | 2019-11-25 | 2021-05-25 | 株式会社日立制作所 | Delivery plan generating device and delivery plan generating method |
| CN111176753B (en) * | 2019-12-20 | 2021-01-05 | 贝壳找房(北京)科技有限公司 | Cloud resource optimal configuration method and device, electronic equipment and readable storage medium |
| CN111176753A (en) * | 2019-12-20 | 2020-05-19 | 贝壳技术有限公司 | Cloud resource optimal configuration method and device, electronic equipment and readable storage medium |
| CN111160654A (en) * | 2019-12-31 | 2020-05-15 | 哈工汇智(深圳)科技有限公司 | Transportation path optimization method for reducing total cost based on fuzzy C-means-simulated annealing algorithm |
| CN111311019A (en) * | 2020-03-10 | 2020-06-19 | 山西省地震局 | Logistics distribution system based on population distribution |
| CN111311019B (en) * | 2020-03-10 | 2021-05-14 | 山西省地震局 | Logistics distribution system based on population distribution |
| CN111311957A (en) * | 2020-05-15 | 2020-06-19 | 南京邮电大学 | Parking guidance system based on RFID and unmanned aerial vehicle and working method |
| CN111967811A (en) * | 2020-07-08 | 2020-11-20 | 吉林大学 | Urban traffic environment-oriented hybrid logistics vehicle path planning method and system |
| CN111967811B (en) * | 2020-07-08 | 2022-10-04 | 吉林大学 | Urban traffic environment-oriented hybrid logistics vehicle path planning method and system |
| CN111915078A (en) * | 2020-07-29 | 2020-11-10 | 中国烟草总公司湖北省公司 | Data-driven flexible cigarette distribution line planning method and system |
| CN111915078B (en) * | 2020-07-29 | 2023-09-26 | 中国烟草总公司湖北省公司 | Flexible cigarette distribution line planning method and system based on data driving |
| CN112947422A (en) * | 2021-01-28 | 2021-06-11 | 电子科技大学 | Navigation control method and platform for ROS unmanned vehicle |
| CN114004386A (en) * | 2021-02-24 | 2022-02-01 | 成都知原点科技有限公司 | Virtual logistics transit station site selection and distribution path optimization method based on intelligent algorithm |
| CN113222282A (en) * | 2021-05-31 | 2021-08-06 | 北京京东乾石科技有限公司 | Method and device for determining conveying path, readable storage medium and electronic equipment |
| CN116310184A (en) * | 2023-03-30 | 2023-06-23 | 上海勘测设计研究院有限公司 | Pile length determining method, storage medium, equipment and system for photovoltaic power generation precast pile |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106156897A (en) | Optimum path planning analog systems in logistics distribution | |
| CN110782086B (en) | Rescue vehicle distribution path optimization method and system with unmanned aerial vehicle | |
| CN110705742A (en) | Logistics distribution method based on improved ant colony algorithm | |
| CN105469201A (en) | Method for logistics dispensing center work task processing and scheduling | |
| CN110334838B (en) | AGV trolley cooperative scheduling method and system based on ant colony algorithm and genetic algorithm | |
| CN108924198A (en) | A kind of data dispatching method based on edge calculations, apparatus and system | |
| CN109002902A (en) | Subregion multistage fresh agricultural products dynamic vehicle method for optimizing route | |
| CN110471417B (en) | Multi-AGV collision prevention method based on load balancing | |
| CN107578119A (en) | A kind of resource allocation global optimization method of intelligent dispatching system | |
| CN107798423A (en) | Vehicle path planning Simulation Experimental Platform based on multi-intelligence algorithm | |
| CN102663574A (en) | Multi-RGV dynamic scheduling method based on genetic algorithm | |
| CN110319829A (en) | Unmanned aerial vehicle flight path planing method based on adaptive polymorphic fusion ant colony algorithm | |
| CN108629531A (en) | Freight transportation method and device for cargo transport | |
| CN109934388A (en) | One kind sorting optimization system for intelligence | |
| CN107358325A (en) | A kind of Location Selection of Logistics Distribution Center method, apparatus and computer-readable recording medium | |
| CN106611378A (en) | Priority encoding-based hybrid genetic algorithm for solving job-shop scheduling problem | |
| CN111445094B (en) | Express vehicle path optimization method and system based on time requirement | |
| Liao et al. | An ant colony optimization algorithm for setup coordination in a two-stage production system | |
| CN104680264A (en) | Transportation vehicle path optimizing method based on multi-agent reinforcement learning | |
| CN107909228A (en) | Based on mould because of the dynamic vehicle shipping and receiving paths planning method and device of calculating | |
| CN107944748B (en) | Flexible job shop personnel configuration and job sequencing method | |
| CN106408162A (en) | Product oil pipeline sequence conveying batch control method | |
| CN109359771A (en) | A kind of line haul vehicle and goods matching algorithm based on big data | |
| CN106980953A (en) | A kind of dynamic path planning method of Logistics Oriented | |
| CN106295791A (en) | For the method finding travelling salesman's optimal path |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20161123 |