Search results for "Heuristic"
showing 10 items of 476 documents
A modified Ant Colony damage identification algorithm for not well spaced frequency systems
2012
Damage identification is of primary concern in many fields of civil engineering. Usually the damage is detected from the variation of structural response induced. When the damage level is very low, incipient damage, this variation is hardly seen. In the present work is studied the case of not well spaced frequency systems. Identification problem is formulated as a minimum problem of a functional expressed in term of damage parameters. The minimum problem is solved by heuristic algorithm, ACORL.
Contributions of Response Processes Analysis to the Validation of an Assessment of Higher Education Students’ Competence in Business and Economics
2017
Higher education domains such as Business and Economics (B&E) generally lack evidence that standardized tests of competency actually assess those aspects of knowledge and reasoning that constitute important targets for learning and instruction. The construction of such a validity argument benefits from a framework to guide the collection of relevant evidence regarding the interpretive meaning of tests results, especially with respect to instruction and learning in B&E. Response processes analysis provides much needed evidence within such a validity argument. The present paper illustrates application of such a framework and the use of response processes analysis for assessment in the B&E hig…
Shared online spreadsheets and hidden profiles: Technological effects on dyad decision strategy
2012
We report a study in which dyads use Instant Messaging to agree a preference among a set of three apartments. The information given to participants is partially overlapping, and contains a ''hidden profile'' (HP), such that a single apartment emerges as the best according to an unweighted sum of feature values only if dyad members pool information that is presented to only one of them. When dyads were additionally provided with a shared online spreadsheet, their decision strategy was more likely to be compensatory and relatively exhaustive, even if the distribution of importance among the cues in which the apartments vary meant that a ''fast and frugal'' heuristic such as take-the-best woul…
Searching the Web for conflicting topics: Page and user factors
2013
Web users tend to search only the pages displayed at the top of the search engine results page (the 'top link' heuristic). Although it might be reasonable to use this heuristic to navigate simple and unambiguous facts, it might be risky when searching for conflicting socio-scientific topics, such as potential measures to reduce greenhouse gas emissions. In the present study, we explored the extent to which students consider other Web page characteristics, such as topic relevance and trustworthiness, when searching and bookmarking pages concerning a conflicting topic. We also examined the extent to which prior background knowledge moderates students' behavior. The results revealed that while…
Social Influence Maximization in Hypergraphs
2021
This work deals with a generalization of the minimum Target Set Selection (TSS) problem, a key algorithmic question in information diffusion research due to its potential commercial value. Firstly proposed by Kempe et al., the TSS problem is based on a linear threshold diffusion model defined on an input graph with node thresholds, quantifying the hardness to influence each node. The goal is to find the smaller set of items that can influence the whole network according to the diffusion model defined. This study generalizes the TSS problem on networks characterized by many-to-many relationships modeled via hypergraphs. Specifically, we introduce a linear threshold diffusion process on such …
A GRASP heuristic for the mixed Chinese postman problem
2002
Abstract Arc routing problems (ARPs) consist of finding a traversal on a graph satisfying some conditions related to the links of the graph. In the Chinese postman problem (CPP) the aim is to find a minimum cost tour (closed walk) traversing all the links of the graph at least once. Both the Undirected CPP, where all the links are edges that can be traversed in both ways, and the Directed CPP, where all the links are arcs that must be traversed in a specified way, are known to be polynomially solvable. However, if we deal with a mixed graph (having edges and arcs), the problem turns out to be NP -hard. In this paper, we present a heuristic algorithm for this problem, the so-called Mixed CPP…
A tabu search algorithm for the bipartite drawing problem
1998
Graphs are used to represent reality in several areas of knowledge. This has generated considerable interest in graph drawing algorithms. Arc crossing minimization is a fundamental aesthetic criterion to obtain a readable map of a graph. The problem of minimizing the number of arc crossings in a bipartite graph (BDP) is NP-complete. In this paper we present a Tabu Search (TS) scheme for the BDP. Several algorithms can be obtained with this scheme by implementing different evaluators in the move definitions. In this paper we propose two variants. Computational results are reported on a set of 300 randomly generated test problems. The two algorithms have been compared with the best heuristics…
Bundle generation for last-mile delivery with occasional drivers
2022
In this paper, we present the vehicle routing problem (VRP) with occasional drivers (OD) and order bundles (OB). The problem VRP-OD-OB is an extension of the VRP-OD, where instead of assigning one customer per driver, drivers are assigned bundles of customers. To deal with the bundle-to-driver assignment, a bidding system is exploited, in which a company offers a set of bundles and the drivers raise their bids. These bids depend on features such as the drivers’ destination, flexibility in deviating from the shortest path, and willingness to offer service. To generate valuable bundles of customers, we propose two strategies: (i) an innovative approach based on the creation of corridors, and …
An ant colony optimization-based fuzzy predictive control approach for nonlinear processes
2015
In this paper, a new approach for designing an adaptive fuzzy model predictive control (AFMPC) based on the ant colony optimization (ACO) is proposed. On-line adaptive fuzzy identification is introduced to identify the system parameters. These parameters are used to calculate the objective function based on a predictive approach and structure of RST control. Then the optimization problem is solved based on an ACO algorithm, used at the optimization process in AFMPC to determine optimal controller parameters of RST control. The utility of the proposed controller is demonstrated by applying it to two nonlinear processes, where the proposed approach provides better performances compared with p…
Optimizing the level of service quality of a bike-sharing system
2016
Public bike-sharing programs have been deployed in hundreds of cities worldwide, improving mobility in a socially equitable and environmentally sustainable way. However, the quality of the service is drastically affected by imbalances in the distribution of bicycles among stations. We address this problem in two stages. First, we estimate the unsatisfied demand (lack of free lockers or lack of bicycles) at each station for a given time period in the future and for each possible number of bicycles at the beginning of the period. In a second stage, we use these estimates to guide our redistribution algorithms. Computational results using real data from the bike-sharing system in Palma de Mall…