论文部分内容阅读
本题是一道VRP问题,它涉及到最短路线、最小费用等条件下的优化问题.问题一中,我们论证出最少需要3辆邮车才能满足要求.然后对X1区域根据装载量、时间要求遍历出所有的可行路线,最后选出因空车率而减小的收入最小的邮路,其减少的收入为49.35元.问题二中,将整个区域进行划分,在每个小区域应用分枝定界法求出运行成本的路线.再通过对区域的微调讨论出使邮车数目更小的、更节省运行成本的邮路规划方案.问题三中,由于我们将Z56,Z57由县局X1负责运送,Z27由县局X2负责运送.问题四是一个选址问题.我们借助于中心点算法,考虑各支局在本县区域内的位置,并结合与地市局的距离,提出了相应的选址方案.
This problem is a VRP problem, which involves the optimization of the shortest route, the minimum cost and other conditions.In the first problem, we demonstrate that at least three cars to meet the requirements.And then the X1 region according to the load, the time required to traverse All the feasible routes, and finally choose the lowest-paid postal route reduced by the empty-car rate, and the reduced revenue is 49.35 yuan.In the second problem, the whole area is divided and the branch demarcation is applied in each small area Method to find the route of operating costs.Through the fine-tuning of the area to discuss to make a smaller number of mailers, more cost-effective postal planning program.In question three, because we will Z56, Z57 County Bureau X1 responsible for the delivery , Z27 by the county office X2 is responsible for transportation.The fourth problem is a site selection problem.We use the center point algorithm, consider the location of each branch in the county area, combined with the distance with the city bureau, put forward the corresponding site Program.