Sciweavers

447 search results - page 2 / 90
» Internet shopping optimization problem
Sort
View
GECCO
2000
Springer
170views Optimization» more  GECCO 2000»
13 years 9 months ago
A Comparison of Genetic Algorithms for the Dynamic Job Shop Scheduling Problem
The majority of the research using evolutionary algorithms for the Job Shop Scheduling Problem (JSSP) has studied only the static JSSP. Few evolutionary algorithms have been appli...
Manuel Vázquez, L. Darrell Whitley
GECCO
2007
Springer
196views Optimization» more  GECCO 2007»
13 years 12 months ago
An estimation of distribution algorithm with guided mutation for a complex flow shop scheduling problem
An Estimation of Distribution Algorithm (EDA) is proposed to approach the Hybrid Flow Shop with Sequence Dependent Setup Times and Uniform Machines in parallel (HFSSDST-UM) proble...
Abdellah Salhi, José Antonio Vázquez...
ICAT
2003
IEEE
13 years 11 months ago
Agent-based Model for Intelligent Shopping Assistant and its Application
With the rapid expansion of the Internet, the implementation of agent technology in electronic commerce (e-commerce) becomes very popular, which provides a promising field for the...
Xu-Bing Pan, Zhi Geng, Yang-Hong Wei
COR
2011
13 years 23 days ago
A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem
: In this paper, we study the job shop scheduling problem with the objective of minimizing the total weighted tardiness. We propose a hybrid shifting bottleneck - tabu search (SB-T...
Kerem Bülbül
ICDM
2005
IEEE
185views Data Mining» more  ICDM 2005»
13 years 11 months ago
Adaptive Product Normalization: Using Online Learning for Record Linkage in Comparison Shopping
The problem of record linkage focuses on determining whether two object descriptions refer to the same underlying entity. Addressing this problem effectively has many practical ap...
Mikhail Bilenko, Sugato Basu, Mehran Sahami