Sciweavers

4430 search results - page 131 / 886
» Solving Optimization Problems with DLL
Sort
View
CEC
2010
IEEE
15 years 1 months ago
The one-commodity traveling salesman problem with selective pickup and delivery: An ant colony approach
We introduce a novel combinatorial optimization problem: the one-commodity traveling salesman problem with selective pickup and delivery (1-TSP-SELPD), characterized by the fact th...
Rafael Falcón, Xu Li, Amiya Nayak, Ivan Sto...
GECCO
2000
Springer
138views Optimization» more  GECCO 2000»
15 years 6 months ago
Domain Knowledge and Representation in Genetic Algorithms for Real World Scheduling Problems
This paper discusses the issues that arise in the design and implementation of an industrialstrength evolutionary-based system for the optimization of the monthly work schedules f...
Ioannis T. Christou, Armand Zakarian
CORR
2004
Springer
113views Education» more  CORR 2004»
15 years 3 months ago
A General Framework for Bounds for Higher-Dimensional Orthogonal Packing Problems
Higher-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. In the context of a branch-and-bound framewo...
Sándor P. Fekete, Jörg Schepers
COLOGNETWENTE
2010
14 years 12 months ago
A Branch-and-price Approach to the k-Clustering Minimum Biclique Completion Problem
Given a bipartite graph G = (S, T, E), we consider the problem of finding k bipartite subgraphs, called "clusters", such that each vertex i of S appears in exactly one o...
Stefano Gualandi, Francesco Maffioli, Claudio Magn...
KES
2008
Springer
15 years 3 months ago
Knowledge-based genetic algorithm for university course timetabling problems
This paper discusses a new solution to university course timetabling problems. The problems that belong to the NP-hard class are very difficult to solve using conventional optimiza...
Hitoshi Kanoh, Yuusuke Sakamoto