OPTIMAL MATHEMATICAL MODEL OF DELIVERY ROUTING AND PROCESSING TIME OF LOGISTICS

Abstract

As a newly-developing service industry that has a broad prospect and enormous market potential under the environment of electronic commerce, logistics is characterized by intellectualization, exibility, informatization, networking and automation, etc.  However, with the rapid development of economy, clients requirements on logistics services are increasing gradually.  Therefore, how to reasonably control delivery costs while still maintaining the high-standard quality and timeliness has become a new challenge for logistics.  On the basis of the earliest and latest service time allowed by clients, the problem of time window constraints should be especially considered for the distribution problems of multiple batches, multiple species and small batch quantity.  Due to the practical significance of studying the routing problem of vehicles with time windows, this study explored the key optimization problem of logistics as well as the problem of distribution routing selection and processing time according to characteristics of logistics under the environment of electronic commerce, using ant colony algorithm (ACA) and particle swarm optimization (PSO).