Dynamical scenarios from a two-patch predator-prey system with human control - Implications for the conservation of the wolf in the Alta Murgia National Park

We evaluate a mathematical model of the predator-prey population dynamics in a fragmented habitat where both migration processes between habitat patches and prey control policies are taken into account. The considered system is examined by applying the aggregation method and different dynamical scenarios are generated. The resulting implications are then discussed, their primary aim being the conservation of the wolf population in the Alta Murgia National Park, a protected area situated in the Apulian Foreland and also part of the Natura 2000 network.

An Integrated Decision Support System to Solve Multi-Criteria Orienteering Problem

In this work we proposed an integrated support system combining a meta-heuristic algorithm and a multicriteria decision analysis method to solve an orienteering problem applied to car-pooling system. For this purpose a Genetic Algorithm (GA), an Analytical Hierarchy Process (AHP) are implemented. The research is based on the awareness that decision makers (DMs) often face situations in which different conflicting viewpoints (goals or criteria) are to be considered. Current car-pooling web platforms are focused on the exchange of information among potential users and drivers.

A GENETIC ALGORITHM TO DESIGN TOURISTIC ROUTES IN A BIKE SHARING

The aim of this paper is to study a Bike Sharing Touring (BST) applying a mathematical model known in operation research as Orienteering Problem (OP). Several European Cities are developing BST in order to reduce the exhaust emissions and to improve the sustainability in urban areas. The authors offer a Decision Support Tool useful for the tourist and the service's manager to organize the tourists' paths on the basis of tourists' desires, subject to usable time, place of interest position and docking station location.

A hybrid tree/finite-difference approach for Heston-Hull-White type models

We study a hybrid tree/finite-difference method which permits to obtain efficient and accurate European and American option prices in the Heston Hull-White and Heston Hull-White2d models. Moreover, as a by-product, we provide a new simulation scheme to be used for Monte Carlo evaluations. Numerical results show the reliability and the efficiency of the proposed methods.

De Finetti e Picone: la nascita dell'informatica in Italia

Bruno de Finetti è senza dubbio una delle figure più importanti per la storia della Statistica e del Calcolo delle Probabilità in Italia. Però i suoi interessi furono molto più ampi e compresero molti settori della cosiddetta matematica applicata. In particolare giocò un ruolo importante nella nascita del calcolo numerico e dell'informatica in Italia, settori che peraltro costituiscono importanti strumenti per l'applicazione dei suoi studi principali.

Applications of the vehicle routing problem with time period constraints

This work describes two applications of the vehicle routing problem (VRP) to the design of fixed and periodic routes. The first application is an industrial case in the field of touristic cruise planning where point of interests should be visited within exactly one of multiple time windows on a weekly time basis. The second application is in retail distribution of fuel oils where petrol stations must be refueled with given fuel oil amounts periodically within a given time horizon.

Numerical methods for pricing options under stochastic volatility models.

Partial integro-differential equation (PIDE) formulations are often preferable for pricing options under models with stochastic volatility and jumps. In this talk, we consider the numerical approximation of such models. On one hand, due to the non-local nature of the integral term, we propose to use Implicit-Explicit (IMEX) Runge-Kutta methods for the time integration to solve the integral term explicitly, giving higher order accuracy schemes under weak stability time-step restrictions.

Near best discrete polynomial approximation via de la Vallee Poussin means

One of the most popular discrete approximating polynomials is the Lagrange interpolation polynomial and the Jacobi zeros provide a particularly convenient choice of the interpolation knots on [?1, 1]. However, it is well known that there is no point system such that the associate sequence of Lagrange polynomials, interpolating an arbitrary function f, would converge to f w.r.t. any weighted uniform or L1 norm.