References$(function(){PrimeFaces.cw("TieredMenu","widget_formSmash_upper_j_idt147",{id:"formSmash:upper:j_idt147",widgetVar:"widget_formSmash_upper_j_idt147",autoDisplay:true,overlay:true,my:"left top",at:"left bottom",trigger:"formSmash:upper:referencesLink",triggerEvent:"click"});}); $(function(){PrimeFaces.cw("OverlayPanel","widget_formSmash_upper_j_idt148_j_idt150",{id:"formSmash:upper:j_idt148:j_idt150",widgetVar:"widget_formSmash_upper_j_idt148_j_idt150",target:"formSmash:upper:j_idt148:permLink",showEffect:"blind",hideEffect:"fade",my:"right top",at:"right bottom",showCloseIcon:true});});

Using Genetic Algorithms for Large Scale Optimizationof Assignment, Planning and Rescheduling ProblemsPrimeFaces.cw("AccordionPanel","widget_formSmash_some",{id:"formSmash:some",widgetVar:"widget_formSmash_some",multiple:true}); PrimeFaces.cw("AccordionPanel","widget_formSmash_all",{id:"formSmash:all",widgetVar:"widget_formSmash_all",multiple:true});
function selectAll()
{
var panelSome = $(PrimeFaces.escapeClientId("formSmash:some"));
var panelAll = $(PrimeFaces.escapeClientId("formSmash:all"));
panelAll.toggle();
toggleList(panelSome.get(0).childNodes, panelAll);
toggleList(panelAll.get(0).childNodes, panelAll);
}
/*Toggling the list of authorPanel nodes according to the toggling of the closeable second panel */
function toggleList(childList, panel)
{
var panelWasOpen = (panel.get(0).style.display == 'none');
// console.log('panel was open ' + panelWasOpen);
for (var c = 0; c < childList.length; c++) {
if (childList[c].classList.contains('authorPanel')) {
clickNode(panelWasOpen, childList[c]);
}
}
}
/*nodes have styleClass ui-corner-top if they are expanded and ui-corner-all if they are collapsed */
function clickNode(collapse, child)
{
if (collapse && child.classList.contains('ui-corner-top')) {
// console.log('collapse');
child.click();
}
if (!collapse && child.classList.contains('ui-corner-all')) {
// console.log('expand');
child.click();
}
}
PrimeFaces.cw("AccordionPanel","widget_formSmash_responsibleOrgs",{id:"formSmash:responsibleOrgs",widgetVar:"widget_formSmash_responsibleOrgs",multiple:true}); 2014 (English)Doctoral thesis, comprehensive summary (Other academic)
##### Abstract [en]

##### Place, publisher, year, edition, pages

KTH Royal Institute of Technology , 2014. , 202 p.
##### Series

TRITA-ICT-ECS AVH, ISSN 1653-6363 ; 14:06
##### National Category

Computer Systems
##### Research subject

SRA - ICT
##### Identifiers

URN: urn:nbn:se:kth:diva-143671ISBN: 978-91-7595-047-1OAI: oai:DiVA.org:kth-143671DiVA: diva2:708381
##### Public defence

2014-04-25, Sal D, Forum, Isafjordsgatan 39, Kista, Stockholm, 13:00 (English)
##### Opponent

PrimeFaces.cw("AccordionPanel","widget_formSmash_j_idt382",{id:"formSmash:j_idt382",widgetVar:"widget_formSmash_j_idt382",multiple:true});
##### Supervisors

PrimeFaces.cw("AccordionPanel","widget_formSmash_j_idt389",{id:"formSmash:j_idt389",widgetVar:"widget_formSmash_j_idt389",multiple:true});
#####

PrimeFaces.cw("AccordionPanel","widget_formSmash_j_idt396",{id:"formSmash:j_idt396",widgetVar:"widget_formSmash_j_idt396",multiple:true});
##### Note

##### List of papers

There has always been a need to solve real-life large-scale problems, suchas efficiently allocating limited resources, and other complex and conflicting situations related to combinatorial optimization genre. A class of combinato- rial optimization problems is NP-hard and, among many well-known, several of them are assignment, planning and rescheduling problems. Assignment problems can deal with optimal assignment of teams of collaborating agents; planning problems can be effects-based planning that search for promising plans to get desired end states with minimal cost; rescheduling problems can be multi-criteria optimization of rescheduling resources that modify existing original schedule. These large scale optimization problems are complex with intractable and highly complex search spaces. Currently, there are no known algorithms with polynomial time complexity, which can solve these problems. Genetic Algorithms have been successfully applied to solve many complex optimization problems but not to the specific problems mentioned above.

The aim of the research, presented in this thesis, is to use Genetic Algo- rithms for large scale optimization of assignment, planning and rescheduling problems. More specifically, the contributions of the thesis are to: (i) adapt existing and develop new efficient Genetic Algorithms to solve large scale as- signment problems, and (ii) adapt existing Genetic Algorithms to solve large scale effects-based planning, and multi-objective rescheduling optimization problems.In case of assignment, we solve a team assignment problem and investigate specific regions in a solution space for assignment problems with huge search spaces.

For the team assignment, an existing Genetic Algorithm is adapted and applied for optimal assignment of tasks to teams of collaborating agents. The algorithm is scalable, stable, robust and produces a near optimal solution. The results of the team assignment problem show that the existing Genetic Algorithms are not efficient for optimal assignment of tasks to teams of agents. Hence, to solve larger instances of the problem efficiently, new Genetic Algo- rithms are developed with emphasis on the construction of crossover opera- tors. Since teams assignment can be multi-criteria, a multi-objective model is constructed and two widely used multi-objective evolutionary algorithms are applied. Further, for the assignment problems with huge search spaces, an existing Genetic Algorithm is adapted to extract possible combinations of input parameters from a specified solution space region. To solve the large scale effects-based planning, a multi-objective optimization problem is formu- lated for the evaluation of operational plans and a multi-objective Genetic Algorithm is adapted and applied to the problem. The results show that the suggested algorithm is much more efficient than A*. For the rescheduling problem, a multi-objective optimization model for rescheduling of resources is proposed and a multi-objective Genetic Algorithm is adapted and applied to obtain the Pareto-optimal solutions.

The research presented in this thesis confirms that Genetic Algorithms can be used for large scale assignment, planning and rescheduling problems since they have shown to be suitable in solving these problems efficiently.

QC 20140328

Available from: 2014-03-28 Created: 2014-03-27 Last updated: 2014-03-28Bibliographically approved1. Optimization of Task Assignment to Collaborating Agents$(function(){PrimeFaces.cw("OverlayPanel","overlay453151",{id:"formSmash:j_idt432:0:j_idt436",widgetVar:"overlay453151",target:"formSmash:j_idt432:0:partsLink",showEvent:"mousedown",hideEvent:"mousedown",showEffect:"blind",hideEffect:"fade",appendToBody:true});});

2. Efficient Genetic Algorithms for Optimal Assignment of Tasks to Teamsof Agents$(function(){PrimeFaces.cw("OverlayPanel","overlay708375",{id:"formSmash:j_idt432:1:j_idt436",widgetVar:"overlay708375",target:"formSmash:j_idt432:1:partsLink",showEvent:"mousedown",hideEvent:"mousedown",showEffect:"blind",hideEffect:"fade",appendToBody:true});});

3. Optimization of assignment of tasks to teams using multi-objective metaheuristics$(function(){PrimeFaces.cw("OverlayPanel","overlay641395",{id:"formSmash:j_idt432:2:j_idt436",widgetVar:"overlay641395",target:"formSmash:j_idt432:2:partsLink",showEvent:"mousedown",hideEvent:"mousedown",showEffect:"blind",hideEffect:"fade",appendToBody:true});});

4. Using Genetic Algorithms for investigating specific regions of the solution space$(function(){PrimeFaces.cw("OverlayPanel","overlay468646",{id:"formSmash:j_idt432:3:j_idt436",widgetVar:"overlay468646",target:"formSmash:j_idt432:3:partsLink",showEvent:"mousedown",hideEvent:"mousedown",showEffect:"blind",hideEffect:"fade",appendToBody:true});});

5. Using genetic algorithms in effects-based planning$(function(){PrimeFaces.cw("OverlayPanel","overlay685992",{id:"formSmash:j_idt432:4:j_idt436",widgetVar:"overlay685992",target:"formSmash:j_idt432:4:partsLink",showEvent:"mousedown",hideEvent:"mousedown",showEffect:"blind",hideEffect:"fade",appendToBody:true});});

6. Solving Battalion Rescheduling Problem Using Multi-objective Genetic Algorithms$(function(){PrimeFaces.cw("OverlayPanel","overlay685981",{id:"formSmash:j_idt432:5:j_idt436",widgetVar:"overlay685981",target:"formSmash:j_idt432:5:partsLink",showEvent:"mousedown",hideEvent:"mousedown",showEffect:"blind",hideEffect:"fade",appendToBody:true});});

References$(function(){PrimeFaces.cw("TieredMenu","widget_formSmash_lower_j_idt1090",{id:"formSmash:lower:j_idt1090",widgetVar:"widget_formSmash_lower_j_idt1090",autoDisplay:true,overlay:true,my:"left top",at:"left bottom",trigger:"formSmash:lower:referencesLink",triggerEvent:"click"});}); $(function(){PrimeFaces.cw("OverlayPanel","widget_formSmash_lower_j_idt1091_j_idt1093",{id:"formSmash:lower:j_idt1091:j_idt1093",widgetVar:"widget_formSmash_lower_j_idt1091_j_idt1093",target:"formSmash:lower:j_idt1091:permLink",showEffect:"blind",hideEffect:"fade",my:"right top",at:"right bottom",showCloseIcon:true});});