CN112101638A - Cooperative optimization method for urban logistics distribution range - Google Patents

Cooperative optimization method for urban logistics distribution range Download PDF

Info

Publication number
CN112101638A
CN112101638A CN202010875016.2A CN202010875016A CN112101638A CN 112101638 A CN112101638 A CN 112101638A CN 202010875016 A CN202010875016 A CN 202010875016A CN 112101638 A CN112101638 A CN 112101638A
Authority
CN
China
Prior art keywords
distribution
cost
matching
center
logistics
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN202010875016.2A
Other languages
Chinese (zh)
Other versions
CN112101638B (en
Inventor
温惠英
蒋晗
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
South China University of Technology SCUT
Original Assignee
South China University of Technology SCUT
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by South China University of Technology SCUT filed Critical South China University of Technology SCUT
Priority to CN202010875016.2A priority Critical patent/CN112101638B/en
Publication of CN112101638A publication Critical patent/CN112101638A/en
Application granted granted Critical
Publication of CN112101638B publication Critical patent/CN112101638B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

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/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

Landscapes

  • Business, Economics & Management (AREA)
  • Engineering & Computer Science (AREA)
  • Economics (AREA)
  • Human Resources & Organizations (AREA)
  • Strategic Management (AREA)
  • Quality & Reliability (AREA)
  • Marketing (AREA)
  • Operations Research (AREA)
  • Entrepreneurship & Innovation (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)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

The invention discloses a city logistics distribution range collaborative optimization method, which comprises the following steps: 1) acquiring urban road network structure information, urban road network real-time traffic flow data, distribution center position and corresponding capacity information, distribution station position and corresponding demand information, and setting the minimum total distribution cost as an optimization principle; 2) calculating the cost C from each center to each station according to the acquired urban road information such as real-time traffic flow data and the like, and matching according to the principle of minimum total cost in the step 1); 3) after the step 2) is finished, the remaining sites which are not matched yet enter a second matching process: in the process, the rest sites are taken as objects, a distribution center with the minimum distribution cost is searched for matching, and the matching process is ended after all the sites are matched; 4) and outputting a distribution range division optimization result comprising distribution cost and a distribution range division scheme. The invention can improve the logistics distribution efficiency and reduce the distribution cost.

Description

Cooperative optimization method for urban logistics distribution range
Technical Field
The invention relates to the technical field of traffic logistics distribution, in particular to a city logistics distribution range collaborative optimization method.
Background
With the rapid development of the internet era and the steady promotion of national economy, the logistics industry plays an increasingly important role in the increasing material demand of people, and for logistics enterprises, the distribution cost is the most important consideration factor in the whole distribution process. In a complex and variable traffic network, how to be able to have a logistics distribution scheme that minimizes the total cost is a first problem to be solved by logistics enterprises nowadays. The distribution range division is particularly important in the whole distribution scheme. The distribution range division refers to a process of determining the distribution range of the center and matching the center and the stations with each other on the basis of the known positions of the center and the stations. By dividing the distribution range and effectively matching the center and the stations, the optimal distribution scheme can be obtained, so that the aim of saving the distribution cost is fulfilled. The disadvantages of the current urban logistics distribution method are probably the following: (1) due to the limitations of a solving algorithm and an optimization method, the division of the logistics distribution range is difficult to have global optimality and only feasible; (2) the weight calculation between the distribution center and the station is constant, is not influenced by factors such as time, traffic flow, climate and oil price, and is not in accordance with the reality. (3) When the distribution range of the stations is clustered and divided, the topological structure of a road network is often ignored, only the geometric position distance between two points is considered, the distance is not consistent with the actual distance, and the method is difficult to be directly applied. In view of this, a method for collaborative optimization of urban logistics distribution range is provided to achieve the purpose of minimizing the total distribution cost. The method and the system can optimize the distribution range division process of the logistics enterprises, are more suitable for other traffic and transportation range division scenes, namely the distribution range division and other traffic and transportation range division optimization scenes of the logistics enterprises are all in the research range of the method and the system, and can provide reference and support for the traffic and transportation range division.
Disclosure of Invention
The invention aims to overcome the defects and shortcomings of the prior art and provides a collaborative optimization method for an urban logistics distribution range, which is based on the traffic state of an urban road network and the capacities of a distribution center and a station to carry out collaborative optimization so as to reduce the logistics distribution cost and enable a distribution range division scheme to have higher economical efficiency, effectiveness and reliability.
In order to achieve the purpose, the technical scheme provided by the invention is as follows: a city logistics distribution range collaborative optimization method comprises the following steps:
1) acquiring urban road network structure information, urban road network real-time traffic flow data, distribution center position and corresponding capacity information, distribution station position and corresponding demand information, analyzing cost composition in the process of dividing logistics distribution ranges, selecting reasonable cost composition elements, and setting the minimum total distribution cost as an optimization principle;
2) calculating the cost C from each center to each station according to the acquired urban road network structure information and the real-time traffic flow data, and matching according to the minimum principle of the total distribution cost in the step 1): starting from a distribution center, selecting distribution stations for matching;
3) step 2) after the matching is finished, the remaining sites which are not matched yet enter a second matching process, the process takes the remaining sites as objects, a distribution center with the minimum distribution cost is searched for matching, and the matching process is finished after all the sites are matched;
4) and taking the matching mode obtained in the first two steps as an optimized logistics distribution range, calculating the final total distribution cost, and outputting a distribution range division optimization result which comprises the distribution cost and a distribution range division scheme.
In the step 1), the urban road network structure information comprises urban road network intersection adjacency information and road section length information, and urban road network structure information data can be acquired from an urban planning design scheme; the urban road network real-time traffic flow data comprises real-time information of average driving speed of vehicles at each road section of the urban road network and average traffic delay at intersections, and can be obtained from an urban road traffic command center; the distribution center position and the corresponding capacity information can acquire data information of the planned distribution center from the logistics enterprises; the distribution station position and the corresponding demand information can acquire the cargo demand distribution amount of each station from a logistics network management background; the cost component comprises the oil consumption cost of the vehicle and the road toll cost when passing through the toll station; the optimization principle is as follows: considering the distance, the oil consumption cost generated by delay and the road toll cost in the route, and optimizing by taking the minimum total distribution cost C of logistics transportation as an objective function, namely:
MinC＝C1+C2 (1)
wherein, C1Cost of fuel consumption for distance and delay time, C2Is the road toll cost in the path.
In the steps 2) and 3), constructing a collaborative optimization basic frame according to a matching process between a distribution center and a station in the distribution range division process, dividing the matching selection between the distribution center and the station into two sub-processes, starting from a distribution center i in the first process, considering the minimum distribution cost C, selecting the distribution station by the ripple diffusion algorithm principle until the maximum distribution range R of the distribution center i is reachediOr accumulating the maximum delivery amount SiWhen the matching of the distribution center i and the k stations is finished, matching of the next distribution center i +1 is carried out until all the distribution centers reach the maximum distribution range or the constraint condition of the accumulated maximum distribution amount; and after the first process is finished, the remaining sites which are not matched yet enter a second matching process, the process takes the remaining sites as objects, a distribution center which does not reach the maximum accumulated capacity is searched for with the aim of minimum cost, and the searched distribution center distributes the sites.
In the steps 2) and 3), according to the running characteristics of the vehicles on the urban road, introducing a ripple diffusion algorithm and improving the termination condition of the ripple relay race, and providing a boundary ripple diffusion algorithm, wherein the specific conditions are as follows:
the expansion phenomenon of the ripples in nature reflects an optimization principle that the ripples always reach the space points closest to the centers of the ripples firstly, because the speed of the ripple expansion is the same in all directions, and when the ripples reach a certain space point, new ripples are generated to continue to diffuse outwards.
In step 4), the distribution cost is divided into two parts, and C is set1The cost of all oil consumption during transportation, the value of which is related to the distance and the transportation time, is divided into the cost of oil consumption caused by the transportation distance and the oil caused by delayCost per unit price of p1And p2；C2Cost per unit of p for toll in the route3Thus, there are:
Figure BDA0002652372520000041
tik＝tr-tt (3)
wherein m is the number of distribution centers, n is the number of distribution sites, tikTo delay time, trFor the actual delivery time, ttTo theoretically deliver time, /)ikThe distribution distance from the distribution center i to the station k;
C2for road toll cost in the path:
Figure BDA0002652372520000042
wherein f isik∈Wi，WiThe collection of toll road sections is passed through in the distribution route.
In step 4), after the distribution range optimization is completed, the distribution range is updated for the distribution center, the distribution sites are matched, and the distribution cost and the distribution range division scheme are output.
Compared with the prior art, the invention has the following advantages and beneficial effects:
1. in the city logistics distribution range collaborative optimization method provided by the invention, a boundary ripple diffusion algorithm is used, the algorithm is an algorithm for searching an optimal path, the robustness and the efficiency are excellent, and an optimal matching scheme can be quickly searched by utilizing the boundary ripple diffusion algorithm.
2. In a static road network, the distribution time is greatly reduced, and the time cost can be greatly saved by using the invention; in a dynamic road network, although the ripple diffusion is influenced by congestion delay in the road network, the distribution time can be effectively reduced by using the invention.
3. The invention can effectively reduce the distribution cost. The invention can effectively reduce the distribution cost no matter in which road network. The traditional distribution range division mode mostly adopts a clustering method, only Euclidean distance factors are considered, and various actual conditions in a road network are rarely considered.
4. The distribution range division is often ignored in the logistics distribution, the invention fills the deficient part in the distribution range division optimization method, and provides convenience and decision thinking for scholars or enterprises related to relevant problems in the logistics distribution process in the future.
5. After the steps are optimized according to the invention, the calculation method of the system is formed, compared with the existing distribution range optimization method, the method has stronger operability, improves the efficiency and the reliability of distribution range division, and has important theoretical significance and social value.
Drawings
FIG. 1 is a flow diagram of the method of the present invention.
FIG. 2 is a basic flow chart of the boundary ripple diffusion algorithm of the present invention.
FIG. 3 is a schematic diagram of the boundary ripple diffusion principle of the present invention.
FIG. 4 is a schematic diagram of the operation of the boundary ripple relay race of the present invention.
FIG. 5 is a basic framework diagram of the distribution range co-optimization of the present invention.
FIG. 6 is a diagram illustrating the result of the unoptimized distribution range partition according to the present invention.
Fig. 7 is a schematic diagram of a delivery range division cooperative optimization result output in the present invention.
FIG. 8 is a comparison of correlation results before and after optimization according to the present invention.
Detailed Description
The present invention will be further described with reference to the following specific examples.
As shown in fig. 1, the method for collaborative optimization of urban logistics distribution range provided by this embodiment includes the following steps:
1) the method comprises the steps of obtaining urban road network structure information, urban road network real-time traffic flow data, distribution center position and corresponding capacity information, distribution station position and corresponding demand information, analyzing cost composition in the process of dividing logistics distribution ranges, selecting reasonable cost composition elements, and setting the minimum total distribution cost as an optimization principle.
The urban road network structure information comprises urban road network intersection adjacency information and road section length information, and urban road network structure information data can be obtained from an urban planning design scheme; the urban road network real-time traffic flow data comprises real-time information of average driving speed of vehicles at each road section of the urban road network and average traffic delay at intersections, and can be obtained from an urban road traffic command center; the distribution center position and the corresponding capacity information can obtain data information of the planned distribution center from the logistics enterprises; the distribution station position and the corresponding demand information can acquire the cargo demand distribution amount of each station from a logistics network management background; the cost component includes a fuel consumption cost of the vehicle and a road toll cost when passing through the toll station.
The urban road network structure information is as follows: the scale of the nodes of the road network is N-400, each node in the road network is connected with other 2-4 nodes, a distribution center and stations are randomly generated on the nodes, the number m of the distribution centers is 5, the number N of the stations is 50, and a corresponding capacity parameter diIn the range of [1,3]In cubic meters; the simulated road network for simulating the urban road traffic condition to generate the dynamic evolution of the speed has different road section speeds among nodes, and the speed value range of a common road section is (15, 60)]km/h, the express road section is shown in a road network graph in a bold way, and the speed value is [60,80 ]]km/h; the distances between the central and the inter-site sections are different, and the distance between the nodes is [150,300 ]]The unit is meter; because the delivery vehicles arrive at the intersection randomly, the delay of the delivery vehicles passing through the intersection is assumed to be a random value, and the value range is [30,60 ]]The unit is seconds.
Setting the minimum total cost C in the distribution process as an optimization target, taking 2/3 of the center maximum distribution range value obtained by a clustering algorithm as the maximum range of each distribution center of the optimization method, and taking the accumulated capacity of the stations matched to the centers in the clustering algorithm result as the maximum capacity of each distribution center of the optimization method.
Considering the distance, the oil consumption cost generated by delay and the road toll cost in the route, and optimizing by taking the minimum total distribution cost C of logistics transportation as an objective function, namely:
MinC＝C1+C2 (1)
wherein, C1Cost of fuel consumption for distance and delay time, C2Is the road toll cost in the path.
2) Constructing a collaborative optimization basic framework according to a matching process between a distribution center and stations in a distribution range division process, dividing the matching selection between the distribution center and the stations into two sub-processes, starting from a distribution center i in the first process, considering the minimum distribution cost C, selecting the distribution stations by the ripple diffusion algorithm principle until the maximum distribution range R of the distribution center i is reachediOr accumulating the maximum delivery amount SiWhen the matching of the distribution center i and the k stations is finished, matching of the next distribution center i +1 is carried out until all the distribution centers reach the maximum distribution range or the constraint condition of the accumulated maximum distribution amount; and after the first process is finished, the remaining sites which are not matched yet enter a second matching process, the process takes the remaining sites as objects, a distribution center which does not reach the maximum accumulated capacity is searched for with the aim of minimum cost, and the searched distribution center distributes the sites.
According to the running characteristics of urban road vehicles, a ripple diffusion algorithm is introduced and the termination condition of the ripple relay race is improved, a boundary ripple diffusion algorithm is provided, the basic flow is shown in fig. 2, the diffusion principle is shown in fig. 3, the running form of the improved ripple relay race is shown in fig. 4, and the specific conditions are as follows:
the expansion phenomenon of the ripples in nature reflects an optimization principle that the ripples always reach the space points closest to the centers of the ripples firstly, because the speed of the ripple expansion is the same in all directions, and when the ripples reach a certain space point, new ripples are generated to continue to diffuse outwards.
As shown in fig. 5, the first process is to select a station for matching based on the ripple diffusion algorithm from the distribution center.
3) The remaining sites that have not been matched after the first process is finished enter a second matching process, as shown in fig. 6, in the process, the remaining sites are used as objects, a distribution center meeting the conditions is searched for matching by using a ripple diffusion algorithm, and the matching process is finished after all the sites are matched.
4) Dividing the distribution cost into two parts, C1The oil consumption cost is all oil consumption cost in the transportation process, the value of the oil consumption cost is related to the distance and the transportation time, the oil consumption cost is divided into oil consumption cost generated by the transportation distance and oil consumption cost generated by delay, and the unit price is p1And p2；C2Cost per unit of p for toll in the route3Thus, there are:
Figure BDA0002652372520000081
tik＝tr-tt (3)
wherein m is the number of distribution centers, n is the number of distribution sites, tikTo delay time, trFor the actual delivery time, ttTo theoretically deliver time, /)ikThe distribution distance from the distribution center i to the station k;
C2for road toll cost in the path:
Figure BDA0002652372520000082
wherein f isik∈Wi，WiThe collection of toll road sections is passed through in the distribution route.
And after the distribution range is optimized, updating the distribution range for the distribution center, matching distribution sites, and outputting distribution cost and a distribution range division scheme.
Then, the normal oil consumption of a large truck is 19.09 liters/100 kilometers, and the unit price of the distance oil consumption is p according to the average price of 6.67 liters/yuan of diesel oil in Guangdong province in 2 months in 202011.27 yuan/km, the idle fuel consumption is about 10% -30% of the normal fuel consumption, the idle fuel consumption is 3.818L/100 km, and the unit price of the obtained delay fuel consumption is p2The toll of taking the express way is 1.42 yuan/kilometer according to the standard of highway charging in Guangdong province in 2020. And calculating the distribution cost according to the formula.
In order to prevent accidental factors, 100 experiments are performed, an average value is taken as a result parameter, the distribution range division scheme before optimization is shown in fig. 6, the distribution range division scheme after optimization is shown in fig. 7, and the related result parameters are shown in the following table 1:
TABLE 1-100 average result parameters for random trials
Distribution cost Distribution distance Time of flight
Clustering method 431126.4 283138.4 53965.9
The method of the invention 330229.2 247127.8 23931.69
As can be seen from table 1, comparing the results before and after optimization, it can be seen from fig. 6 and 7 that the partial sites produce different matching schemes in the two methods, thereby also changing the distribution range division of the center. On the basis, the distribution cost is reduced by utilizing the invention to divide the range, the distribution cost is reduced by 23.4 percent on average, the distribution distance is reduced by 12.7 percent, the distribution time is reduced by 55.7 percent on average, and the correlation results before and after optimization are shown in a graph of fig. 8. Experimental results show that the performance of the urban logistics distribution range collaborative optimization method is superior to that of the traditional division method, the method has strong feasibility in practical application, and is worthy of popularization.
The above-mentioned embodiments are merely preferred embodiments of the present invention, and the scope of the present invention is not limited thereto, so that the changes in the shape and principle of the present invention should be covered within the protection scope of the present invention.

Claims (6)

1. A city logistics distribution range collaborative optimization method is characterized by comprising the following steps: the method comprises the following steps:
1) acquiring urban road network structure information, urban road network real-time traffic flow data, distribution center position and corresponding capacity information, distribution station position and corresponding demand information, analyzing cost composition in the process of dividing logistics distribution ranges, selecting reasonable cost composition elements, and setting the minimum total distribution cost as an optimization principle;
2) calculating the cost C from each center to each station according to the acquired urban road network structure information and the real-time traffic flow data, and matching according to the minimum principle of the total distribution cost in the step 1): starting from a distribution center, selecting distribution stations for matching;
3) step 2) after the matching is finished, the remaining sites which are not matched yet enter a second matching process, the process takes the remaining sites as objects, a distribution center with the minimum distribution cost is searched for matching, and the matching process is finished after all the sites are matched;
4) and taking the matching mode obtained in the first two steps as an optimized logistics distribution range, calculating the final total distribution cost, and outputting a distribution range division optimization result which comprises the distribution cost and a distribution range division scheme.
2. The city logistics distribution range collaborative optimization method according to claim 1, characterized in that: in the step 1), the urban road network structure information comprises urban road network intersection adjacency information and road section length information, and urban road network structure information data can be acquired from an urban planning design scheme; the urban road network real-time traffic flow data comprises real-time information of average driving speed of vehicles at each road section of the urban road network and average traffic delay at intersections, and can be obtained from an urban road traffic command center; the distribution center position and the corresponding capacity information can acquire data information of the planned distribution center from the logistics enterprises; the distribution station position and the corresponding demand information can acquire the cargo demand distribution amount of each station from a logistics network management background; the cost component comprises the oil consumption cost of the vehicle and the road toll cost when passing through the toll station; the optimization principle is as follows: considering the distance, the oil consumption cost generated by delay and the road toll cost in the route, and optimizing by taking the minimum total distribution cost C of logistics transportation as an objective function, namely:
MinC＝C1+C2 (1)
wherein, C1Cost of fuel consumption for distance and delay time, C2Is the road toll cost in the path.
3. The city logistics distribution range collaborative optimization method according to claim 1, characterized in that: in the steps 2) and 3), constructing a collaborative optimization basic framework according to the matching process between the distribution center and the stations in the distribution range division process, dividing the matching selection between the distribution center and the stations into two sub-processes, wherein the first process is started by the distribution center i,taking into account that the distribution cost Cmin, selecting the distribution stations by the principle of the ripple diffusion algorithm until reaching the maximum distribution range R of the distribution center iiOr accumulating the maximum delivery amount SiWhen the matching of the distribution center i and the k stations is finished, matching of the next distribution center i +1 is carried out until all the distribution centers reach the maximum distribution range or the constraint condition of the accumulated maximum distribution amount; and after the first process is finished, the remaining sites which are not matched yet enter a second matching process, the process takes the remaining sites as objects, a distribution center which does not reach the maximum accumulated capacity is searched for with the aim of minimum cost, and the searched distribution center distributes the sites.
4. The city logistics distribution range collaborative optimization method according to claim 1, characterized in that: in the steps 2) and 3), according to the running characteristics of the vehicles on the urban road, introducing a ripple diffusion algorithm and improving the termination condition of the ripple relay race, and providing a boundary ripple diffusion algorithm, wherein the specific conditions are as follows:
the expansion phenomenon of the ripples in nature reflects an optimization principle that the ripples always reach the space points closest to the centers of the ripples firstly, because the speed of the ripple expansion is the same in all directions, and when the ripples reach a certain space point, new ripples are generated to continue to diffuse outwards.
5. The city logistics distribution range collaborative optimization method according to claim 1, characterized in that: in step 4), the distribution cost is divided into two parts, and C is set1The oil consumption cost is all oil consumption cost in the transportation process, the value of the oil consumption cost is related to the distance and the transportation time, the oil consumption cost is divided into oil consumption cost generated by the transportation distance and oil consumption cost generated by delay, and the unit price is p1And p2；C2Is in the pathThe road toll cost of (1) is p3Thus, there are:
Figure FDA0002652372510000031
tik＝tr-tt (3)
wherein m is the number of distribution centers, n is the number of distribution sites, tikTo delay time, trFor the actual delivery time, ttTo theoretically deliver time, /)ikThe distribution distance from the distribution center i to the station k;
C2for road toll cost in the path:
Figure FDA0002652372510000032
wherein f isik∈Wi，WiThe collection of toll road sections is passed through in the distribution route.
6. The city logistics distribution range collaborative optimization method according to claim 1, characterized in that: in step 4), after the distribution range optimization is completed, the distribution range is updated for the distribution center, the distribution sites are matched, and the distribution cost and the distribution range division scheme are output.
CN202010875016.2A 2020-08-27 2020-08-27 Cooperative optimization method for urban logistics distribution range Active CN112101638B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202010875016.2A CN112101638B (en) 2020-08-27 2020-08-27 Cooperative optimization method for urban logistics distribution range

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202010875016.2A CN112101638B (en) 2020-08-27 2020-08-27 Cooperative optimization method for urban logistics distribution range

Publications (2)

Publication Number Publication Date
CN112101638A true CN112101638A (en) 2020-12-18
CN112101638B CN112101638B (en) 2022-06-14

Family

ID=73757944

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202010875016.2A Active CN112101638B (en) 2020-08-27 2020-08-27 Cooperative optimization method for urban logistics distribution range

Country Status (1)

Country Link
CN (1) CN112101638B (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112529469A (en) * 2020-12-25 2021-03-19 昆明珍茗食品有限责任公司 Product distribution method, device, electronic equipment and computer readable storage medium
CN113469505A (en) * 2021-06-10 2021-10-01 哈尔滨工业大学 Multi-main-body collaborative transportation resource scheduling method for express non-standard service

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
DE10239299C1 (en) * 2002-08-27 2003-12-18 Siemens Ag Telecommunications network distribution method for cost optimization of radio network sub-systems
CN105184412A (en) * 2015-09-21 2015-12-23 北京农业信息技术研究中心 Logistics delivery route planning method and system based on geographic positions
CN107578128A (en) * 2017-08-31 2018-01-12 南京理工大学 Across level distribution network planing method based on immunity particle cluster algorithm
CN107730033A (en) * 2017-09-27 2018-02-23 上海与德科技有限公司 A kind of logistics route planning mode
CN110119839A (en) * 2019-04-24 2019-08-13 华南理工大学 A kind of Urban Road Traffic Accidents emergency management and rescue paths planning method
CN110298474A (en) * 2019-04-28 2019-10-01 武汉理工大学 A kind of logistics centers location method of the ship stores spare part based on AIS and GIS

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
DE10239299C1 (en) * 2002-08-27 2003-12-18 Siemens Ag Telecommunications network distribution method for cost optimization of radio network sub-systems
CN105184412A (en) * 2015-09-21 2015-12-23 北京农业信息技术研究中心 Logistics delivery route planning method and system based on geographic positions
CN107578128A (en) * 2017-08-31 2018-01-12 南京理工大学 Across level distribution network planing method based on immunity particle cluster algorithm
CN107730033A (en) * 2017-09-27 2018-02-23 上海与德科技有限公司 A kind of logistics route planning mode
CN110119839A (en) * 2019-04-24 2019-08-13 华南理工大学 A kind of Urban Road Traffic Accidents emergency management and rescue paths planning method
CN110298474A (en) * 2019-04-28 2019-10-01 武汉理工大学 A kind of logistics centers location method of the ship stores spare part based on AIS and GIS

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
周彤等: "考虑多成本的多车型多种类生鲜农产品配送模型研究", 《物流科技》 *

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112529469A (en) * 2020-12-25 2021-03-19 昆明珍茗食品有限责任公司 Product distribution method, device, electronic equipment and computer readable storage medium
CN113469505A (en) * 2021-06-10 2021-10-01 哈尔滨工业大学 Multi-main-body collaborative transportation resource scheduling method for express non-standard service
CN113469505B (en) * 2021-06-10 2022-09-27 哈尔滨工业大学 Multi-main-body collaborative transportation resource scheduling method for express non-standard service

Also Published As

Publication number Publication date
CN112101638B (en) 2022-06-14

Similar Documents

Publication Publication Date Title
CN107180274B (en) Typical scene selection and optimization method for electric vehicle charging facility planning
CN108647221B (en) Bus route planning method based on GIS
CN112101638B (en) Cooperative optimization method for urban logistics distribution range
Omidvar et al. Sustainable vehicle routing: Strategies for congestion management and refueling scheduling
CN108871354B (en) Road information processing method and processing system
CN104881710A (en) Urban express delivering method based on vehicle self-organized network
CN105865476A (en) Method for searching lowest carbon path of automobile under dynamic traffic environment
CN107909187B (en) Method for quickly matching bus stops and road sections in electronic map
CN105957348B (en) Evaluation method is discharged at a kind of urban public bus lines node based on GIS and PEMS
CN101650876A (en) Method for obtaining average speed of traffic flow of urban road sections
CN113435777B (en) Electric operation vehicle charging station planning method and system
CN115879737A (en) Shared bicycle station site selection method based on density and access degree balanced clustering
CN107545318B (en) Bus line priority determination and bus transfer line sequencing method and device
CN102567389A (en) Combined traffic network forming method and equipment as well as path searching method and equipment
CN111199320A (en) Electric vehicle charging load space-time distribution prediction method based on travel probability matrix
CN110674990B (en) Instant distribution path selection method and system with sliding window updating mechanism
CN117553818A (en) Path planning method and system based on improved A-algorithm
CN118071109B (en) Electric vehicle charging station site selection and volume determination method, system, equipment and medium
CN114925483A (en) Carbon emission measuring method for urban traffic network
CN102445208B (en) Method for acquiring multiple vehicle navigation paths from map data
CN113256966B (en) Method and system for establishing road network emission list based on space-time velocity domain reconstruction
CN109572479A (en) A kind of Optimizing Site Selection method of electric vehicle rapid charging station in urban power distribution network
Kang et al. Link-based emission model for eco routing
CN117057158A (en) Electric automobile charging load simulation method considering cellular automata and space-time travel
CN114862018B (en) Electric vehicle charging station site selection and constant volume planning method considering charging driving distance

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant