智能速递柜地址选择模型构建.docVIP

1 1 摘 要 随着当今电子商务的新兴与发展，越来越多的消费者选择网购作为他们的购物方式。而大学生作为使用网络较为活跃的群体，当之无愧地成为了网上购物的主力军之一。大学生网购率的逐年递增，无疑是对大学校园内快递物流公司一大挑战，如何使得大学生对校内物流配送系统满意逐渐地成为了如今的校内快递公司摆在首要位置去解决的问题。本文以快递柜的选址问题展开，弄清楚智能快递柜在校园内与在居民区的差异后，分析哪些因素是快递柜选址问题首要考虑的，然后结合选址问题的基础知识构建出本文大致的框架和流程。针对快递柜选址此类的物流学问题，首先根据快递柜的特点以及服务形式确定采用集合覆盖模型，接着基于“最低成本获得最大的服务半径”的思路决定赋予集合覆盖模型一种叫做贪婪算法的计算方式，求解后把模型的解集转化为候选点，接着在候选点中选出与校园内已有的快递中心距离最短的作为最终的设立点。 关键词：快递柜选址问题；集合覆盖模型；贪婪算法；数学建模 Abstract With the emerging and development of e-commerce, more and more consumers choose online shopping as their shopping method. As an active group, college students have become one of the main forces of online shopping. The online shopping rate of college students is increasing year by year, which is undoubtedly a big challenge for express delivery companies on campus. How to make college students satisfied with the on-campus logistics distribution system has gradually become the primary problem for campus express companies to solve. This paper starts with the problem of location selection of express cabinets. After making clear the differences between intelligent express cabinets on campus and in residential areas, it analyzes which factors are the primary consideration for location selection of express cabinets, and then constructs the general framework and process of this paper based on the basic knowledge of location selection. According to express ark location such logistics problem, first according to the characteristics of the express ark and service form determined by using the set covering model, then based on the lowest cost to maximize the service radius of "thinking decided to give the set covering model called a calculation of greedy algorithm, after solving the model into a candidate solution sets, then the candidate points choose express delivery to the campus has the shortest center distance as the final set point. Key words: location problem of express delivery cabinet; Aggregate coverage model; The greedy algorithm; Mathematical modelin