Search results for: variable neighborhood search

Authors: Aydin Teymourifar, Gurkan Ozturk, Ozan Bahadir

Abstract:

In this paper, a new neural network based variable neighborhood search is proposed for the multi-objective dynamic, flexible job shop scheduling problems. The neural network controls the problems' constraints to prevent infeasible solutions, while the Variable Neighborhood Search (VNS) applies moves, based on the critical block concept to improve the solutions. Two approaches are used for managing the constraints, in the first approach, infeasible solutions are modified according to the constraints, after the moves application, while in the second one, infeasible moves are prevented. Several neighborhood structures from the literature with some modifications, also new structures are used in the VNS. The suggested neighborhoods are more systematically defined and easy to implement. Comparison is done based on a multi-objective flexible job shop scheduling problem that is dynamic because of the jobs different release time and machines breakdowns. The results show that the presented method has better performance than the compared VNSs selected from the literature.

Keywords: constrained optimization, neural network, variable neighborhood search, flexible job shop scheduling, dynamic multi-objective optimization

Procedia PDF Downloads 319

Authors: G. M. Komaki, S. Mobin, E. Teymourian, S. Sheikh

Abstract:

This paper addresses minimizing the makespan of the distributed permutation flow shop scheduling problem. In this problem, there are several parallel identical factories or flowshops each with series of similar machines. Each job should be allocated to one of the factories and all of the operations of the jobs should be performed in the allocated factory. This problem has recently gained attention and due to NP-Hard nature of the problem, metaheuristic algorithms have been proposed to tackle it. Majority of the proposed algorithms require large computational time which is the main drawback. In this study, a general variable neighborhood search algorithm (GVNS) is proposed where several time-saving schemes have been incorporated into it. Also, the GVNS uses the sophisticated method to change the shaking procedure or perturbation depending on the progress of the incumbent solution to prevent stagnation of the search. The performance of the proposed algorithm is compared to the state-of-the-art algorithms based on standard benchmark instances.

Keywords: distributed permutation flow shop, scheduling, makespan, general variable neighborhood search algorithm

Procedia PDF Downloads 327

Authors: Watcharapan Sukkerd, Teeradej Wuttipornpun

Abstract:

This paper aims to present non-population search algorithms called tabu search (TS), simulated annealing (SA) and variable neighborhood search (VNS) to minimize the total cost of capacitated MRP problem in multi-stage assembly flow shop with two alternative machines. There are three main steps for the algorithm. Firstly, an initial sequence of orders is constructed by a simple due date-based dispatching rule. Secondly, the sequence of orders is repeatedly improved to reduce the total cost by applying TS, SA and VNS separately. Finally, the total cost is further reduced by optimizing the start time of each operation using the linear programming (LP) model. Parameters of the algorithm are tuned by using real data from automotive companies. The result shows that VNS significantly outperforms TS, SA and the existing algorithm.

Keywords: capacitated MRP, tabu search, simulated annealing, variable neighborhood search, linear programming, assembly flow shop, application in industry

Procedia PDF Downloads 209

Authors: Houda Abadlia, Nadia Smairi, Khaled Ghedira

Abstract:

Multiobjective Particle Swarm Optimization (MOPSO) has shown an effective performance for solving test functions and real-world optimization problems. However, this method has a premature convergence problem, which may lead to lack of diversity. In order to improve its performance, this paper presents a hybrid approach which embedded the MOPSO into the island model and integrated a local search technique, Variable Neighborhood Search, to enhance the diversity into the swarm. Experiments on two series of test functions have shown the effectiveness of the proposed approach. A comparison with other evolutionary algorithms shows that the proposed approach presented a good performance in solving multiobjective optimization problems.

Keywords: particle swarm optimization, migration, variable neighborhood search, multiobjective optimization

Procedia PDF Downloads 139

Authors: Majid Khalili

Abstract:

This paper deals with a bi-objective hybrid no-wait flowshop scheduling problem minimizing the makespan and total weighted tardiness, in which we consider transportation times between stages. Obtaining an optimal solution for this type of complex, large-sized problem in reasonable computational time by using traditional approaches and optimization tools is extremely difficult. This paper presents a new multi-objective variable neighborhood algorithm (MOVNS). A set of experimental instances are carried out to evaluate the algorithm by advanced multi-objective performance measures. The algorithm is carefully evaluated for its performance against available algorithm by means of multi-objective performance measures and statistical tools. The related results show that a variant of our proposed MOVNS provides sound performance comparing with other algorithms.

Keywords: no-wait hybrid flowshop scheduling; multi-objective variable neighborhood algorithm; makespan; total weighted tardiness

Procedia PDF Downloads 395

Authors: Abdolsalam Ghaderi

Abstract:

In this paper, the single-depot capacitated location-routing problem under uncertainty is presented. The problem aims to find the optimal location of a single depot and the routing of vehicles to serve the customers when the parameters may change under different circumstances. This problem has many applications, especially in the area of supply chain management and distribution systems. To get closer to real-world situations, travel time of vehicles, the fixed cost of vehicles usage and customers’ demand are considered as a source of uncertainty. A combined approach including robust optimization and stochastic programming was presented to deal with the uncertainty in the problem at hand. For this purpose, a mixed integer programming model is developed and a heuristic algorithm based on Variable Neighborhood Search(VNS) is presented to solve the model. Finally, the computational results are presented and future research directions are discussed.

Keywords: location-routing problem, robust optimization, stochastic programming, variable neighborhood search

Procedia PDF Downloads 243

Authors: Masoud Shahmanzari

Abstract:

The aim of this paper is to present a Variable Neighborhood Search (VNS) with Tabu Search (TS) conditions for the Roaming Salesman Problem (RSP). The RSP is a special case of the well-known traveling salesman problem (TSP) where a set of cities with time-dependent rewards and a set of campaign days are given. Each city can be visited on any day and a subset of cities can be visited multiple times. The goal is to determine an optimal campaign schedule consist of daily open/closed tours that visit some cities and maximizes the total net benefit while respecting daily maximum tour duration constraints and the necessity to return campaign base frequently. This problem arises in several real-life applications and particularly in election logistics where depots are not fixed. We formulate the problem as a mixed integer linear programming (MILP), in which we capture as many real-world aspects of the RSP as possible. We also present a hybrid metaheuristic algorithm based on a VNS with TS conditions. The initial feasible solution is constructed via a new matheuristc approach based on the decomposition of the original problem. Next, this solution is improved in terms of the collected rewards using the proposed local search procedure. We consider a set of 81 cities in Turkey and a campaign of 30 days as our largest instance. Computational results on real-world instances show that the developed algorithm could find near-optimal solutions effectively.

Keywords: optimization, routing, election logistics, heuristics

Procedia PDF Downloads 55

Authors: Khashayar Kashani Jou, Ilnaz Fathololoomi

Abstract:

Nowadays, access to sustainable development in cities is assumed as one of the most important goals of urban managers. In the meanwhile, neighborhood as the smallest unit of urban spatial organization has a substantial effect on urban sustainability. Hence, attention to and focus on this subject is highly important in urban development plans. The objective of this study is evaluation of the status of Jahanshahr Neighborhood in Karaj city based on sustainable neighborhood development indicators. This research has been applied based on documentary method and field surveys. Also, evaluating of Jahanshahr Neighborhood of Karaj shows that it has a high level in sustainability in physical and economical dimension while a low level in cultural and social dimension. For this purpose, this neighborhood as a semi-sustainable neighborhood must take measures for development of collective spaces and efficiency of utilizing the public neighborhood spaces via collaboration of citizens and officials.

Keywords: neighborhood, sustainable development, sustainable neighborhood development, Jahanshahr neighborhood

Procedia PDF Downloads 242

Authors: Raed Alnajjar, Mohd Zakree, Ahmad Nazri

Abstract:

In this study, we apply Discrete Group Search Optimizer (DGSO) for solving Traveling Salesman Problem (TSP). The DGSO is a nature inspired optimization algorithm that imitates the animal behavior, especially animal searching behavior. The proposed DGSO uses a vector representation and some discrete operators, such as destruction, construction, differential evolution, swap and insert. The TSP is a well-known hard combinatorial optimization problem, which seeks to find the shortest path among numbers of cities. The performance of the proposed DGSO is evaluated and tested on benchmark instances which listed in LIBTSP dataset. The experimental results show that the performance of the proposed DGSO is comparable with the other methods in the state of the art for some instances. The results show that DGSO outperform Ant Colony System (ACS) in some instances whilst outperform other metaheuristic in most instances. In addition to that, the new results obtained a number of optimal solutions and some best known results. DGSO was able to obtain feasible and good quality solution across all dataset.

Keywords: discrete group search optimizer (DGSO); Travelling salesman problem (TSP); Variable neighborhood search(VNS)

Procedia PDF Downloads 294

Authors: Lin Zhang

Abstract:

Neighborhood redevelopment is vital to improve residents’ living environment, and there has been a national neighborhood micro-redevelopment initiative in China since 2020, which is largely different from the previous large-scale demolition and reconstruction projects. Yet, few studies systematically examine the new interactions of multiple actors in this initiative. China’s neighborhood (micro-) redevelopment is a kind of governance network, and the complexity perspective could reflect the dynamic nature of multiple actors and their relationships in governance networks. In order to better understand the fundamental shifts of governance networks in China’s neighborhood micro-redevelopment, this paper adopted a theoretical framework of complexity in governance networks and analyzed the new governance networks of neighborhood micro-redevelopment projects in Haikou accordingly.

Keywords: neighborhood redevelopment, governance, networks, Haikou

Procedia PDF Downloads 43

Authors: Soner Nandappa D., Ahmed Mohammed Naji

Abstract:

In a graph G = (V, E), the distance from a vertex v to a vertex u is the length of shortest v to u path. The eccentricity e(v) of v is the distance to a farthest vertex from v. The diameter diam(G) is the maximum eccentricity. The k-distance neighborhood of v, for 0 ≤ k ≤ e(v), is Nk(v) = {u ϵ V (G) : d(v, u) = k}. In this paper, we introduce a new distance degree based topological polynomial of a graph G is called a k- distance neighborhood polynomial, denoted Nk(G, x). It is a polynomial with the coefficient of the term k, for 0 ≤ k ≤ e(v), is the sum of the cardinalities of Nk(v) for every v ϵ V (G). Some properties of k- distance neighborhood polynomials are obtained. Exact formulas of the k- distance neighborhood polynomial for some well-known graphs, Cartesian product and join of graphs are presented.

Keywords: vertex degrees, distance in graphs, graph operation, Nk-polynomials

Procedia PDF Downloads 500

Authors: Abdulaziz Alageel, Martino Luis, Shuya Zhong

Abstract:

The main focus of this research study is on the challenges faced in decision-making in a supply chain network regarding the facility location while considering carbon emissions. The study aims (i) to locate facilities (i.e., distribution centeres) in a continuous space considering limitations of capacity and the costs associated with opening and (ii) to reduce the cost of carbon emissions by selecting the mode of transportation. The problem is formulated as mixed-integer linear programming. This study hybridised a greedy randomised adaptive search (GRASP) and variable neighborhood search (VNS) to deal with the problem. Well-known datasets from the literature (Brimberg et al. 2001) are used and adapted in order to assess the performance of the proposed method. The proposed hybrid method produces encouraging results based on computational analysis. The study also highlights some research avenues for future recommendations.

Keywords: supply chain, facility location, weber problem, sustainability

Procedia PDF Downloads 71

Authors: X. Li, J. Sundquist, C. Sjöstedt, M. Winkleby, K. S. Kendler, K. Sundquist

Abstract:

Aims: This study examines the association between the incidence of drug abuse (DA) and linking (communal) social capital, a theoretical concept describing the amount of trust between individuals and societal institutions. Methods: We present results from an 8-year population-based cohort study that followed all residents in Sweden, aged 15-44, from 2003 through 2010, for a total of 1,700,896 men and 1,642,798 women. Social capital was conceptualized as the proportion of people in a geographically defined neighborhood who voted in local government elections. Multilevel logistic regression was used to estimate odds ratios (ORs) and between-neighborhood variance. Results: We found robust associations between linking social capital (scored as a three level variable) and DA in men and women. For men, the OR for DA in the crude model was 2.11 [95% confidence interval (CI) 2.02-2.21] for those living in areas with the lowest vs. highest level of social capital. After accounting for neighborhood-level deprivation, the OR fell to 1.59 (1.51-1-68), indicating that neighborhood deprivation lies in the pathway between linking social capital and DA. The ORs remained significant after accounting for age, sex, family income, marital status, country of birth, education level, and region of residence, and after further accounting for comorbidities and family history of comorbidities and family history of DA. For women, the OR decreased from 2.15 (2.03-2.27) in the crude model to 1.31 (1.22-1.40) in the final model, adjusted for multiple neighborhood-level and individual-level variables. Conclusions: Our study suggests that low linking social capital may have important independent effects on DA.

Keywords: drug abuse, social linking capital, environment, family

Procedia PDF Downloads 446

Authors: Kimiyo Shimomai, Mihoko Harada

Abstract:

This study is a literature review of the psychological reactions that occur in end-of-life cancer patients who are nearing death. It searched electronic databases and selected literature related to psychological studies of end-of-life patients. There was no limit on the search period, and the search was conducted until the second week of December 2021. The keywords were specified as “death and dying”, “terminal illness”, “end-of-life”, “palliative care”, “psycho-oncology” and “research”. These literatures referred to Holly (2017): Comprehensive Systematic Review for Advanced Practice Nursing, P268 Figure 10.3 to ensure quality. These literatures were selected with a dissertation score of 4 or 5. The review was conducted in two stages with reference to the procedure of George (2002). First, these references were searched for keywords in the database, and then relevant references were selected from the psychology and nursing studies of end-of-life patients. The number of literatures analyzed was 76 for overseas and 17 for domestic. As for the independent variables, "physical variable" was the most common in 36 literatures (66.7%), followed by "psychological variable" in 35 literatures (64.8%), "spiritual variable" in 21 literatures (38%), and "social variable" in 17 literatures. (31.5%), "Variables related to medical care / treatment" were 16 literatures (29.6%). To summarize the relationship between these independent variables and the dependent variable, when the dependent variable is "psychological variable", the independent variables are "psychological variable", "social variable", and "physical variable". Among the independent variables, the physical variables were the most common. The psychological responses that occur in end-stage cancer patients who are nearing death are mutually influenced by psychological, social, and physical variables. Therefore, it supported the "total pain" advocated by Cicely Saunders.

Keywords: cancer patient, end-of-life, literature review, psychological process

Procedia PDF Downloads 99

Authors: Aydin Teymourifar, Gurkan Ozturk

Abstract:

In this paper, a hybrid Tabu Search (TS) algorithm is suggested for the multi-objective job shop scheduling problems (MO-JSSPs). The algorithm integrates several shifting bottleneck based neighborhood structures with the Giffler & Thompson algorithm, which improve efficiency of the search. Diversification and intensification are provided with local and global left shift algorithms application and also new semi-active, active, and non-delay schedules creation. The suggested algorithm is tested in the MO-JSSPs benchmarks from the literature based on the Pareto optimality concept. Different performances criteria are used for the multi-objective algorithm evaluation. The proposed algorithm is able to find the Pareto solutions of the test problems in shorter time than other algorithm of the literature.

Keywords: tabu search, heuristics, job shop scheduling, multi-objective optimization, Pareto optimality

Procedia PDF Downloads 412

Authors: Nejah Ben Mabrouk, Bassem Jarboui, Habib Chabchoub

Abstract:

Production and distribution planning is the most important part in supply chain management. In this paper, a NP-hard production-distribution problem for one product over a multi-period horizon is investigated. The aim is to minimize the sum of costs of three items: production setups, inventories and distribution, while determining, for each period, the amount produced, the inventory levels and the delivery trips. To solve this difficult problem, we propose a bi-phase approach based on a Variable Neighbourhood Search (VNS). This heuristic is tested on 90 randomly generated instances from the literature, with 20 periods and 50, 100, 200 customers. Computational results show that our approach outperforms existing solution procedures available in the literature

Keywords: logistic, production, distribution, variable neighbourhood search

Procedia PDF Downloads 303

Authors: Shahpar Yilmaz, Yasir Nadeem, Syed A. Mehdi

Abstract:

Searching for a record in a dataset is always a frequent task for any data structure-related application. Hence, a fast and efficient algorithm for the approach has its importance in yielding the quickest results and enhancing the overall productivity of the company. Interpolation search is one such technique used to search through a sorted set of elements. This paper proposes a new algorithm, an advancement over interpolation search for the application of search over a sorted array. Pattern Recognition Search or PR Search (PRS), like interpolation search, is a pattern-based divide and conquer algorithm whose objective is to reduce the sample size in order to quicken the process and it does so by treating the array as a perfect arithmetic progression series and thereby deducing the key element’s position. We look to highlight some of the key drawbacks of interpolation search, which are accounted for in the Pattern Recognition Search.

Keywords: array, complexity, index, sorting, space, time

Procedia PDF Downloads 198

Authors: Elif Aksel, Çagrı Imamoglu

Abstract:

This ongoing study aims to investigate the effects of neighborhood location on place attachment and residential satisfaction. Place attachment will be examined by comparing place of residence in different areas of the city. Furthermore, the relationship between neighborhood and residential satisfaction will be investigated in terms of physical and social aspects of the places influencing residential satisfaction. This study will be carried out in two different districts of Ankara which are Çankaya, located in the city center, and Sincan, a suburb. Two-hundred adult respondents will participate in this research; 100 men and 100 women aged between 18-65 years with different socio-economic status using snowball sampling. A place attachment scale and a questionnaire related with residential satisfaction, including open-ended questions and 7-point Likert type scale, will be used as instruments. Apart from these, demographic information of the participants such as gender, age, education, the length of residence will be collected. The findings of the study are expected to demonstrate that neighborhood is seen to be influential on place attachment by affecting the intensity of attachment. The level of place attachment is expected to be greater in areas far from the city compared to areas in the center of the city. Apart from this, the neighborhood is also effective in residential satisfaction. The residents living in these neighborhoods having strong physical and social opportunities will be expected to have higher residential satisfaction.

Keywords: neighborhood, neighborhood satisfaction, place attachment, residential satisfaction

Procedia PDF Downloads 283

Authors: Saman Sobhani

Abstract:

Historical neighborhoods have special values inside them, and, in addition to inducing a sense of collective memories, they have to have some criteria in respect of achieving desirable environmental quality in order for citizens to live. From the perspective of urban planners and designers, a neighborhood as an urban space has to satisfy various needs of citizens in terms of activities as well as their spiritual requirements. In the research based on the component of environmental quality in one of the neighborhoods with historical value resulting from the theoretical model presented (functional-structural, physical-spatial, and substantive), integrated analysis has been performed on the Khajeh Khezr neighborhood in Kerman. Then, after studying the weaknesses and strengths points of it based on the AIDA model, some mechanisms have been presented to promote environmental quality based on neighborhood organization, and related urban design projects have been defined accordingly. Analyzing the findings shows that inhabitants in the Khajeh Khezr neighborhood are not much satisfied with the quality of the urban environment of the neighborhood. In the research, the descriptive-analytical method and review of texts have been used in the form of library studies, and case study has been applied as well as observation and questionnaire in the form of field studies.

Keywords: environmental quality, Kerman, Khajeh Khezr, neighborhood

Procedia PDF Downloads 57

Authors: Kirstie Smith

Abstract:

This paper elucidates the value of neighborhood perception as it contributes to the advancement of well-being for individuals and families within a neighborhood. Through in-depth interviews with city residents, this paper examines the degree to which key stakeholders’ (residents) evaluate their neighborhood and perception of resources and identify, access, and utilize local assets existing in the community. Additionally, the research objective included conducting a community inventory that qualified the community assets and resources of lower-income neighborhoods of a medium-sized industrial city. Analysis of the community’s assets was compared with the interview results to allow for a better understanding of the community’s condition. Community mapping revealed the key informants’ reflections of assets were somewhat validated. In each neighborhood, there were more assets mapped than reported in the interviews. Another chief supposition drawn from this study was the identification of key development partners and social networks that offer the potential to facilitate locally-driven community development. Overall, the participants provided invaluable local knowledge of the perception of neighborhood assets, the well-being of residents, the condition of the community, and suggestions for responding to the challenges of the entire community in order to mobilize the present assets and networks.

Keywords: community mapping, family, resource allocation, social networks

Procedia PDF Downloads 312

Authors: Marie Oslène Honorat

Abstract:

Porto Belo is a neighborhood in the city of Foz do Iguaçu / PR, located in the Vila C region of Brazil. It is a project that addresses the question of the dirt generated by the neighborhood community about how they dispose and recycle domestic waste. This project aimed at raising awareness among residents, on how important it is to preserve the environment and take care, especially of the space in which we are located. Living this way manages to minimize the exploitation of natural resources, soil and water pollution. After collecting information about what one saw, we questioned some people in the neighborhood to find out about selective collection, recycling, and the separation and final destination of garbage. From the study, it was possible to verify the importance of placing more trash cans on neighborhood streets, where garbage is discarded, and the importance of promoting environmental education to improve the environment and quality of life. The methodology used in this research was a qualitative methodology that seeks the principle of transforming reality through investigation.

Keywords: awareness, recycling, selective collection, waste disposal

Procedia PDF Downloads 17

Authors: Boumesbah Asma, Chergui Mohamed El-amine

Abstract:

Since it has been shown that the multi-objective minimum spanning tree problem (MOST) is NP-hard even with two criteria, we propose in this study a hybrid NSGA-II algorithm with an exact mutation operator, which is only used with low probability, to find an approximation to the Pareto front of the problem. In a connected graph G, a spanning tree T of G being a connected and cycle-free graph, if k edges of G\T are added to T, we obtain a partial graph H of G inducing a reduced size multi-objective spanning tree problem compared to the initial one. With a weak probability for the mutation operator, an exact method for solving the reduced MOST problem considering the graph H is then used to give birth to several mutated solutions from a spanning tree T. Then, the selection operator of NSGA-II is activated to obtain the Pareto front approximation. Finally, an adaptation of the VNS metaheuristic is called for further improvements on this front. It allows finding good individuals to counterbalance the diversification and the intensification during the optimization search process. Experimental comparison studies with an exact method show promising results and indicate that the proposed algorithm is efficient.

Keywords: minimum spanning tree, multiple objective linear optimization, combinatorial optimization, non-sorting genetic algorithm, variable neighborhood search

Procedia PDF Downloads 61

Authors: Venkata Ravi Kumar Veluru

Abstract:

Indian traditional neighborhoods are socially active and sometimes intrusive communities, which are losing their qualities due to western influences, undermining the traditional Indian values by blind adaptation of western neighborhood concepts since the scale is not suitable to the Indian context. This paper aims to understand the qualities of Indian traditional neighborhoods by evaluating a traditional neighborhood of Jaipur, comparing it with a modern planned neighborhood of Chandigarh, designed by a foreign planner, in the neighborhood concept of the western world, to find out the special qualities of traditional Indian neighborhoods as compared to western concepts in terms of social spaces, by way of physical observation of selected neighborhoods and residents structured questionnaire survey. The combined analysis found that social spaces are abundantly available in traditional neighborhoods, which are missing in modern neighborhoods, which are the main qualities where interactions happen, aiming towards the formation of social capital. The qualities of traditional neighborhoods have to be considered while designing new neighborhoods in India.

Keywords: Indian neighborhoods, modern neighborhoods, neighborhood planning, social spaces, traditional neighborhoods

Procedia PDF Downloads 83

Authors: Vasudha Saraogi

Abstract:

Heritage hotels are architectural marvels and embody a number of values of heritage discourses within them. The adaptive re-use of old structures to make them commercially viable as heritage hotels, not only boosts tourism and the local economy but also brings in development for the neighborhood in which it is located. This paper seeks to study the value created by heritage hotels in general and French Haveli (Ahmedabad) in particular using the single case study methodology. The paper draws upon the concept of the Italian model of Albergo Diffuso and its implementation via French Haveli, for value creation and development in Dhal Ni Pol (a historic neighborhood) while recognizing the importance of stakeholders to the process of the historic neighborhood upliftment.

Keywords: heritage discourses, historic neighborhoods, heritage hotel, Old City Ahmedabad

Procedia PDF Downloads 167

Authors: Daljinder Singh, J.S.Dhillon, Balraj Singh

Abstract:

According to no free lunch theorem, a single search technique cannot perform best in all conditions. Optimization method can be attractive choice to solve optimization problem that may have exclusive advantages like robust and reliable performance, global search capability, little information requirement, ease of implementation, parallelism, no requirement of differentiable and continuous objective function. In order to synergize between exploration and exploitation and to further enhance the performance of Bat algorithm, the paper proposed a modified bat algorithm that adds additional search procedure based on bat’s previous experience. The proposed algorithm is used for solving the economic load dispatch (ELD) problem. The practical constraint such valve-point loading along with power balance constraints and generator limit are undertaken. To take care of power demand constraint variable elimination method is exploited. The proposed algorithm is tested on various ELD problems. The results obtained show that the proposed algorithm is capable of performing better in majority of ELD problems considered and is at par with existing algorithms for some of problems.

Keywords: bat algorithm, economic load dispatch, penalty method, variable elimination method

Procedia PDF Downloads 436

Authors: Omar Dib, Alexandre Caminada, Marie-Ange Manier

Abstract:

The purpose of this study is to introduce a novel approach to solve the one-to-one shortest path problem. A directed connected graph is assumed in which all edges’ weights are positive. Our method is based on a memetic algorithm in which we combine a genetic algorithm (GA) and a variable neighborhood search method (VNS). We compare our approximate method with two exact algorithms Dijkstra and Integer Programming (IP). We made experimentations using random generated, complete and real graph instances. In most case studies, numerical results show that our method outperforms exact methods with 5% average gap to the optimality. Our algorithm’s average speed is 20-times faster than Dijkstra and more than 1000-times compared to IP. The details of the experimental results are also discussed and presented in the paper.

Keywords: shortest path problem, Dijkstra’s algorithm, integer programming, memetic algorithm

Procedia PDF Downloads 434

Authors: Wan Jiun Tin

Abstract:

Neighborhood regeneration has gained its popularity despite market-led urban redevelopment is still the main strategy in most of the countries in Asia. Area-based approach of neighborhood regeneration with the focus on people, place and system which covers the main sustainable aspects shall be studied as part of the solution. Project implementation in small scale without fully depending on the financial support from the government and main stakeholders is the advantage of neighborhood regeneration. This enables the improving and upgrading of living conditions to be ongoing even during the economy downturn. In addition to that, there will be no specific selection on the development areas as the entire nation share the similar opportunity to upgrade and to improve their neighborhood. This is important to narrow the income disparities in urban. The objective of this paper is to review and to summarize the urban regeneration in developed countries with the focus on Korea, Singapore and Hong Kong. The aim is to determine the direction of sustainable urban regeneration in Malaysia for post-Vision 2020 through the introduction of neighborhood regeneration. This paper is conducted via literature review and observations in those selected countries. In conclusion, neighborhood regeneration shall be one of the approach of sustainable urban regeneration in Malaysia. A few criteria have been identified and to be recommended for the adaptation in Malaysia.

Keywords: area-based regeneration, public participation, sustainable urban regeneration, urban redevelopment

Procedia PDF Downloads 241

Authors: Zeinab Aliyas

Abstract:

Walking is known as the most common type of physical activity that helps mental and physical health of people. In the recent years, promoting walking activity in neighborhood areas and cities become as one of the important issues in terms of sustainable cities. Therefore the study aimed to investigate the influence of fear of crime and personal barriers as social and personal factor respectively on neighborhood walking. 464 questionnaires in Bandar Baru Bangi in Malaysia was distributed to collect data, and finally, 424 questionnaires were qualified to be used in the study. The Smart-PLS was used to analyze the data. The findings of the study revealed that individual barriers and fear of crime both have significant influence on the level of walking behavior in the neighborhood area. It was found that fear of crime has higher influence on walking behavior in comparison to individual factors. The finding of this study can help urban researcher and planner to know the significant influence of crime safety and individual attitudes on the level of walking activity.

Keywords: fear of crime, neighborhood walking, personal barriers, residential neighborhood

Procedia PDF Downloads 150

Authors: Guangyuan Zhao, Nan Huang, Xuesong Han, Xu Huang

Abstract:

In order to solve the problem of sample dilution in the traditional particle filter algorithm and achieve accurate state estimation in a nonlinear system, a particle filter method based on an improved artificial bee colony (ABC) algorithm was proposed. The algorithm simulated the process of bee foraging and optimization and made the high likelihood region of the backward probability of particles moving to improve the rationality of particle distribution. The opposition-based learning (OBL) strategy is introduced to optimize the initial population of the artificial bee colony algorithm. The convergence factor is introduced into the neighborhood search strategy to limit the search range and improve the convergence speed. Finally, the crossover and mutation operations of the genetic algorithm are introduced into the search mechanism of the following bee, which makes the algorithm jump out of the local extreme value quickly and continue to search the global extreme value to improve its optimization ability. The simulation results show that the improved method can improve the estimation accuracy of particle filters, ensure the diversity of particles, and improve the rationality of particle distribution.

Keywords: particle filter, impoverishment, state estimation, artificial bee colony algorithm

Procedia PDF Downloads 97

Authors: Aydin Teymourifar, Gurkan Ozturk, Ozan Bahadir

Abstract:

NSGA-II is one of the most well-known and most widely used evolutionary algorithms. In addition to its new versions, such as NSGA-III, there are several modified types of this algorithm in the literature. In this paper, a hybrid NSGA-II algorithm has been suggested for solving the multi-objective flexible job shop scheduling problem. For a better search, new neighborhood-based crossover and mutation operators are defined. To create new generations, the neighbors of the selected individuals by the tournament selection are constructed. Also, at the end of each iteration, before sorting, neighbors of a certain number of good solutions are derived, except for solutions protected by elitism. The neighbors are generated using a constraint-based neural network that uses various constructs. The non-dominated sorting and crowding distance operators are same as the classic NSGA-II. A comparison based on some multi-objective benchmarks from the literature shows the efficiency of the algorithm.

Keywords: flexible job shop scheduling problem, multi-objective optimization, NSGA-II algorithm, neighborhood structures

Procedia PDF Downloads 190