Path Constitution Analysis: A Methodology for Understanding Path Dependence and Path Creation

Although an increasing number of studies of technological, institutional and organizational change refer to the concepts of path dependence and path creation, few attempts have been made to consider these concepts explicitly in their methodological accounts. This paper addresses this gap and contributes to the literature by developing a comprehensive methodology that originates from the concepts of path dependence and path creation – path constitution analysis (PCA) – and allows for the integration of multi-actor constellations on multiple levels of analysis within a process perspective. Based upon a longitudinal case study in the field of semiconductors, we illustrate PCA ‘in action’ as a template for other researchers and critically examine its adequacy. We conclude with implications for further path-oriented inquiries.

The verb slot in causative constructions. Finding the best fit

Using the technique of multiple distinctive collexeme analysis, this paper seeks to determine the verbs that are distinctively associated with the non-finite verb slot of English periphrastic causative constructions. Not only does the analysis reveal that the various causative constructions are attracted to essentially different verbs, but by examining how these verbs fall into semantic classes, it also hints at subtle differences in meaning between the constructions. In addition, the paper shows how the technique of multiple distinctive collexeme analysis can be usefully combined with other, complementary methods, and briefly discusses a number of factors which influence the results of multiple distinctive collexeme analysis and should therefore ideally be taken into account.

GRASP with Hybrid Path Relinking for Bi-Objective Winner Determination in Combinatorial Transportation Auctions

The procurement of transportation services via large-scale combinatorial auctions involves a couple of complex decisions whose outcome highly influences the performance of the tender process. This paper examines the shipper's task of selecting a subset of the submitted bids which efficiently trades off total procurement cost against expected carrier performance. To solve this bi-objective winner determination problem, we propose a Pareto-based greedy randomized adaptive search procedure (GRASP). As a post-optimizer we use a path relinking procedure which is hybridized with branch-and-bound. Several variants of this algorithm are evaluated by means of artificial test instances which comply with important real-world characteristics. The two best variants prove superior to a previously published Pareto-based evolutionary algorithm.