A task allocation and path planning method for a cooperative logistics problem

A technology for task allocation and path planning, applied in the field of logistics management, which can solve problems such as costs and large transportation costs

Active Publication Date: 2019-04-02
DALIAN UNIV OF TECH
View PDF3 Cites 8 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

This distribution mode is convenient for the head office to manage, but the distribution without cooperation will easily lead to unnecessary costs. For example, the order E in charge of company A is closer to company B in geographical location. If order E is managed in a "chimney style" Assigned to company A, it will incur a larger transportation cost than assigned to company B

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
  • A task allocation and path planning method for a cooperative logistics problem
  • A task allocation and path planning method for a cooperative logistics problem
  • A task allocation and path planning method for a cooperative logistics problem

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0144] The present invention will be further described below in conjunction with the accompanying drawings.

[0145] Assume that the number of subsidiaries M of the logistics company is 3, the vehicle load C=100, the total order N is 150, the population size P is 100, and the mutation probability is p m is 0.1, the maximum iteration algebra g is 200, α=0.6, β=1.4.

[0146] Step 1: Order Redistribution

[0147] Step 1.1: let i=0;

[0148] Step 1.2: Calculate the distance ratio a of order i respectively 12 , a 13 , a 23 ;

[0149] Step 1.3: Judgment

[0150] if a 12 ≤0.6 and a 13 ≤0.6, the order i is assigned to subsidiary 1, and the order i is added to the set S 1 ;

[0151] if a 12 ≥1.4 and a 23 ≤0.6, the order i is assigned to subsidiary 2, and the order i is added to the set S 2 ;

[0152] if a 13 ≥1.4 and a 23 ≥1.4, then order i is allocated to subsidiary 3, and order i is added to set S 3 ;

[0153] If the above is not satisfied, add the order i to the fu...

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 belongs to the field of logistics management, and particularly relates to a task allocation and path planning method for a cooperative logistics problem. The method comprises the steps that firstly, a model building, wherein M sub-companies are governed by a head company, all the sub-companies share N orders which need to be met, and the sub-companies uniformly use vehicle types withthe same load capacity to transport cargoes, wherein the target is to obtain a path driving scheme with the shortest transportation distance; and step 2, model solving including redistributing the total order according to the result of order redistribution, thereby distributing the order to a relatively nearest sub-company according to the geographic position complementarity of the order, and realizing the optimal distribution of the total order. And the next step is to plan the vehicle paths in the sub-companies based on Sm and Rm, and the target is to optimize the transportation cost of each sub-company and obtain the vehicle distribution route with the minimum transportation distance. According to the invention, the transportation cost of logistics companies and sub-companies thereof can be reduced, and the emission of CO2 can be reduced, so that win-win and environment-friendly development among the companies can be realized.

Description

technical field [0001] The invention belongs to the field of logistics management, and in particular relates to a task distribution and path planning method for cooperative logistics problems. Background technique [0002] With the rapid development of the logistics industry, logistics companies urgently need to improve transportation efficiency to ensure competitiveness. A key measure to improve transportation efficiency is to reduce unnecessary costs, including time and fuel costs. For a logistics head office with several subsidiaries, a key goal of logistics transportation is to minimize the total transportation cost. The existing management model is based on the "chimney" management of subsidiaries, that is, each subsidiary only delivers orders within the company without affecting the order delivery of other subsidiaries at the same level. This distribution mode is convenient for the head office to manage, but the distribution without cooperation will easily lead to un...

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 Applications(China)
IPC IPC(8): G06Q10/06G06Q10/04G06Q10/08G06N3/12
CPCG06N3/126G06Q10/047G06Q10/0631G06Q10/08355
Inventor 张同亮林娜史彦军屈福政
Owner DALIAN UNIV OF TECH
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

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap