Railway junction traffic control by heuristic methods

Traffic conflicts at railway junctions are very conmon, particularly on congested rail lines. While safe passage through the junction is well maintained by the signalling and interlocking systems, minimising the delays imposed on the trains by assigning the right-of-way sequence sensibly is a bonus to the quality of service. A deterministic method has been adopted to resolve the conflict, with the objective of minimising the total weighted delay. However, the computational demand remains significant. The applications of different heuristic methods to tackle this problem are reviewed and explored, elaborating their feasibility in various aspects and comparing their relative merits for further studies. As most heuristic methods do not guarantee a global optimum, this study focuses on the trade-off between computation time and optimality of the resolution.

A study of heuristic approach on station track allocation in mainline railways

Station track allocation is the critical component in the overall railway timetabling. Because of its intrinsic complexity and lack of modeling on station track layouts and train movement within station, analytical approach to attain optimal solution is not feasible. This study investigates the possibilities of applying a heuristic approach and identifies possible difficulties in practice. It is the first and important step to resolve one of the burning issues in the mainline railway operation in China.

A Heuristic algorithm for fixed train runtime

This paper proposes a train movement model with fixed runtime that can be employed to find feasible control strategies for a single train along an inter-city railway line. The objective of the model is to minimize arrival delays at each station along railway lines. However, train movement is a typical nonlinear problem for complex running environments and different requirements. A heuristic algorithm is developed to solve the problem in this paper and the simulation results show that the train could overcome the disturbance from train delay and coordinates the operation strategies to sure punctual arrival of trains at the destination. The developed algorithm can also be used to evaluate the running reliability of trains in scheduled timetables.

CASNS - A heuristic algorithm for the nesting of irregular-shaped sheet-metal blanks

This article reports on the design and implementation of a computer-aided sheet nesting system (CASNS) for the nesting of two-dimensional irregular-shaped sheet-metal blanks on a given sheet stock or coil stock. The system is designed by considering several constraints of sheet-metal stamping operations, such as bridge width and grain orientation, and design requirements such as maximizing the strength of the part hen subsequent bending is involved, minimization of scrap, and economic justification for'a single or multiple station operation. Through many practical case studies, the system proves its efficiency, effectiveness and usefulness.

A hybrid constructive heuristic and simulated annealing for railway crew scheduling

Railway crew scheduling problem is the process of allocating train services to the crew duties based on the published train timetable while satisfying operational and contractual requirements. The problem is restricted by many constraints and it belongs to the class of NP-hard. In this paper, we develop a mathematical model for railway crew scheduling with the aim of minimising the number of crew duties by reducing idle transition times. Duties are generated by arranging scheduled trips over a set of duties and sequentially ordering the set of trips within each of duties. The optimisation model includes the time period of relief opportunities within which a train crew can be relieved at any relief point. Existing models and algorithms usually only consider relieving a crew at the beginning of the interval of relief opportunities which may be impractical. This model involves a large number of decision variables and constraints, and therefore a hybrid constructive heuristic with the simulated annealing search algorithm is applied to yield an optimal or near-optimal schedule. The performance of the proposed algorithms is evaluated by applying computational experiments on randomly generated test instances. The results show that the proposed approaches obtain near-optimal solutions in a reasonable computational time for large-sized problems.

Understanding the pre-internationalization phase decision heuristic of Australian SMEs

Since the 1970s, the Uppsala stages model has been one of the dominant explanations of firm internationalization. The model's focus on internationalization as a firm's gradual and incremental process of increasing international involvement has attracted much debate, with one criticism being that it is unclear in explaining how the internationalization process first originates within a firm. In this paper, the Uppsala model is extended through the incorporation of a pre-internationalization phase to explore the antecedents of firm internationalization. Adopting the Uppsala model's theoretical underpinnings, this paper develops and operationalizes a pre-internationalization phase decision heuristic in the form of an ‘export readiness index'. Four constructs are proposed that drive and inhibit export commencement decision-making during a firm's preinternationalization phase: export stimuli, attitudinal/psychological commitment, resources and lateral rigidity. Through a survey of Australian exporting and non-exporting small-medium sized enterprises (SMEs), the Export Readiness Index (ERI) is developed through factor analysis and tested using logistic regression. Results of the study and their potential implications are discussed.

A more efficient and effective heuristic algorithm for the MapReduce placement problem in cloud computing

The placement of the mappers and reducers on the machines directly affects the performance and cost of the MapReduce computation in cloud computing. From the computational point of view, the mappers/reducers placement problem is a generalization of the classical bin packing problem, which is NP-complete. Thus, in this paper we propose a new heuristic algorithm for the mappers/reducers placement problem in cloud computing and evaluate it by comparing with other several heuristics on solution quality and computation time by solving a set of test problems with various characteristics. The computational results show that our heuristic algorithm is much more efficient than the other heuristics. Also, we verify the effectiveness of our heuristic algorithm by comparing the mapper/reducer placement for a benchmark problem generated by our heuristic algorithm with a conventional mapper/reducer placement. The comparison results show that the computation using our mapper/reducer placement is much cheaper while still satisfying the computation deadline.

Applying academagogy : the transference of an organised heuristic teaching approach to the digital realm

Much has been written about transferring class materials and teaching techniques to digital platforms, but less has been written about applying heuristic organizing constructs in the same manner. With the transformation of learning ecologies over the past decades as well as requirements to adjust to constantly shifting digital tools and environments, the challenges for learning facilitators are to readily adapt and change, as well as to engage a changing learner demographic. However, most importantly is to engage most effectively with learners in these online environments. This article reviews the existing literature in the heuristic construct of academagogy [1] and applies a case study methodology to discussion of the first application of academagogy to the online delivery of an undergraduate design unit. Through a focus on effective teaching and learning techniques, the transfer from face-to-face (f2f) to the digital realm is explored through four main focal points: Tools for teaching, teaching and learning, communicating with students, and effective teaching methods. These four focal points are then used to discuss ways to meet the challenges of teaching online including how they create new dimensions in teaching practice and how the digital experience changes learning experiences. The article concludes with reflection and consolidation of the similarities and differences between the face-to-face and digital deliveries, and by suggesting changes to the academagogic heuristic to enable its use more easily in a digital space.

The affect heuristic and public support for three types of wood smoke mitigation policies

This study applied the affect heuristic model to investigate key psychological factors (affective associations, perceived benefits, and costs of wood heating) contributing to public support for three distinct types of wood smoke mitigation policies: education, incentives, and regulation. The sample comprised 265 residents of Armidale, an Australian regional community adversely affected by winter wood smoke pollution. Our results indicate that residents with stronger positive affective associations with wood heating expressed less support for wood smoke mitigation policies involving regulation. This relationship was fully mediated by expected benefits and costs associated with wood heating. Affective associations were unrelated to public support for policies involving education and incentives, which were broadly endorsed by all segments of the community, and were more strongly associated with rational considerations. Latent profile analysis revealed no evidence to support the proposition that some community members experience internal “heart versus head” conflicts in which their positive affective associations with wood heating would be at odds with their risk judgments about the dangers of wood smoke pollution. Affective associations and cost/benefit judgments were very consistent with each other.

A heuristic clustering algorithm using union of overlapping pattern-cells

Relative geometric arrangements of the sample points, with reference to the structure of the imbedding space, produce clusters. Hence, if each sample point is imagined to acquire a volume of a small M-cube (called pattern-cell), depending on the ranges of its (M) features and number (N) of samples; then overlapping pattern-cells would indicate naturally closer sample-points. A chain or blob of such overlapping cells would mean a cluster and separate clusters would not share a common pattern-cell between them. The conditions and an analytic method to find such an overlap are developed. A simple, intuitive, nonparametric clustering procedure, based on such overlapping pattern-cells is presented. It may be classified as an agglomerative, hierarchical, linkage-type clustering procedure. The algorithm is fast, requires low storage and can identify irregular clusters. Two extensions of the algorithm, to separate overlapping clusters and to estimate the nature of pattern distributions in the sample space, are also indicated.

Some new results regarding spikes and a heuristic for spike construction

his paper addresses the problem of minimizing the number of columns with superdiagonal nonzeroes (viz., spiked columns) in a square, nonsingular linear system of equations which is to be solved by Gaussian elimination. The exact focus is on a class of min-spike heuristics in which the rows and columns of the coefficient matrix are first permuted to block lower-triangular form. Subsequently, the number of spiked columns in each irreducible block and their heights above the diagonal are minimized heuristically. We show that ifevery column in an irreducible block has exactly two nonzeroes, i.e., is a doubleton, then there is exactly one spiked column. Further, if there is at least one non-doubleton column, there isalways an optimal permutation of rows and columns under whichnone of the doubleton columns are spiked. An analysis of a few benchmark linear programs suggests that singleton and doubleton columns can abound in practice. Hence, it appears that the results of this paper can be practically useful. In the rest of the paper, we develop a polynomial-time min-spike heuristic based on the above results and on a graph-theoretic interpretation of doubleton columns.

Heuristic algorithms for scheduling of a batch processor in automobile gear manufacturing

In this paper we address a scheduling problem for minimising total weighted tardiness. The motivation for the paper comes from the automobile gear manufacturing process. We consider the bottleneck operation of heat treatment stage of gear manufacturing. Real life scenarios like unequal release times, incompatible job families, non-identical job sizes and allowance for job splitting have been considered. A mathematical model taking into account dynamic starting conditions has been developed. Due to the NP-hard nature of the problem, a few heuristic algorithms have been proposed. The performance of the proposed heuristic algorithms is evaluated: (a) in comparison with optimal solution for small size problem instances, and (b) in comparison with `estimated optimal solution' for large size problem instances. Extensive computational analyses reveal that the proposed heuristic algorithms are capable of consistently obtaining near-optimal solutions (that is, statistically estimated one) in very reasonable computational time.