An Optimal Method for the Two-Stage Site Selection-Route Problem in Urban Logistics

An optimization method and route technology, applied in logistics, data processing applications, forecasting, etc., can solve problems such as restricting the promotion and application of two-layer logistics network systems

Active Publication Date: 2020-11-03
HOHAI UNIV
View PDF5 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

These problems greatly limit the promotion and application of the two-tier logistics network system in urban logistics

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • An Optimal Method for the Two-Stage Site Selection-Route Problem in Urban Logistics
  • An Optimal Method for the Two-Stage Site Selection-Route Problem in Urban Logistics
  • An Optimal Method for the Two-Stage Site Selection-Route Problem in Urban Logistics

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0079] Embodiment 1, the optimization method of the small-scale two-stage site selection-route problem (5 alternative transshipment centers / 25 clients);

[0080] (1) Site selection for the transshipment center. The initial concentration of pheromone assigned to each candidate transshipment center was 1, and the first group of ant colony consisting of 4 ants was arranged to be responsible for site selection. The number of transshipment centers selected by each ant is given by the following formula:

[0081]

[0082] Wherein, U(0, u) represents any integer between 0 and u (take u=3). The probability of each alternative transshipment center being selected is determined by the following formula:

[0083]

[0084] Among them, α represents the importance coefficient of relevant heuristic information relative to the concentration of pheromone in the transit center (take α=1).

[0085] The selection of n transshipment centers is carried out according to the rule of pseudo-pro...

Embodiment 2

[0107] Embodiment 2. An optimization method for a large-scale two-stage site selection-route problem (10 alternative transshipment centers / 200 customers).

[0108] (1) Transshipment center site selection - customer allocation. Simplify the two-stage location-routing problem into a classic facility location problem, and use the IBM ILOG CPLEX optimization software package to solve it directly to obtain the location selection plan of the transshipment center and the customer allocation plan.

[0109] (2) Vehicle route arrangement in the first stage. The vehicle route of the first stage is constructed using the saving method. The vehicle starts from the distribution center or the transshipment center, and selects the next visiting node according to the principle of maximum saving, that is, using The transshipment center j with the largest value; where, is the cost savings from transit center i to transit center j, c io is the route cost between transshipment center i and dis...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention discloses an optimization method for a two-stage site selection-route problem in urban logistics, and the method comprises the steps: splitting the two-stage site selection-route probleminto two relatively independent layers and four sub-problems which are connected with each other and are easy to solve according to the structural features of the two-stage site selection-route problem; for a small-scale problem, two sub-problems of transfer center site selection and customer allocation are independently considered and respectively processed, and a multi-ant colony algorithm is provided to improve the solving quality of the problem; transfer center site selection and customer allocation are considered together for a large-scale problem, overall optimization is performed, anda hybrid algorithm is provided to improve the solving efficiency of the problem.

Description

technical field [0001] The invention belongs to the technical field of urban logistics system optimization, and in particular relates to an optimization method for the two-stage location-route problem in urban logistics. Background technique [0002] With the continuous advancement of the urbanization process and the continuous improvement of people's living conditions, urban logistics plays an increasingly important role in ensuring the normal progress of urban production and life and realizing the sustainable development of the city. How to promote the scientific development of urban logistics while reducing the external diseconomy of urban logistics activities is an urgent problem to be solved. The two-tier logistics network system is currently one of the feasible solutions for urban logistics widely recognized by the academic circle and the industry. However, the two-stage location-routing problem involved in it involves two NP-hard problems of facility location and vehi...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
Patent Type & Authority Patents(China)
IPC IPC(8): G06Q10/08G06Q10/06G06Q10/04
CPCG06Q10/047G06Q10/06312G06Q10/08355
Inventor 汤希峰吴建涛杨帅
Owner HOHAI UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products