In a Hierarchical Model Predictive Control (H-MPC) framework, this paper explores suitable time-variant structures for the hierarchies of different local MPC controllers. The idea is to adapt to different operational conditions by changing the importance of the local controllers. This is done by defining the level of the hierarchy they belong to, and solving within each level the local MPC prob...

This paper investigates and bounds the expected solution quality of combinatorial optimization problems when feasible solutions are chosen at random. Loose general bounds are discovered, as well as families of combinatorial optimization problems for which random feasible solutions are expected to be a constant factor of optimal. One implication of this result is that, for graphical problems, if...

This paper presents and compares three heuristics for the combinatorial auction problem. Besides a simple greedy (SG) mechanism, two metaheuristics, a simulated annealing (SA), and a genetic algorithm (GA) approach are developed which use the combinatorial auction process to find an allocation with maximal revenue for the auctioneer. The performance of these three heuristics is evaluated in the...

The banking industry has initiated an assortment of new customer services and products using Information Technology (IT) systems. The banking industry has gone through many modifications as a consequence of the introduction of IT. In fact, the configuration of the industry is incessantly altering because of speedy expansion of IT. The sustained accomplishment of IT applications means that the b...

Iterated Local Search (ILS) is a popular metaheuristic search technique for use on combinatorial optimisation problems. As with most such techniques, there are many ways in which ILS can be implemented. The aim of this paper is to shed light on the best variants and choice of parameters when using ILS on a complex combinatorial problem with many objectives, by reporting on the results of an exh...

location-allocation is a combinatorial optimization problem, and is defined as non deterministic polynomial hard (np) hard optimization. therefore, solution of such a problem should be shifted from exact to heuristic or meta heuristic due to the complexity of the problem. locating medical centers and allocating injuries of an earthquake to them has high importance in earthquake disaster managem...