DocumentCode :
2959634
Title :
Route optimization of tobacco delivery system in China
Author :
Yang, Rua-Iong ; Zhang, Bao-hua ; Zheng, Bin
Author_Institution :
Transp. Manage. Coll., Dalian Maritime Univ., Dalian, China
fYear :
2009
fDate :
22-24 July 2009
Firstpage :
700
Lastpage :
703
Abstract :
In order to realize the optimization of tobacco delivery routes in China, a viable tobacco delivery routing model was established with regard to the characteristics of tobacco distribution. Through transforming the retail outlets (points) into the roads (lines) where the retail outlets are located, the shortest delivery route was obtained in accordance with the theory of Chinese postman problem. Based on Floyd algorithm, assignment problem has been employed in this model to match the two odd nodes in a network map. It has been proved that the algorithm can quickly complete the real-time computing of the shortest delivery route and finally determine the optimal route.
Keywords :
distribution strategy; tobacco products; travelling salesman problems; China; Floyd algorithm; assignment problem; postman problem; retail outlets; route optimization; shortest delivery route; tobacco delivery system; tobacco distribution; Computer industry; Design optimization; Information technology; Logistics; Marketing and sales; Partitioning algorithms; Roads; Routing; Transportation; Vehicles; assignment problem; route optimization; tobacco distribution;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Service Operations, Logistics and Informatics, 2009. SOLI '09. IEEE/INFORMS International Conference on
Conference_Location :
Chicago, IL
Print_ISBN :
978-1-4244-3540-1
Electronic_ISBN :
978-1-4244-3541-8
Type :
conf
DOI :
10.1109/SOLI.2009.5204023
Filename :
5204023
Link To Document :
بازگشت