2017
DOI: 10.1007/978-3-319-67223-6_32
|View full text |Cite
|
Sign up to set email alerts
|

Simulated Annealing Based on Linguistic Patterns: Experimental Examination of Properties for Various Types of Logistic Problems

Abstract: The paper presents simulation experiment results regarding properties of linguistic pattern based simulated annealing used for solving the facilities layout problems in logistics. In the article, we investigate four different arrangements (02 × 18, 03 × 12, 04 × 09, and 06 × 06) comprising of 36 items. The examined layouts also differ in the links matrix density (20%, 40%, and 60%) and in defining distance between objects' pairs for the distance membership function (absolute and relative). We formally examine … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 14 publications
0
1
0
Order By: Relevance
“…The generation and selection of the most convenient layout for an organisation is a complex iterative process that depends on the relations between the elements making up its production system. According to the theory of computational complexity, most FLP formulations are considered non-polynomial hard problems (NPhard) as no solution algorithms provide an optimal solution in a reasonable polynomial time (Grobelny and Michalski, 2018). However, this high degree of difficulty has not stopped different authors from tackling these problems by providing acceptable solutions in realistic computational times.…”
Section: Literature Reviewmentioning
confidence: 99%
“…The generation and selection of the most convenient layout for an organisation is a complex iterative process that depends on the relations between the elements making up its production system. According to the theory of computational complexity, most FLP formulations are considered non-polynomial hard problems (NPhard) as no solution algorithms provide an optimal solution in a reasonable polynomial time (Grobelny and Michalski, 2018). However, this high degree of difficulty has not stopped different authors from tackling these problems by providing acceptable solutions in realistic computational times.…”
Section: Literature Reviewmentioning
confidence: 99%