DISCLAIMER This document describes work undertaken as part of a programme of study at the Faculty of Geo-Information Science and Earth Observation of the University of Twente. All views and opinions expressed therein remain the sole responsibility of the author, and do not necessarily represent those of the Faculty. i ABSTRACT Location allocation is a combinatorial optimization problem. Traditi...

We consider the problem of allocating a set I of m indivisible resources (items) to a set P of n customers (players) competing for the resources. Each resource j ∈ I has a same value vj > 0 for a subset of customers interested in j, and zero value for the remaining customers. The utility received by each customer is the sum of the values of the resources allocated to her. The goal is to find a ...

in this paper, a location allocation (la) problem in construction and demolition (c&d;) waste management (wm) is studied. a bi-level model for this problem under a fuzzy random environment is presented where the upper level is the governments who sets up the processing centers, and the lower level are the administrators of different construction projects who control c&d; waste and the after tre...

in this paper, simultaneous placement of distributed generation, capacitor bank and protective devices are utilized to improve the efficiency of the distribution network. the objectives of the problem are reduction of active and reactive power losses, improvement of voltage profile and reliability indices and increasing distribution companies’ profit. the combination of firefly algorithm, parti...

ion ............................................................................................................. 3 Determination of Number of New Aircraft Needed ................................................. 4 Aircraft Sizing ......................................................................................................... 5 Monolithic Problem Formulation ..............................

we consider the queueing maximal covering location-allocation problem (qm-clap) with an m/m/1 queueing system. we propose a new solution procedure based on decomposition of the problem into smaller sub-problems. we solve the resulting sub-problems both with a branch and bound algorithm and with the meta-heuristic grasp. we also solve the entire model with grasp. computational results for these ...

The multicast address allocation problem requires Internet domains to allocate unique addresses to multicast applications from a globallyshared space. We develop a theoretical framework for multicast allocation algorithms that is influenced by subcube allocation in hypercube computer systems. Based on this framework we derive complexity results for the address allocation problem and describe se...

In this paper1, we present a constraint programmingbased approach to solve a hard real-time allocation problem. This problem consists in assigning periodic tasks to processors in the context of fixed priority preemptive scheduling. Our approach builds on dynamic constraint programming together with a learning method to find a feasible processor allocation under constraints. This problem is deco...

Task allocation is one of the core steps to effectively exploit the capabilities of cooperative control of multiple Uninhabited Aerospace Vehicle (UAV) teams. Task allocation is an NP-complete problem. In this paper, we present a new task allocation algorithm that is based on the principles of genetic algorithm (GA). GA is a class of adaptive search algorithms derived from biological population...