Study On Logistics Distribution Problems In C2C E-commerce

In this dissertation we mainly discuss the logistics distribution problems in C2Ce-commerce. At present, shopping online has become the habitual shopping style forpeople. Due to the demand of the timeliness of logistics, taking a reasonable deliverypath and dispatching appropriate vehicles are two important ways in order to enhancethe level of logistics. However, the logistics companies and distribution centres areseparate in the real life, so the customers and the distribution centres are, therefore,mathematics models must have more realistic significance and reflect morecharacteristic in C2C e-commerce.There are five chapters in this dissertation. In the first chapter, we introducesome concepts, the background, the current situation in C2C e-commerce, and themain research contents of this paper. In the second chapter, we present two kinds ofVRP, they are inventory routing problem and semi-open vehicle routing problem,three kinds of solving methods of VRP, they are scanning algorithm, simulatedannealing algorithm and geometry heuristic approach. In the third chapter, we doresearch in an optimization problem of semi-open inventory routing in C2Ce-commence, we build a 0-1 integer programming model for it. On the basis ofoptimizing the transport routes, we continuously budget the quantity of taking thedelivery of goods in each stage, and then adjust the inventory of each seller. we solvethe problem with a heuristic approach by analysing the characteristic of the problem.Finally, an example shows the correctness and effectiveness of the algorithm. In thefourth chapter, we study a pick up and delivery problem with multi-logisticscompanies and multi-customer in a single region under C2C e-commence. We build a0-1 integer programming model for this problem, and work out the problem by asimulated annealing algorithm. Because the memory function is used in the algorithm,the calculated amount is reduced. We use a warming function to prevent the algorithmsinking into local optimum. We illustrate this algorithm by a numerical example. Inthe fifth chapter, we discuss a joint pick up and delivery problem of across-region andsoft time windows with multi-distribution centers, multi-logistics companies andmulti-customer in C2C e-commence. We build a 0-1 integer programming model for the problem, which is helpful to enhance the efficiency of logistics distribution in alarge range. We work out this problem using a simulated annealing algorithm. In thesampling process of the simulated annealing algorithm, not all solutions are feasible,which enlarges the search range.Finally, we briefly summarize the contents of the dissertation, and then look intothe future of the logistics distribution in C2C e-commence.