Results 91 to 100 of about 95,488 (287)

Utilizing Artificial Intelligence to Solve Construction Site Layout Planning Problems [PDF]

open access: yesJournal of Soft Computing in Civil Engineering
The facilities have conflicting purposes in the available space on the construction site, increasing the transportation flow of facilities, which is the cause of the increase in project construction costs.
Pham Vu Hong Son, To Dieu Lam
doaj   +1 more source

Hybridization as Cooperative Parallelism for the Quadratic Assignment Problem

open access: yes, 2016
International audienceThe Quadratic Assignment Problem is at the core of several real-life applications. Finding an optimal assignment is computationally very difficult, for many useful instances.
Abreu, Salvador   +2 more
core   +3 more sources

Maneuverable Multilegged Locomotion through Anisotropically Arranged Soft Backbones in a Single‐Actuator Modular Miniature Robot

open access: yesAdvanced Intelligent Systems, EarlyView.
A modular eight‐legged robot exploits anisotropically oriented soft I‐beam backbones to transmit vibration from a single unbalanced‐mass actuator, producing frequency‐dependent multimodal gaits. A pseudo‐rigid‐body model enables high‐fidelity MuJoCo simulation, while Bayesian parameter identification and reinforcement learning yield robust control ...
Yiğit Yaman   +4 more
wiley   +1 more source

Combinatorial optimization np-hard problem solved by using the quadratic assignment problem (QAP) solution through a parallel genetic algorithm on GPU

open access: yesVisión Electrónica, 2017
In this article, some instances of well known combinatorial optimization NP-Hard problems are solved by using Koopmans and Beckmann formulation of the quadratic assignment problem (QAP).
Eduardo Cárdenas Gómez   +2 more
doaj   +1 more source

Autocorrelation measures for the quadratic assignment problem

open access: yesApplied Mathematics Letters, 2012
In this article we provide an exact expression for computing the autocorrelation coefficient $\xi$ and the autocorrelation length $\ell$ of any arbitrary instance of the Quadratic Assignment Problem (QAP) in polynomial time using its elementary landscape decomposition.
Chicano-García, José-Francisco   +2 more
openaire   +4 more sources

Solving Certain Large Instances of the Quadratic Assignment Problem: Steinberg's Examples [PDF]

open access: yes, 1999
This report discusses techniques for the solution of the quadratic assignment problem (QAP) and describes a prototype implementation used to solve two large (n = 36) instances of the ...
Nyströem, Mika
core  

Defining a Storage-assignment Strategy for Precedence-constrained Order Picking

open access: yesOperations Research and Decisions, 2021
A zero-one quadratic assignment model has been proposed for dealing with the storage location assignment problem when there are weight constraints. Our analysis shows that operations can be improved using our model.
Maria A.M. Trindade   +2 more
doaj  

A bilinear programming solution to the quadratic assignment problem [PDF]

open access: yes
The quadratic assignment problem (QAP) or maximum acyclical graph problem is well documented (see e.g. Pardalos and Wolkowicz, 1994). One of the authors has published some material, in which it was tried, by structuring the problem additionally, to bring
Kaashoek, J.F., Paelinck, J.H.P.
core   +1 more source

Short‐Term Scheduling Optimization of a Single‐Pipeline Refining System With High Melting Point Crude Oil

open access: yesAsia-Pacific Journal of Chemical Engineering, EarlyView.
ABSTRACT In order to reflect the actual production situation more comprehensively and optimize the production cost, this paper solves the short‐term scheduling optimization problem for a single pipeline containing high melting point crude oil. Based on the refining plan given by the upper layer, a multi‐objective optimization model with high melting ...
Jing Yao   +5 more
wiley   +1 more source

O(1) Deltapart part computation technique for the quadratic assignment problem

open access: yesSistemnì Doslìdženâ ta Informacìjnì Tehnologìï, 2015
The quadratic assignment problem is rightfully considered to be one of the most challenging problems of combinatorial optimization. Since this problem is NP-hard, the use of heuristic algorithms is the only way to find in a reasonable time a solution ...
S. V. Podolsky, Yu. M. Zorin
doaj  

Home - About - Disclaimer - Privacy