A General Vehicle Routing Problem

In this paper, we study a rich vehicle routing problem incorporating various complexities found in real-life applications. The General Vehicle Routing Problem (GVRP) is a combined load acceptance and generalised vehicle routing problem. Among the real-life requirements are time window restrictions, a heterogeneous vehicle fleet with different travel times, travel costs and capacity, multi-dimensional capacity constraints, order/vehicle compatibility constraints, orders with multiple pickup, delivery and service locations, different start and end locations for vehicles, and route restrictions for vehicles. The GVRP is highly constrained and the search space is likely to contain many solutions such that it is impossible to go from one solution to another using a single neighbourhood structure. Therefore, we propose iterative improvement approaches based on the idea of changing the neighbourhood structure during the search.     

Structural properties of graphs of diameter 2 with maximal repeats

It was shown using eigenvalue analysis by Erdös et al. that with the exception of C₄, there are no graphs of diameter 2, of maximum degree d and of order d², that is, one less than the Moore bound. These graphs belong to a class of regular graphs of diameter 2, and having certain interesting structural properties, which will be proved in this paper.     

Modal Aggregation and the Theory of Paraconsistent Filters

This paper articulates the structure of a two species of weakly aggregative necessity in a common idiom, neighbourhood semantics, using the notion of a k-filter of propositions. A k-filter on a non-empty set I is a collection of subsets of I which (i) contains I, (ii) is closed under supersets on I, and (iii) contains ∪{X_i ≤ X_j : 0 ≤ i < j ≤ k} whenever it contains the subsets X₀,…, X_k. The mathematical content of the proof that weakly aggregative modal logic is complete relative to k-ary frame theory, the standard semantic idiom for weakly aggregative modal logic (see [1]) is presented in language-independent terms as a representation theorem for k-filters: every non-trivial k-filter is included in the union of ≤ k non-trivial filters. The elementary theory of k-filters is developed and then applied in the form of an ultrafilter extension result for k-ary frame theory. Mathematics Subject Classification: 03B45.     

A dynamical systems model of unorganized segregation

We consider Schelling’s bounded neighborhood model (BNM) of unorganized segregation, from the perspective of modern dynamical systems theory. We carry out a complete quantitative analysis of the system for linear tolerance schedules. We derive a fully predictive model and associate each term with a social meaning. We recover and generalize Schelling’s qualitative results.

For the case of unlimited population movement, we derive exact formulae for regions in parameter space where stable integrated population mixes can occur, and show how neighborhood tipping can be explained in terms of basins of attraction.

When population movement is limited, we derive exact criteria for the occurrence of new population mixes.

For nonlinear tolerance schedules, we illustrate our approach with numerical simulations.     

Some Connections between Topological and Modal Logic

We study modal logics based on neighbourhood semantics using methods and theorems having their origin in topological model theory. We thus obtain general results concerning completeness of modal logics based on neighbourhood semantics as well as the relationship between neighbourhood and Kripke semantics. We also give a new proof for a known interpolation result of modal logic using an interpolation theorem of topological model theory.     

On a heterochromatic number for hypercubes

The neighbourhood heterochromatic numbernh_c(G) of a non-empty graph G is the smallest integer l such that for every colouring of G with exactly l colours, G contains a vertex all of whose neighbours have different colours. We prove that lim_n→∞(nh_c(Gⁿ)-1)/|V(Gⁿ)|=1 for any connected graph G with at least two vertices. We also give upper and lower bounds for the neighbourhood heterochromatic number of the 2ⁿ-dimensional hypercube.     

New formulations for the Kissing Number Problem

Determining the maximum number of D-dimensional spheres of radius r that can be adjacent to a central sphere of radius r is known as the Kissing Number Problem (KNP). The problem has been solved for two, three and very recently for four dimensions. We present two nonlinear (nonconvex) mathematical programming models for the solution of the KNP. We solve the problem by using two stochastic global optimization methods: a Multi Level Single Linkage algorithm and a Variable Neighbourhood Search. We obtain numerical results for two, three and four dimensions.     

二部图是可迹的一个充分条件

本文证明了以下结果:设G=(X,Y;E)是连通的二部图,如果4≤|Y|≤|X|≤|Y|+1,且NC_2≥|X|-1,则G是可迹的。从而表明[2]中的猜想对二部图是成立的。