The Dial-a-Ride Problem (DARP): Variants,modeling issues and algorithms

The Dial-a-Ride Problem (DARP) consists of designing vehicle routes and schedules for n users who specify pick-up and drop-off requests between origins and destinations. The aim is to plan a set of m minimum cost vehicle routes capable of accommodating as many users as possible, under a set of constraints. The most common example arises in door-to-door transportation for elderly or disabled people. The purpose of this article is to review the scientific literature on the DARP. The main features of the problem are described and classified and some modeling issues are discussed. A summary of the most important algorithms is provided.AMS classification: 90B06, 90C27, 90C59     

Two exact algorithms for the capacitated p-median problem

The p-median problem has been widely studied in combinatorial optimisation, but its generalisation to the capacitated case has not. We propose a branch and price algorithm, comparing it with a standard MIP solver and a branch and bound algorithm based on Lagrangean relaxation. We present computational experience, using test instances drawn from the literature and new instances with higher ratio between the number of medians p and the number of nodes N. The branch and price algorithm shows very good performances and computational time robustness in solving problems for any ratio.Received: December 2002, Revised: August 2003AMS classification: 90C10, 90C27     

Positive solutions of singular boundary value problem of negative exponent Emden—Fowler equation

This paper investigates the existence of positive solutions of a singular boundary value problem with negative exponent similar to standard Emden-Fowler equation. A necessary and sufficient condition for the existence of C[0, 1] positive solutions as well as C¹[0, 1] positive solutions is given by means of the method of lower and upper solutions with the Schauder fixed point theorem.     

Hypersurfaces of the Euclidean sphere with nonnegative Ricci curvature

In this paper we prove that a compact oriented hypersurface of a Euclidean sphere with nonnegative Ricci curvature and infinite fundamental group is isometric to an H(r)-torus with constant mean curvature. Furthermore, we generalize, whithout any hypothesis about the mean curvature, a characterization of Clifford torus due to Hasanis and Vlachos. Received: 19 March 2002     

A continuous parametric shape model

In this paper we propose a flexible continuous parametric shape model for star-shaped planar objects. The model is based on a polar Fourier expansion of the normalized radius-vector function. The expected phase amplitudes are modelled by a simple regression with parameters having nice geometric interpretations. The suggestedgeneralized p-order model is an extension of first- and second-order Gaussian shape models, and in particular the Gaussian assumption is relaxed. The statistical analysis is straightforward, as demonstrated by an application concerning shape discrimination of two cell nuclei populations.     

用激活性非线性介质Nd：MgO：LiNbO3产生二次谐波

以Nd:MgO:LiNbO_3同时兼作激活介质和非线性光学材料,研究自倍频激光器。用小型氙灯泵浦,在室温下获得二次谐波激光(0.547μm) 阈值小于4.8'J,最大输出400μJ/shot,工作温度范围大于20℃～45℃,无光损伤。     

A class of B-(p,r)-invex functions and mathematical programming

Invexity of a function is generalized. The new class of nonconvex functions, called B-(p,r)-invex functions with respect to η and b, being introduced, includes many well-known classes of generalized invex functions as its subclasses. Some properties of the introduced class of B-(p,r)-invex functions with respect to η and b are studied. Further, mathematical programming problems involving B-(p,r)-invex functions with respect to η and b are considered. The equivalence between saddle points and optima, and different type duality theorems are established for this type of optimization problems.     

Informational acquisition and cognitive models

Life forms must organize information into cognitive models reflecting the outside environment, and in a complex and changing environment a life form must constantly select and organize this mass of information to avoid slipping into a chaotic cognitive state. The task of developing and maintaining adaptive cognitive models can be understood through two processes, crucial to regulating the interconnections between environmental elements. The inclusion and exclusion of information follows a process designated by P and the process by which cognitive models change is designated by K. Higher order concepts are created by reducing the interconnections between elements to a minimal number to avoid cognitive chaos. © 2004 Wiley Periodicals, Inc. Complexity 9:31–37, 2004     

A monotone iterative scheme for a nonlinear second order equation based on a generalized anti–maximum principle

In this paper, a generalized anti–maximum principle for the second order differential operator with potentials is proved. As an application, we will give a monotone iterative scheme for periodic solutions of nonlinear second order equations. Such a scheme involves the L^p norms of the growth, 1 ≤ p ≤ ∞, while the usual one is just the case p = ∞.