Mobile phone ownership and usage among pre-adolescents

Research has revealed that the mobile phone is, for adolescents, a medium which permits communication without the surveillance of parents, families and teachers. Indeed, the current study found this to be the case with younger pupils, too. However, communicating with family members appeared just as important, if not more, for these primary aged children. This study focused on the ownership and usage of mobile phones in a sample (N=351) of 10- to 11-year-old children in Gloucestershire primary schools (N=7). Some 45% of the sample possessed mobile phones. Nearly half of their calls (47%) were used for chatting with family or friends; 26% were to let their parents know their whereabouts; and others (20%) were “convenience” calls, i.e. to ask to be picked up etc. Other uses of the mobile in addition to chatting and making arrangements, although not always positive, were also made apparent. Thus, some two fifths of the children reported that they had made an “emergency” call (examples were given), about 17% had received “frightening” calls. A sizeable minority (20%) reported that their mobile had been damaged or stolen. This research also considers the amount of money that the pupils claimed to spend on their mobile calls every month as well as their means of purchasing the mobile and its up-keep.     

一种新型Ka波段盒型窗

本文介绍了一种新型Ka波段盒型窗,并利用HFSS进行仿真优化,得到在32.6～39.6 GHz带宽内S11低于-20dB的无鬼模振荡输出,与标准的半波长厚度的介质窗片相比,其与圆波导接触面积较大,更有利于散热。     

A truck scheduling problem arising in intermodal container transportation

We address a truck scheduling problem that arises in intermodal container transportation, where containers need to be transported between customers (shippers or receivers) and container terminals (rail or maritime) and vice versa. The transportation requests are handled by a trucking company which operates several depots and a fleet of homogeneous trucks that must be routed and scheduled to minimize the total truck operating time under hard time window constraints imposed by the customers and terminals. Empty containers are considered as transportation resources and are provided by the trucking company for freight transportation. The truck scheduling problem at hand is formulated as Full-Truckload Pickup and Delivery Problem with Time Windows (FTPDPTW) and is solved by a 2-stage heuristic solution approach. This solution method was specially designed for the truck scheduling problem but can be applied to other problems as well. We assess the quality of our solution approach on several computational experiments.     

面向中小企业集群的非满载车辆调度问题研究

基于中小企业集群的特点,给出最少配送车辆数的计算模型,从最少配送车辆数、最短距离、各路线里程平衡和时间窗等方面对集送一体化车辆调度问题建立模型,用改进的模拟退火算法求解该调度模型.通过仿真实例验证了该算法的可行性,且符合实时性的要求.     

带退货和软时间窗的多仓库选址-路径问题研究

选址-路径问题(location routing problems, LRP)是集成物流网络研究中的难题,也是任何一个大型物流配送企业必须面对的管理决策问题。本文在仓库容量约束和车辆容量约束的基础上,结合送取货一体化的配送模式和客户服务时间要求,建立了带退货和软时间窗的多仓库选址-路径(MDLRP)数学模型。针对MDLRP问题求解的复杂性,引入局部搜索算法和重组策略,设计了自适应混合遗传算法,对模型进行整体求解。最后进行数值实验,表明本文提出的模型和改进算法具有实用性和优越性,可为选址和车辆运输决策提供重要参考依据。     

求解硬时间窗约束下随机需求库存-路径问题的优化算法

随机需求库存-路径问题(Stochastic Demand Inventory Routing Problem, SDIRP)即考虑随机需求环境下供应链中库存与配送的协调优化问题,是实施供应商管理库存策略过程中的关键所在,也是典型的NP难题之一。文章以具有硬时间窗约束的随机需求库存-路径问题(Stochastic Demand Inventory Routing Problem with Hard Time Windows, SDIRPHTW)为研究对象,将SDIRPHTW分解为直接配送的随机库存-路径问题和具有硬时间窗约束的路径优化问题两个子问题,并以最小化系统运行成本和用车数量为目标,设计了一个基于(s,S)库存策略和修正C-W节约法的启发式算法。最后,通过相应的数值算例验证了算法的有效性。     

带时间窗偏好的同时配集货且需求可拆分车辆路径问题

针对带时间窗偏好的同时配集货且需求可拆分车辆路径问题,最小化派遣成本、理货成本、时间窗惩罚成本以及油耗成本之和,建立数学模型。设计混合遗传变邻域搜索算法求解问题,在算法中引入时空距离的理念,首先用最近邻插入法和Logistic映射方程生成初始种群;然后利用变邻域搜索算法的深度搜索能力优化算法;提出自适应搜索策略,平衡种群进化所需的广度和深度;设计拆分准则,为各客户设置不同的拆分服务量;提出确定车辆最优出发时间的时差推移法,减少车辆在客户处的等待时间;最后通过多组算例验证本文模型和算法的有效性。     

The vehicle routing problem with flexible time windows and traveling times

We generalize the standard vehicle routing problem by allowing soft time window and soft traveling time constraints, where both constraints are treated as cost functions. With the proposed generalization, the problem becomes very general. In our algorithm, we use local search to determine the routes of vehicles. After fixing the route of each vehicle, we must determine the optimal start times of services at visited customers. We show that this subproblem is NP-hard when cost functions are general, but can be efficiently solved with dynamic programming when traveling time cost functions are convex even if time window cost functions are non-convex. We deal with the latter situation in the developed iterated local search algorithm. Finally we report computational results on benchmark instances, and confirm the benefits of the proposed generalization.     

Scatter search for a real-life heterogeneous fleet vehicle routing problem with time windows and split deliveries in Brazil

In this paper, we consider a real-life heterogeneous fleet vehicle routing problem with time windows and split deliveries that occurs in a major Brazilian retail group. A single depot attends 519 stores of the group distributed in 11 Brazilian states. To find good solutions to this problem, we propose heuristics as initial solutions and a scatter search (SS) approach. Next, the produced solutions are compared with the routes actually covered by the company. Our results show that the total distribution cost can be reduced significantly when such methods are used. Experimental testing with benchmark instances is used to assess the merit of our proposed procedure.     

大学生手机依赖现状调查探究--以HH大学J校区为例

本文以南京HH大学J校区的大学生为研究对象,主要采用问卷调查的方法对大学生手机依赖的状况进行了调查分析。研究发现,大部分大学生能够正确认识和使用手机,只有少数大学生存在手机依赖现象,但部分学生已出现手机强依赖,需要引起重视。另外,本文从性别、专业、年级这三个方面比较分析了大学生手机依赖的程度,从个人、朋辈、家庭、社会四个方面对大学生手机依赖的影响因素进行了探究。