Sciweavers

273 search results - page 3 / 55
» Genetic local search for multi-objective combinatorial optim...
Sort
View
101
Voted
TSMC
2011
324views more  TSMC 2011»
14 years 5 months ago
Genetic Algorithms With Guided and Local Search Strategies for University Course Timetabling
—The university course timetabling problem (UCTP) is a combinatorial optimization problem, in which a set of events has to be scheduled into time slots and located into suitable ...
Shengxiang Yang, Sadaf Naseem Jat
CEC
2008
IEEE
15 years 4 months ago
Differential evolution for discrete optimization: An experimental study on Combinatorial Auction problems
: Differential evolutionary (DE) mutates solution vectors by the weighted difference of other vectors using arithmetic operations. As these operations cannot be directly extended t...
Jingqiao Zhang, Viswanath Avasarala, Arthur C. San...
86
Voted
VLSID
2006
IEEE
112views VLSI» more  VLSID 2006»
15 years 4 months ago
Handling Constraints in Multi-Objective GA for Embedded System Design
Design space exploration is central to embedded system design. Typically this is a multi-objective search problem, where performance, power, area etc. are the different optimizati...
Biman Chakraborty, Ting Chen, Tulika Mitra, Abhik ...
64
Voted
CORR
2008
Springer
91views Education» more  CORR 2008»
14 years 10 months ago
Randomised Variable Neighbourhood Search for Multi Objective Optimisation
Various local search approaches have recently been applied to machine scheduling problems under multiple objectives. Their foremost consideration is the identification of the set ...
Martin Josef Geiger
71
Voted
EMO
2009
Springer
155views Optimization» more  EMO 2009»
15 years 4 months ago
A Hybrid Integrated Multi-Objective Optimization Procedure for Estimating Nadir Point
A nadir point is constructed by the worst objective values of the solutions of the entire Pareto-optimal set. Along with the ideal point, the nadir point provides the range of obje...
Kalyanmoy Deb, Kaisa Miettinen, Deepak Sharma