CRISTIAN DAVID OLIVA SAN MARTIN
@ucsc.cl
Assistant Professor / Industrial Engineering department
Universidad Católica de la Santísima Concepción
RESEARCH INTERESTS
Resolución de problemas de diseño de rutas para vehículos, planificación y programación de la producción y problemas de programación de horarios. También interesado en la logística portuaria.
Scopus Publications
Scholar Citations
Scholar h-index
Scholar i10-index
Scopus Publications
Luis Flores Garrido and Cristian Oliva San Martín
SciELO Agencia Nacional de Investigacion y Desarrollo (ANID)
Este articulo presenta un caso particular del problema de localizacion de instalaciones. La caracteristica de este es que considera un conjunto de clusters que representan la acumulacion de clientes que demandan un producto en particular. Se desea localizar P centros de distribucion donde la demanda de los clusters se satisface solo si localizamos un centro de distribucion en dicho cluster. Ademas, se debe determinar tanto el numero de plantas como sus respectivas ubicaciones con el fin de abastecer los diferentes centros de distribucion localizados. El objetivo es maximizar la utilidad considerando, por un lado, los ingresos que se obtienen por satisfacer la demanda de los diferentes clusters y, por otro lado, los costos de instalacion que se incurren al localizar los centros de distribucion y las plantas como tambien los costos de transporte de material desde las plantas a los centros de distribucion. Otras aplicaciones de este problema se aprecian en redes de telecomunicaciones, redes electricas, etc. Se presenta un nuevo modelo de programacion lineal entera que permite resolver instancias pequenas, hasta 300 clusters, en un tiempo CPU aceptable, los problemas fueron programados con AMPL, y resueltos con CPLEX 11.0. Para instancias de mayor tamano se presentan heuristicas que permiten obtener soluciones con un GAP menor al 1%.
Pablo Ortega, Cristian Oliva, Jacques Ferland, and Manuel Cepeda
SciELO Agencia Nacional de Investigacion y Desarrollo (ANID)
The vehicle routing problem with time windows and scheduled loading [VRPTWSL] requires not only the design of routes with time windows and capacity constraints, but also a schedule of the departures of vehicles from the depot given a load time due to the limited resources available to load the demand in the vehicles. A mathematical formulation of the vehicle routing problem with time windows and scheduled loading is presented and a metaheuristics based on Multiple Ant Colony System is proposed and implemented where two ant colonies, each with a single objective function, are organized in a hierarchical way. A time update procedure is incorporated into the ant constructive procedure to update and schedule the departure of a vehicle from the depot when each ant moves to a new customer-node. Constraint programming is used to determine a feasible move to a new customer-node. As [VRPTWSL] incorporates the vehicle departure scheduling, the algorithm presented in this paper has a direct application to real problems, in this way [VRPTWSL] can be taken as an important advance for practical vehicle routing problems.
Mireille Palpant, Cristian Oliva, Christian Artigues, Philippe Michelon, and Mohamed Didi Biha
Wiley
In this paper, a realistic modeling of interferences for frequency assignment in hertzian telecommunication networks is presented. In contrast with traditional interference models based only on binary interference constraints involving two frequencies, this new approach considers the case of cumulative disruptions that are modeled through a unique non-binary constraint. To deal with these complex constraints, we propose extensions of classical integer linear programming formulations. On a set of realistic instances, we propose hybrid constraint programming and large neighborhood search solution methods to solve minimum interference and minimum span frequency assignment problems. We compare their performances with those of existing heuristics. Finally, we show how the end-user benefits from using the cumulative model instead of the traditional one.