variable neighborhood search

A variable neighborhood search for the green vehicle routing problem with two-dimensional loading constraints and split delivery

  • Kamyla Ferreira
  • Thiago Alves de Queiroz
  • Pedro Munari
  • Franklina M. B. Toledo
    • Categories Meta Heuristics, Production and Logistics, Transportation Tags , , , ,

    We address the Green Vehicle Routing Problem with Two-Dimensional Loading Constraints and Split Delivery (G2L-SDVRP), which extends the split delivery vehicle routing problem to include customer demands represented by two-dimensional, rectangular items. We aim to minimize carbon dioxide (CO\(_2\)) emissions instead of travel distance, a critical issue in contemporary logistics activities. The CO\(_2\) emission rate … Read more

    Variable Neighborhood Search for parameter tuning in Support Vector Machines

  • Emilio Carrizosa
  • Belén Martín-Barragán
  • Dolores Romero Morales
    • Categories Data-Mining, Nonsmooth Optimization, Unconstrained Optimization Tags , , , , ,

    As in most Data Mining procedures, how to tune the parameters of a Support Vector Machine (SVM) is a critical, though not sufficiently explored, issue. The default approach is a grid search in the parameter space, which becomes prohibitively time-consuming even when just a few parameters are to be tuned. For this reason, for models … Read more

    COIN-OR METSlib: a Metaheuristics Framework in Modern C++.

  • Mirko Maischberger
    • Categories Meta Heuristics, Nonlinear Optimization, Problem Solving Environments Tags , , , , ,

    The document describes COIN-OR METSlib, a C++ framework for local search based metaheuristics. METSlib has been used to implement a massively parallel VRP algorithm, a state of the art Vertex Coloring Problem solver, a Timetabling software, and in many other projects. ArticleDownload View PDF

    Neighborhood based heuristics for a Two-level Hierarchical Location Problem with modular node capacities

  • Bernardetta Addis
  • Giuliana Carello
  • Alberto Ceselli
    • Categories Facility Planning and Design, Meta Heuristics, Telecommunications Tags , , , , ,

    In many telecommunication network architectures a given set of client nodes must be served by different kinds of facility, which provide di fferent services and have diff erent capabilities. Such facilities must be located and dimensioned in the design phase. We tackle a particular location problem in which two sets of facilities, mid level and high level, … Read more

    Randomized heuristics for the MAX-CUT problem

  • Paola Festa
  • Panos M. Pardalos
  • Mauricio G.C. Resende
  • Celso C. Ribeiro
    • Categories Meta Heuristics Tags , , , ,

    Given an undirected graph with edge weights, the MAX-CUT problem consists in finding a partition of the nodes into two subsets, such that the sum of the weights of the edges having endpoints in different subsets is maximized. It is a well-known NP-hard problem with applications in several fields, including VLSI design and statistical physics. … Read more