Sciweavers

920 search results - page 45 / 184
» Generating Satisfiable Problem Instances
Sort
View
IOR
2008
102views more  IOR 2008»
13 years 10 months ago
An Optimization Algorithm for the Ordered Open-End Bin-Packing Problem
The ordered open-end bin packing problem is a variant of the bin packing problem in which the items to be packed are sorted in a given order and the capacity of each bin can be ex...
Alberto Ceselli, Giovanni Righini
JAIR
2010
99views more  JAIR 2010»
13 years 8 months ago
Developing Approaches for Solving a Telecommunications Feature Subscription Problem
Call control features (e.g., call-divert, voice-mail) are primitive options to which users can subscribe off-line to personalise their service. The configuration of a feature su...
David Lesaint, Deepak Mehta, Barry O'Sullivan, Lui...
IJAIT
2010
167views more  IJAIT 2010»
13 years 9 months ago
Bee Colony Optimization with Local Search for Traveling Salesman Problem
Many real world industrial applications involve finding a Hamiltonian path with minimum cost. Some instances that belong to this category are transportation routing problem, scan c...
Li-Pei Wong, Malcolm Yoke-Hean Low, Chin Soon Chon...
CEC
2005
IEEE
14 years 4 months ago
Evolving dispatching rules for solving the flexible job-shop problem
We solve the Flexible Job-Shop Problem (FJSP) by using dispatching rules discovered through Genetic Programming (GP). While Simple Priority Rules (SPR) have been widely applied in ...
Nhu Binh Ho, Joc Cing Tay
GECCO
2007
Springer
196views Optimization» more  GECCO 2007»
14 years 4 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...