Results 1  10
of
14
Variable Neighborhood Search
, 1997
"... Variable neighborhood search (VNS) is a recent metaheuristic for solving combinatorial and global optimization problems whose basic idea is systematic change of neighborhood within a local search. In this survey paper we present basic rules of VNS and some of its extensions. Moreover, applications a ..."
Abstract

Cited by 355 (26 self)
 Add to MetaCart
Variable neighborhood search (VNS) is a recent metaheuristic for solving combinatorial and global optimization problems whose basic idea is systematic change of neighborhood within a local search. In this survey paper we present basic rules of VNS and some of its extensions. Moreover, applications are briefly summarized. They comprise heuristic solution of a variety of optimization problems, ways to accelerate exact algorithms and to analyze heuristic solution processes, as well as computerassisted discovery of conjectures in graph theory.
POPMUSIC FOR THE POINT FEATURE LABEL PLACEMENT PROBLEM
"... Abstract. Pointfeature label placement is the problem of placing text labels adjacent to point features on a map so as to maximize legibility. The goal is to choose positions for the labels that do not give rise to label overlaps and that minimize obscuration of features. A practical goal is to min ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
(Show Context)
Abstract. Pointfeature label placement is the problem of placing text labels adjacent to point features on a map so as to maximize legibility. The goal is to choose positions for the labels that do not give rise to label overlaps and that minimize obscuration of features. A practical goal is to minimize the number of overlaps while considering cartographic preferences. This article proposes a new heuristic for solving the point feature label placement problem based on the application of the POPMUSIC frame. Computational experiments show that the proposed heuristic outperformed other recent metaheuristics approaches in the literature. Experiments with problem instances involving up to 10 million points show that the computational time of the proposed heuristic increases almost linearly with the problem size. New problem instances based on real data with more than 13,000 labels are proposed. 1.
Cooperative Coevolution with Route Distance Grouping for LargeScale Capacitated Arc Routing Problems
, 2012
"... In this paper, a divideandconquer approach is proposed to solve the LargeScale Capacitated Arc Routing Problem ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
In this paper, a divideandconquer approach is proposed to solve the LargeScale Capacitated Arc Routing Problem
Matheuristics for the capacitated pmedian problem
"... Abstract The recent evolution of computers and mathematical programming techniques has provide the development of a new class of algorithms called matheuristics. Associated with an improvement of MIP solvers, many of these methods have been successful applied to solve combinatorial problems. This w ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract The recent evolution of computers and mathematical programming techniques has provide the development of a new class of algorithms called matheuristics. Associated with an improvement of MIP solvers, many of these methods have been successful applied to solve combinatorial problems. This work presents an approach that hybridizes metaheuristics based on local search and exact algorithms to solve the classic capacitated pmedian problem. The proposal considers a reduced mathematical model performed by a heuristic elimination of variables which are less likely to belong to a good or optimal solution. In addition, an iterative local optimization algorithm based on reduction is proposed. In both cases, the mathematical model is solved by a MIP solver. Computational experiments involving three set of instances are presented to demonstrate the good performance of the developed approaches.
A Metaheuristic Algorithm Based on Chemotherapy Science: CSA
"... Among scientific fields of study, mathematical programming has high status and its importance has led researchers to develop accurate models and effective solving approaches to addressing optimization problems. In particular, metaheuristic algorithms are approximate methods for solving optimization ..."
Abstract
 Add to MetaCart
(Show Context)
Among scientific fields of study, mathematical programming has high status and its importance has led researchers to develop accurate models and effective solving approaches to addressing optimization problems. In particular, metaheuristic algorithms are approximate methods for solving optimization problems whereby good (not necessarily optimum) solutions can be generated via their implementation. In this study, we propose a populationbased metaheuristic algorithm according to chemotherapy method to cure cancers that mainly search the infeasible region. As in chemotherapy, Chemotherapy Science Algorithm (CSA) tries to kill inappropriate solutions (cancers and bad cells of the human body); however, this would inevitably risk incidentally destroying some acceptable solutions (healthy cells). In addition, as the cycle of cancer treatment repeats over and over, the algorithm is iterated. To align chemotherapy process with the proposed algorithm, different basic terms and definitions including Infeasibility Function (IF), objective function (OF), Cell Area (CA), and Random Cells (RCs) are presented in this study. In the terminology of algorithms and optimization, IF and OF are mainly applicable as criteria to compare every pair of generated solutions. Finally, we test CSA and its structure using the benchmark Traveling Salesman Problem (TSP).
POPMUSIC FOR THE WORLD LOCATION ROUTING PROBLEM
"... ABSTRACT. POPMUSIC — Partial optimization metaheuristic under special intensification conditions — is a template for tackling large problem instances. This template has been shown to be very efficient for various combinatorial problems like pmedian, sum of squares clustering, vehicle routing and ma ..."
Abstract
 Add to MetaCart
(Show Context)
ABSTRACT. POPMUSIC — Partial optimization metaheuristic under special intensification conditions — is a template for tackling large problem instances. This template has been shown to be very efficient for various combinatorial problems like pmedian, sum of squares clustering, vehicle routing and map labeling. In terms of algorithmic complexity, one of the most complex part of POPMUSIC template is to find an initial solution. This article presents a method for generating an appropriate initial solution to the location routing problem by producing in O(n 3/2) an approximate solution to the capacitated pMedian problem. The method is tested on LRP instances with millions of entities. 1.
Table des matières
"... FRANCORO IV BIENVENUE À FRANCORO IV Bienvenue à FRANCORO IV L’Université de Fribourg, l’Ecole d’Ingénieurs d’Yverdon et les membres du comité d’organisation sont particulièrement fiers et heureux d’accueillir les quatrièmes journées francophones de recherche opérationnelle (FRANCORO IV) à Fribourg, ..."
Abstract
 Add to MetaCart
FRANCORO IV BIENVENUE À FRANCORO IV Bienvenue à FRANCORO IV L’Université de Fribourg, l’Ecole d’Ingénieurs d’Yverdon et les membres du comité d’organisation sont particulièrement fiers et heureux d’accueillir les quatrièmes journées francophones de recherche opérationnelle (FRANCORO IV) à Fribourg, en Suisse. Fiers, car il s’agissait d’un véritable défi de bousculer les habitudes estivales pour réussir à collecter 79 présentations offertes par des orateurs français, belges, canadiens, nordafricains et suisses et d’inviter ces derniers à se rencontrer dans cette charmante cité médiévale.
MIC2005. The 6th Metaheuristics International Conference 39 POPMUSIC for the Point Feature Label Placement
"... Label placement is a problem of fundamental importance in cartography, where text labels must be placed on maps while avoiding overlaps with cartographic symbols and other labels. It requires positioning labels of area (such as countries and oceans), line (such as rivers and roads) and point (such a ..."
Abstract
 Add to MetaCart
(Show Context)
Label placement is a problem of fundamental importance in cartography, where text labels must be placed on maps while avoiding overlaps with cartographic symbols and other labels. It requires positioning labels of area (such as countries and oceans), line (such as rivers and roads) and point (such as cities and mountain peaks) features [2]. Independent of the features
MIC 2007: The Seventh Metaheuristics International Conference??1 A POPMUSIC heuristic for the Point Feature Label Placement Problem
"... eric.taillard at heigvd.ch ..."
(Show Context)
PopMusic for Real World Large Scale Multi Depot Vehicle Routing Problem with Time Windows
"... In this paper we consider a large scale Multi Depot Vehicle Routing Problem with Time Windows (MDVRPTW) that was derived from a large Austrian logistics provider. The developed algorithm is based on the PopMusic framework developed by Taillard and Voss [2] and uses a specially designed Memetic Algor ..."
Abstract
 Add to MetaCart
(Show Context)
In this paper we consider a large scale Multi Depot Vehicle Routing Problem with Time Windows (MDVRPTW) that was derived from a large Austrian logistics provider. The developed algorithm is based on the PopMusic framework developed by Taillard and Voss [2] and uses a specially designed Memetic Algorithm (MA) as optimizer. The MA was chosen as it is easy to be integrated into the framework as well as the fact that the generated populations can be saved and used as starting solutions for the subproblems within the PopMusic framework. The MDVRPTW was defined by Cordeau et al. [1] and is a generalization of the well known Vehicle Routing Problem with Time Windows but with the addition of more than one depot. A fixed and homogenous vehicle fleet that is distributed between the depots needs to serve a set of customers with respect to time window constraints, a maximum allowed tour length as well as a maximum allowed load on each vehicle. The developed MA consists of the following core components. A special modification of I1 insertion heuristic based on a stochastic insertion criterion was chosen to generate the initial population pop. An evaluation function that penalizes violations in load, maximum tour length and time window violations is used to interpret solution