The Design And Implementation Of Immediate Distribution Scheduling System For Concentrated Regional Take-away

Order a take-away has become many people's daily consumption behavior. Many of the traditional catering industry businesses and junior entrepreneurs joined into wave of take-away trade. Convenience of take-away fascinates customers, nevertheless, a long time distribution disturbs. How to optimize sever of distribution gains businesses? focus and it is urgent put forward a reasonable distribution solution for take-away business. The take-away distribution facing businesses is to provide services to customers where some concentrated regions like schools or office buildings. What?s the characteristic is that the centralized and fallible orders. Take a reasonable overall scheduling and optimize distribution progress for complex orders of concentrated regions rather than rely on distribution experience or increase the distribution intensity simply to solve this problem.The progress of the distribution scheduling for concentrated regional take-away is a typical TSP(Traveling Salesman Problem), and a NPC(Non-deterministic Polynomial Complete problem). We can put TSP into Hamiltonian cycle to solve. Many kinds of algorithms of TSP were put forward, which consisted tradition algorithm as branch and bound method, modern optimization algorithm as intelligent algorithms. We selected branch and bound method to solve this problem after synthesizing take-away delivery characteristics, the complexity and deviation of the algorithm.Constructed the MVC three-layered structure model by Node.JS + Express + ejs + MongoDB. Achieved view pages and front-end modules by Bootstrap + JQuery. Transferred data at the view layer by Ajax. Achieved map functions by BaiduMap JavaScript API. Developed a take-away distribution scheduling system to solve the real-time distribution problem of intensive orders where concentration area.