Less is more: Basic variable neighborhood search for minimum differential dispersion problem

No abstract is available for this paper.

• Publication year

  2016

• Venue

  Information Sciences

• Publication date

  Unknown publication date

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1016/j.ins.2015.07.044
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Variable Neighborhood Search

  2018cited by this paper
• Greedy randomized adaptive search procedure with exterior path relinking for differential dispersion minimization

  2015cited by this paper
• Solving the maximally diverse grouping problem by skewed general variable neighborhood search

  2015cited by this paper
• Variable and single neighbourhood diving for MIP feasibility

  2015cited by this paper
• The multi-depot vehicle routing problem with heterogeneous vehicle fleet: Formulation and a variable neighborhood search implementation

  2014cited by this paper
• Heuristics and metaheuristics for the maximum diversity problem

  2011cited by this paper
• Variable neighbourhood search: methods and applications

  2010cited by this paper
• Programming Models for Facility Dispersion: The p‐Dispersion and Maxisum Dispersion Problems

  2010cited by this paper
• A general variable neighborhood search for solving the uncapacitated single allocation p-hub median problem

  2009cited by this paper
• The equitable dispersion problem

  2009cited by this paper
• Iterated tabu search for the maximum diversity problem

  2007cited by this paper
• Tabu search and GRASP for the maximum diversity problem

  2007cited by this paper
• Maximum diversity/similarity models with extension to part grouping

  2005cited by this paper
• Experimental Comparison of Greedy Randomized Adaptive Search Procedures for the Maximum Diversity Problem

  2004cited by this paper
• First vs. best improvement: An empirical study

  1999cited by this paper
• An empirical comparison of heuristic methods for creating maximally diverse groups

  1998cited by this paper
• Heuristic algorithms for the maximum diversity problem

  1998cited by this paper
• Computational aspects of the maximum diversity problem

  1996cited by this paper
• A Multiobjective Model For Locating Solid Waste Transfer Facilities Using An Empirical Opposition Function

  1995cited by this paper
• Analyzing and Modeling the Maximum Diversity Problem by Zero‐One Programming*

  1993cited by this paper
• On choosing a dense subgraph

  1993cited by this paper
• The discrete p-dispersion problem

  1990cited by this paper
• Analytical models for locating undesirable facilities

  1989cited by this paper
• The Sharing Problem

  1979cited by this paper
• The Knapsack Sharing Problem

  1979cited by this paper
• Toward a theory of urban public facility location

  1968cited by this paper
• Individual Comparisons by Ranking Methods

  1945cited by this paper

• Solving the single-machine scheduling problem with periodical resource constraints

  2025cites this paper
• A more realistic variant of capacitated vehicle routing problem: Methodology and a case study

  2025cites this paper
• Variable Neighborhood Search-based Resource Allocation for Vehicle-to-Everything Communications

  2024cites this paper
• VNS algorithm for the periodic pick-up and delivery helicopter routing problem in oil and gas offshore

  2024cites this paper
• A parallel variable neighborhood search for α-neighbor facility location problems

  2024cites this paper
• Tackling the Generalized Max-Mean Dispersion Problem with a Hybrid Population Method

  2024cites this paper
• General Variable Neighborhood Search for Maximum Diversity Problem with Capacity and Budget Constraints

  2024cites this paper
• A reduced variable neighborhood search for the just in time job shop scheduling problem with sequence dependent setup times

  2024cites this paper
• Solution algorithms for dock scheduling and truck sequencing in cross-docks: A neural branch-and-price and a metaheuristic

  2024cites this paper
• Fat-tailed distributions for continuous variable neighborhood search

  2023cites this paper
• Variable neighbourhood search for connected graphs of fixed order and size with minimal spectral radius

  2023cites this paper
• The Obnoxious Competitive Facility Location Model

  2023cites this paper
• A trajectory based heuristic for the planar <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si270.svg" display="inline" id="d1e2918"><mml:mi>p</mml:mi></mml:math>-median problem

  2023cites this paper
• An iterated greedy algorithm with variable reconstruction size for the obnoxious p-median problem

  2023cites this paper
• Extensions to the planar p-median problem

  2023cites this paper
• Auxiliary data structures and techniques to speed up solving of the p-next center problem: A VNS heuristic

  2023cites this paper
• Solution-based tabu search for the capacitated dispersion problem

  2023cites this paper
• HA-CCP: A Hybrid Algorithm for Solving Capacitated Clustering Problem

  2022cites this paper
• In memory of Professor Nenad Mladenović (1951–2022)

  2022cites this paper
• A variable neighborhood search and mixed-integer programming models for a distributed maintenance service network scheduling problem

  2022cites this paper
• Solving a stochastic hierarchical scheduling problem by VNS-based metaheuristic with locally assisted algorithms

  2022cites this paper
• An efficient implementation of a VNS heuristic for the weighted fair sequences problem

  2022cites this paper
• Bi-level scheduling in high-end equipment R&D: when more algorithm strategies may not be better

  2022cites this paper
• A hybrid metaheuristic for a semiconductor production scheduling problem with deterioration effect and resource constraints

  2022cites this paper
• The Obnoxious Facilities Planar <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si19.svg"><mml:mi>p</mml:mi></mml:math>-Median Problem with Variable Sizes

  2022cites this paper
• A general variable neighborhood search approach for the minimum load coloring problem

  2022cites this paper
• Solution approaches for the vehicle routing problem with occasional drivers and time windows

  2022cites this paper
• Reduced Variable Neighbourhood Search for the Generation of Controlled Circular Data

  2021cites this paper
• Multi-Objective GRASP for Maximizing Diversity

  2021cites this paper
• A hybrid DBH-VNS for high-end equipment production scheduling with machine failures and preventive maintenance activities

  2021cites this paper
• RETRACTED ARTICLE: A Hybrid Intelligent Optimization Algorithm for Solving the Producing Work Order Group Furnace Problem

  2021cites this paper
• Less is more: discrete starting solutions in the planar p-median problem

  2021cites this paper
• Discrete diversity and dispersion maximization. A review and an empirical analysis from an OR perspective

  2021cites this paper
• Solving the Capacitated Dispersion Problem with variable neighborhood search approaches: From basic to skewed VNS

  2021cites this paper
• Less is more: discrete starting solutions in the planar p-median problem

  2021cites this paper
• Less is more approach in optimization: a road to artificial intelligence

  2021cites this paper
• A hybrid moth flame optimization and variable neighbourhood search technique for optimal design of IIR filters

  2021cites this paper
• A review on discrete diversity and dispersion maximization from an OR perspective

  2021cites this paper
• A hybrid moth flame optimization and variable neighbourhood search technique for optimal design of IIR filters

  2021cites this paper
• Less is more: simple algorithms for the minimum sum of squares clustering problem

  2021cites this paper
• Constraint based local search for flowshops with sequence-dependent setup times

  2021cites this paper
• Variable Neighborhood Programming as a Tool of Machine Learning

  2021cites this paper
• A variable neighborhood search algorithm for the (r∣p)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$ (r{\mid }p) $$\

  2021cites this paper
• Structural damage detection and localization using decision tree ensemble and vibration data

  2020cites this paper
• Less is more approach: basic variable neighborhood search for the obnoxious p-median problem

  2020cites this paper
• A study of two evolutionary/tabu search approaches for the generalized max-mean dispersion problem

  2020cites this paper
• Solving the traveling repairman problem with profits: A Novel variable neighborhood search approach

  2020cites this paper
• Analysis of variable neighborhood descent as a local search operator for total weighted tardiness problem on unrelated parallel machines

  2020cites this paper
• Green manufacturing: Order acceptance and scheduling subject to the budgets of energy consumption and machine launch

  2020cites this paper
• Bi-objective load balancing multiple allocation hub location: a compromise programming approach

  2020cites this paper
• The Importance of Good Starting Solutions in the Minimum Sum of Squares Clustering Problem

  2020cites this paper
• The uncapacitated r-allocation p-hub center problem

  2020cites this paper
• A multi-improvement local search using dataflow and GPU to solve the minimum latency problem

  2020cites this paper
• An efficient metaheuristic for the K-page crossing number minimization problem

  2020cites this paper
• Hierarchical Physician Recommendation via Diversity-enhanced Matrix Factorization

  2020cites this paper
• Bi-objective load balancing multiple allocation hub location: a compromise programming approach

  2020cites this paper
• Less is more: General variable neighborhood search for the capacitated modular hub location problem

  2019cites this paper
• A Tabu Search Approach With Dynamical Neighborhood Size for Solving the Maximum Min-Sum Dispersion Problem

  2019cites this paper
• A Performance Study of the Impact of Different Perturbation Methods on the Efficiency of GVNS for Solving TSP

  2019cites this paper
• Less is more: variable neighborhood search for integrated production and assembly in smart manufacturing

  2019cites this paper
• Unconventional GVNS for Solving the Garbage Collection Problem with Time Windows

  2019cites this paper
• Intensi cation-driven tabu search for the minimum di erential dispersion problem

  2019influential citation
• A variable neighborhood search approach for the vertex bisection problem

  2019cites this paper
• Less is more approach for competing groups scheduling with different learning effects

  2019cites this paper
• The selective traveling salesman problem with draft limits

  2019cites this paper
• A Variable Neighborhood Search approach for the Hamiltonian p-median problem

  2019cites this paper
• Intensification-driven tabu search for the minimum differential dispersion problem

  2019cites this paper
• Less Is More: Tabu Search for Bipartite Quadratic Programming Problem

  2019cites this paper
• Ant Colony Optimization for Markov Blanket-Based Feature Selection. Application for Precision Medicine

  2018cites this paper
• Diversity and Equity Models

  2018cites this paper
• Órbita Perpétua e outras técnicas de otimização global robusta para os algoritmos Simulated Annealing Acoplado e Nelder-Mead

  2018cites this paper
• An effective multi-wave algorithm for solving the max-mean dispersion problem

  2018cites this paper
• Continuous Variable Neighborhood Search (C-VNS) for Solving Systems of Nonlinear Equations

  2018cites this paper
• Improved Variable Neighbourhood Search Heuristic for Quartet Clustering

  2018cites this paper
• Studying the Impact of Perturbation Methods on the Efficiency of GVNS for the ATSP

  2018cites this paper
• Solution-based tabu search for the maximum min-sum dispersion problem

  2018cites this paper
• Combinatorial GVNS (General Variable Neighborhood Search) Optimization for Dynamic Garbage Collection

  2018cites this paper
• Variable neighborhood programming for symbolic regression

  2018cites this paper
• Review of Basic Local Searches for Solving the Minimum Sum-of-Squares Clustering Problem

  2018cites this paper
• Less is More: Simplified Nelder-Mead Method for Large Unconstrained Optimization

  2018cites this paper
• Less is more: Solving the Max-Mean diversity problem with variable neighborhood search

  2017cites this paper
• Less is more: basic variable neighborhood search heuristic for balanced minimum sum-of-squares clustering

  2017cites this paper
• Applications of simheuristics and horizontal cooperation concepts in rich vehicle routing problems

  2017cites this paper
• Quantum Inspired General Variable Neighborhood Search (qGVNS) for Dynamic Garbage Collection

  2017cites this paper
• Solving the maximum min-sum dispersion by alternating formulations of two different problems

  2017cites this paper
• Order matters - A Variable Neighborhood Search for the Swap-Body Vehicle Routing Problem

  2017cites this paper
• A Quantum Inspired GVNS: Some Preliminary Results.

  2017cites this paper
• Effective metaheuristic algorithms for the minimum differential dispersion problem

  2017cites this paper
• An iterated local search algorithm for the minimum differential dispersion problem

  2016influential citation
• Reduced variable neighborhood programming for the preventive maintenance planning of railway infrastructure

  2016cites this paper
• Iterated variable neighborhood search for the capacitated clustering problem

  2016influential citation
• A basic variable neighborhood search heuristic for the uncapacitated multiple allocation p-hub center problem

  2015cites this paper
• A basic variable neighborhood search heuristic for the uncapacitated multiple allocation p-hub center problem

  2015cites this paper
• Variable neighborhood programming for the preventive maintenance planning in railway transportation

  2015cites this paper
• General variable neighborhood search for the uncapacitated single allocation p-hub center problem

  2015cites this paper
• Expert Systems With Applications

  year unknowncites this paper