A cycle-based evolutionary algorithm for the fixed-charge capacitated multi-commodity network design problem

This paper presents an evolutionary algorithm for the fixed-charge multicommodity network design problem (MCNDP), which concerns routing multiple commodities from origins to destinations by designing a network through selecting arcs, with an objective of minimizing the fixed costs of the selected arcs plus the variable costs of the flows on each arc. The proposed algorithm evolves a pool of solutions using principles of scatter search, interlinked with an iterated local search as an improvement method. New cycle-based neighborhood operators are presented which enable complete or partial re-routing of multiple commodities. An efficient perturbation strategy, inspired by ejection chains, is introduced to perform local compound cycle-based moves to explore different parts of the solution space. The algorithm also allows infeasible solutions violating arc capacities while performing the "ejection cycles", and subsequently restores feasibility by systematically applying correction moves. Computational experiments on benchmark MCNDP instances show that the proposed solution method consistently produces high-quality solutions in reasonable computational times

Creative Information Exploration in Journalism

Existing digital tools used by journalists such as content management systems and search engines focus on helping journalists find relevant information and organize their creative work; they do not provide support for discovering creative angles to investigate. To meet this need in journalism, we have researched new creative search algorithms that manipulate the journalist’s primary medium – written information – and developed an innovative creativity and productivity support tool deliberately for use by journalists. In this paper, we analyse the creative tasks journalists perform when developing new stories, we provide an overview of requirements, which have been addressed by the INJECT digital creativity support tool for journalists. Further, we explain the intended use of the system using a walkthrough scenario and present our early experiences from deploying the tool in journalist’s working environments

Resource constrained routing and scheduling: Review and research prospects

In the service industry, it is crucial to efficiently allocate scarce resources to perform tasks and meet particular service requirements. What considerably complicates matters is when these resources, for example skilled technicians, nurses, and home carers have to visit different customer locations. This paper provides a comprehensive survey on resource constrained routing and scheduling that unveils the problem characteristics with respect to resource qualifications, service requirements and problem objectives. It also identifies the most effective exact and heuristic algorithms for this class of problems. The paper closes with several research prospects

Evidences for Tsallis non-extensivity on CMR manganites

We found, from the analysis of $M$ vs. $T$ curves of some manganese oxides (manganites), that these systems do not follow the traditional Maxwell-Boltzmann statistics, but the Tsallis statistics, within the \QTR{em}{normalized} formalism. Curves were calculated within the mean field approximation, for various ferromagnetic samples and the results were compared to measurements of our own and to various other authors published data, chosen at random from the literature. The agreement between the experimental data and calculated $M_{q}$ vs. $T^{\ast}$ curve, where $T^{\ast}$ is an effective temperature, is excellent for all the compounds. The entropic parameter, $q$, correlates in a simple way with the experimental value of $T_{c}$, irrespect the chemical composition of the compounds, heat treatment or other details on sample preparation. Examples include $q<1$ (superextensivity), $q=1$ (extensivity) and $q>1$ (subextensivity) cases.Comment: 12 pages, 3 figure

Engineering Graph-Based Models for Dynamic Timetable Information Systems

Many efforts have been done in the last years to model public transport timetables in order to find optimal routes. The proposed models can be classified into two types: those representing the timetable as an array, and those representing it as a graph. The array-based models have been shown to be very effective in terms of query time, while the graph-based models usually answer queries by computing shortest paths, and hence they are suitable to be used in combination with speed-up techniques developed for road networks. In this paper, we focus on the dynamic behavior of graph-based models considering the case where transportation systems are subject to delays with respect to the given timetable. We make three contributions: (i) we give a simplified and optimized update routine for the well-known time-expanded model along with an engineered query algorithm; (ii) we propose a new graph-based model tailored for handling dynamic updates; (iii) we assess the effectiveness of the proposed models and algorithms by an experimental study, which shows that both models require negligible update time and a query time which is comparable to that required by some array-based models

Dynamic Collection Scheduling Using Remote Asset Monitoring: Case Study in the UK Charity Sector

Remote sensing technology is now coming onto the market in the waste collection sector. This technology allows waste and recycling receptacles to report their fill levels at regular intervals. This reporting enables collection schedules to be optimized dynamically to meet true servicing needs in a better way and so reduce transport costs and ensure that visits to clients are made in a timely fashion. This paper describes a real-life logistics problem faced by a leading UK charity that services its textile and book donation banks and its high street stores by using a common fleet of vehicles with various carrying capacities. Use of a common fleet gives rise to a vehicle routing problem in which visits to stores are on fixed days of the week with time window constraints and visits to banks (fitted with remote fill-monitoring technology) are made in a timely fashion so that the banks do not become full before collection. A tabu search algorithm was developed to provide vehicle routes for the next day of operation on the basis of the maximization of profit. A longer look-ahead period was not considered because donation rates to banks are highly variable. The algorithm included parameters that specified the minimum fill level (e.g., 50%) required to allow a visit to a bank and a penalty function used to encourage visits to banks that are becoming full. The results showed that the algorithm significantly reduced visits to banks and increased profit by up to 2.4%, with the best performance obtained when the donation rates were more variable

An adaptive memory programming framework for the resource-constrained project scheduling problem

The Resource-Constrained Project Scheduling Problem (RCPSP) is one of the most intractable combinatorial optimisation problems that combines a set of constraints and objectives met in a vast variety of applications and industries. Its solution raises major theoretical challenges due to its complexity, yet presenting numerous practical dimensions. Adaptive memory programming (AMP) is one of the most successful frameworks for solving hard combinatorial optimisation problems (e.g. vehicle routing and scheduling). Its success stems from the use of learning mechanisms that capture favourable solution elements found in high-quality solutions. This paper challenges the efficiency of AMP for solving the RCPSP, to our knowledge, for the first time in the literature. Computational experiments on well-known benchmark RCPSP instances show that the proposed AMP consistently produces high-quality solutions in reasonable computational times

Crystal Field and Dzyaloshinsky-Moriya Interaction in orbitally ordered La_{0.95}Sr_{0.05}MnO_3: An ESR Study

We present a comprehensive analysis of Dzyaloshinsky-Moriya interaction and crystal-field parameters using the angular dependence of the paramagnetic resonance shift and linewidth in single crystals of La_{0.95}Sr_{0.05}MnO_3 within the orthorhombic Jahn-Teller distorted phase. The Dzyaloshinsky-Moriya interaction (~ 1K) results from the tilting of the MnO_6 octahedra against each other. The crystal-field parameters D and E are found to be of comparable magnitude (~ 1K) with D ~= -E. This indicates a strong mixing of the |3z^2-r^2> and |x^2-y^2> states for the real orbital configuration.Comment: 12 pages, 6 figure

Effect of transport-induced charge inhomogeneity on point-contact Andreev reflection spectra at ferromagnet-superconductor interfaces

We investigate the transport properties of a ferromagnet-superconductor interface within the framework of a modified three-dimensional Blonder-Tinkham-Klapwijk formalism. In particular, we propose that charge inhomogeneity forms via two unique transport mechanisms, namely, evanescent Andreev reflection and evanescent quasiparticle transmission. Furthermore, we take into account the influence of charge inhomogeneity on the interfacial barrier potential and calculate the conductance as a function of bias voltage. Point-contact Andreev reflection (PCAR) spectra often show dip structures, large zero-bias conductance enhancement, and additional zero-bias conductance peak. Our results indicate that transport-induced charge inhomogeneity could be a source of all these anomalous characteristics of the PCAR spectra.Comment: 9 pages, 6 figure

Transport spin polarization of Ni_xFe_{1-x}: electronic kinematics and band structure

We present measurements of the transport spin polarization of Ni_xFe_{1-x} (0<x<1) using the recently-developed Point Contact Andreev Reflection technique, and compare them with our first principles calculations of the spin polarization for this system. Surpisingly, the measured spin polarization is almost composition-independent. The results clearly demonstrate that the sign of the transport spin polarization does not coincide with that of the difference of the densities of states at the Fermi level. Calculations indicate that the independence of the spin polarization of the composition is due to compensation of density of states and Fermi velocity in the s- and d- bands