创业者个体学习、组织学习如何交互影响企业创新行为？——基于整合视角的纵向单案例研究

社会经济的不断发展促使分工愈发精细,对个人与组织间的技术隔离也愈加明显,亟待创业者个体及组织开展跨层次的交互学习以构建组织创新优势。基于此,本文援引学习理论与意义构建视角,从"行动"与"解释"出发,采用纵向单案例研究方法,基于"个体-组织"整合性分析框架,探究了不同创业阶段内跨层次行动主体间的学习互动模型,揭示了其对企业创新的影响路径。研究发现:创业者个体学习与组织学习间的互动,表现为渐变初期个体利用式学习经"自上而下"团队互动主导形成组织单环式行动;而在调整转变期,个体学习与组织学习发生交互影响,包含个体探索式学习经"横向协同式"团队互动主导形成组织双环式行动,以及组织双环式行动转换为单环式之后,经由持续反思与质询,刺激形成创业者个体利用式学习;最后,在发展突变期,个体利用式学习经"制度化统筹式"团队交互合作促成组织单环式行动,同时个体探索式学习经"跨越层次自主式"团队交互激活组织双环式学习。此外,在不同创业阶段,3种互动逻辑与意义构建框架下的创新决定机制呈现出以个体创意激发与扩散、信息整合与匹配以及平衡矛盾与冲突3种不同的影响路径展开的态势。本研究为创业学习理论和创业实践过程贡献了新的启示。     

考虑实时预倒箱的出口箱堆场多场桥调度优化

在出口集装箱堆场的实际作业过程中，倒箱是制约场桥作业效率的瓶颈之一。为提高出口箱堆场的作业效能，减少船舶装船作业时间，采用实时预倒来降低倒箱的影响，研究出口箱堆场多场桥调度优化问题。考虑待提箱作业次序固定、场桥间保持安全距离及不可跨越的现实约束，兼顾内集卡的等待上限，侧重场桥作业过程中的实时预倒箱，构建了以带惩罚因子的内集卡总等待时间最少为目标的混合整数线性规划模型。基于问题自身的特点设计了混合和声模拟退火算法，得出了各场桥的行走路径与实时预倒箱方案。在算例实验中，通过与不考虑实时预倒箱的方案、FCFS方案以及下界进行对比，验证了考虑实时预倒箱的场桥调度模型及算法的有效性，为集装箱码头出口箱堆场的场桥调度提供参考。     

赛珍珠《大地》叙事空间的置遣谫论

赛珍珠的《大地》虽然是用传统叙事写法创作的小说,但仍带有明显的叙事空间化的倾向,体现了时空维度的统一。小说以王龙一家所居村庄为基点空间,同时又设置了附近的城镇和南方大城市两个外缘空间。三大空间都具有表征人物性格、助推情节发展和突显主题思想等多种功能。三大空间都蕴含着地理、社会、文化、心理等方面因素,都由场域、场景和场面三个层次构成,并都表现出实在性、主体性和能动性三大特征。深厚的生活积累和谙熟中国小说写法是作者得以充分发挥空间叙事的长处并圆满完成故事讲述宗旨的决定性前提。     

社区应急疏散动态协作调度优化研究

针对灾民数量和路网通行时间的动态性以及灾民疏散反应系数的随机性，本文提出了社区应急疏散协作调度优化流程，并以疏散灾民数量最大化和疏散成本最小化为目标，构建了社区应急疏散多种运输方式协作调度优化模型，并给出了求解该模型的改进多目标遗传算法。然后，论文使用Tansmodeler模拟社区应急疏散协作调度优化过程，加载疏散灾民动态需求和历史出行时间表，并对模型和算法进行验证。结果表明，该模型和算法可以在有效刻画疏散灾民数量和路网通行时间的基础上，为不同时刻的交通工具配置及疏散路径选取提供决策。     

A Network Therapy Clinic for Clients with Intellectual Disability

Over the past 30 years a systemic approach has been applied to complex cases involving intellectual disability and behaviours of concern. This paper describes a model that draws on systemic family therapy and network therapy as well as the use of a reflective team. A single session intervention was provided for families of people with intellectual disability. A systemic consultation was used as a pre‐session meeting for professionals working with the family. The systemic consultation and single session therapy allowed the family and the professional network to gain insight. Involving the professionals in the therapy session also enhanced the alliance between professionals and family. This approach assists everyone involved in the case to find a way to progress.     

Facility Location with Dynamic Distance Functions

Facility location problems have always been studied with theassumption that the edge lengths in the network are static anddo not change over time. The underlying network could be used to model a city street networkfor emergency facility location/hospitals, or an electronic network for locating information centers. In any case, it is clear that due to trafficcongestion the traversal time on links changes with time. Very often, we have estimates as to how the edge lengths change over time, and our objective is to choose a set of locations (vertices) ascenters, such that at every time instant each vertex has a center close to it (clearly, the center close to a vertex may change over time). We also provide approximation algorithms as well as hardness results forthe K-center problem under this model. This is the first comprehensive study regarding approximation algorithmsfor facility location for good time-invariant solutions.     

On-Line Scheduling of Two-Machine Open Shops Where Jobs Arrive Over Time

We investigate the problem of on-line scheduling two-machine open shops with the objective of minimizing the makespan.Jobs arrive independently over time, and the existence of a job is not known until its arrival. In the clairvoyant on-line model, the processing requirement of every job becomes fully known at the arrival of the job, while inthe non-clairvoyant on-line model, this processing requirement is notknown until the job is processed and completed.In both models, scheduling of a job is irrevocable.We study the two-machine open shop problem for both models in the preemptive and in the non-preemptive version. For each of the four variants, we provide an algorithm that is best possible with respect to the worst-case performance. In the clairvoyant on-line model, the best worst-case performance ratios are 5/4 (preemptive) and 3/2 (non-preemptive), and in the non-clairvoyant on-line model, they are 3/2 (preemptive and non-preemptive).     

Pareto mimic algorithm: An approach to the team orienteering problem

The team orienteering problem is an important variant of the vehicle routing problem. In this paper, a new algorithm, called Pareto mimic algorithm, is proposed to deal with it. This algorithm maintains a population of incumbent solutions which are updated using Pareto dominance. It uses a new operator, called mimic operator, to generate a new solution by imitating an incumbent solution. Furthermore, to improve the quality of a solution, it employs an operator, called swallow operator which attempts to swallow (or insert) an infeasible node and then repair the resulting infeasible solution. A comparative study supports the effectiveness of the proposed algorithm, especially, our algorithm can quickly find new better results for several large-scale instances. We also demonstrate that Pareto mimic algorithm can be generalized to solve other routing problems, e.g., the capacitated vehicle routing problem.