Quantum heuristic algorithm for traveling salesman problem

We propose a quantum heuristic algorithm to solve a traveling salesman problem by generalizing Grover search. Sufficient conditions are derived to greatly enhance the probability of finding the tours with extremal costs, reaching almost to unity and they are shown characterized by statistical properties of tour costs. In particular for a Gaussian distribution of the tours along the cost we show that the quantum algorithm exhibits the quadratic speedup of its classical counterpart, similarly to Grover search.Comment: Published versio

‘This restless enemy of all fertility’: exploring paradigms of coastal dune management in Western Europe over the last 700 years

Drifting sand has inundated settlements and damaged agricultural land along the coasts of Western Europe for the last 700 years. The need to control sand migration has been an important driver of the management of coastal sand dunes and here we analyse original archival materials to provide new insights into historically changing coastal dune management practices. Records of coastal sand movement in Denmark, The Netherlands, Britain, Ireland and France were reviewed and three distinct management approaches were identified. The ways in which these approaches have played out in space and time were examined with particular reference to records from landed estates in Britain and Ireland. We demonstrate how historical evidence can be used to inform contemporary debates on dune management strategy and practice. We propose a new place-based approach to the future management of coastal dunes that can incorporate both expert and locally produced ‘knowledges’ and that is underpinned by an understanding of how both natural forces and human interventions have shaped these dune landscapes over time

Efficient Scheduling of Pigeons for a Constrained Delay Tolerant Application

Information collection in the disaster area is an important application of pigeon networks—a special type of delay tolerant networks (DTNs) that borrows the ancient idea of using pigeons as the telecommunication method. The aim of this paper is to explore highly efficient scheduling strategies of pigeons for such applications. The upper bound of traffic that can be supported under the deadline constraints for the basic on-demand strategy is given through the analysis. Based on the analysis, a waiting-based packing strategy is introduced. Although the latter strategy could not change the maximum traffic rate that a pigeon can support, it improves the efficiency of a pigeon largely. The analytical results are verified by the simulations