k-Interchange heuristic as an optimization procedure for material handling applications

DSpace/Manakin Repository

Show simple item record

dc.contributor.author Makris, PA en
dc.contributor.author Giakoumakis, IG en
dc.date.accessioned 2014-03-01T01:19:05Z
dc.date.available 2014-03-01T01:19:05Z
dc.date.issued 2003 en
dc.identifier.issn 0307-904X en
dc.identifier.uri http://hdl.handle.net/123456789/15374
dc.subject Heuristic en
dc.subject k-Interchange en
dc.subject Material handling en
dc.subject Optimization en
dc.subject Order-picking en
dc.subject Warehouse en
dc.subject.classification Engineering, Multidisciplinary en
dc.subject.classification Mathematics, Interdisciplinary Applications en
dc.subject.classification Mechanics en
dc.subject.other Heuristic methods en
dc.subject.other Optimization en
dc.subject.other Warehouses en
dc.subject.other Parallel aisles en
dc.subject.other Materials handling en
dc.subject.other materials handling en
dc.subject.other mathematical analysis en
dc.subject.other optimization en
dc.title k-Interchange heuristic as an optimization procedure for material handling applications en
heal.type journalArticle en
heal.identifier.primary 10.1016/S0307-904X(02)00137-3 en
heal.identifier.secondary http://dx.doi.org/10.1016/S0307-904X(02)00137-3 en
heal.language English en
heal.publicationDate 2003 en
heal.abstract A modification of the k-interchange heuristic used in combinatorial optimization, can be applied either as a tour construction heuristic, or as an improvement for order-picking procedures for warehouse environment with parallel aisles of equal length or with rectangular racks. A repetitive application of a mutual interchange of two randomly chosen ""items"" in a given route, produces every time four new partial motions, while at the same time abolishes four others, in order to minimize the travel route. Moreover it was attempted to estimate the minimal sufficient total number of such interchanges, which are necessary in order to find a travel route, which is close to the optimal solution. Additionally the proposed method can be applied to every configuration of storage field or geometrical form or kind of function for a warehouse. © 2002 Elsevier Science Inc. All rights reserved. en
heal.publisher ELSEVIER SCIENCE INC en
heal.journalName Applied Mathematical Modelling en
dc.identifier.doi 10.1016/S0307-904X(02)00137-3 en
dc.identifier.isi ISI:000182071600002 en
dc.identifier.volume 27 en
dc.identifier.issue 5 en
dc.identifier.spage 345 en
dc.identifier.epage 358 en

Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record