Sciweavers

27 search results - page 1 / 6
» Spreadsheet modelling for solving combinatorial problems: Th...
Sort
View
CORR
2008
Springer
102views Education» more  CORR 2008»
13 years 4 months ago
Spreadsheet modelling for solving combinatorial problems: The vendor selection problem
Spreadsheets have grown up and became very powerful and easy to use tools in applying analytical techniques for solving business problems. Operations managers, production managers...
Pandelis G. Ipsilandis
GECCO
2005
Springer
139views Optimization» more  GECCO 2005»
13 years 10 months ago
Solving large scale combinatorial optimization using PMA-SLS
Memetic algorithms have become to gain increasingly important for solving large scale combinatorial optimization problems. Typically, the extent of the application of local search...
Jing Tang, Meng-Hiot Lim, Yew-Soon Ong, Meng Joo E...
CEC
2010
IEEE
13 years 2 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...
HEURISTICS
1998
252views more  HEURISTICS 1998»
13 years 4 months ago
Constraint Handling in Genetic Algorithms: The Set Partitioning Problem
In this paper we present a genetic algorithm-based heuristic for solving the set partitioning problem (SPP). The SPP is an important combinatorial optimisation problem used by man...
P. C. Chu, J. E. Beasley
CPAIOR
2008
Springer
13 years 6 months ago
The Accuracy of Search Heuristics: An Empirical Study on Knapsack Problems
Theoretical models for the evaluation of quickly improving search strategies, like limited discrepancy search, are based on specific assumptions regarding the probability that a va...
Daniel H. Leventhal, Meinolf Sellmann