SOLUTION METHODS FOR THREE-DIMENSIONAL ASSIGNMENT PROBLEMS
Abstract
SOLUTION METHODS FOR THE PROBLEMS OF AXIAL AND PLANAR ASSIGNMENT ARE DESCRIBED.THE TWO PROBLEMS REFER TO ASSIGNMENT AMONG THE ELEMENTS OF THREE SETS WITH THEOBJECTIVE OF MINIMIZING THE TOTAL COST. FOR EACH PROBLEM AN OVERVIEW OF THE LITERATURE IS MADE, SEVERAL APPLICATIONS ARE DESCRIBED AND NEW SOLUTION METHODS ARE PROPOSED. WITH RESPECT TO THE AXIAL ASSIGNMENT PROBLEM AN EXACT ALGORITHM ISDESCRIBED. IT CAN BE EASILY IMPLEMENTED AS A PARALLEL SCHEME. A BRANCH AND BOUND ALGORITHM IS DESCRIBED FOR THE PLANAR PROBLEM. IT EMBEDS A VARIETY OF ADVANCED OPTIMIZATION TECHNIQUES. ADDITIONALLY A SIMULATED ANNEALING ALGORITHM FOR THE PLANAR PROBLEM IS IMPLEMENTED. COMPUTATIONAL EXPERIENCE FOR EVERY ALGORITHM IS INCLUDED.
Download full text in PDF format (5.31 MB)
(Available only to registered users)
|
All items in National Archive of Phd theses are protected by copyright.
|
Usage statistics
VIEWS
Concern the unique Ph.D. Thesis' views for the period 07/2018 - 07/2023.
Source: Google Analytics.
Source: Google Analytics.
ONLINE READER
Concern the online reader's opening for the period 07/2018 - 07/2023.
Source: Google Analytics.
Source: Google Analytics.
DOWNLOADS
Concern all downloads of this Ph.D. Thesis' digital file.
Source: National Archive of Ph.D. Theses.
Source: National Archive of Ph.D. Theses.
USERS
Concern all registered users of National Archive of Ph.D. Theses who have interacted with this Ph.D. Thesis. Mostly, it concerns downloads.
Source: National Archive of Ph.D. Theses.
Source: National Archive of Ph.D. Theses.