【摘要】 分析了电子超市中的网页和链接的种类,并基于顾客浏览时间的假设建立了网站基本结构优化的数学模型,其目标是使点击率高的商品网页需要较少的访问时间.提出了禁忌搜索(TS)和优先分配两种求解算法.仿真实验结果表明优先分配算法简单易行,而TS可以得到较好的优化结果,两种算法都可以达到优化的目的.更多还原

【Abstract】 The different web pages and hyper_links on e_supermarket Websites are analyzed. Based on the assumption of customer browsing time, a mathematical model is constructed, whose objective is to minimize the visiting time necessarily for commodity pages with high clicking rate. Two algorithms, which are tabu search (TS) and approach of preferential distribution, are presented as solving methods. Case study shows that both algorithms are applicable, whereas the approach of preferential distribution is easy to implement, TS always results in better solution.更多还原