TAILIEUCHUNG - Gaussian variable neighborhood search for the file transfer scheduling problem

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. | Yugoslav Journal of Operations Research 26 (2016), Number 2, 173–188 DOI: GAUSSIAN VARIABLE NEIGHBORHOOD SEARCH FOR THE FILE TRANSFER SCHEDULING PROBLEM ˇ C ´ Zorica DRAZI Faculty of Mathematics, University of Belgrade, Serbia zdrazic@ Received: January 2015 / Accepted: March 2015 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. Keywords: Combinatorial Optimization, Variable Neighborhood Search, Gaussian Variable Neighborhood Search, File Transfer Scheduling Problem. MSC: 90C59, 68T20, 05C90. 174 Z. Draˇzi´c / Gauss-VNS for FTSP 1. INTRODUCTION The standard form of the optimization problem is given with: min{ f (x)

• Kỹ thuật lập trình
• Combinatorial optimization
• Variable neighborhood search
• Gaussian variable neighborhood search
• File transfer scheduling problem
• Optimization problems
• Ecosystem management
• Combinatorial optimization techniques
• Meta heuristic
• Economical values
• Probabilistic Combinatorial Optimization
• Probabilistic Graph problems
• Probabilistic Minimum Coloring
• The Probabilistic Longest Path
• Probabilistic Minimum Vertex
• the Probabilistic Maximum Independen
• Efficient transformations
• Generalized combinatorial optimization problems
• Integer programming
• Graph into node sets
• Extremal graph theory
• Mathematical programming
• Efficient algorithms
• Information sciences
• Multiobjective combinatorial optimization problems
• Well spread set
• Well spread non dominated points
• State of the art
• Ebook Linear optimization
• Linear optimization
• Linear extensions
• Projective algorithms
• Ellipsoid algorithms
• Optimization software
• Minimum cost network flow problem
• Optimization software packages
• Meta–Heuristic methods
• Swarm intelligence
• Scheduling problems
• Foraging habits of honeybees
• Center location problems
• Reverse optimization
• Tree graphs
• Time complexity
• Hamming norms
• Báo cáo sinh học hay
• cách trình bày báo cáo
• báo cáo sinh học
• công trình nghiên cứu sinh học
• tài liệu về sinh học
• Dynamic memory allocation Ppblem
• Regarding quality
• Metaheuristic approach
• Transportation problem
• Bottleneck transportation problem
• Bi criteria transportation problem
• Efficient points
• Salesman problem
• System of vertexr equisitions
• Local search
• Efficient point
• Evolutionary algorithms
• Runtime analysis
• Fitness level
• Strong metric dimension
• Graph problems
• Computational approaches
• Historical and scientific framework
• Music generation
• Evolutionary approach
• Algorithm composing
• Music compositions
• Genetic Algorithm
• Optimal Recombination Problem
• Boolean Linear Programming
• Optimal recombination
• Maximum Diverse Grouping
• Extensive computational
• Diversity problem
• Operations research
• Exteriorpoint simplex type
• Network dual simplex algorithm
• Electromagnetism like metaheuristic
• Maximum set splitting problem
• Steiner triple systems
• Fast implementation
• Evolutionary computation
• Graph coloring problem
• Bandwidth multicoloring problem
• Bandwidth coloring problem
• Quadratic assignment problem
• Modified genetic operators
• Weighted graphs
• Minimal branching
• Asymetric weight matrix
• Minimal s branching