Ara
Toplam kayıt 79, listelenen: 51-60
Hospital layout design renovation as a Quadratic Assignment Problem with geodesic distances
(Elsevier, 2021)
Hospital facilities are known as functionally complex buildings. There are usually configurational problems that lead to inefficient transportation processes for patients, medical staff, and/or logistics of materials. The ...
Multi-zone optimisation of high-rise buildings using artificial intelligence for sustainable metropolises. Part 2: Optimisation problems, algorithms, results, and method validation
(Elsevier, 2021)
High-rise building optimisation is becoming increasingly relevant owing to global population growth and urbanisation trends. Previous studies have demonstrated the potential of high-rise optimisation but have been focused ...
Multi-zone optimisation of high-rise buildings using artificial intelligence for sustainable metropolises. Part 1: Background, methodology, setup, and machine learning results
(Elsevier, 2021)
Designing high-rise buildings is one of the complex tasks of architecture because it involves interdisciplinary performance aspects in the conceptual phase. The necessity for sustainable high-rise buildings has increased ...
A General Variable Neighborhood Search Algorithm for the No-Idle Permutation Flowshop Scheduling Problem
(SPRINGER-VERLAG BERLIN, 2013)
In this study, a general variable neighborhood search (GVNS) is presented to solve no-idle permutation flowshop scheduling problem (NIPFS), where idle times are not allowed on machines. GVNS is a metaheuristic, where inner ...
A Populated Iterated Greedy Algorithm with Inver-Over Operator for Traveling Salesman Problem
(SPRINGER-VERLAG BERLIN, 2013)
In this study, we propose a populated iterated greedy algorithm with an Inver-Over operator to solve the traveling salesman problem. The iterated greedy (IG) algorithm is mainly based on the central procedures of destruction ...
Metaheuristic Algorithms for the Quadratic Assignment Problem
(IEEE, 2013)
This paper presents two meta-heuristic algorithms to solve the quadratic assignment problem. The iterated greedy algorithm has two main components, hich are destruction and construction procedures. The algorithm starts ...
A Dynamic Berth Allocation Problem with Priority Considerations under Stochastic Nature
(SPRINGER-VERLAG BERLIN, 2012)
Stochastic nature of vessel arrivals and handling times adds to the complexity of the well-known NP-hard berth allocation problem. To aid real decision-making under customer differentiations, a dynamic stochastic model ...
A Variable Iterated Greedy Algorithm with Differential Evolution for Solving No-Idle Flowshops
(SPRINGER-VERLAG BERLIN, 2012)
In this paper, we present a variable iterated greedy algorithm where its parameters (basically destruction size and probability of whether or not to apply the iterated greedy algorithm to an individual) are optimized by ...
Solving Fuzzy Job-Shop Scheduling Problem by a Hybrid PSO Algorithm
(SPRINGER-VERLAG BERLIN, 2012)
This paper proposes a hybrid particle swarm optimization (PSO) algorithm for solving the job-shop scheduling problem with fuzzy processing times. The objective is to minimize the maximum fuzzy completion time, i.e., the ...
A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem
(ELSEVIER SCIENCE INC, 2011)
In this paper, a discrete artificial bee colony (DABC) algorithm is proposed to solve the lot-streaming flow shop scheduling problem with the criterion of total weighted earliness and tardiness penalties under both the ...