![](images/graphics/blank.gif)
Neighborhood search
-
Part 1 of ebook "Search methodologies: Introductory tutorials in optimization and decision support techniques" provides readers with contents including: classical techniques; integer programming; genetic algorithms; scatter search; genetic programming; artificial immune systems; swarm intelligence; tabu search; simulated annealing; GRASP: greedy randomized adaptive search procedures; variable neighborhood search;...
344p
thamnhuocgiai
24-09-2023
6
4
Download
-
Continued part 1, part 2 of ebook "Search methodologies: Introductory tutorials in optimization and decision support techniques" provides readers with contents including: very large-scale neighborhood search; constraint programming; multi-objective optimization; sharpened and focused no free lunch and complexity theory; machine learning; fuzzy reasoning; rough-set-based decision support; hyper-heuristics; approximations and randomization; fitness landscapes;...
371p
thamnhuocgiai
24-09-2023
6
5
Download
-
Bài báo này đề cập đến các cách tiếp cận chính xác và metaheuristic để giải quyết các dạng khác nhau của VRP, và đã thực hiện một rà soát thống kê rộng rãi. Giải thuật được trình bày trong bài báo được dựa trên giải thuật metaheuristic Iterated Local Search (ILS) với việc sử dụng một thủ tục giảm lân cận giá trị theo thứ tự lân cận ngẫu nhiên (Variable Neighborhood Descent with Random neighborhood ordering (RVND)), trong đoạn tìm kiếm địa phương.
12p
viberkshire
09-08-2023
12
5
Download
-
The Multi-stripe Travelling Salesman Problem (Ms-TSP) is an extension of the Travelling Salesman Problem (TSP). In the q-stripe TSP with q ≥ 1, the objective function sums the costs for traveling from one vertex to each of the next q vertices along the tour. To solve medium to large-sized instances, a metaheuristic approach is proposed. The proposed method has two main components, which are construction and improvement phases. The construction phase generates an initial solution using the Greedy Randomized Adaptive Search Procedure (GRASP).
18p
nguathienthan9
08-12-2020
13
2
Download
-
In this paper, we present a novel global protein-protein interaction network alignment algorithm, which is enhanced with an extended large neighborhood search heuristics. Evaluated on benchmark datasets of yeast, fly, human and worm, the proposed algorithm outperforms state-of-the-art algorithms. Furthermore, the complexity of ours is polynomial, thus being scalable to large biological networks in practice.
11p
tamynhan4
06-09-2020
13
3
Download
-
The problem is modeled as two-stage stochastic program and a metaheuristic algorithm based on the adaptive large neighborhood search (ALNS) is proposed. Extensive computational experiments based on the CAB and TR data sets are conducted. Results show the high efficiency of the proposed solution method.
12p
toritori
11-05-2020
6
0
Download
-
This article discusses the ecological vehicle routing problem with a stop at a refueling station titled Green-Vehicle Routing Problem. In this problem, the refueling stations and the limit of fuel tank capacity are considered for the construction of a tour. We propose a variable neighborhood search to solve the problem.
10p
toritori
11-05-2020
17
2
Download
-
This paper is interested in pharmaceuticals distribution which is one of the most important activities and ensures the availability of drug products to a set of customers (pharmacies). The study introduces the Disrupted Vehicle Routing problem with Soft Time Windows since pharmaceutical distributors should respond to increased demands for products to ensure timely and efficient delivery to dynamic demands. We also propose an improved multiobjective local search (IMOLS).
18p
toritori
11-05-2020
19
0
Download
-
Credit scoring is a crucial problem in both finance and banking. In this paper, we tackle credit scoring as a classification problem where three local search-based methods are studied for feature selection. The feature selection is an interesting technique that can be launched before the data classification task.
15p
vithanos2711
09-08-2019
28
0
Download
-
This paper is devoted to the Dynamic Memory Allocation Problem (DMAP) in embedded systems. The existing Integer Linear Programing (ILP) formulation for DMAP is improved, and given that there are several metaheuristic approaches for solving the DMAP, a new metaheuristic approach is proposed and compared with the former ones.
24p
danhnguyentuongvi27
19-12-2018
45
0
Download
-
In particular, almost all feasible instances of the problem are solvable in O(n) time using the new algorithm, where n is the number of vertices. The developed approach also helps in fast enumeration of a neighborhood in the local search and yields an integer programming model with O(n) binary variables for the problem.
12p
danhnguyentuongvi27
19-12-2018
26
0
Download
-
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.
16p
vinguyentuongdanh
19-12-2018
17
0
Download
-
In this paper we present an implementation of a variable neighborhood search (VNS) for solving minimum linear arrangement problem. We use Skewed general VNS scheme witch appeared to be successful in solving some recent optimization problems on graphs. Based on computational experiments, we argue that our approach is comparable with the state-of-the-art heuristic.
14p
vinguyentuongdanh
19-12-2018
23
0
Download
-
In this study, we consider a variant of the Bilevel Uncapacitated Facility Location Problem (BLUFLP), in which the clients choose suppliers based on their own preferences. We propose and compare three metaheuristic approaches for solving this problem: Particle Swarm Optimization (PSO), Simulated Annealing (SA), and a combination of Reduced and Basic Variable Neighborhood Search Method (VNS).
18p
vinguyentuongdanh
19-12-2018
16
0
Download
-
Research in the field of vehicle routing is often focused on finding new ideas and concepts in the development of fast and efficient algorithms for an improved solution process. Early studies introduce static tailor-made strategies, but trends show that algorithms with generic adaptive policies - which emerged in the past years - are more efficient to solve complex vehicle routing problems.
16p
vinguyentuongdanh
19-12-2018
38
2
Download
-
This paper presents a general variable neighborhood search (GVNS) heuristic for solving the maximum diverse grouping problem. Extensive computational experiments performed on a series of large random graphs as well as on several instances of the maximum diversity problem taken from the literature show that the results obtained by GVNS consistently outperform the best heuristics from the literature.
13p
vinguyentuongdanh
19-12-2018
26
0
Download
-
General Variable Neighborhood Search (GVNS) is shown to be a powerful and robust methodology for solving travelling salesman and vehicle routing problems. However, its efficient implementation may play a significant role in solving large size instances. In this paper we suggest new GVNS heuristic for solving Travelling salesman problem with time windows.
12p
vinguyentuongdanh
19-12-2018
26
1
Download
-
In this paper we suggest a new variant of Variable neighborhood search designed for solving Mixed integer programming problems. We call it Variable neighborhood formulation search (VNFS), since both neighborhoods and formulations are changed during the search.
22p
danhnguyentuongvi27
19-12-2018
33
0
Download
-
In this paper, we address the problem of network design with redundant connections, often faced by operators of telephone and internet services. The network connects customers with one master node and is built by taking into account the rules that shape its construction, such as number of customers, number of components and types of links, in order to meet operational needs and technical constraints.
26p
danhnguyentuongvi27
19-12-2018
11
0
Download
-
We examine the first phase of a known NP-hard 2-stage assembly problem. It consists of sequencing a set of jobs having multiple components to be processed. Each job has to be worked on independently on a specific machine. We consider these jobs to form a vector of tasks. Our objective is to schedule jobs on the particular machines in order to minimize the completion time before the second stage starts.
15p
danhnguyentuongvi27
19-12-2018
42
0
Download
CHỦ ĐỀ BẠN MUỐN TÌM
![](images/graphics/blank.gif)