Scheduling and Platforming Trains at Busy Complex Stations

We consider the problem of train planning or scheduling for large, busy, complex train stations, which are common in Europe and elsewhere, though not in North America. We develop the constraints and objectives for this problem, but these are too computationally complex to solve by standard combinatorial search or integer programming methods. Also, the problem is somewhat political in nature, that is, it does not have a clear objective function because it involves multiple train operators with conflicting interests. We therefore develop scheduling heuristics analogous to those successfully adopted by train planners using ''manual'' methods. We tested the model and algorithms by applying to a typical large station that exhibits most of the complexities found in practice. The results compare well with those found by traditional methods, and take account of cost and preference trade-offs not handled by those methods. With successive refinements, the algorithm eventually took only a few seconds to run, the time depending on the version of the algorithm and the scheduling problem. The scheduling models and algorithms developed and tested here can be used on their own, or as key components for a more general system for train scheduling for a rail line or network.Train scheduling for a busy station includes ensuring that there are no conflicts between several hundred trains per day going in and out of the station on intersecting paths from multiple in-lines and out-lines to multiple platforms, while ensuring that each train is allowed at least its minimum required headways, dwell time, turnaround time and trip time. This has to be done while minimizing (costs of) deviations from desired times, platforms or lines, allowing for conflicts due to through-platforms, dead-end platforms, multiple sub-platforms, and possible constraints due to infrastructure, safety or business policy.

De la cooperativa agroalimentaria a la "learning netchain". Hacia un planteamiento teorico interorganizativo e interpersonal

Se propone un planteamiento teórico/conceptual para determinar si las relaciones interorganizativas e interpersonales de la netchain de las cooperativas agroalimentarias evolucionan hacia una learning netchain. Las propuestas del trabajo muestran que el mayor grado de asociacionismo y la mayor cooperación/colaboración vertical a lo largo de la cadena están positivamente relacionados con la posición horizontal de la empresa focal más cercana del consumidor final. Esto requiere una planificación y una resolución de problemas de manera conjunta, lo que está positivamente relacionado con el mayor flujo y diversidad de la información/conocimiento obtenido y diseminado a lo largo de la netchain. Al mismo tiempo se necesita desarrollar un contexto social en el que fluya la información/conocimiento y las nuevas ideas de manera informal y esto se logra con redes personales y, principalmente, profesionales y con redes internas y, principalmente, externas. Todo esto permitirá una mayor satisfacción de los socios de la cooperativa agroalimentaria y de sus distribuidores y una mayor intensidad en I+D, convirtiéndose la netchain de la cooperativa agroalimentaria, así, en una learning netchain.

The Teaching Space Allocation Problem with splitting

A standard problem within universities is that of teaching space allocation which can be thought of as the assignment of rooms and times to various teaching activities. The focus is usually on courses that are expected to fit into one room. However, it can also happen that the course will need to be broken up, or ‘split’, into multiple sections. A lecture might be too large to fit into any one room. Another common example is that of seminars or tutorials. Although hundreds of students may be enrolled on a course, it is often subdivided into particular types and sizes of events dependent on the pedagogic requirements of that particular course. Typically, decisions as to how to split courses need to be made within the context of limited space requirements. Institutions do not have an unlimited number of teaching rooms, and need to effectively use those that they do have. The efficiency of space usage is usually measured by the overall ‘utilisation’ which is basically the fraction of the available seat-hours that are actually used. A multi-objective optimisation problem naturally arises; with a trade-off between satisfying preferences on splitting, a desire to increase utilisation, and also to satisfy other constraints such as those based on event location and timetabling conflicts. In this paper, we explore such trade-offs. The explorations themselves are based on a local search method that attempts to optimise the space utilisation by means of a ‘dynamic splitting’ strategy. The local moves are designed to improve utilisation and satisfy the other constraints, but are also allowed to split, and un-split, courses so as to simultaneously meet the splitting objectives.

An analogue of the Magnus problem for associative algebras

We prove an analogue of Magnus theorem for associative algebras without unity over arbitrary fields. Namely, if an algebra is given by $n+k$ generators and $k$ relations and has an $n$-element system of generators, then this algebra is a free algebra of rank $n$.

The 90-degree problem of scattering theory revisited: dynamical turbulence effects versus nonlinear effects

The 90° problem of cosmic-ray transport theory is revisited in this paper. By using standard forms of the wave spectrum in the solar wind, the pitch-angle Fokker–Planck coefficient and the parallel mean free path are computed for different resonance functions. A critical comparison is made of the strength of 90° scattering due to plasmawave effects, dynamical turbulence effects and nonlinear effects. It is demonstrated that, only for low-energy cosmic particles, dynamical effects are usually dominant. The novel results presented here are essential for an effective comparison of heliospheric observations for the parallel mean free path with the theoretical model results.