Cellular Processing Algorithms

Terán-Villanueva, J. David; Huacuja, Héctor Joaquín Fraire; Carpío, Martín; Rangel, Rodolfo A. Pazos; Soberanes, Héctor José Puga; Flores, José Juan Alvarado

doi:10.1007/978-3-642-35323-9_3

Cited by 6 publications

(3 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Cellular Processing Alg processing based algorithm is tion approach [23]. It include explore different regions of th ing cell can be implemented u heuristics or an hybridization principle of the algorithm is to several pseudo-parallel proces each cell can explore different main feature of the new appr cation of the stagnation condi unnecessary tasks.…”

Section: Algorithm With Forecasting -Forecastingmentioning

confidence: 99%

“…The cellular processing based algorithm is a new pseudo-parallel optimization approach [23]. It includes multiple processing cells that explore different regions of the search space.…”

Section: Cellular Processing Algorithmmentioning

confidence: 99%

“…We design an new algorithm based on a pseudo-parallel optimization approach introduced by [23]. The new algorithm we design is a cellular processing approach, which includes multiple processing cells that helps to explore different regions of the search optimization space.…”

Section: Cellular Processing Algorithmmentioning

confidence: 99%

See 2 more Smart Citations

Algorithms solving the Internet shopping optimization problem with price discounts

Musiał¹,

Pecero²,

López-Locés³

et al. 2016

Bulletin of the Polish Academy of Sciences Technical Sciences

View full text Add to dashboard Cite

Abstract. The Internet shopping optimization problem arises when a customer aims to purchase a list of goods from a set of web-stores with a minimum total cost. This problem is NP-hard in the strong sense. We are interested in solving the Internet shopping optimization problem with additional delivery costs associated to the web-stores where the goods are bought. It is of interest to extend the model including price discounts of goods. The aim of this paper is to present a set of optimization algorithms to solve the problem. Our purpose is to find a compromise solution between computational time and results close to the optimum value. The performance of the set of algorithms is evaluated through simulations using real world data collected from 32 web-stores. The quality of the results provided by the set of algorithms is compared to the optimal solutions for small-size instances of the problem. The optimization algorithms are also evaluated regarding scalability when the size of the instances increases. The set of results revealed that the algorithms are able to compute good quality solutions close to the optimum in a reasonable time with very good scalability demonstrating their practicability.

show abstract

Section: Algorithm With Forecasting -Forecastingmentioning

confidence: 99%

“…The cellular processing based algorithm is a new pseudo-parallel optimization approach [23]. It includes multiple processing cells that explore different regions of the search space.…”

Section: Cellular Processing Algorithmmentioning

confidence: 99%