Operators of public bicycle sharing systems (BSSs) have to regularly redistribute bikes across their stations in order to avoid them getting overly full or empty. We consider the dynamic case where this is done while the system is in use. There are two main objectives: On the one hand it is desirable to reach particular target fill levels at the end of the process so that the stations are likel...

We consider four conjectures related to the largest eigenvalue of (the adjacency matrix of) a graph (i.e., to the index of the graph). Three of them have been formulated after some experiments with the programming system AutoGraphiX (AGX), designed for finding extremal graphs with respect to given properties by the use of variable neighborhood search. The conjectures are related to the maximal ...

We consider an approach for scheduling the multi-period collection of recyclable materials. Citizens can deposit glass and paper for recycling in small cubes located at several collection points. The cubes are emptied by a vehicle that carries two containers and the material is transported to two treatment facilities. We investigate how the scheduling of emptying and transportation should be do...

Orthographic neighborhood (N) size effects have been extensively studied in English consistently producing a facilitatory effect in word naming tasks. In contrast, several recent studies on Chinese character naming have demonstrated an inhibitory effect of neighborhood size. Response latencies tend to be inhibited by inconsistent characters with large neighborhoods relative to small neighborhoo...

the neighborhood has had a long history in iranian urbanization. since urban plans wereintroduced by the authorities to shape urban development in iran half a century ago, the concept of iranian traditional neighborhood has been neglected gradually. the concept of neighborhood has not found the appropriate status in urban design and planning yet. one of the main reasons is that academics, profe...

A large body of nonexperimental literature finds residing in a disadvantaged neighborhood is deleterious for mental health, and recent evidence from the Moving to Opportunity (MTO) program—a social experiment giving families living in high-poverty neighborhoods the opportunity to move to low-poverty neighborhoods—suggests a causal effect of moving to a low-poverty neighborhood on adult mental h...

Settlement in a socially deprived neighborhood may hamper individual labor market outcomes because of lack of employed or highly skilled contacts. I investigate this hypothesis by exploiting a unique natural experiment that occurred between 1986 and 1998 when refugee immigrants to Denmark were assigned to municipalities quasi-randomly, which successfully addresses the methodological problem of ...

Two key issues in local search algorithms are the definition of a neighborhood and the way to examine it. In this chapter we consider techniques for examining very large neighborhoods, in particular, ways for exactly searching them. We first illustrate such techniques using three paradigmatic examples. In the largest part of the chapter, we focus on the development and experimental study of ver...

This paper presents a general variable neighborhood search (GVNS) heuristic for solving the maximum diverse grouping problem. Extensive computational experiments performed on a series of large random graphs as well as on several instances of the maximum diversity problem taken from the literature show that the results obtained by GVNS consistently outperform the best heuristics from the literat...