Search results

The purpose of this study is to understand the functional power of frequency from-to chart (FFTC) as an independent solution-key for generation optimal (exact) facilities sequences with an equal distance of straight-line flow patterns. The paper will propose a bi-objective function model based on the Torque Method then will turn it into a computer-based technique with a permutative manner using the full enumeration method. This model aims to figure out if there is a difference between the moment minimization and backtracking treatment. Furthermore, the proposed technique will measure the performance of related works from literature to numerically highlight their limitations.

The literature of related works provided two-principles assumed mastering material flow sequences. The researchers gathered and analyzed the three methods – used FFTC as an independent technique – mentioned in the literature then measured their performance with the proposed technique. The proposed technique is based on the computation of torque value using an enhancement of bi-objective function model then application a permutative approach with full enumeration methodology. The bi-objective function model used once to mimic the grand moment value of FFTC and again to study the reflection of minimizing the congestion of backtracking movements on the minimization of total transportation cost.

Based on the analysis of literature and comparative results of its three case studies using the proposed technique, it is found that: there are optimum facilities sequences with rich opportunities of exact pathway selection. Reduction methodology is an inefficient way to generate exact results. There is a gap between combining the minimization of the grand moment and the treatment of the backtracking problem.

This study is one of the first contributions that discusses the assumption of integration between optimization moment value and its relation to treatment backtracking problem. Also, the illness of reduction methodology to reach optimal solutions. The further direction of this research will highlight the conjecture of searching the exact results for small size problems, analyzing the given data and its logical dimensions, developing logical rules for solving and verifying large size problems based on the exact results (The conjecture of P = NP).

This paper provides a detailed numerical analysis of the most common problems generally faced facility layout problems through understanding the lack of integration between moment minimization and backtracking minimization. Also, the inefficiency of reliance on reduction methodology either in scores of frequencies between facilities with weak relation or the number of permutations. Based on those findings, further study will search the logical philosophy exactly optimizing FFTC manually or without having to deal with a permutative approach for large size problems – which considered non-deterministic polynomial-time problem.

Additive puzzles form a large and important class of problems in Artificial Intelligence, since many other problems may be shown to be homomorphic to them, and many techniques for solving them are easily transferable to certain classes of problems. For many additive puzzles, a homomorphic puzzle can be sometimes obtained which is much simpler than the initial one. If the simple puzzle cannot be solved from the image of a state in the first puzzle, then the first puzzle cannot be solved from that state. A method to obtain a simple homomorphic puzzle is by colouring its board. This paper presents an algorithm for colouring the boards of additive puzzles. Three heuristic backtracking decisions are discussed and their experimental performances are compared.

Pervasive computing envisions seamless support for user tasks through cooperating devices that are present in an environment. Fluctuating availability of devices, induced by mobility and failures, requires mechanisms and algorithms that allow applications to adapt to their ever‐changing execution environments without user intervention. To ease the development of adaptive applications, Becker et al. (3) have proposed the peer‐based component system PCOM. This system provides fundamental mechanisms to support the automated composition of applications at runtime. In this article, we discuss the requirements on algorithms that enable automatic configuration of pervasive applications. Furthermore, we show how finding a configuration can be interpreted as Distributed Constraint Satisfaction Problem. Based on this, we present an algorithm that is capable of finding an application configuration in the presence of strictly limited resources. To show the feasibility of this algorithm, we present an evaluation based on simulations and real‐world measurements and we compare the results with a simple greedy approximation.

An archive is a file containing several related files. Many Internet resources, such as freeware, shareware and trail software, are often packaged into archives for easy installation and taking. Additionally, thousands of users search for archives and download them from different sources everyday. In this paper, previous research on archive downloading is extended via proxy cache to support archive searching. Internet proxy cache servers are used to gather a significant number of Web pages, detect those that contain archive links, and then use the obtained data to search archives by description or filename. Two schemes, iterative and backtracking, are proposed to obtain Web pages with archive links. The experimental results indicate that the precision that both of the schemes can achieve is about the same; however, the backtracking scheme reduces the number of checked pages by a factor of 26. Finally, a real system was implemented to demonstrate the proposed approaches.

The purpose of this paper is to design an efficient on-demand routing protocol for mobile ad hoc networks (MANETs) which combines greedy forwarding and backtracking.

It uses a hybrid approach. It uses greedy approach to determine a route from source to the destination. If the greedy approach fails, then it uses a backtracking approach. Combining greedy and backtracking approaches results in a more efficient protocol.

A new routing algorithm for MANETs which performs better than some of the existing algorithms.

A major limitation of this work is that the authors did not implement the protocol on a test bed and evaluated the performance. They neither had the infrastructure nor the resources to actually implement the protocol. Instead, like most of the researchers, they evaluated the performance of their protocol based on extensive simulation. The mobility model, the area of deployment and the density of nodes chosen to simulate the protocol are consistent with what many of the other researchers have done. Intuitively, the authors’ protocol, as the performance evaluation indicates, is likely to perform well in small networks.

The authors did not implement the protocol on a test bed to evaluate the performance of the protocol. The authors used simulation to study the performance of their protocol. Their simulation model is similar to many of the research works published in the literature.

To the authors’ knowledge, no other paper has combined the greedy and backtracking approach to design a routing protocols for MANETs.

This work shows that it is possible to link various economic and property attributes to the value of a commercial property over time in a particular market, and arrive at a valuation pattern which can be used to give a short‐term forecast of valuation fluctuations using longitudinal rather than cross‐sectional analysis. Shows that it is possible to do this by using a novel process we have termed “backtrack valuations” or “backtracking”. The method proposed creates a simulated historic record of valuations, from which a neural network can be trained and then used as a model to estimate a forward trend. This is allied to the requirement in the RICS Appraisal and Valuation Manual (Red Book) whereby the valuer may be instructed to provide Estimated Realisation Price which depends on completion taking place on a future date as compared with Open Market Value where achievement of completion is assumed at the date of valuation. There is also the new definition of “Forecast of Value” in the RICS Red Book and we suggest that the valuer would find the technique of forecasting from backtracked time series of interest and use in both these particular circumstances. The source of data for the investigation was Richard Ellis, International Property Consultants, who provided monthly valuations of 16 major commercial properties in Central London. Our forecasts are presented alongside the subsequent Richard Ellis valuations. The results confirm that in the conditions obtaining in this market, it is feasible to predict capital valuations in the short term. The method is being extended and tested in the wider commercial markets.

This paper aims to investigate the just-in-time (JIT) in-house logistics problem for automotive assembly lines. A point-to-point (P2P) JIT distribution model has been formulated to specify the destination station and parts quantity of each delivery for minimizing line-side inventory levels.

An exact backtracking procedure integrating with dominance properties is presented to cope with small-scale instances. As for real-world instances, this study develops a modified discrete artificial bee colony (MDABC) metaheuristic. The neighbor search of MDABC is redefined by a novel differential evolution loop and a breadth-first search.

The backtracking method has efficaciously cut unpromising branches and solved small-scale instances to optimality. Meanwhile, the modifications have enhanced exploitation abilities of the original metaheuristic, and good approximate solutions are obtained for real-world instances. Furthermore, inventory peaks are avoided according to the simulation results which validates the effectiveness of this mathematical model to facilitate an efficient JIT parts supply.

This study is applicable only if the breakdown of transport devices is not considered. The current work has effectively facilitated the P2P JIT logistics scheduling in automotive assembly lines, and it could be modified to tackle similar distribution problems featuring time-varying demands.

Both limited vehicle capacities and no stock-outs constraints are considered, and the combined routing and loading problem is solved satisfactorily for an efficient JIT supply of material in automotive assembly lines.

The notion of a computation graph is introduced. A computation graph is a rooted, directed graph whose nodes are labelled by statements (instructions) to be executed. The motivation for developing computation graphs comes from a desire to represent programs by well‐defined, manipulable structures and to permit search (especially backtracking) to be a natural part of the execution of such programs. This initial work considers very simple computation graphs where the only statements that can be executed are assignment statements and tests. Procedure calls, parameter passing, etc. are not considered. The execution rule for computation graphs is based upon search procedures. The computation rule presented permits a computation graph to be executed depth first, breadth first or using a combination of both. This is done by defining functions, which are arguments to the computation rule, to control the traversal of the graph. The use of the rule is illustrated by describing functions to permit the rule to execute the same graph depth first and breadth first.