Full-Text Search:
Home|About CNKI|User Service|中文
Add to Favorite Get Latest Update

The Research Review on Optimal Algorithms of Logistic Scheduling Problem

XU Xin-ming,CHEN Pei-you (School of Economics and Management,Heilongjiang Institute of Science and Technology,Harbin 150027,China)  
With the development of economy and commercial business,logistic distribution has become one of the most important parts of modern logistics.The efficiency of logistic distribution directly influences the response speed of customer demand,customer satisfaction and distribution costs of the service providers.Logistic scheduling problem is an NP-hard problem.By describing the logistics scheduling problem objectively,the model of the problem is built in this paper.The algorithms of exact algorithm,heuristic algorithms and soft computing are used to solve the problem by overcoming their shortcomings,especially for soft computing.It points out the future trend in the researches on logistic scheduling problem and soft computing.
Download(CAJ format) Download(PDF format)
CAJViewer7.0 supports all the CNKI file formats; AdobeReader only supports the PDF format.
©CNKI All Rights Reserved