Pablo Moscato - Papers

Book Chapters

``Algoritmos Geneticos''

Manuel Laguna and Pablo Moscato, Chapter 3, from the book ``Optimizacion Heuristica y Redes Neuronales'' , edited by B. A. Diaz, Ed. Paraninfo, Madrid, Espanya, (1996). Available here. The home page of the book in Spanish is available here .

``Recocido Simulado'' (Simulated Annealing).

Belarmino Adenso Diaz and Pablo Moscato, Chapter 2, from the book ``Optimizacion Heuristica y Redes Neuronales'' , edited by B. A. Diaz, Ed. Paraninfo, Mad irid, Espanya, (1996). The home page of the book in Spanish is available here .

Publications

The Euclidean Traveling Salesman Problem and a Space-Filling Curve.

M. G. Norman and P. Moscato, Chaos, Solitons and Fractals, Vol. 6, pages 389-397, 1995. Available here.

A discussion on some design principles for efficient crossover operators for graph coloring problems.

G. Duran, P.E. Coll and P. Moscato, ``Anales del XXVII Simposio Brasileiro de Pesquisa Operacional'', Vitoria, Brazil, 6-8 Nov. 1995. Available here.

A new hybrid heuristic for large geometric Traveling Salesman Problems based on the Delaunay Triangulation.

N. Krasnogor, P. Moscato and M.G Norman ``Anales del XXVII Simposio Brasileiro de Pesquisa Operacional'', Vitoria, Brazil, 6-8 Nov. 1995. Available here.

Using L-Systems to generate arbitrarily large instances of the Euclidean Traveling Salesman Problem with known optimal tours.

A. Mariano, P. Moscato and M.G Norman, ``Anales del XXVII Simposio Brasileiro de Pesquisa Operacional'', Vitoria, Brazil, 6-8 Nov. 1995. Available here.

Complexity Studies in Latin America: A Report on the First International Conference on Complex Systems in Computational Physics.

P. Moscato, Complexity , Vol. 1, Number 1, 1995. The home page of this journal is Available here.

Arbitrarily large planar ETSP instances with known optimal tours,

A. Mariano, P. Moscato, and M.G. Norman, expanded version of the paper presented at Vitoria, ES, Brazil, 1995. Paper accepted in the journal ``Pesquisa Operacional''. Preprint available here .

Semidynamic-Point Sets for Polynomial-Time Learning.

P. Moscato and N. Krasnogor, ``CLAIO '94'' , Santiago de Chile, Chile, July 1994. Available here.

An Introduction to Population Approaches for Optimization and Hierarchical Objective Functions: A Discussion on the role of Tabu Search.

P. Moscato, Annals of Operations Research , Vol. 41, Number 1-4, pp. 85-121, 1993. Please check the home page of this volume of the journal which is available here.

A `Memetic' Approach for the Traveling Salesman Problem. Implementation of a Computational Ecology for Combinatorial Optimization on Message-Passing Systems.

P. Moscato and M.G. Norman, Parallel Computing and Transputer Applications , edited by M. Valero, E. Onate, M. Jane, J.L. Larriba and B. Suarez, Ed. IOS Press, Amsterdam, pp. 187-194, 1992. Available here.

A Computational Ecology for the Quadratic Assignment Problem.

J. Carrizo, F.G. Tinetti and P. Moscato, Proceedings of the 21st Meeting on Informatics and Operations Research (JAIIO '21) , Buenos Aires, Argentina, August 1992, available here.

The REM-Sleep Alterations in Chronic Alcoholism: Its relation with a Limit-Cycle Mutual Interaction Model for REM-NREM Transitions.

P. Moscato and A. Garay. Proceedings of 4th Workshop in Information Processing and Control, Buenos Aires, Argentina, Nov. 1991.

``Heuristicas para balance de carga computacional y el problema de asignacion cuadratica''

, Heuristics for computational load balancing and the quadratic assignment problem, (in Spanish), J. Carrizo, F. Tinetti and P. Moscato. Proceedings of 4th Workshop in Information Processing and Control, Buenos Aires, Argentina, Nov. 1991.

Un algoritmo detector de bordes basado en un mecanismo adaptativo de reconocimiento de patrones y logica de umbral

An edge detection algorithm based on a pattern recognition adaptive mechanism and threshold logic, in Spanish, R. Figueroa, F. Safar and P. Moscato, Proceedings of 4th Workshop in Information Processing and Control, Buenos Aires, Argentina, Nov. 1991.

Algoritmos memeticos para problemas de optimizacion combinatoria. Estudio de eficiencia e implementacion en un sistema concurrente

Memetic Algorithms for Combinatorial Optimization Problems: Efficiency Studies and Implementation on a Concurrent System, in Spanish. D. Guerri, F. Tinetti and P. Moscato. Proceedings of 4th Workshop in Information Processing and Control, Buenos Aires, Argentina, Nov. 1991.

Stochastic vs. Deterministic Update in Simulated Annealing.

P. Moscato and J.F. Fontanari, Phys. Lett. A, , Vol. 146, Number 4, pp. 204-208, (1990). Abstract

A Competitive and Cooperative Approach to Complex Combinatorial Search.

M. G. Norman and P. Moscato, Caltech Concurrent Computation Program, C3P Report 790 (1989) (expanded version published at the Proceedings of the 20th Informatics and Operations Research Meeting, Buenos Aires, August 1991).

Selected Technical Reports

These reports contain material that has been submitted for publication or has not otherwise yet been published.

An Analysis of the Performance of Traveling Salesman Heuristics on Infinite-Size Fractal Instances in the Euclidean Plane.

P. Moscato and M.G. Norman, submitted, available here .

Blending Heuristics with a Population-Based Approach: A Memetic Algorithm for the Traveling Salesman Problem.

P. Moscato and F. Tinetti, submitted, available here .

``Sistemas de computacion concurrente: Hacia la revolucion informatica de los anyos noventa''.

(Concurrent Computation Systems: Towards the Informatic Revolution of the Nineties, in Spanish), P. Moscato and A.A. Quijano, invited paper and talk given at CINTEBA '90, (April 1990).

On Evolution, Search, Optimization, Genetic Algorithms and Martial Arts: Towards Memetic Algorithms.

P. Moscato, Caltech Concurrent Computation Program, C3P Report 826, (1989), available here.

On Genetic Crossover Operators for Relative Order Preservation.

P. Moscato, Caltech Concurrent Computation Program, C3P Report 778, (1989), available here .

t-expansion and the Mathieu equation

P. Moscato and C. Riveros, Caltech Concurrent Computation Program, C3P Report 782, (1989), available here.

t-expansion at low orders: Ground State Calculations of Lattice Systems.

P. Moscato, Caltech Concurrent Computation Program, C3P Report 684, (1988), available here .

Back to Pablo Moscato's Home Page

Page created Feb. 29, 1996
Last update Nov. 1, 1996