Aplicaciones Matemáticas en Ciencias e Ingeniería

URI permanente para esta comunidad

https://hdl.handle.net/10784/9117

Desarrollo de métodos matemáticos, numéricos y computacionales para el avance del conocimiento y la tecnología en ingeniería y ciencias aplicadas, mediante la excelencia en todas las actividades que desarrolla.

Líneas de investigación: Ciencia e Ingeniería computacional, Computer Aided Geometric Design, Ecuaciones Diferenciales, Mecánica Computacional.
Código Minciencias: COL0013067.
Categoría 2021: A1.
Escuela: Ciencias Aplicadas e Ingeniería.
Líder: Juan Manuel Rodríguez Prieto.
Correo electrónico: jmrodrigup@eafit.edu.co

Fusión de los grupos: Laboratorio CAD/CAM/CAE y Matemáticas y Aplicaciones (2025)

Noticias

https://www.eafit.edu.co/sistema-ciencia-tecnologia-innovacion/investigacion/grupos-investigacion/aplicaciones-matematicas-ciencias-ingenieria
https://scienti.minciencias.gov.co/gruplac/jsp/visualiza/visualizagr.jsp?nro=00000000001614

Examinar

Mostrando 1 - 20 de 310

2D shape similarity as a complement for Voronoi-Delone methods in shape reconstruction
(PERGAMON-ELSEVIER SCIENCE LTD, 2005-02-01) Ruiz, O.E.; Cadavid, C.A.; Granados, M.; Peña, S.; Vásquez, E.; Universidad EAFIT. Departamento de Ingeniería Mecánica; Laboratorio CAD/CAM/CAE
In surface reconstruction from planar cross sections it is necessary to build surfaces between 2D contours in consecutive cross sections. This problem has been traditionally attacked by (i) direct reconstruction based on local geometric proximity between the contours, and (ii) classification of topological events between the cross sections. These approaches have been separately applied with limited success. In case (i), the resulting surfaces may have overstretched or unnatural branches. These arise from local contour proximity which does not reflect global similarity between the contours. In case (ii), the topological events are identified but are not translated into the actual construction of a surface. This article presents an integration of the approaches (i) and (ii). Similarity between the composite 2D regions bounded by the contours in consecutive cross sections is used to: (a) decide whether a surface should actually relate two composite 2D regions, (b) identify the type and location of topological transitions between cross sections and (c) drive the surface construction for the regions found to be related in step (a). The implemented method avoids overstretched or unnatural branches, rendering a surface which is both geometrically intuitive and topologically faithful to the cross sections of the original object. The presented method is a good alternative in cases in which correct reproduction of the topology of the surface (e.g. simulation of flow in conduits) is more important than its geometry (e.g. assessment of tumor mass in radiation planning). © 2004 Elsevier Ltd. All rights reserved.
2D Shape similarity as a complement for Voronoi-Delone methods in shape reconstruction
(Elsevier, 2005) Ruíz S., Óscar E.; Cadavid, Carlos A.; Granados, Miguel; Peña, Sebastián; Vásquez, Eliana; Universidad EAFIT. Departamento de Ingeniería Mecánica; Laboratorio CAD/CAM/CAE
In surface reconstruction from planar slices it is necessary to build surfaces between corresponding 2D regions in consecutive levels -- The problem has been traditionally attacked with (i) direct reconstruction based on local geometric proximity between the regions, and (ii) classification of topological events between the slices, which control the evolution of the cross cuts -- These approaches have been separately applied with mixed success -- In the case (i), the results may be surfaces with over-stretched or unnatural branches, resulting from a local contour proximity which does not correspond to global similarity between regions -- In (ii), the consequences from topological events upon the actual surface realization have not been drawn -- In this paper an integration of (i) and (ii) is presented, which uses a criteria of similarity between composed 2D regions in consecutive slices to: (a) decide if a surface should actually relate those regions, (b) identify the topological transitions between levels and (c) construct the local surface for the related regions -- The method implemented hinders over-stretched and unnatural branches, therefore rendering a surface which adjusts to geometrically-sound topological events -- This is a good alternative when the surface reconstructed needs to be topologically faithful (for example in flow simulation) in addition to represent the a rough geometrical space (for example in radiation planning)
A Metaheuristic Approach for the Cumulative Capacitated Arc Routing Problem
(Springer, 2018-09-12) Lenis, Sergio Andres; Carlos Rivera, Juan; Universidad EAFIT. Departamento de Ciencias; Matemáticas y Aplicaciones
In this paper we propose a new variant of the capacitated arc routing problem (CARP). In this new problem the objective function becomes a cumulative objective computed as the traveled distance multiplied by the vehicle load. A metaheuristic approach
A Local Stochastic Strategy for Rubik´s Cube,
(2013-06-01) Vélez, Juan Diego; Universidad EAFIT. Departamento de Ciencias; Matemáticas y Aplicaciones
A Metaheuristic Approach for the Cumulative Capacitated Arc Routing Problem
(Springer Verlag, 2018-09-03) Rivera, Juan Carlos; Lenis, Sergio Andres; Universidad EAFIT. Departamento de Ciencias; Matemáticas y Aplicaciones
In this paper we propose a new variant of the capacitated arc routing problem (CARP). In this new problem the objective function becomes a cumulative objective computed as the traveled distance multiplied by the vehicle load. A metaheuristic approach is proposed which is based on the hybridization of three known procedures: GRASP, VND and Set covering model. The metaheuristic is tested with some benchmark instances from CARP. The results allow to evaluate the performance with the different metaheuristic components and to compare the solutions with the classical objective function. © 2018, Springer Nature Switzerland AG.
A Mixed-Integer Linear Programming Model for a Selective Vehicle Routing Problem
(Springer International Publishing, 2018-09-03) Rivera, Juan Carlos; Posada, Andrea; PALACIO, JUAN DAVID; Universidad EAFIT. Departamento de Ciencias; Matemáticas y Aplicaciones
A Mixed-Integer Linear Programming Model for a Selective Vehicle Routing Problem
(Springer Verlag, 2018-01-01) Posada A.; Rivera J.C.; Palacio J.D.; Universidad EAFIT. Departamento de Ciencias; Matemáticas y Aplicaciones
In this paper, we propose a new vehicle routing problem variant. The new problem is a type of selective vehicle routing model in which it is not necessary to visit all nodes, but to visit enough nodes in such a way that all clusters are visited and from which it is possible to cover all nodes. Here, a mixed-integer linear programming formulation (MILP) is proposed in order to model the problem. The MILP is tested by using adapted instances from the generalized vehicle routing problem (GVRP). The model is also tested on small size GVRP instances as a special case of our proposed model. The results allow to evaluate the impact of clusters configuration in solver efficacy. © 2018, Springer Nature Switzerland AG.
A model for solving vehicle scheduling problems: a case study
(IMPRENTA UNIV ANTIOQUIA, 2018-09-01) Gulnara Baldoquin, Maria; Jose Rengifo-Campo, Alvaro; Universidad EAFIT. Departamento de Ciencias; Matemáticas y Aplicaciones
In this work we formulate a model to solve a type of vehicle scheduling problem, derived from the operation of the mass transit system (MIO) in Cali city, Colombia. Four companies operate the system with 3 types of buses and four depots. Two kinds of tasks should be assigned to operators' buses. A task is a sequence of consecutive travels of a route between two stations: initial and final. Each task should start and should finish in a depot, not necessarily the same. There are two main objectives defined by the operators. One objective is to minimize the total deadhead kilometers between depots and stations where tasks should start or end. The other objective is to minimize the maximum deviation of kilometers (commercial and deadhead) assigned to the operators regarding the ideal quantity of kilometers that they should have, according to the number of their buses in the fleet. We have implemented the proposed model in AMPL using Gurobi solver and we validate it using nine representative instances, generated with real data obtained from the system operation. The results obtained, in all cases, improve the solutions proposed by the company. Model variations are proposed to deal with new desirable constraints for the company.
A multi-start evolutionary local search for the one-commodity pickup and delivery traveling salesman problem
(Springer Netherlands, 2020-01-01) Palacio J.D.; Rivera J.C.; Universidad EAFIT. Departamento de Ciencias; Matemáticas y Aplicaciones
This article addresses the one-commodity pickup and delivery traveling salesman problem (1-PDTSP), which is a generalization of the well-known traveling salesman problem. The 1-PDTSP aims to find a Hamiltonian tour in which a set of supply points (pickup locations), demand points (delivery locations) are visited and, the total traveled distance is minimized. We propose a hybrid metaheuristic based on multi-start evolutionary local search and variable neighborhood descent to solve the 1-PDTSP. To test the performance of our algorithm, we solve instances with up to 500 nodes available in the literature and we demonstrate that our approach is able to provide competitive results when comparing to other existing strategies. Since a direct application of the 1-PDTSP arises as the bicycle repositioning problem, we also use our metaheuristic algorithm to solve a set of real-case instances based on EnCicla, the bicycle sharing system in the Aburrá Valley (Antioquia, Colombia). © 2020, Springer Science+Business Media, LLC, part of Springer Nature.
A multistart iterated local search for the multitrip cumulative capacitated vehicle routing problem
(Springer Netherlands, 2015-05-01) Rivera, Juan Carlos; Christian Prins; H. Murat Afsar; Universidad EAFIT. Departamento de Ciencias; Matemáticas y Aplicaciones
A q-exponential statistical Banach manifold
(ACADEMIC PRESS INC ELSEVIER SCIENCE, 2013-02-15) Loaiza, G.; Quiceno, H. R.; Universidad EAFIT. Departamento de Ciencias; Matemáticas y Aplicaciones
Let µ be a given probability measure and Mµ the set of µ-equivalent strictly positive probability densities. In this paper we construct a Banach manifold on Mµ, modeled on the space L 8(p{dot operator}µ) where p is a reference density, for the non-parametric q-exponential statistical models (Tsallis's deformed exponential), where 0<q<1 is any real number. This family is characterized by the fact that when q?1, then the non-parametric exponential models are obtained and the manifold constructed by Pistone and Sempi is recovered, up to continuous embeddings on the modeling space. The coordinate mappings of the manifold are given in terms of Csiszár's F-divergences; the tangent vectors are identified with the one-dimensional q-exponential models and q-deformations of the score function. © 2012 Elsevier Ltd.
A Remark on the Heat Equation and Minimal Morse Functions on Tori and Spheres
(Fondo Editorial Universidad EAFIT, 2013-04-01) Vélez, Juan Diego; Universidad EAFIT. Departamento de Ciencias; Matemáticas y Aplicaciones
A Riemannian geometry in the q-exponential banach manifold induced by q-divergences
(2013-01-01) Quiceno, Hector Román; Loaiza, G; Arango, Juan C; Universidad EAFIT. Departamento de Ciencias; Matemáticas y Aplicaciones
For the family of non-parametric q-exponential statistical models, in a former paper, written by the same authors, a differentiable Banach manifold modelled on Lebesgue spaces of real random variables has been built
A Riemannian geometry in the q-exponential Banach manifold induced by q-divergences
(SPRINGER, 2013-01-01) Loaiza, G.; Quiceno, H.R.; Universidad EAFIT. Departamento de Ciencias; Matemáticas y Aplicaciones
For the family of non-parametric q-exponential statistical models, in a former paper, written by the same authors, a differentiable Banach manifold modelled on Lebesgue spaces of real random variables has been built. In this paper, the geometry induced on this manifold is characterized by q-divergence functionals. This geometry turns out to be a generalization of the geometry given by Fisher information metric and Levi-Civita connections. Moreover, the classical Amari's a-connections appears as special case of the q-connections ?(q). The main result is the expected one, namely the zero curvature of the manifold. © 2013 Springer-Verlag.
A unified model framework for the multiattribute consistent periodic vehicle routing problem
(Public Library of Science, 2020-01-01) Baldoquin M.G.; Martine J.A.; Diaz-Ramirez J.; Universidad EAFIT. Departamento de Ciencias; Matemáticas y Aplicaciones
Modeling real-life transportation problems usually require the simultaneous incorporation of different variants of the classical vehicle routing problem (VRP). The periodic VRP (PVRP) is a classical extension in which routes are determined for a planning period of several days and each customer has an associated set of allowable visit schedules. This work proposes a unified model framework for PVRP that consists of multiple attributes or variants not previously addressed simultaneously, such as time-windows, time-dependence, and consistency-which guarantees the visits to customer by the same vehicle-, together with three objective functions that respond to the needs of practical problems. The numerical experimentation is focused on the effects of three factors: frequency, depot centrality, and the objective function on the performance of a general-purpose MILP solver, through the analysis of the achieved relative gaps. Results show higher sensitivity to the objective functions and to the problem sizes. © 2020 Baldoquin et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.
Accelerated Thermal Simulation for Three-Dimensional Interactive Optimization of Computer Numeric Control Sheet Metal Laser Cutting
(American Society of Mechanical Engineers (ASME), 2017-12-21) Mejía, D.; Moreno, Aitor; Arbelaiz, Ander; Posada, Jorge; Ruiz, O.; Chopitea, Raúl; Universidad EAFIT. Departamento de Ingeniería Mecánica; Laboratorio CAD/CAM/CAE
Accelerated Thermal Simulation for Three-Dimensional Interactive Optimization of Computer Numeric Control Sheet Metal Laser Cutting
(American Society of Mechanical Engineers (ASME), 2018-03-01) Mejia D.; Moreno A.; Arbelaiz A.; Posada J.; Ruiz-Salguero O.; Chopitea R.; Universidad EAFIT. Departamento de Ingeniería Mecánica; Laboratorio CAD/CAM/CAE
In the context of computer numeric control (CNC)-based sheet metal laser cutting, the problem of heat transfer simulation is relevant for the optimization of CNC programs. Current physically based simulation tools use numeric or analytic algorithms which provide accurate but slow solutions due to the underlying mathematical description of the model. This paper presents: (1) an analytic solution to the laser heating problem of rectangular sheet metal for curved laser trajectories and convective cooling, (2) a graphics processing unit (GPU) implementation of the analytic solution for fast simulation of the problem, and (3) an integration within an interactive environment for the simulation of sheet metal CNC laser cutting. This analytic approach sacrifices the material removal effect of the laser cut in the favor of an approximated real-time temperature map on the sheet metal. The articulation of thermal, geometric, and graphic feedback in virtual manufacturing environments enables interactive redefinition of the CNC programs for better product quality, lower safety risks, material waste, and energy usage among others. The error with respect to finite element analysis (FEA) in temperature prediction descends as low as 3.5%. Copyright © 2018 by ASME.
Adaptative cubical grid for isosurface extraction
(2009) Congote, John; Moreno, Aitor; Barandiaran, Iñigo; Barandiaran, Javier; Ruíz, Óscar E.; Universidad EAFIT. Departamento de Ingeniería Mecánica; Laboratorio CAD/CAM/CAE
This work proposes a variation on the Marching Cubes algorithm, where the goal is to represent implicit functions with higher resolution and better graphical quality using the same grid size -- The proposed algorithm displaces the vertices of the cubes iteratively until the stop condition is achieved -- After each iteration, the difference between the implicit and the explicit representations are reduced, and when the algorithm finishes, the implicit surface representation using the modified cubical grid is more detailed, as the results shall confirm -- The proposed algorithm corrects some topological problems that may appear in the discretisation process using the original grid
Adaptative cubical grid forisosurface extraction
(2009-01-01) Congote, J.; Moreno, A.; Barandiaran, I.; Barandiaran, J.; Ruiz, O.E.; Universidad EAFIT. Departamento de Ingeniería Mecánica; Laboratorio CAD/CAM/CAE
This work proposes a variation on the Marching Cubes algorithm, where the goal is to represent implicit functions with higher resolution and better graphical qualiry using the same grid size. The proposed algorithm displaces the vertices of the cubes iteratively until the stop condition is achieved. After each iteration, the difference betvveen the implicit and the explicit representations are reduced, and when the algorithm finishes, the implicit surface representation using the modified cubical grid is more detailed, as the results shall confirm. The proposed algorithm corrects some topological problems that may appear in the discretisation process using the original grid.
ADOMIAN DECOMPOSITION METHOD AND TAYLOR SERIES METHOD IN ORDINARY DIFFERENTIAL EQUATIONS
(2013-08-01) Sanchez, Jose Albeiro; Universidad EAFIT. Departamento de Ciencias; Matemáticas y Aplicaciones

Examinar

Examinando Aplicaciones Matemáticas en Ciencias e Ingeniería por Título

Resultados por página

Opciones de ordenación