基于改进Dijkstra算法的最短路算法

Dijkstra算法是求解最短路径问题的经典算法。在现如今的城市交通网络中,经常需要寻求两个地点之间的最短距离,减少运输时间。本文将Dijkstra算法与C语言相结合,对Dijkstra算法进行改进,根据实际网络图的情况,建立了相应的数学模型,运用C语言编程,在给定的网络图中,实现了只需确定起始点和终点,就可以直接输出最短路径和最短距离的功能。在有多个相同最短路径的情况下,会将多个最短路径一起输出,在搜索到终点时,立即跳出,结束循环。在一般情况下,无需对所有点进行迭代,提高了效率。这种方法可以应用到现在的物流运输中,以此来节约时间,降低成本。     

关于节水型园林设计规划的思路构架和分析

随着我国社会主义现代化建设和城市化建设进程不断加快,人们对自然资源的过渡开发与利用,带来了诸多环境问题。为提高我国园林生态水平,相关部门应认识到我国园林用水的现状,并积极开发和设计节水型园林,大力推广节水灌溉,优化各类植物配置,加强园林人力资源管理,提高人们的节水意识,从而为建设节水型园林奠定坚实的基础。     

Integrated planning for product selection,shelf-space allocation,and replenishment decision with elasticity and positioning effects

As the retail industry is growing larger and more diversified, retailers' decisions about product selection, shelf-space-allocation, and replenishment become more important and challenging. This paper is to present a model for shelf-space allocation with product selection and replenishment decisions to maximize the retailer's profit. The model is based on a two-dimensional display space in which all shelves and products have widths and heights and includes factors that influence demand for each product, such as space and cross-space elasticities and positioning effects. The integrated model presented is mixed-integer non-linear programming (MINLP) because the demand function is non-convex. This research proposes two heuristic algorithms (tabu search and genetic) to solve the MINLP problem. The results show the effectiveness and efficiency of these algorithms by comparing the outputs to the MINLP optimal solution for small data sets and comparing the algorithm performances for large data sets. The solution methodologies expect to support a simultaneous decision-making process for retailers to maximize their revenue.     

Internal habits formation and optimality

In a very influential model with internal habits, Carroll et al., (2017, 2000), establish that an increase in economic growth may cause a positive change in savings. The optimality of this result, and of many other contributions using a similar framework, has been questioned by some authors who have observed that the parametrization used in these models always implies a utility function not jointly concave in consumption and habits. In this paper, we revisit the optimality issue and, using advanced techniques in Dynamic Programming, we answer the following long-standing open questions: (i) Is the solution found in Carroll et al., (2017, 2000) optimal? (ii) Is it also unique or do other optimal solutions exist?     

基于粒子群算法下的交叉口信号配时优化

为了合理地优化交叉口信号配时,通过分析交叉口的评价指标,建立了以车辆的平均延误、停车次数最小、交叉口整体通行能力最大、各相位有效绿灯时间和交叉口周期时长作为约束条件的数学模型。并通过改进前人研究基础上的动态加权系数,将多目标的非线性优化问题转化为单一目标的非线性规划问题,为了得出更科学稳定的解,提出了改善粒子群算法系统稳定性的2种方法,并将其与粒子群算法结合起来。然后以Matlab为求解工具,结合临邑市某一交叉口实例进行求解分析。最后的结果表明,在使用改进后的粒子群算法进行优化后交叉口通行能力较之现状提升了9%,延误下降了28%,停车次数下降了9%,且各项优化结果均优于Webster,改进后的算法在程序中运行300代,到216代才开始收敛,而未改进的算法稳定性较差,优化结果和收敛曲线则随着实验次数的变化而变化,最后的结论证明了该算法和模型的可靠性。     

A simple characterisation for sustained growth

This article considers an inter-temporal optimisation problem in a general form and gives conditions ensuring the convergence to infinity of the economy. These conditions can be easily verified and applied for a large class of problems in the literature. Some applications for different economies are given as illustrative examples.     

Consumer avoidance of specially priced items during social coupon redemption

Social coupons (SCs) (e.g., Groupon) differ from traditional or regular coupons (RCs) in that they require consumers to make a prepayment to receive substantive discounts. As the general rule of SCs prohibits double-promotion, SC consumers tend to engage in certain avoidance behaviors when experiencing another promotion (i.e., specially priced for selected items). The results across two scenario-based experiments reveal that SC consumers (vs. RC consumers) have a greater tendency to avoid specially priced items when redeeming a coupon for hedonic consumptions, but not for utilitarian consumptions. Such avoidance is due to one’s motivation to minimize the perception of deal waste.     

A multicriteria model for the assessment of rural development plans in Greece

In the last decades rural communities face the problems of ageing of population, high share of elder farmers and imbalanced distribution of farmers across age classes. The Rural Development Plans (RDPs) of Common Agricultural Policy (CAP) in European Union (EU) are the policy instruments that affect agriculture and the people living in rural areas. The RDP measure “Setting up Young Farmers” aims to fight the demographic problems of these areas. This study is an attempt to highlight the role and the impacts of RDPs and especially of the “Setting up Young Farmers” measure in the prefecture of Thessaloniki in Greece. To this end, a multicriteria mathematical programming model was implemented. This methodology was chosen using the Knowledge Brokerage Approach in the context of the LIAISE project, which proposes a set of support modules that are linked to the impact assessment process with a final goal to support future policies and design. The results showed that the “Setting up young farmers” measure achieved its goals to transfer land to young, trained farmers, to offset the set-up costs faced by young people when establishing themselves in farming.     

数控车床测头系统的开发

随着现代制造技术的不断发展,我国数控车床测头系统的开发也得到发展。本文分析了测头系统的作用、组成及工作原理,以在数控车床上自动在线测量孔直径为例,介绍了测头系统测量程序的编制方法,使数控机床的操作变得更加简单、便捷、精确、高效,同时为其他相关程序的编制提供参考。     

定时器的PLC程序设计

本文旨在实现接通延时定时器、断开延时定时器、多谐震荡器的时序图及PLC程序设计。