neighbourhood search
Optimisation of transportation service network using κ node large neighbourhood search
... variable neighbourhood search based metaheuristic approach for the service network design with stochastic demand, a problem sharing similar structure to ...the neighbourhood functions used in their ...
21
A Hybrid Water Flow-Like Algorithm and Variable Neighbourhood Search for Traveling Salesman Problem
... Abstract—Various metaheuristic methods have been proposed earlier and applied for solving the Travelling Salesman Problem (TSP). Water Flow Algorithm (WFA) is one of the recent population-based metaheuristic optimization ...
7
A Variable Neighbourhood Search for nurse scheduling with balanced preference satisfaction
... Variable Neighbourhood Search (VNS) metaheuristic algorithm to tackle this problem, incorporating two novel heuristics tailored to the ...the search space using a priority list of candidate workers ...
10
A multi-arm bandit neighbourhood search for routing and scheduling problems
... local search neighbourhood as a dynamic multi- armed bandit (D-MAB) problem where learning techniques for solving the D-MAB can be used to guide the local search ...D-MAB neighbourhood ...
34
Large neighbourhood search with adaptive guided ejection search for the pickup and delivery problem with time windows
... tailored neighbourhood moves within a streamlined version of adaptive large neighbourhood search [20] also incorporating guided ejection search ...of search mechanisms can result in a ...
25
Genetic Algorithm and Variable neighbourhood search for BDD Variable Ordering Problem
... heuristic search procedures are recognized as the neighboring structures (NS), which transform a solution to one of its neighbourhood by applying some ...Variable neighbourhood search (VNS) ...
8
A variable neighbourhood search algorithm with compound neighbourhoods for VRPTW
... Variable Neighbourhood Search algorithm with Compound Neighbourhoods is proposed to solve VRPTW in this ...independent neighbourhood operators are composed into compound neighbourhood ...
11
Optimisation of transportation service network using κ node large neighbourhood search
... new neighbourhood function has shown its effectiveness by producing very promising results, obtaining the new best-known results for many ...larger neighbourhood sizes and abilities to maintain ...other ...
13
AN EFFICIENT ALGORITHM FOR PRIVACY IN NEAREST NEIGHBOURHOOD SEARCH IN MQMO FOR POINT CLOUDS
... Module 3: The proposed system uses RK-NN (Reverse K-Nearest Neighbor) technique for retrieving spatial results for the given spatial query. The bidirectional K- NN (RK-NN) take search to the next level and ...
6
Application of Adaptive Large Neighbourhood Search for a Rich and Real World Vehicle Routing Problem
... Li et al. (2015) claim that the standard ALNS is improved by combining it with a iterated local search. This claim is based on benchmark cases for single depot VRP. Substantiation for the MDVRP is not given. That ...
103
Heuristic Neighbourhood Search Approach for Bulk Transportation Problem
... Abstract. The bulk transportation problems are to minimize the cost of carrying goods or people from sources to destinations using different types of transportation modes. In this paper, we studied a model of “heuristic ...
12
SMART WEB BASED APPLICATION FOR INTERNET DIRECT CONSUMER TO CONSUMER TRADING
... The rapid development of information technology has facilitated an elegant trading environment in the Internet. An online web application called Student-Trade has been developed. It is a state-of-the-art platform for ...
5
Grouped Bees Algorithm: A Grouped Version of the Bees Algorithm
... basic neighbourhood search method, two more methods are introduced in [43] to cope with multi-objective problems, where the “pareto” curve is formed by “all the non-dominated bees in each ...simple ...
15
Online Full Text
... harmony search algorithm (HSA) is compared with its ...variable neighbourhood search method (VNSM) philosophy including a modified simplex method ...
6
Variable depth adaptive large meighbourhood search algorithm for Open Periodic Vehicle Routing Problem with time windows
... in search. In Variable Depth Neighbourhood Search, large neighbourhood depth prevents the search from trapping into local optima prematurely, while small depth provides thorough ...
10
On minimizing coding operations in network coding based multicast: an evolutionary algorithm
... We first investigate the effectiveness of the two extensions in EA, i.e. the OR- based crossover and the neighbourhood search operator, respectively. Experiments were conducted on four testing networks, ...
31
A critical Comparison of Graph Clustering Algorithms Using the K-clique Percolation Technique
... In recent past RNSC, MCL came into the field of graph clustering and each algorithm has it‟s own method and relies on a very different approach. RNSC, which is a cost based clustering method and performs some local ...
5
Few heuristic optimization algorithms to solve the multi-period fixed charge production-distribution problem
... population search heuristic, Simulated annealing algorithm (SAA) based neighbourhood search heuristic and an Equivalent variable cost (EVC) based simple heuristic are proposed to solve the ...
11
Neighbourhood reputation and the intention to leave the neighbourhood
... of neighbourhood satisfaction and perceived neighbourhood reputation can be expected to overlap (Curtis and Jackson, 1977; Permentier et ...perceived neighbourhood reputation are complementary rather ...
21
Simple hyper-heuristics control the neighbourhood size of randomised local search optimally for LeadingOnes
... Apart from the Greedy one, an obvious advantage of these simple methods is that they execute very quickly. On the other hand, it is unclear how well they perform in terms of how effective they are at identifying (near) ...
35