A metaheuristic for a numerical approximation to the mass transfer problem

1Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

This work presents an improvement of the approximation scheme for the Monge-Kantorovich (MK) mass transfer problem on compact spaces, which is studied by Gabriel et al. (2010), whose scheme discretizes the MK problem, reduced to solve a sequence of finite transport problems. The improvement presented in this work uses a metaheuristic algorithm inspired by scatter search in order to reduce the dimensionality of each transport problem. The new scheme solves a sequence of linear programming problems similar to the transport ones but with a lower dimension. The proposed metaheuristic is supported by a convergence theorem. Finally, examples with an exact solution are used to illustrate the performance of our proposal.

Cite

CITATION STYLE

APA

Avendaño-Garrido, M. L., Gabriel-Argüelles, J. R., Quintana-Torres, L., & Mezura-Montes, E. (2016). A metaheuristic for a numerical approximation to the mass transfer problem. International Journal of Applied Mathematics and Computer Science, 26(4), 757–766. https://doi.org/10.1515/amcs-2016-0053

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free