Log in

Relevant bibliographies by topics / Discrete Neighborhood / Journal articles

To see the other types of publications on this topic, follow the link: Discrete Neighborhood.

Journal articles on the topic 'Discrete Neighborhood'

Author: Grafiati

Published: 10 March 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Discrete Neighborhood.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Quillian, Lincoln. "A Comparison of Traditional and Discrete-Choice Approaches to the Analysis of Residential Mobility and Locational Attainment." ANNALS of the American Academy of Political and Social Science 660, no. 1 (June 9, 2015): 240–60. http://dx.doi.org/10.1177/0002716215577770.

Full text

Abstract:

This article contrasts traditional modeling approaches and discrete-choice models as methods to analyze locational attainment—how individual and household characteristics (such as race, socioeconomic status, age) influence the characteristics of neighborhoods of residence (such as racial composition and median income). Traditional models analyze attributes of a neighborhood as a function of the characteristics of the households within them; discrete-choice methods, on the other hand, are based on dyadic analysis of neighborhood attributes and household characteristics. I outline two problems with traditional approaches to residential mobility analysis that may be addressed through discrete-choice analysis. I also discuss disadvantages of the discrete-choice approach. Finally, I use data from the Panel Study of Income Dynamics to estimate residential mobility using traditional locational attainment and discrete-choice models; I show that these produce similar estimates but that the discrete-choice approach allows for estimates that examine how multiple place characteristics simultaneously guide migration. Substantively, these models reveal that the disproportionate migration of black households into lower-income tracts amounts to sorting of black households into black tracts, which on average are lower income.

APA, Harvard, Vancouver, ISO, and other styles

2

Mishachev, Nikolay Mikhailovich, and Anatoliy Mikhailovich Shmyrin. "DISCRETE SYSTEMS AND NEIGHBORING STRUCTURES." Tambov University Reports. Series: Natural and Technical Sciences, no. 123 (2018): 473–78. http://dx.doi.org/10.20310/1810-0198-2018-23-123-473-478.

Full text

Abstract:

In the article, neighborhood structures (digraphs of a special type) are defined and their relationship with discrete control systems is discussed. The archetypes of the neighborhood structures and the control systems corresponding to these archetypes are listed.

APA, Harvard, Vancouver, ISO, and other styles

3

Huang, Song, Na Tian, and Zhicheng Ji. "Particle swarm optimization with variable neighborhood search for multiobjective flexible job shop scheduling problem." International Journal of Modeling, Simulation, and Scientific Computing 07, no. 03 (August 23, 2016): 1650024. http://dx.doi.org/10.1142/s1793962316500240.

Full text

Abstract:

The simulation on benchmarks is a very simple and efficient method to evaluate the performance of the algorithm for solving flexible job shop scheduling model. Due to the assignment and scheduling decisions, flexible job shop scheduling problem (FJSP) becomes extremely hard to solve for production management. A discrete multi-objective particle swarm optimization (PSO) and simulated annealing (SA) algorithm with variable neighborhood search is developed for FJSP with three criteria: the makespan, the total workload and the critical machine workload. Firstly, a discrete PSO is designed and then SA algorithm performs variable neighborhood search integrating two neighborhoods on public critical block to enhance the search ability. Finally, the selection strategy of the personal-best individual and global-best individual from the external archive is developed in multi-objective optimization. Through the experimental simulation on matlab, the tests on Kacem instances, Brdata instances and BCdata instances show that the modified discrete multi-objective PSO algorithm is a promising and valid method for optimizing FJSP with three criteria.

APA, Harvard, Vancouver, ISO, and other styles

4

Chen, Guantao, Jian Shen, and Raphael Yuster. "Second Neighborhood via First Neighborhood in Digraphs." Annals of Combinatorics 7, no. 1 (June 2003): 15–20. http://dx.doi.org/10.1007/s000260300001.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Namgung, Mi, and Gulsah Akar. "Influences of Neighborhood Characteristics and Personal Attitudes on University Commuters’ Public Transit Use." Transportation Research Record: Journal of the Transportation Research Board 2500, no. 1 (January 2015): 93–101. http://dx.doi.org/10.3141/2500-11.

Full text

Abstract:

This study examined the links between attitudes, the built environment, and travel behavior on the basis of data from the Ohio State University's 2012 Campus Transportation Survey. The analysis results indicated that attitudes might have explained travel behavior better than the built environment. Survey respondents were asked questions about their attitudes on public transit use, and their answers were grouped into new attitudinal factors by using principal component analysis. Then, new neighborhood categories were created by K-means cluster analysis by means of built-environment and land use variables (population density, employment density, housing density, median age of structures, percentage of single-family housing, and intersection density). As a result of this analysis, discrete neighborhood categories, such as urban high-density and residential neighborhoods, and urban low-density and mixed-use neighborhoods, were created. Then, differences in attitudes toward public transit were analyzed across these new neighborhood categories. Binary logit models were estimated to determine the influence of these neighborhood categories as well as personal attitudes on public transit use after sociodemographic characteristics were controlled for. The results indicated that attitudes were more strongly associated with travel behavior than with neighborhood characteristics. The findings of this study will aid in the formation of a better understanding of public transit use by highlighting the effects of attitudes and neighborhood characteristics in transit use as well as differences in attitudes between neighborhood types.

APA, Harvard, Vancouver, ISO, and other styles

6

WISEHEART, REBECCA, SUNJUNG KIM, LINDA J. LOMBARDINO, and LORI J. P. ALTMANN. "Indexing effects of phonological representational strength on rapid naming using rime neighborhood density." Applied Psycholinguistics 40, no. 2 (October 30, 2018): 253–77. http://dx.doi.org/10.1017/s0142716418000565.

Full text

Abstract:

AbstractA long-standing hypothesis is that rapid automatized naming (RAN) measures access to phonological representations stored in long-term memory, but this has been difficult to test experimentally because phonological representations are mental constructs not easily operationalized. Here, we provide a method to test this theory using rime neighborhood density as an index of phonological representational strength. Thirty adults completed four picture-naming tasks orthogonalized for item composition (repeating vs. nonrepeating) and presentation format (discrete vs. serial). Each task was presented in two dichotomous conditions of rime neighborhood density (dense and sparse). There was no effect of rime neighborhood density on naming speed in the discrete nonrepeated (confrontation naming) task. However, rime neighborhood density significantly facilitated naming speed for serial repeated (i.e., RAN), discrete repeated, and serial nonrepeated tasks (ps<.03). The effect was weakest for confrontation naming (d=0.14) and strongest for both discrete and serial RAN tasks (ds=1.01), suggesting that repeating items, not serial presentation, makes RAN uniquely sensitive to manipulations of rime neighborhood density and, by proxy, phonological representations.

APA, Harvard, Vancouver, ISO, and other styles

7

Li, Tianjun. "Local discrete symmetry in the brane neighborhood." Physics Letters B 528, no. 1-2 (February 2002): 149–55. http://dx.doi.org/10.1016/s0370-2693(02)01185-1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Marchand-Maillet, Stéphane, and Yazid M. Sharaiha. "Discrete Convexity, Straightness, and the 16-Neighborhood." Computer Vision and Image Understanding 66, no. 3 (June 1997): 316–29. http://dx.doi.org/10.1006/cviu.1996.0521.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Sedykh, I. A. "FORECASTING THE GROUNDWATER LEVEL OF CEMENT RAW MATERIALS DEPOSIT BASED ON DYNAMIC NEIGHBORHOOD MODELS." Vestnik of Don State Technical University 18, no. 3 (September 29, 2018): 326–32. http://dx.doi.org/10.23947/1992-5980-2018-18-3-326-332.

Full text

Abstract:

Introduction. The development of a mathematical model for the groundwater level of a deposit of cement raw materials located in the Zadonian-Yelets aquifer, which is the principal domestic water supply source for the city of Lipetsk, is considered. Therefore, it is necessary to provide ongoing monitoring and to have the possibility to predict the water level under the field development. The work objectives are the identification and study of a dynamic neighborhood model with variable hierarchical neighborhoods of the groundwater level that enables to adequately predict value of the water level in the examined wells.Materials and Methods. The definition of a dynamic neighborhood model with variable hierarchical neighborhoods is given, differing by time-varying double-level neighborhood communications between the first- and second-level nodes. At each next discrete instant of time, the neighborhood model nodes change their state under the influence of the online parameters and node states included in their neighborhood. As a subcase, we consider a model with line state recalculation functions. Parametric identification of the dynamic neighborhood model consists in finding the system parameters for each second-level node, and is based on the ordinary least squares.Research Results. A linear dynamic neighborhood model with variable hierarchical neighborhoods for predicting the groundwater level in a cement raw material deposit located in the Zadonian-Yelets aquifer is developed. The software using C++ is developed for the parametric identification and simulation of the functioning of the dynamic neighborhood model under consideration. It enables to determine parameters of the node state recalculation functions for a given structure, and also to predict the model behavior in the operation process. A hierarchical structure is given, and a parametric identification of the linear dynamic neighborhood model of the groundwater level is carried out. After the parametric identification on the teaching data selection, the mathematical model is checked on the test sample.Discussion and Conclusions. The obtained average ratio errors of the identification and forecast suggest the developed model validity and enable to recommend it for predicting the underground water level of a cement raw materials deposit.

APA, Harvard, Vancouver, ISO, and other styles

10

Chen, Xueyu, Minghua Wan, Hao Zheng, Chao Xu, Chengli Sun, and Zizhu Fan. "A New Bilinear Supervised Neighborhood Discrete Discriminant Hashing." Mathematics 10, no. 12 (June 17, 2022): 2110. http://dx.doi.org/10.3390/math10122110.

Full text

Abstract:

Feature extraction is an important part of perceptual hashing. How to compress the robust features of images into hash codes has become a hot research topic. Converting a two-dimensional image into a one-dimensional descriptor requires a higher computational cost and is not optimal. In order to maintain the internal feature structure of the original two-dimensional image, a new Bilinear Supervised Neighborhood Discrete Discriminant Hashing (BNDDH) algorithm is proposed in this paper. Firstly, the algorithm constructs two new neighborhood graphs to maintain the geometric relationship between samples and reduces the quantization loss by directly constraining the hash codes. Secondly, two small rotation matrices are used to realize the bilinear projection of the two-dimensional descriptor. Finally, the experiment verifies the performance of the BNDDH algorithm under different feature types, such as image original pixels and a Convolutional Neural Network (CNN)-based AlexConv5 feature. The experimental results and discussion clearly show that the proposed BNDDH algorithm is better than the existing traditional hashing algorithm and can represent the image more efficiently in this paper.

APA, Harvard, Vancouver, ISO, and other styles

11

Peng, Liang-Xue. "On linear neighborhood assignments and dually discrete spaces." Topology and its Applications 155, no. 16 (October 2008): 1867–74. http://dx.doi.org/10.1016/j.topol.2008.06.005.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Vandeviver, Christophe, and Wim Bernasco. "“Location, Location, Location”: Effects of Neighborhood and House Attributes on Burglars’ Target Selection." Journal of Quantitative Criminology 36, no. 4 (October 11, 2019): 779–821. http://dx.doi.org/10.1007/s10940-019-09431-y.

Full text

Abstract:

Abstract Objectives To empirically test whether offenders consider environmental features at multiple spatial scales when selecting a target and examine the simultaneous effect of neighborhood-level and residence-level attributes on residential burglars’ choice of residence to burglarize. Methods We combine data on 679 burglaries by 577 burglars committed between 2005 and 2014 with data on approximately 138,000 residences in 193 residential neighborhoods in Ghent, Belgium. Using a discrete spatial choice approach, we estimate the combined effect of neighborhood-level and residence-level attributes on burglars’ target choice in a conditional logit model. Results Burglars prefer burglarizing residences in neighborhoods with lower residential density. Burglars also favor burglarizing detached residences, residences in single-unit buildings, and renter-occupied residences. Furthermore, burglars are more likely to target residences in neighborhoods that they previously and recently targeted for burglary, and residences nearby their home. We find significant cross-level interactions between neighborhood and residence attributes in burglary target selection. Conclusions Both area-level and target-level attributes are found to affect burglars’ target choices. Our results offer support for theoretical accounts of burglary target selection that characterize it as being informed both by attributes of individual properties and attributes of the environment as well as combinations thereof. This spatial decision-making model implies that environmental information at multiple and increasingly finer scales of spatial resolution informs crime site selection.

APA, Harvard, Vancouver, ISO, and other styles

13

Thompson, Amy E., John P. Walden, Adrian S. Z. Chase, Scott R. Hutson, Damien B. Marken, Bernadette Cap, Eric C. Fries, et al. "Ancient Lowland Maya neighborhoods: Average Nearest Neighbor analysis and kernel density models, environments, and urban scale." PLOS ONE 17, no. 11 (November 2, 2022): e0275916. http://dx.doi.org/10.1371/journal.pone.0275916.

Full text

Abstract:

Many humans live in large, complex political centers, composed of multi-scalar communities including neighborhoods and districts. Both today and in the past, neighborhoods form a fundamental part of cities and are defined by their spatial, architectural, and material elements. Neighborhoods existed in ancient centers of various scales, and multiple methods have been employed to identify ancient neighborhoods in archaeological contexts. However, the use of different methods for neighborhood identification within the same spatiotemporal setting results in challenges for comparisons within and between ancient societies. Here, we focus on using a single method—combining Average Nearest Neighbor (ANN) and Kernel Density (KD) analyses of household groups—to identify potential neighborhoods based on clusters of households at 23 ancient centers across the Maya Lowlands. While a one-size-fits all model does not work for neighborhood identification everywhere, the ANN/KD method provides quantifiable data on the clustering of ancient households, which can be linked to environmental zones and urban scale. We found that centers in river valleys exhibited greater household clustering compared to centers in upland and escarpment environments. Settlement patterns on flat plains were more dispersed, with little discrete spatial clustering of households. Furthermore, we categorized the ancient Maya centers into discrete urban scales, finding that larger centers had greater variation in household spacing compared to medium-sized and smaller centers. Many larger political centers possess heterogeneity in household clustering between their civic-ceremonial cores, immediate hinterlands, and far peripheries. Smaller centers exhibit greater household clustering compared to larger ones. This paper quantitatively assesses household clustering among nearly two dozen centers across the Maya Lowlands, linking environment and urban scale to settlement patterns. The findings are applicable to ancient societies and modern cities alike; understanding how humans form multi-scalar social groupings, such as neighborhoods, is fundamental to human experience and social organization.

APA, Harvard, Vancouver, ISO, and other styles

14

Lehel, J., and Zs Tuza. "Neighborhood perfect graphs." Discrete Mathematics 61, no. 1 (August 1986): 93–101. http://dx.doi.org/10.1016/0012-365x(86)90031-2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Zhang, Jin, Li Hong, and Qing Liu. "An Improved Whale Optimization Algorithm for the Traveling Salesman Problem." Symmetry 13, no. 1 (December 30, 2020): 48. http://dx.doi.org/10.3390/sym13010048.

Full text

Abstract:

The whale optimization algorithm is a new type of swarm intelligence bionic optimization algorithm, which has achieved good optimization results in solving continuous optimization problems. However, it has less application in discrete optimization problems. A variable neighborhood discrete whale optimization algorithm for the traveling salesman problem (TSP) is studied in this paper. The discrete code is designed first, and then the adaptive weight, Gaussian disturbance, and variable neighborhood search strategy are introduced, so that the population diversity and the global search ability of the algorithm are improved. The proposed algorithm is tested by 12 classic problems of the Traveling Salesman Problem Library (TSPLIB). Experiment results show that the proposed algorithm has better optimization performance and higher efficiency compared with other popular algorithms and relevant literature.

APA, Harvard, Vancouver, ISO, and other styles

16

Rahimi, Amir Masoud, and Ehsan Ramezani-Khansari. "Artificial Bee Colony Algorithm with Proposed Discrete Nearest Neighborhood Algorithm for Discrete Optimization Problems." Jurnal Kejuruteraan 33, no. 4 (November 30, 2021): 1087–95. http://dx.doi.org/10.17576/jkukm-2021-33(4)-31.

Full text

Abstract:

Travelling salesman problem (TSP) is one the problems of NP-complete family, which means finding shortest complete close tour in the graph. This study seeks to solve this problem using Artificial Bee Colony (ABC) Algorithm along with the proposed Discrete Nearest Neighborhood Algorithm (DNNA). DNNA finds shortest path among points by starting from an arbitrary point. In next steps this links will be a guide to make complete tour. In other words the links in partial tours have higher chance to be in the final solution. In order to improve the final solutions of a single created tour, The employee bees’ movement radius has been limited, because of avoidance of long random jump between nodes. To reduce the optimization time of the tours created by the artificial bee colony algorithm, the fixed-radius near neighbor 2-opt algorithm was used as well. In addition, 2 types of scout bee were used for to intensify the probability property of the algorithm. Also, convergence in the probability function of employee bees’ movement was prevented by increasing the number of route-creating tours. The first scout bee applies the proposed DNNA and the secondary scout bee improves the partial tours of employee bees in a probable way. Although Althought the average error of proposed ABC algorithm has been 0.371% higher than best solution of all methods, it could improve the solution of 3 problems with average of 3.305%. The proposed algorithm has been better than basic ABC in all tested problems with average of 0.570%.

APA, Harvard, Vancouver, ISO, and other styles

17

Fertin, Guillaume, and André Raspaud. "Neighborhood Communications in Networks." Electronic Notes in Discrete Mathematics 10 (November 2001): 103–8. http://dx.doi.org/10.1016/s1571-0653(04)00371-3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Groshaus, Marina, Min Chih Lin, and Jayme L. Szwarcfiter. "On neighborhood-Helly graphs." Discrete Applied Mathematics 216 (January 2017): 191–202. http://dx.doi.org/10.1016/j.dam.2016.04.029.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Porter, Jason M., Marvin E. Larsen, J. Wesley Barnes, and John R. Howell. "Metaheuristic Optimization of a Discrete Array of Radiant Heaters." Journal of Heat Transfer 128, no. 10 (March 23, 2006): 1031–40. http://dx.doi.org/10.1115/1.2345430.

Full text

Abstract:

The design of radiant enclosures is an active area of research in radiation heat transfer. When design variables are discrete such as for radiant heater arrays with on-off control of individual heaters, current methods of design optimization fail. This paper reports the development of a metaheuristic thermal radiation optimization approach. Two metaheuristic optimization methods are explored: simulated annealing and tabu search. Both approaches are applied to a combinatorial radiant enclosure design problem. Configuration factors are used to develop a dynamic neighborhood for the tabu search algorithm. Results are presented from the combinatorial optimization problem. Tabu search with a problem specific dynamic neighborhood definition is shown to find better solutions than the benchmark simulated annealing approach in less computation time.

APA, Harvard, Vancouver, ISO, and other styles

20

Drazic, Zorica. "Gaussian variable neighborhood search for the file transfer scheduling problem." Yugoslav Journal of Operations Research 26, no. 2 (2016): 173–88. http://dx.doi.org/10.2298/yjor150124006d.

Full text

Abstract:

This paper presents new modifications of Variable Neighborhood Search approach for solving the file transfer scheduling problem. To obtain better solutions in a small neighborhood of a current solution, we implement two new local search procedures. As Gaussian Variable Neighborhood Search showed promising results when solving continuous optimization problems, its implementation in solving the discrete file transfer scheduling problem is also presented. In order to apply this continuous optimization method to solve the discrete problem, mapping of uncountable set of feasible solutions into a finite set is performed. Both local search modifications gave better results for the large size instances, as well as better average performance for medium and large size instances. One local search modification achieved significant acceleration of the algorithm. The numerical experiments showed that the results obtained by Gaussian modifications are comparable with the results obtained by standard VNS based algorithms, developed for combinatorial optimization. In some cases Gaussian modifications gave even better results.

APA, Harvard, Vancouver, ISO, and other styles

21

Sedykh, Irina, and Аnastasiya Smetannikova. "Construction and investigation of discrete dynamic neighborhood models in Mathcad." Bulletin of Perm National Research Polytechnic University. Electrotechnics, Informational Technologies, Control Systems, no. 29 (March 29, 2019): 32–43. http://dx.doi.org/10.15593/2224-9397/2019.1.02.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

Zhou, Dongqing, and Xing Wang. "A Neighborhood-Impact Based Community Detection Algorithm via Discrete PSO." Mathematical Problems in Engineering 2016 (2016): 1–15. http://dx.doi.org/10.1155/2016/3790590.

Full text

Abstract:

The paper addresses particle swarm optimization (PSO) into community detection problem, and an algorithm based on new label strategy is proposed. In contrast with other label propagation strategies, the main contribution of this paper is to design the definition of the impact of node and take it into use. Special initialization and update approaches based on it are designed in order to make full use of it. Experiments on synthetic and real-life networks show the effectiveness of proposed strategy. Furthermore, this strategy is extended to signed networks, and the corresponding objective function which is called modularity density is modified to be used in signed networks. Experiments on real-life networks also demonstrate that it is an efficacious way to solve community detection problem.

APA, Harvard, Vancouver, ISO, and other styles

23

Petruševski, Mirko, and Riste Škrekovski. "Colorings with neighborhood parity condition." Discrete Applied Mathematics 321 (November 2022): 385–91. http://dx.doi.org/10.1016/j.dam.2022.07.018.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Hammack, Richard. "Graph exponentiation and neighborhood reconstruction." Discussiones Mathematicae Graph Theory 41, no. 1 (2021): 335. http://dx.doi.org/10.7151/dmgt.2186.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Hajdu, András, Lajos Hajdu, and Robert Tijdeman. "General neighborhood sequences in Zn." Discrete Applied Mathematics 155, no. 18 (November 2007): 2507–22. http://dx.doi.org/10.1016/j.dam.2007.06.021.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Hossein-Zadeh, Samaneh, Ali Iranmanesh, Asma Hamzeh, and Mohammad Ali Hosseinzadeh. "On the common neighborhood graphs." Electronic Notes in Discrete Mathematics 45 (January 2014): 51–56. http://dx.doi.org/10.1016/j.endm.2013.11.011.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

Chandler, James D., Wyatt J. Desormeaux, Teresa W. Haynes, and Stephen T. Hedetniemi. "Neighborhood-restricted [≤2]-achromatic colorings." Discrete Applied Mathematics 207 (July 2016): 39–44. http://dx.doi.org/10.1016/j.dam.2016.02.023.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Nand, Ravneil, Bibhya Sharma, and Kaylash Chaudhary. "An introduction of preference based stepping ahead firefly algorithm for the uncapacitated examination timetabling." PeerJ Computer Science 8 (September 2, 2022): e1068. http://dx.doi.org/10.7717/peerj-cs.1068.

Full text

Abstract:

In recent times, there has been a growing attention to intelligent optimization algorithms centred on swarm principles such as the firefly algorithm (FA). It was proposed for the continuous domain that mimics the attraction of fireflies to flashing light and has been used in discrete domains via modification. A discrete domain that is a major challenge in most higher education institutes (HEI) is examination timetabling. This article presents a new methodology based on FA for uncapacitated examination timetabling problems (UETP) where the proposed method is an extension of earlier work by the authors on the continuous domain. UETP is considered in this article as it is a university examination timetabling problem, which is still an active research area and has not been solved by FA algorithm as per authors knowledge. The proposed method concentrates on solving the initial solution using discrete FA where it consolidates the reordering of examinations and slots through a heuristic ordering known as neighborhood search. Three neighborhoods are employed in this research, where one is used during the initialization phase while two are utilized during solution improvement phase. Later, through preference parameters, a novel stepping ahead mechanism is used, which employs neighborhood searches built on previous searches. The proposed method is tested with 12 UETP problems where the preference based stepping ahead FA creates comparative results to the best ones available in the literature for the Toronto exam timetabling dataset. The results obtained are proof of concept at the preliminary stage and require further experiments on other educational datasets such as the second international timetable competition benchmark sets. The newly introduced preference based stepping ahead mechanism takes advantage of the current best solution space where it exploits the solution space for better solutions. This paves the way for researchers to utilize the mechanism in other domains such as robotics, etc.

APA, Harvard, Vancouver, ISO, and other styles

29

Stergiou, Kostas. "Neighborhood singleton consistencies." Constraints 24, no. 1 (November 23, 2018): 94–131. http://dx.doi.org/10.1007/s10601-018-9298-1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Achinger, Piotr. "-neighborhoods and comparison theorems." Compositio Mathematica 151, no. 10 (June 5, 2015): 1945–64. http://dx.doi.org/10.1112/s0010437x15007319.

Full text

Abstract:

A technical ingredient in Faltings’ original approach to$p$-adic comparison theorems involves the construction of$K({\it\pi},1)$-neighborhoods for a smooth scheme$X$over a mixed characteristic discrete valuation ring with a perfect residue field: every point$x\in X$has an open neighborhood$U$whose generic fiber is a$K({\it\pi},1)$scheme (a notion analogous to having a contractible universal cover). We show how to extend this result to the logarithmically smooth case, which might help to simplify some proofs in$p$-adic Hodge theory. The main ingredient of the proof is a variant of a trick of Nagata used in his proof of the Noether normalization lemma.

APA, Harvard, Vancouver, ISO, and other styles

31

Barrus, Michael D., and Elizabeth A. Donovan. "Neighborhood degree lists of graphs." Discrete Mathematics 341, no. 1 (January 2018): 175–83. http://dx.doi.org/10.1016/j.disc.2017.08.027.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Ainouche, Ahmed. "β-neighborhood closures for graphs." Discrete Mathematics 309, no. 10 (May 2009): 2961–67. http://dx.doi.org/10.1016/j.disc.2008.06.016.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Vaughan, Diane E., Sheldon H. Jacobson, and Derek E. Armstrong. "A New Neighborhood Function for Discrete Manufacturing Process Design Optimization Using Generalized Hill Climbing Algorithms." Journal of Mechanical Design 122, no. 2 (March 1, 2000): 164–71. http://dx.doi.org/10.1115/1.533566.

Full text

Abstract:

Discrete manufacturing process design optimization can be difficult, due to the large number of manufacturing process design sequences and associated input parameter setting combinations that exist. Generalized hill climbing algorithms have been introduced to address such manufacturing design problems. Initial results with generalized hill climbing algorithms required the manufacturing process design sequence to be fixed, with the generalized hill climbing algorithm used to identify optimal input parameter settings. This paper introduces a new neighborhood function that allows generalized hill climbing algorithms to be used to also identify the optimal discrete manufacturing process design sequence among a set of valid design sequences. The neighborhood function uses a switch function for all the input parameters, hence allows the generalized hill climbing algorithm to simultaneously optimize over both the design sequences and the inputs parameters. Computational results are reported with an integrated blade rotor discrete manufacturing process design problem under study at the Materials Process Design Branch of the Air Force Research Laboratory, Wright Patterson Air Force Base (Dayton, Ohio, USA). [S1050-0472(00)01002-3]

APA, Harvard, Vancouver, ISO, and other styles

34

Qinghua Hu, W. Pedrycz, D. Yu, and Jun Lang. "Selecting Discrete and Continuous Features Based on Neighborhood Decision Error Minimization." IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics) 40, no. 1 (February 2010): 137–50. http://dx.doi.org/10.1109/tsmcb.2009.2024166.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Dong, Wenbo, Kang Zhou, Qinhong Fu, and Yingying Duan. "The Discrete Glowworm Swarm Optimization Algorithm with an Adaptive Neighborhood Search." Journal of Computational and Theoretical Nanoscience 13, no. 6 (June 1, 2016): 3824–34. http://dx.doi.org/10.1166/jctn.2016.5216.

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

Olender, Paweł, and Włodzimierz Ogryczak. "A revised Variable Neighborhood Search for the Discrete Ordered Median Problem." European Journal of Operational Research 274, no. 2 (April 2019): 445–65. http://dx.doi.org/10.1016/j.ejor.2018.10.010.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

Puerto, Justo, Dionisio Pérez-Brito, and Carlos G. García-González. "A modified variable neighborhood search for the discrete ordered median problem." European Journal of Operational Research 234, no. 1 (April 2014): 61–76. http://dx.doi.org/10.1016/j.ejor.2013.09.029.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

Luo, Qifang, Yongquan Zhou, Jian Xie, Mingzhi Ma, and Liangliang Li. "Discrete Bat Algorithm for Optimal Problem of Permutation Flow Shop Scheduling." Scientific World Journal 2014 (2014): 1–15. http://dx.doi.org/10.1155/2014/630280.

Full text

Abstract:

A discrete bat algorithm (DBA) is proposed for optimal permutation flow shop scheduling problem (PFSP). Firstly, the discrete bat algorithm is constructed based on the idea of basic bat algorithm, which divide whole scheduling problem into many subscheduling problems and then NEH heuristic be introduced to solve subscheduling problem. Secondly, some subsequences are operated with certain probability in the pulse emission and loudness phases. An intensive virtual population neighborhood search is integrated into the discrete bat algorithm to further improve the performance. Finally, the experimental results show the suitability and efficiency of the present discrete bat algorithm for optimal permutation flow shop scheduling problem.

APA, Harvard, Vancouver, ISO, and other styles

39

Qi, Yuanhang, and Yanguang Cai. "Hybrid Chaotic Discrete Bat Algorithm with Variable Neighborhood Search for Vehicle Routing Problem in Complex Supply Chain." Applied Sciences 11, no. 21 (October 28, 2021): 10101. http://dx.doi.org/10.3390/app112110101.

Full text

Abstract:

Driven by the supply chain, suppliers, manufacturers and warehouses are working more closely together for improving service quality. However, tremendous cost may incur in the supply chain if transportation is not planned properly and efficiently, which frustrates enterprises in the intense market. In this paper, we present a model of vehicle routing problem in complex supply chain (VRPCSC) and propose an intelligent algorithm called hybrid chaotic discrete bat algorithm with variable neighborhood search for minimizing the purchase cost of materials, processing cost, and delivery cost along the path from suppliers, to manufacturers and warehouses in the vehicle routing problem. Based on the principles of bat algorithm, a discrete chaotic initialization strategy (DCIS) and a variable neighborhood search (VNS) are adopted to enhance the convergence capacity. Finally, two sets of experiments are conducted, which show that the proposed algorithm can solve the VRPCSC effectively.

APA, Harvard, Vancouver, ISO, and other styles

40

Zelenyuk, Yevhen. "Local Homomorphisms of Topological Groups." Journal of the Australian Mathematical Society 83, no. 1 (August 2007): 135–48. http://dx.doi.org/10.1017/s1446788700036430.

Full text

Abstract:

AbstractA mapping f : G → s from a left topological group G into a semigroup S is a local homomorphism if for every x є G \ {e}, there is a neighborhood Ux of e such that f (xy) = f (x)f (y) for all y є Ux \ {e}. A local homomorphism f : G → S is onto if for every neighborhood U of e, f(U \ {e}) = S. We show that(1) every countable regular left topological group containing a discrete subset with exactly one accumulation point admits a local homomorphism onto N,(2) it is consistent that every countable topological group containing a discrete subset with exactly one accumulation point admits a local homomorphism onto any countable semigroup,(3) it is consistent that every countable nondiscrete maximally almost periodic topological group admits a local homomorphism onto the countably infinite right zero semigroup.

APA, Harvard, Vancouver, ISO, and other styles

41

Gutin, Gregory, and Anders Yeo. "Upper bounds on ATSP neighborhood size." Discrete Applied Mathematics 129, no. 2-3 (August 2003): 533–38. http://dx.doi.org/10.1016/s0166-218x(03)00181-1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

Björner*, Anders, and Mark de Longueville†. "Neighborhood Complexes of Stable Kneser Graphs." Combinatorica 23, no. 1 (January 2003): 23–34. http://dx.doi.org/10.1007/s00493-003-0012-5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Liu, Huiqing, Mei Lu, and Feng Tian. "Neighborhood unions and cyclability of graphs." Discrete Applied Mathematics 140, no. 1-3 (May 2004): 91–101. http://dx.doi.org/10.1016/j.dam.2003.05.002.

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

Seo, Suk J., and Peter J. Slater. "Open neighborhood locating–dominating in trees." Discrete Applied Mathematics 159, no. 6 (March 2011): 484–89. http://dx.doi.org/10.1016/j.dam.2010.12.010.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

Goldbarg, Elizabeth F. G., Nelson Maculan, and Marco C. Goldbarg. "A New Neighborhood for the QAP." Electronic Notes in Discrete Mathematics 30 (February 2008): 3–8. http://dx.doi.org/10.1016/j.endm.2008.01.002.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

Schweitzer, Pascal. "Iterated open neighborhood graphs and generalizations." Discrete Applied Mathematics 161, no. 10-11 (July 2013): 1598–609. http://dx.doi.org/10.1016/j.dam.2012.12.023.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Jiamjitrak, Wanchote, and Erik Jan van Leeuwen. "Co-Bipartite Neighborhood Edge Elimination Orderings." Electronic Notes in Discrete Mathematics 61 (August 2017): 655–61. http://dx.doi.org/10.1016/j.endm.2017.07.020.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Bryant, David. "The Splits in the Neighborhood of a Tree." Annals of Combinatorics 8, no. 1 (May 2004): 1–11. http://dx.doi.org/10.1007/s00026-004-0200-z.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Juhász, István, Vladimir V. Tkachuk, and Richard G. Wilson. "Weakly linearly lindelöf monotonically normal spaces are lindelöf." Studia Scientiarum Mathematicarum Hungarica 54, no. 4 (December 2017): 523–35. http://dx.doi.org/10.1556/012.2017.54.4.1383.

Full text

Abstract:

A space X is weakly linearly Lindelöf if for any family U of non-empty open subsets of X of regular uncountable cardinality κ, there exists a point x ∈ X such that every neighborhood of x meets κ-many elements of U. We also introduce the concept of almost discretely Lindelöf spaces as the ones in which every discrete subspace can be covered by a Lindelöf subspace. We prove that, in addition to linearly Lindelöf spaces, both weakly Lindelöf spaces and almost discretely Lindelöf spaces are weakly linearly Lindelöf. The main result of the paper is formulated in the title. It implies that every weakly Lindelöf monotonically normal space is Lindelöf, a result obtained earlier in [3]. We show that, under the hypothesis 2ω < ωω, if the co-diagonal ΔcX = (X × X) \ΔX is discretely Lindelöf, then X is Lindelöf and has a weaker second countable topology; here ΔX = {(x, x): x ∈ X} is the diagonal of the space X. Moreover, discrete Lindelöfness of ΔcX together with the Lindelöf Σ-property of X imply that X has a countable network.

APA, Harvard, Vancouver, ISO, and other styles

50

Yin, Xunwu. "On Asymptotic Behavior for Reaction Diffusion Equation with Small Time Delay." Abstract and Applied Analysis 2011 (2011): 1–13. http://dx.doi.org/10.1155/2011/142128.

Full text

Abstract:

We investigate the asymptotic behavior of scalar diffusion equation with small time delayut-Δu=f(ut,u(t-τ)). Roughly speaking, any bounded solution will enter and stay in the neighborhood of one equilibrium when the equilibria are discrete.

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!