| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Show document

Title:Assignment problems in logistics
Authors:ID Povh, Janez (Author)
Files:.pdf Logistics_&_Sustainable_Transport_2008_Povh_Assignment_problems_in_logistics.pdf (204,96 KB)
MD5: 7F99DE8AAEE25AF0C3709012502AAE4C
PID: 20.500.12556/dkum/56930406-f7e0-42aa-93e0-5e8768f67460
 
URL http://jlst.fl.uni-mb.si/index.php/journal/article/view/12/11
 
Language:English
Work type:Scientific work (r2)
Typology:1.01 - Original Scientific Article
Organization:FL - Faculty of Logistic
Abstract:We consider two classical problems from location theory which may serve as theoretical models for several logistic problems where one wants to assign elements of a set A to elements of a set B such that some linear or quadratic function attains its minimum. It turns out that linear objective function yields a linear assignment problem, which can be solved easily by several primal-dual methods like Hungarian method, Shortest augmenting path method etc. On the other hand, taking quadratic objective function into account makes the problem much harder. The resulting quadratic assignment problem is a very useful model but also very tough problem from theoretical and practical point of view. We list several well-known applications of these models and also the most effective methods to solve the problem. However, it is still a challenging task to solve this problem to optimality when the size of underlying sets A and B is greater than 25 and currently impossible task when the size is greater than 35.
Keywords:quadratic assignment problem, linear assignment problem, branch and bound algorithm, heuristics
Year of publishing:2008
Publication status in journal:Published
Article version:Publisher's version of article
Number of pages:10 str.
Numbering:Letn. 1, št. 3
PID:20.500.12556/DKUM-30962 New window
ISSN:1854-3332
UDC:519.863:656.072
ISSN on article:1854-3332
COBISS.SI-ID:512036925 New window
NUK URN:URN:SI:UM:DK:JFI9E9FA
Publication date in DKUM:05.06.2012
Views:1520
Downloads:111
Metadata:XML RDF-CHPDL DC-XML DC-RDF
Categories:Misc.
:
Kopiraj citat
  
Average score:(0 votes)
Your score:Voting is allowed only for logged in users.
Share:AddThis
AddThis uses cookies that require your consent. Edit consent...

Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Record is a part of a journal

Title:Logistics & Sustainable Transport
Publisher:Fakulteta za logistiko Univerze v Mariboru, De Gruyter Open
ISSN:1854-3332
COBISS.SI-ID:222476800 New window

Licences

License:CC BY-NC-ND 4.0, Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
Link:http://creativecommons.org/licenses/by-nc-nd/4.0/
Description:The most restrictive Creative Commons license. This only allows people to download and share the work for no commercial gain and for no other purposes.
Licensing start date:05.06.2012

Secondary language

Language:Slovenian
Keywords:problem kvadratičnega programiranja, problem linearnega programiranja, metoda razveji in omeji, hevristika


Collection

This document is a part of these collections:
  1. Logistics & sustainable transport

Comments

Leave comment

You must log in to leave a comment.

Comments (0)
0 - 0 / 0
 
There are no comments!

Back
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica