The Internet Shopping Optimization Problem with Multiple Item Units (ISHOP-U): Formulation, Instances, NP-Completeness, and Evolutionary Optimization

Simple item page
AudienciaPúblico en generales_ES
CoberturaMéxicoes_ES
Fecha de ingreso2026-09-15T00:29:57Z
Fecha de publicación2022-01-01
ResumenIn this work, we investigate the variant of the Internet Shopping Optimization Problem (ISHOP) that considers different item units. This variant is more challenging than the original problem. The original ISHOP is already known as a combinatorial NP-hard problem. In this work, we present a formal proof that the ISHOP variant considering different item units belongs to the NP-Hard complexity class. The abovementioned variant is familiar to companies and consumers who need to purchase more than one unit of a specific product to satisfy their requirements. For example, companies buy different quantities of construction materials, medical equipment, office supplies, or chemical components. We propose two new evolutionary operators (crossover and mutation) and an unfeasible solution repair method for the studied ISHOP variant. Furthermore, we produce a new benchmark of 15 synthetic instances where item prices follow a random uniform distribution. Finally, to assess our evolutionary operators, we implemented two Evolutionary Algorithms, a Genetic Algorithm (GA) and a Cellular Genetic Algorithm (CGA), and an experimental evaluation against a Water Cycle Algorithm (WCA) from the state-of-the-art. Experimental results show that our proposed GA performs well with statistical significance.es_ES
Doihttps://doi.org/10.3390/math10142513es_ES
URIhttps://riuat.uat.edu.mx/handle/123456789/1903
Idiomaeses_ES
EditorialMDPI AGes_ES
RelaciónMathematicses_ES
URL relacionadohttps://doi.org/10.3390/math10142513es_ES
DerechosAcceso abierto (Metadatos de producción científica)es_ES
Licenciahttp://purl.org/coar/access_right/c_abf2es_ES
FuenteMathematics
TítuloThe Internet Shopping Optimization Problem with Multiple Item Units (ISHOP-U): Formulation, Instances, NP-Completeness, and Evolutionary Optimizationes_ES
TipoArtículoes_ES
ArbitradoHa sido Arbitradoes_ES
AutorOrnelas, Fernando
AutorSantiago, Alejandro
AutorMartínez, Salvador Ibarra
AutorPonce-Flores, Mirna Patricia
AutorTerán-Villanueva, Jesús David
AutorBalderas, Fausto
AutorRocha, José Antonio Castán
AutorGarcía, Alejandro H.
AutorLaria-Menchaca, Julio
AutorTreviño-Berrones, Mayra Guadalupe
AutorOrnelas, Fernandoes_ES
AutorSantiago, Alejandroes_ES
AutorMartínez, Salvador Ibarraes_ES
AutorPonce-Flores, Mirna Patriciaes_ES
AutorTerán-Villanueva, Jesús Davides_ES
AutorBalderas, Faustoes_ES
AutorRocha, José Antonio Castánes_ES
AutorGarcía, Alejandro H.es_ES
AutorLaria-Menchaca, Julioes_ES
AutorTreviño-Berrones, Mayra Guadalupees_ES
InstituciónUniversidad Autónoma de Tamaulipas
InstituciónUniversidad Autónoma de Tamaulipases_ES
Número14es_ES
Rango de páginas2513es_ES
URL relacionadahttps://doi.org/10.3390/math10142513
Tipo de artículoIndexado
Tipo de artículoIndexadoes_ES
Volumen10es_ES

Files

Collections

Documentación Cientifica