In this paper, we report the results of our investigation of an evolutionary approach for solving the unequal area multi-objective facility layout problem (FLP) using the variable neighborhood search (VNS) with an adaptive scheme that presents the final layouts as a set of Pareto-optimal solutions. The unequal area FLP comprises a class of extremely difficult and widely applicable optimization ...

Local search heuristics are among the most popular approaches to solve hard optimization problems. Among them, Very Large Scale Neighborhood Search techniques present a good balance between the quality of local optima and the time to search a neighborhood. We develop a language to generate exponentially large neighborhoods for sequencing problems using grammars. We develop efficient generic dyn...

The Cumulative Capacitated Vehicle Routing Problem (CCVRP) is a variation of the classical Capacitated Vehicle Routing Problem in which the objective is the minimization of the sum of arrival times at customers, instead of the total routing cost. This paper presents an adaptive large neighborhood search heuristic for the CCVRP. This algorithm is applied to a set of benchmark instances and compa...

For autonomous vehicles, obstacle detection results using 3D lidar are in the form of point clouds, and unevenly distributed space. Clustering is a common means for cloud processing; however, improper selection clustering thresholds can lead to under-segmentation or over-segmentation resulting false missed obstacles. In order solve these problems, new method was required. Firstly, we applied di...

A phylogeny is a tree that relates taxonomic units, based on their similarity over a set of characters. The phylogeny problem consists in finding a phylogeny with the minimum number of evolutionary steps. We propose a new neighborhood structure for the phylogeny problem. A greedy randomized adaptive search procedure heuristic based on this neighborhood structure and using variable neighborhood ...

In this paper, we propose an adaptive large neighborhood search heuristic for the Two-Echelon Vehicle Routing Problem (2E-VRP) and the Location Routing Problem (LRP). The 2E-VRP arises in two-level transportation systems such as those encountered in the context of city logistics. In such systems, freight arrives at a major terminal and is shipped through intermediate satellite facilities to the...

In this paper, we address the approximate nearest neighbor (ANN) search problem over large scale visual descriptors. We investigate a simple but very effective approach, neighborhood graph (NG) search, which conducts the local search by expanding neighborhoods with a best-first manner. Expanding neighborhood makes it efficient to locate the descriptors with high probability being true NNs. Howe...

This paper presents the investigation of an evolutionary multi-objective simulated annealing algorithm with variable neighborhoods to solve the multi-objective multicast routing problems in telecommunications. The hybrid algorithm aims to carry out a more flexible and adaptive exploration in the complex search space by using features of the variable neighborhood search to find more non-dominate...

Based on the current situation and problems of transportation "last mile" distribution, this paper establishes a path optimization model based user distribution methods from perspective market preference for methods, designs an Adaptive Large Neighborhood Search (ALNS) algorithm, builds portrait solution algorithm construction method. method, scenario is established, route method are planned fi...