Results 61 to 70 of about 4,843,664 (223)
Guanxi and Wasta: 20 Years of Evolution and Future Directions for Informal Network Research
Thunderbird International Business Review, EarlyView.ABSTRACT This article provides an examination of the evolution of networking in China and the Arab world over two decades and provides an update to, and new insights arising from, an article called Guanxi and Wasta; A Comparison, published in Thunderbird International Business Review in 2006.
Kate Hutchings +3 more
wiley +1 more source
TS2PACK: A Two-Level Tabu Search for the Three-dimensional Bin Packing Problem [PDF]
, 2009 Three-dimensional orthogonal bin packing is a problem NP-hard in the strong sense where a set of boxes must be orthogonally packed into the minimum number of three-dimensional bins. We present a two-level tabu search for this problem.
CRAINIC T. G +3 more
core +1 more source
Probabilistic GRASP-Tabu Search algorithms for the UBQP problem [PDF]
Computers & Operations Research, 2013 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yang Wang 0030 +3 more
openaire +2 more sources
CAAI Transactions on Intelligence Technology, EarlyView.Abstract In a multi‐row facility layout problem (MRFLP), facilities are arranged in more than one row under the limited layout area. Considering different layout factors, various extensions of MRFLP have been modelled. However, the orientation of input/output (I/O) point in a facility, as a key factor that plays a direct impact on flow cost, is seldom ...
Yinan Guo +5 more
wiley +1 more source
An improved hybrid optimization algorithm for the quadratic assignment problem
Mathematical Modelling and Analysis, 2004 In this paper, we present an improved hybrid optimization algorithm, which was applied to the hard combinatorial optimization problem, the quadratic assignment problem (QAP).
A. Misevičius
doaj +1 more source
Building Blocks as Experiences in Dynamic Capacitated Arc Routing Problems
CAAI Transactions on Intelligence Technology, EarlyView.ABSTRACT The dynamic capacitated arc routing problem (DCARP) aims to update the service paths of vehicles in the capacitated arc routing problem when uncertain factors deteriorate the current schedule of vehicles' services. A DCARP scenario comprises a series of DCARP instances that share similarities with each other. Therefore, optimisation experience
Hao Tong +4 more
wiley +1 more source
FARKLI GELİŞ ZAMANLI ÖĞRENME ETKİLİ PARALEL MAKİNELİ ÇİZELGELEME PROBLEMİ
Havacılık ve Uzay Teknolojileri Dergisi, 2008 In this study m-identical parallel machine scheduling problem with release date is considered. The objective function of the problem is minimization of the makespan.
Tamer Eren
doaj
The Big Picture: Religion and Global Comparative History
Journal of Religious History, EarlyView.This article considers what a ‘big picture’ approach to global religious history might look like, and in particular the implications of deploying the comparative method across much larger stretches of time and space than historians normally attend to. It will begin by reflecting on the epistemological moods that have hindered this project to date, the ...
Alan Strathern
wiley +1 more source
Hybrid Feature Selection Approach Based on GRASP for Cancer Microarray Data
Journal of Computing and Information Technology, 2017 Microarray data usually contain a large number of genes, but a small number of samples. Feature subset selection for microarray data aims at reducing the number of genes so that useful information can be extracted from the samples. Reducing the dimension
Arpita Nagpal, Deepti Gaur
doaj +1 more source
A Novel Tabu Search Algorithm for Multi-AGV Routing Problem
Mathematics, 2020 In this paper, we propose a novel tabu search (NTS) algorithm that improves the efficiencies of picking goods of automated guided vehicles (AGVs) in an automatic warehouse by solving the conflicts that happen when multiple AGVs work at the same time ...
Lining Xing +5 more
doaj +1 more source