Food hubs has seen substantial growth in past few decades but the overall operational efficiency and effectiveness is a concern for the managers of these facilities. The physical layout and infrastructure of the facility along with training to the operators is one of the critical part of improvements that will improve the efficiency of these facilities. Regional food hubs even though different ...

This paper browses through some well-known meta-heuristic search strategies, and briefly discusses some of their recent applications to the VLSI layout design process. It starts with very brief description of the different phases of VLSI layout design, and a brief overview of Meta-Heuristic search strategies. Since most of the VLSI layout design problems are hard optimization problems, the conc...

Café X is a coffee shop managed by 3 low-vision baristas. Visitors to this cafe are also dominated visitors with visual impairments. Due the limited visibility of barista and some visitors, several problems were found that could cause discomfort for workers visitors. Therefore, it necessary adjust cafe's operating system support performance provide security comfort baristas who come. The data c...

Layout arrangement is important to achieve high productivity in flexible manufacturing system (FMS). This paper discusses the design of loop layout in FMS. The objective of the loop layout problem is the determination of the ordering of machines around a loop, to minimize the total number of loop traversals for a family of parts. This paper details the design, development and testing of particl...

The single row facility layout problem (SRFLP) is the problem of arranging facilities with given lengths on a line, with the objective of minimizing the weighted sum of the distances between all pairs of facilities. The problem is NP-hard and research has focused on heuristics to solve large instances of the problem. In this paper we present four scatter search algorithms to solve large sized S...

The single row facility layout problem (SRFLP) is the problem of arranging facilities with given lengths on a line, while minimizing the weighted sum of the distances between all pairs of facilities. The problem is known to be NP-hard. In this paper, we present a neighborhood search heuristic called LK-INSERT which uses a Lin-Kernighan neighborhood structure built on insertion neighborhoods. To...