2011
DOI: 10.4304/jsw.6.4.612-619
|View full text |Cite
|
Sign up to set email alerts
|

Research on Heuristics Logistics Distribution Algorithm Based on Parallel Multi-ant Colonies

Abstract:

Logistics distribution problem is an important part of the modern logistics system. Suppliers need to plan a route scheme for each customer in goods distribution, which is a multi-ponit to multi-point problem. It is NP-hard.Through analysis of characteristics of the existing logistics system, mathematical models are constructed, by introducing the order request and the return request with multiple suppliers. With these models, we present  multi-vendor logistics distribution optimized algorithm and heur… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2012
2012
2017
2017

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(3 citation statements)
references
References 12 publications
0
3
0
Order By: Relevance
“…Ant Colony Optimization (ACO) [18,19] algorithm is a new kind of simulated evolutionary algorithm [20] and it has been successfully applied to several NP-hard combinatorial optimization problems [21] . The ACO algorithm was proposed by Italian scholar M. Dorigo according to food-seeking behavior by ants in 1996 [22] .…”
Section: A Ant Colony Optimization Algorithmmentioning
confidence: 99%
“…Ant Colony Optimization (ACO) [18,19] algorithm is a new kind of simulated evolutionary algorithm [20] and it has been successfully applied to several NP-hard combinatorial optimization problems [21] . The ACO algorithm was proposed by Italian scholar M. Dorigo according to food-seeking behavior by ants in 1996 [22] .…”
Section: A Ant Colony Optimization Algorithmmentioning
confidence: 99%
“…ACO integrate the information of the partly and global, weight the important of the information, then choose the optimal path. This method can integrates the partly optimal path to the global optimal path and get the shortest distance, which has been widely used in many fields such as supply chain design [12][13][14][15][16], robot learning and planning [17,18], customer behavior analysis [19,20], job shop scheduling problem [21,22], financial forecast [23], signal processing [24], power system design [25], and so. In this paper we take the total cost as the total distance, take the several cost as points, the amount of the cost as the road distance which are vary with the candidate solution, using the ACO to calculate the best solution.…”
Section: Ant Colony Optimization For Solving the Problemmentioning
confidence: 99%
“…Describe of ant colony algorithm. The ant colony algorithm in the calculation of the cycle must obey the following rules [6]: (a) The rule of state transition In the site r, the calculation about probability of ant k chooses to transfer to the site s is:…”
Section: Algorithm Solvingmentioning
confidence: 99%