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

In 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 pr...

Descrición completa

Detalles Bibliográficos

Principais autores:	Fernando Ornelas, Alejandro Santiago, Salvador Ibarra Martínez, Mirna Patricia Ponce-Flores, Jesús David Terán-Villanueva, Fausto Balderas, José Antonio Castán Rocha, Alejandro H. García, Julio Laria-Menchaca, Mayra Guadalupe Treviño-Berrones
Formato:	Artigo
Idioma:	Inglês
Publicado:	MDPI AG 2022-07-01
Series:	Mathematics
Assuntos:	internet shopping optimization problem (ISHOP) internet shopping optimization problem with units (ISHOP-U) e-commerce evolutionary algorithms (EAs) NP-complete NP-hard
Acceso en liña:	https://www.mdpi.com/2227-7390/10/14/2513
Tags:	Engadir etiqueta Sen Etiquetas, Sexa o primeiro en etiquetar este rexistro!