# A.C. MorettiUniversity of Campinas | UNICAMP · Faculdade de Ciências Aplicadas - Limeira (FCA)

A.C. Moretti

PhD Industrial Engineering - Georgia Tech

## About

69

Publications

15,940

Reads

**How we measure 'reads'**

A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more

488

Citations

Citations since 2017

## Publications

Publications (69)

In this paper, we present the integration of two problems related to the operations in a port terminal: the Berth Allocation Problem (BAP) integrated with the Machine Assignment Problem. We present a mixed-integer linear programming (MILP) formulation, capable of assigning and scheduling incoming vessels to berthing positions and the assignment of...

In this paper, we propose a new heuristic strategy to solve linear integer mathematical problems. The strategy begins by finding the optimal solution of the continuous associated problem and the simplex directions from that optimal solution. A total of n − m problems are generated and solved by the strategy, where m is the number of constraints and...

In this article we obtain an approximation of a given fuzzy number by a unique polygonal fuzzy number preserving its main characteristics such as core, support, and expected interval. For this, we consider the well-known weighted L2 metric. We show that this weighted polygonal approximation is equivalent to a strict convex quadratic optimization pr...

In this article a part of the context sections has errors due to an incomplete revision for which the authors much apologize.

This paper presents an exact scalarization method to solve bi-objective integer linear optimization problems. This method uses diverse reference points in the iterations, and it is free from any kind of a priori chosen weighting factors. In addition, two new adapted scalarization methods from literature and the modified Tchebycheff method are studi...

ABSTRACT Maritime shipping is vital to worldwide commerce. Due to the high flow in ports throughout the world, the efficient allocation of vessels in berths has become a problem. A new mathematical model and several algorithms are proposed in this paper to planning the allocation of the vessels in berths and the allocation of resources to the servi...

The operational efficiency of a port depends on proper container movement planning, called “stowage planning”, especially because unloading and loading container ships demands time, and this has a cost. Thus, the optimization of operations through stages is important to avoid blockage activities. This paper proposes a framework for solving the 3D s...

This article addresses the bi-objective integer cutting stock problem in one dimension. This problem has great importance and use in various industries, including steel mills. The bi-objective model considered aims to minimize the frequency of cutting patterns to meet the minimum demand for each item requested and the number of different cutting pa...

In this work we propose a heuristic algorithm for the layout optimization for disks installed in a rotating circular container. This is a unequal circle packing problem with additional balance constraints. It proved to be an NP-hard problem, which justifies heuristics methods for its resolution in larger instances. The main feature of our heuristic...

In this paper we study a particular aspect of the urban community policing: routine patrol
route planning. We seek routes that guarantee visibility, as this has a sizable impact on the community
perceived safety, allowing quick emergency responses and providing surveillance of selected sites (e.g.,
hospitals, schools). The planning is restricted to...

O presente trabalho trata o Problema do Corte Unidimensional Inteiro (PCUI). De- vido a sua vasta aplicabilidade nas metalurgicas, industrias textil, m´oveis, papel, aluminio, etc, este problema ´e um dos mais estudados em Otimizacao Combinatoria. Embora seja facilmente entendido, o PCUI ´e altamente complexo de ser resolvido, devido a natureza e o...

O presente trabalho tem por objetivo, tratar o Problema de Alocacao de Navios em Bercos usando a metaheuristica GRASP. Tal problema tem sido objeto de estudo de muitos pesquisadores nos ultimos anos, como em [1], [2] e [4], tendo em vista o forte impacto do setor de transporte maritimo no comercio mundial. O Problema de Alocacao de Navios em Bercos...

This paper proposes an approach to address the problem of programming the maintenance of electric energy transmission assets based on the relationship reliability/cost. A mathematical model is proposed for finding the best maintenance schedule (taking into account the constraints of the Electric System) for these assets in a given planning horizon....

One of the most important optimality conditions to solve a vector
optimization problem is the first-order necessary optimality condition that
generalizes the Karush-Kuhn-Tucker condition. However, to obtain the sufficient
optimality conditions, it is necessary to impose additional assumptions in the
objective functions and in the constraint set. Th...

Cargo handling in private and public ports is one of the main activities in trade logistics. A different adaptation on container operations is required, as it plays a different role in terms of performance in port operations in Brazil. The use of data envelopment analysis (DEA) is applied to analyze the relative efficiency in terms of container ope...

Modelos decisórios para o projeto de arquitetura da linha de produtos de software são de
extrema importância para a comunidade de Engenharia de Software dada a complexidade dos
contextos decisórios atuais nas empresas e o seu papel estratégico na busca por maior eficiência na construção de produtos de software. Busca-se a seleção e o sequenciamento...

de navios em terminais Portuários para Múltiplos Cenários via Representação por Regras e Algoritmo Genético Resumo: Neste artigo, apresenta-se uma nova formulação e uma representação por regras para a solução do problema estocástico de carregamento dos contêineres 3D de navios em terminais portuários (PCCTP 3D), que consiste em determinar como carr...

Cargo handling in private and public ports is one of the main activities in trade logistics. A different adaptation on container operations is required, as it plays a different role in terms of performance in port operations in Brazil. The use of data envelopment analysis (DEA) is applied to analyze the relative efficiency in terms of container ope...

This article deals with issues related to international competitiveness, with emphasis on the customs administration. The paper presents a conceptual and practical approach. In the foreground it was sought, based on the concepts of competitiveness and customs administration, to understand the relative position of Brazilian customs forward to increa...

This paper addresses a scheduling problem in an actual industrial environment of a baking industry where production rates have been growing every year and the need for optimized planning becomes increasingly important in order to address all the features presented by the
problem. This problem contains relevant aspects of production, such as paralle...

This paper formulates the 3D containership loading planning problem (3D CLPP) and also proposes a new and compact representation to efficiently solve it. The key objective of stowage planning is to minimise the number of container movements and also the ship's instability. The binary formulation of this problem is properly described and an alternat...

Due to constant advances in technology and growing business competition, it is increasingly common for technology companies to offer users' training in their service portfolio. In this sense, an effective planning method for allocating instructors to courses is necessary to prevent overload, subcontracting or idle workforce, as well as offering a g...

In this work we propose a heuristic algorithm for the layout optimization for
disks installed in a rotating circular container. This is a unequal circle
packing problem with additional balance constraints. It proved to be an NP-hard
problem, which justifies heuristic methods for its resolution. The main feature
of our heuristic is based on the sele...

A simple mathematical model is developed to explain the appearance of oscillations in the dispersal of larvae from the food source in experimental populations of certain species of blowflies. The life history of the immature stage in these flies, and in a number of other insects, is a system with two populations, one of larvae dispersing on the soi...

This paper formulates the 3D Stochastic Stowage Plan-ning (3D SSP) problem. The key objective of 3D SSP is to minimize the number of container movements and maximize the ship´s stability considering multiple scenar-ios. The binary formulation of this problem is described and an alternative formulation, called Representation by Rules, is combined wi...

Editor's note with apologies.

Edilson Fernandes de Arruda (UFRJ) efarruda@pep.ufrj.br Luiz Leduino Salles Neto (UNIFESP) luiz.leduino@unifesp.br Antônio Augusto Chaves (UNIFESP) antonio.chaves@unifesp.br Antônio Carlos Moretti (UNICAMP) moretti@ime.unicamp.br Resumo:Neste artigo é apresentada uma nova forma de resolução do problema de carregamento de contêineres 3D em terminais...

This article has been retracted: please see Elsevier Policy on Article Withdrawal (http://www.elsevier.com/locate/withdrawalpolicy). This article has been retracted at the request of the Editors-in-Chief. The article is a duplicate of a paper that has already been published in Mem Inst Oswaldo Cruz, Vol 92(2), (1997) 281-286 [DOI: doi:10.1590/S0074...

In this paper, we propose a new mathematical formalization of the concept of polygonal fuzzy numbers and an extension of this notion to fuzzy sets on RnRn. We study the mathematical structure of these families of fuzzy sets and show that each family is a complete and separable metric space when endowed with the generalized Hausdorff metric. Moreove...

This study presents the promising results obtained for an intelligent decision-making system for industrial processes in which the cutting stock problem is a component relevant to production planning. In order to establish a cutting process assisted by an intelligent system, with memory and learning capabilities, we utilised a symbiotic genetic alg...

This paper formulates the 3D Container ship Loading Planning Problem (3D CLPP) and also proposes a new and compact representation to efficiently solve it. Containers on board a Container ship are placed in vertical stacks, located in different sections. The only way to access the containers is through the top of the stack. In order to unload a cont...

This work presents a genetic symbiotic algorithm to minimize the number of objects and the setup in a one-dimensional cutting stock problem. The algorithm implemented can generate combinations of ordered lengths of stock (the cutting pattern) and, at the same time, the frequency of the cutting patterns, through a symbiotic process between two disti...

Este estudio presenta un nuevo modelo matemático y un procedimiento metaheurístico de búsqueda voraz adaptativa y aleatoria (GRASP, por sus siglas en inglés) para resolver el problema de stock de corte ordenado. Este problema ha sido introducido recientemente en la literatura. Es apropiado minimizar la materia prima usada por las industrias que man...

RESUMEN Este estudio presenta un nuevo modelo matemático y un procedimiento metaheurístico de búsqueda voraz adaptativa y aleatoria (GRASP, por sus siglas en inglés) para resolver el problema de stock de corte ordenado. Este problema ha sido introducido recientemente en la literatura. Es apropiado minimizar la materia prima usada por las industrias...

The school timetabling problem (STP) consists in fixing a sequence of meetings between teachers and students in a prefixed period of time (typically a week), satisfying organizational, pedagogical and personal constraints. STP is a NP-complete problem and is usually tackled using heuristic methods. In this work we considered typical characteristics...

In this article we solve a nonlinear cutting stock problem which represents a cutting stock problem that considers the minimization of, both, the number of objects used and setup. We use a linearization of the nonlinear objective function to make possible the generation of good columns with the Gilmore and Gomory procedure. Each time a new column i...

This study presents a new mathematical model a Greedy Randomized Adaptive Search Procedure (GRASP) metaheuristic to solve the ordered cutting stock problem. The ordered cutting stock problem was recently introduced in literature. It is appropriate to minimize the raw material used by industries that deal with reduced product inventories, such as in...

In this article we solve a nonlinear cutting stock problem which represents a cutting stock problem that considers the minimization of, both, the number of objects used and setup. We use a linearization of the nonlinear objective function to make possible the generation of good columns with the Gilmore and Gomory procedure. Each time a new column i...

The main ingredient for polynomiality in interior point methods is the centering procedure. All interior point algorithms for solving linear programing (LP) problems, known to be polynomial, have an explicit or implicit mechanism for finding a center of the LP polytope. Therefore, we consider the study of centers of polytopes as an important undert...

In this paper, we establish the existence and uniqueness of strong solutions for the viscous incompressible chemically active fluid in an unbounded domain differing somewhat from those previously known.

We present a method for the calculation of the capillary pressure curve in porous media using centrifuge single-speed experimental data. The mathematical model is based on the hydrostatic equilibrium equation for capillary pressure and the inverse problem for finding the saturation distribution along the sample from the displaced fluid volume when...

An iterative method for finding the center of a linear programming polytope is presented. The method assumes that we start at a feasible interior point and each iterate is obtained as a convex combination of the orthogonal projection on the half spaces defined by the linear inequalities plus a special projections on the same half spaces. The algori...

The present paper considers the calculation of the absorption coefficient, the index of refraction, and the thickness of thin films using optical transmission data only. To solve the problem, a pointwise constrained optimization approach is used. The method consists of defining a nonlinear programming problem, efficients to be estimated with linear...

We discuss a new method to estimate the absorption coefficient, the index of refraction, and the thickness of thin films using optical transmission data only. To solve the problem we used a pointwise constrained optimization approach, defining a nonlinear programming problem, the unknowns of which are the coefficients to be estimated, with linear c...

A simple mathematical model is developed to explain the appearance of oscillations in the dispersal of larvae from the food source in experimental populations of certain species of blowflies. The life history of the immature stage in these flies, and in a number of other insects, is a system with two populations, one of larvae dispersing on the soi...

We introduce a trust region algorithm for minimization of nonsmooth functions with linear constraints. At each iteration, the objective function is approximated by a model function that satisfies a set of assumptions stated recently by Qi and Sun in the context of unconstrained nonsmooth optimization. The trust region iteration begins with the reso...

This paper describes implementations of eight algorithms of Newton and quasi-Newton type for solving large sparse systems of nonlinear equations. For linear algebra calculations, a symbolic manipulation is used, as well as a static data structure introduced recently by George and Ng, which allows a partial pivoting strategy for solving linear syste...

The main contribution of this work is the introduction of a new function which has the analytic center of a polytope as its maximizer. At the function's optimal point, it assumes a value equal m, the total number of constraints used to define the polytope. For this reason we call it the m-function of the polytope. We also prove that given a p-dimen...

2 Abstract. In this work we introduce a new method to minimize the number 3 of processed objects and the setup number in a unidimensional cutting 4 stock problem. A nonlinear integer programming problem can be used to 5 represent the problem studied here. The term related to the minimization 6 of the setup number is a nonlinear discontinuous functi...

A resolução de problemas de corte unidimen-sionaí e um tema clássico ná area de Pesquisa Op-eracional. Podemos resumir tais problemas con-siderando materiais fornecidos inicialmente em rolos ou placas e que necessitam ser cortados em taman-hos pré–estabelecidos. Conhecidos os tamanhos e a demanda, diferentes combinações de corte podem ser geradas e...

In this work we studied the NP-hard combinatorial nonidentical circle packing prob-lem. It consists of packing a set of circles of different radius dimensions into a circular region taking in account the design and technological considerations. Our problem is a little bit dif-ferent, we want to place a circular weighted objects inside a circular co...

In this work we introduce a new method to minimize the number of processed objects and the setup number in a unidimensional cutting stock problem. A nonlinear integer programming problem can be used to represent the problem studied here. The term related to the minimization of the setup number is a nonlinear discontinuous function, we smooth it and...