Loading in 2 Seconds...
Loading in 2 Seconds...
Depto. Investigación Operativa, Computer Science Institute, Engineer Faculty Universidad de la República, Uruguay. March 2005. Assistants Celina Gutiérrez Antonio Mauttone Alfredo Olivera Martín González Pablo Rodríguez Bocca Eight PhD and MsC students
Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.
stochastic programming and dynamic programming.
Discrete event simulation.
Monte Carlo methods,
Variance Reduction methods.Main research areas and methodologies
“Adaptative Memory Programming for the Vehicle Routing Problem With Multiple Trips”.
A. Olivera, O. Viera (2005)
A.Mauttone, M.E. Urquhart (ICIL Poster-2005).
This work is about the design of bus lines (routes and frequencies) in urban public transport systems. It is part of a long reach project, whose objective is to develop a tool that supports the transit network design planning in a strategic context.
Problem: to find the least costnetwork topology that satisfies some node-disjoint path connection requirements;
Modeled as a GSPNC (Generalized Steiner Problem with Node-Connectivity Constraints);
Solved with an algorithm based on GRASP.
Present experimental results, test problems with more than 100 nodes, obtained from public libraries.
Problem: to design the access network topology of a Wide Area Network;
Modeled as a variant of the Steiner Problem in graphs.
Solved with an algorithm based on GRASP that employs Random Neural Networks as local search heuristic.
Present experimental results, test problems obtained from the SteinLib .
S. Nesmachnow,H. Cancela, E. Alba.(2004)
Problem: to design a reliable communication network topology;
Modeled as a Generalized Steiner Problem in graphs (to design a minimum cost subnetwork verifying a set of prefixed minimum connection requirements for pairs of terminal nodes).
Solved with a set of pure and hybrids Evolutionary algorithms (GA, CHC, GA+SA, Parallel)
Present a comparative study of them with a random test suite of three .
J. Viera,C. Testuri.(2004)
Multicommodity network, Sotchastic Programming.
S. Costabel, M. Urquhart (2005). Master thesis.
Timetable problem, Tabu-Search, Genetic Algorithm, Ant-systems. Real test-case: Engineering Faculty.