This paper presents and compares three heuristics for the combinatorial auctionproblem. Besides a simple greedy (SG) mechanism, two metaheuristics, a simulatedannealing (SA), and a genetic algorithm (GA) approach are developedwhich use the combinatorial auction process to an allocation with...

Der Beitrag stellt ein Simulated Annealing-Verfahren zur Lösung des um Zeitfensterrestriktionen erweiterten Standardproblems vor. Die Zielfunktion berücksichtigt zwei Zielkriterien, die Minimierung der Fahrzeuganzahl als primäres und die Minimierung der Gesamtentfernung als sekundäres...

We develop a hybrid algorithm using Genetic Algorithms (GA) and Simulated Annealing (SA) to solve multi-objective step function maximization problems. We then apply the algorithm to a specific economic problem which is taken out of the corporate governance literature.

In simulation studies Latent Factor Prediction Pursuit outperformed classical reduced rank regression methods. The algorithm described so far for Latent Factor Prediction Pursuit had two shortcomings: It was only implemented for situations where the explanatory variables were of full colum rank....

The purpose of this research was to investigate the relationships with storage location assignment and location of I/O points in details in the warehouse operation planning. Dedicated storage warehouse design and three different allocation methods (throughput-to-storage ratios, space-filling...

The QWERTY keyboard layout can be very inefficient for one-finger typing on virtual keyboards since the letters in many common digrams are placed on opposite sides of the keyboard, resulting in a long finger travel. This paper reports on use of simulated annealing for finding alternate...

One of the main problems attracted researchers' attentions in recent years is Vehicle Routing Problem (VRP). This paper tends to minimize the covered distance, total travelling time, number of vehicles, delay and transportation costs, and to maximize consumers' satisfaction by utilizing...