DocumentCode :
525287
Title :
The application of MAS and C–W algorithm in purchase logistics
Author :
Yang Chang Chun ; Liu Yu Xiu ; Yang Li Bo
Author_Institution :
Dept. of Inf. Sci. & Eng., Jiangsu Polytech. Univ., Changzhou, China
Volume :
4
fYear :
2010
fDate :
25-27 June 2010
Abstract :
An attempt was made to apply C-W algorithm,which is usually used in routed optimization in the domain of distribution,to purchase logistics. In view of the characteristic of transported products in the purchase logistics of assembly enterprises,the task was divided into initial tasks and unexpected tasks. The former adopted C-W algorithm that vehicle capacity, volume and arriving time as three constraints were inserted,the latter used autonomous vehicles competitive bidding independently,which could obtain the optimal solution and solve unexpected tasks timely and intellectually. Then an example was given to confirm the serviceability of C-W algorithm in distributing the initial tasks and autonomous vehicles competitive bidding independently and a good result was obtained.
Keywords :
logistics; multi-agent systems; optimisation; purchasing; scheduling; C-W algorithm; MAS; arriving time; assembly enterprises; autonomous vehicles competitive bidding; purchase logistics; routed optimization; serviceability; transported products; vehicle capacity; volume time; Assembly; Costs; Design engineering; Information processing; Information science; Job shop scheduling; Logistics; Mobile robots; Procurement; Remotely operated vehicles; Agent; C–W algorithm; purchase logistics; vehicle scheduing problem;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computer Design and Applications (ICCDA), 2010 International Conference on
Conference_Location :
Qinhuangdao
Print_ISBN :
978-1-4244-7164-5
Electronic_ISBN :
978-1-4244-7164-5
Type :
conf
DOI :
10.1109/ICCDA.2010.5541114
Filename :
5541114
Link To Document :
بازگشت