Search Results - subject:"Algorithms"

Addressing the advantages of using ensemble probabilistic models in Estimation of Distribution Algorithms for scheduling problems

Chen, Shih-Hsin; Chen, Min-Chih - In: International Journal of Production Economics 141 (2013) 1, pp. 24-33

Estimation of Distribution Algorithms (EDAs) have recently been recognized as a prominent alternative to traditional … evolutionary algorithms due to their increasing popularity. The core of EDAs is a probabilistic model which directly impacts …

Persistent link: https://www.econbiz.de/10010869087

A Comparative Study of the Lasso-type and Heuristic Model Selection Methods

Savin, Ivan - In: Journal of Economics and Statistics (Jahrbuecher fuer … 233 (2013) 4, pp. 526-549

This study presents a first comparative analysis of Lasso-type (Lasso, adaptive Lasso, elastic net) and heuristic subset selection methods. Although the Lasso has shown success in many situations, it has some limitations. In particular, inconsistent results are obtained for pairwise highly...

Persistent link: https://www.econbiz.de/10010907957

Multi-item Vickrey–English–Dutch auctions

Andersson, Tommy; Erlanson, Albin - In: Games and Economic Behavior 81 (2013) C, pp. 116-129

Assuming that bidders wish to acquire at most one item, this paper defines a polynomial time multi-item auction that locates the VCG prices in a finite number of iterations for any given starting prices. This auction is called the Vickrey–English–Dutch auction and it contains the...

Persistent link: https://www.econbiz.de/10011049710

Efficient comparison of constrained systems using dormancy

Healey, Christopher M.; Andradóttir, Sigrún; Kim, … - In: European Journal of Operational Research 224 (2013) 2, pp. 340-352

We consider the problem of finding the best simulated system under a primary performance measure, while also satisfying stochastic constraints on secondary performance measures. We improve upon existing constrained selection procedures by allowing certain systems to become dormant, halting...

Persistent link: https://www.econbiz.de/10011052495

A Tabu Search heuristic procedure in Markov chain bootstrapping

Cerqueti, Roy; Falbo, Paolo; Guastaroba, Gianfranco; … - In: European Journal of Operational Research 227 (2013) 2, pp. 367-384

Markov chain theory is proving to be a powerful approach to bootstrap finite states processes, especially where time dependence is non linear. In this work we extend such approach to bootstrap discrete time continuous-valued processes. To this purpose we solve a minimization problem to partition...

Persistent link: https://www.econbiz.de/10011052614

A memetic approach to construct transductive discrete support vector machines

Brandner, Hubertus; Lessmann, Stefan; Voß, Stefan - In: European Journal of Operational Research 230 (2013) 3, pp. 581-595

Transductive learning involves the construction and application of prediction models to classify a fixed set of decision objects into discrete groups. It is a special case of classification analysis with important applications in web-mining, corporate planning and other areas. This paper...

Persistent link: https://www.econbiz.de/10011052640

Constraints in container loading – A state-of-the-art review

Bortfeldt, Andreas; Wäscher, Gerhard - In: European Journal of Operational Research 229 (2013) 1, pp. 1-20

Container loading is a pivotal function for operating supply chains efficiently. Underperformance results in unnecessary costs (e.g. cost of additional containers to be shipped) and in an unsatisfactory customer service (e.g. violation of deadlines agreed to or set by clients). Thus, it is not...

Persistent link: https://www.econbiz.de/10011052729

The generalized assignment problem with minimum quantities

Krumke, Sven O.; Thielen, Clemens - In: European Journal of Operational Research 228 (2013) 1, pp. 46-55

complexity results for different versions of the problem and give polynomial time exact algorithms and approximation algorithms … approximation algorithm (unless P=NP), even for the case of a single bin. This motivates to study dual approximation algorithms that …

Persistent link: https://www.econbiz.de/10011052812

Optimization of blade pitch angle of an axial turbine used for wave energy conversion

Mohamed, M.H.; Shaaban, S. - In: Energy 56 (2013) C, pp. 229-239

Wells turbine is a part of OWC (Oscillating Water Column) which is one of the most practical wave energy converters. However, they suffer low aerodynamic efficiency and consequently low power produced. It is proposed to improve the aerodynamic efficiency of Wells turbines by optimizing the blade...

Persistent link: https://www.econbiz.de/10011054547

Comparison among run order algorithms for sequential factorial experiments

Hilow, Hisham - In: Computational Statistics & Data Analysis 58 (2013) C, pp. 397-406

Four algorithms for sequencing runs of the 2n factorial experiment are compared according to the two criteria: the … number of factor level changes (i.e. cost) and the time trend resistance. These algorithms are: Correa et al. (2009), Cui and … John (1998), Cheng and Jacroux (1988) and Coster and Cheng (1988), referred to here as Algorithms I, II, III (a and b) and …

Persistent link: https://www.econbiz.de/10011056549