Variable neighborhood search: Principles and applications

Nonconvex programming, global optimization (90C26) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Stochastic scheduling theory in operations research (90B36)

Related Items

On characterization of maximal independent sets via quadratic optimization, Variable and large neighborhood search to solve the multiobjective set covering problem, Automated conjectures on upper bounds for the largest Laplacian eigenvalue of graphs, A list-based compact representation for large decision tables management, Variable neighborhood decomposition search for the edge weighted \(k\)-cardinality tree problem, Embedded local search approaches for routing optimization, The extended concentric tabu for the quadratic assignment problem, Scheduling a hybrid assembly-differentiation flowshop to minimize total flow time, Search with evolutionary ruin and stochastic rebuild: a theoretic framework and a case study on exam timetabling, Using VNS for the optimal synthesis of the communication tree in wireless sensor networks, VNS-based heuristic with an exponential neighborhood for the server load balancing problem, General variable neighborhood search applied to the picking process in a warehouse, VNS as an upper bound for an exact method to solve a class of on-demand transit transportation systems, A web-based decision support system for waste lube oils collection and recycling, A variable neighborhood search heuristic for periodic routing problems, A guided local search metaheuristic for the team orienteering problem, Variable neighbourhood search for bandwidth reduction, Dynamic capacitated lot-sizing problems: a classification and review of solution approaches, Portfolio decision analysis with a generalized balance approach, Modelling and solving the milk collection problem with realistic constraints, New formulations for the Kissing Number Problem, Solving a capacitated hub location problem, A multiplicative weights update algorithm for MINLP, Models for government intervention during a pandemic, A variable neighborhood search approach to solve the order batching problem with heterogeneous pick devices, E-platooning: optimizing platoon formation for long-haul transportation with electric commercial vehicles, A storm of feasibility pumps for nonconvex MINLP, The team orienteering problem with time windows: an LP-based granular variable neighborhood search, Design and analysis of hybrid metaheuristics for the reliability \(p\)-median problem, A diversified tabu search approach for the open-pit mine production scheduling problem with metal uncertainty, Variable neighbourhood structures for cycle location problems, A self-tuning variable neighborhood search algorithm and an effective decoding scheme for open shop scheduling problems with travel/setup times, A variable neighborhood search approach for the vertex bisection problem, A quadratic programming approach to the Randić index, Scheduling logistic activities to improve hospital supply systems, A variable neighborhood decomposition search method for supply chain management planning problems, Variable neighborhood search for parallel machines scheduling problem with step deteriorating jobs, Bayesian instance selection for the nearest neighbor rule, Strategic planning of an underground mine with variable cut-off grades, Degree-constrained \(k\)-minimum spanning tree problem, An ant colony algorithm for the pos/neg weighted \(p\)-median problem, A continuous variable neighborhood search heuristic for finding the three-dimensional structure of a molecule, A new bilevel formulation for the vehicle routing problem and a solution method using a genetic algorithm, Integrated order batching and vehicle routing operations in grocery retail -- a general adaptive large neighborhood search algorithm, A survey on the applications of variable neighborhood search algorithm in healthcare management, Local search algorithms for finding the Hamiltonian completion number of line graphs, Metaheuristics ``In the large, Solving the wire-harness design problem at a European car manufacturer, Consistent vehicle routing problem with service level agreements: a case study in the pharmaceutical distribution sector, Synergy of genetic algorithm with extensive neighborhood search for the permutation flowshop scheduling problem, An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers, A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems, An adaptive multiphase approach for large unconditional and conditional \(p\)-median problems, Memetic algorithms: The polynomial local search complexity theory perspective, A particle swarm optimization algorithm with path relinking for the location routing problem, A modified variable neighborhood search for the discrete ordered median problem, A variable neighborhood search with an effective local search for uncapacitated multilevel lot-sizing problems, Designing a sustainable closed-loop supply chain network based on triple bottom line approach: a comparison of metaheuristics hybridization techniques, Solution of real-world postman problems, A location-routing problem in glass recycling, Hybridizing simulated annealing with variable neighborhood search for bipartite graph crossing minimization, Variable neighborhood search and local branching, Sequential search and its application to vehicle-routing problems, First vs. best improvement: an empirical study, Expanding neighborhood GRASP for the traveling salesman problem, A metaheuristic to solve a location-routing problem with nonlinear costs, A mesh adaptive direct search algorithm for multiobjective optimization, A hybrid heuristic for the diameter constrained minimum spanning tree problem, Single machine scheduling to minimize maximum lateness subject to release dates and precedence constraints, An adaptive VNS algorithm for vehicle routing problems with intermediate stops, A fuzzy sets based generalization of contact maps for the overlap of protein structures, GRASP with variable neighborhood descent for the online order batching problem, A reduced variable neighborhood search algorithm for uncapacitated multilevel lot-sizing problems, Neighborhood decomposition based variable neighborhood search and tabu search for maximally diverse grouping, A comparative analysis of two matheuristics by means of merged local optima networks, Heuristics for the dynamic facility location problem with modular capacities, Hybrid VNS heuristics for the production scheduling of costumes for Brazilian carnival samba schools, On integrating an iterated variable neighborhood search within a bi-objective genetic algorithm: sum coloring of graphs case application, Candidate groups search for K-harmonic means data clustering, Dynamic three-stage operating room scheduling considering patient waiting time and surgical overtime costs, A patient flow scheduling problem in ophthalmology clinic solved by the hybrid EDA-VNS algorithm, Heuristic algorithms for the bi-objective hierarchical multimodal hub location problem in cargo delivery systems, A modeling framework and local search solution methodology for a production-distribution problem with supplier selection and time-aggregated quantity discounts, On solving the order processing in picking workstations, A survey of scheduling with parallel batch (p-batch) processing, The incorporation of fixed cost and multilevel capacities into the discrete and continuous single source capacitated facility location problem, Controlling mixed-model assembly lines in real-time by using distributed systems, Continuous scatter search: an analysis of the integration of some combination methods and improvement strategies, Closed-form formulas for evaluating \(r\)-flip moves to the unconstrained binary quadratic programming problem, Solving the \(p\)-median problem with pos/neg weights by variable neighborhood search and some results for special cases, A dynamic neighborhood based tabu search algorithm for real-world flight instructor scheduling problems, MOAQ and ant-Q algorithm for multiple objective optimization problems, Variable neighborhood search for the vertex weighted \(k\)-cardinality tree problem, Local optimization method with global multidimensional search, Computers and discovery in algebraic graph theory, Scheduling fixtures for basketball New Zealand, Fuzzy J-means: a new heuristic for fuzzy clustering, A matheuristic for the truck and trailer routing problem, A multi-objective combinatorial model of casualty processing in major incident response, Combining very large scale and ILP based neighborhoods for a two-level location problem, A hybrid clonal selection algorithm for the location routing problem with stochastic demands, Iterated local search for the team orienteering problem with time windows, A survey of search methodologies and automated system development for examination timetabling, A survey of recent research on location-routing problems, New neighborhood structures for the double traveling salesman problem with multiple stacks, Delivery strategies for blood products supplies, Multiple phase neighborhood search---GRASP based on Lagrangean relaxation, random backtracking Lin-Kernighan and path relinking for the TSP, Solving the maximum vertex weight clique problem via binary quadratic programming, A multi-objective evolutionary algorithm for examination timetabling, Uplink scheduling for joint wireless orthogonal frequency and time division multiple access networks, Hybrid algorithms for the vehicle routing problem with clustered backhauls and 3D loading constraints, Anytime Pareto local search, Heuristic approaches for biobjective mixed 0-1 integer linear programming problems, Exact and heuristic algorithms for the design of hub networks with multiple lines, The multi-compartment vehicle routing problem with flexible compartment sizes, Fast local search for single row facility layout, Aggregation heuristic for the open-pit block scheduling problem, The bipartite quadratic assignment problem and extensions, A hybrid heuristic approach for the multi-commodity pickup-and-delivery traveling salesman problem, Nested general variable neighborhood search for the periodic maintenance problem, A model for clustering data from heterogeneous dissimilarities, A computational study for bilevel quadratic programs using semidefinite relaxations, Large neighborhood search for multi-trip vehicle routing, A hybrid metaheuristic approach for the rollon-rolloff vehicle routing problem, A GRASP with path-relinking heuristic for the survivable IP/MPLS-over-WSON multi-layer network optimization problem, A math-heuristic for the warehouse location-routing problem in disaster relief, Location-arc routing problem: heuristic approaches and test instances, A nested heuristic for parameter tuning in support vector machines, Minimizing the total completion time in a distributed two stage assembly system with setup times, A two-stage heuristic approach for nurse scheduling problem: a case study in an emergency department, Variable neighborhood search for the pharmacy duty scheduling problem, A fix-and-optimize heuristic for the high school timetabling problem, A high performing metaheuristic for multi-objective flowshop scheduling problem, A variable neighborhood search particle filter for bearings-only target tracking, A column generation approach to extend lifetime in wireless sensor networks with coverage and connectivity constraints, A global optimisation approach for parameter estimation of a mixture of double Pareto lognormal and lognormal distributions, Optimizing frequent time-window selection for association rules mining in a temporal database using a variable neighbourhood search, A local search heuristic for the \((r| p)\)-centroid problem in the plane, Skewed general variable neighborhood search for the location routing scheduling problem, Bi-objective integrating sustainable order allocation and sustainable supply chain network strategic design with stochastic demand using a novel robust hybrid multi-objective metaheuristic, Variable neighborhood search for location routing, An efficient hybrid meta-heuristic for aircraft landing problem, Combining the principles of variable neighborhood decomposition search and the Fix\&Optimize heuristic to solve multi-level lot-sizing and scheduling problems, Hybrid column generation and large neighborhood search for the dial-a-ride problem, Load-dependent and precedence-based models for pickup and delivery problems, Heuristic approaches for scheduling jobs in large-scale flexible job shops, A destroy and repair algorithm for the bike sharing rebalancing problem, Variable neighborhood search for the second type of two-sided assembly line balancing problem, The dynamic vehicle allocation problem with application in trucking companies in Brazil, On the extremal properties of the average eccentricity, An iterative approach for the serial batching problem with parallel machines and job families, Point-to-point shortest paths on dynamic time-dependent road networks, A recipe for finding good solutions to MINLPs, Algorithms for the maximum \(k\)-club problem in graphs, Space and time allocation in a shipyard assembly hall, Ambulance location and relocation problems with time-dependent travel times, Metaheuristic methods based on tabu search for assigning judges to competitions, Adapting derivative free optimization methods to engineering models with discrete variables, Design of highly synchronizable and robust networks, The tree representation for the pickup and delivery traveling salesman problem with LIFO loading, Solving the two-echelon location routing problem by a GRASP reinforced by a learning process and path relinking, A GRASP with evolutionary path relinking for the truck and trailer routing problem, A GRASP based on DE to solve single machine scheduling problem with SDST, Variable neighborhood search for harmonic means clustering, Similarities between meta-heuristics algorithms and the science of life, Exact and heuristic solutions to minimize total waiting time in the blood products distribution problem, A unified framework for population-based metaheuristics, Functional data clustering via piecewise constant nonparametric density estimation, Heuristic and exact algorithms for the multi-pile vehicle routing problem, A variable neighborhood search based matheuristic for nurse rostering problems, An improved column generation algorithm for minimum sum-of-squares clustering, Column generation bounds for numerical microaggregation, Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems, Stochastic and semidefinite optimization for scheduling in orthogonal frequency division multiple access networks, A simultaneous and iterative approach for parallel machine scheduling with sequence-dependent family setups, An optimization algorithm for solving the rich vehicle routing problem based on variable neighborhood search and tabu search metaheuristics, A filling function method for unconstrained global optimization, A multi-objective capacitated rural school bus routing problem with heterogeneous fleet and mixed loads, The heterogeneous \(p\)-median problem for categorization based clustering, Local search for the undirected capacitated arc routing problem with profits, Adaptive memory in multistart heuristics for multicommodity network design, Assigning judges to competitions of several rounds using tabu search, Improved convergent heuristics for the 0-1 multidimensional knapsack problem, Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem, Variable neighborhood search for the maximum clique, A tabu search algorithm for the heterogeneous fixed fleet vehicle routing problem, Heuristic methods for the optimal statistic median problem, Multiobjective optimization for multimode transportation problems, Approaching rank aggregation problems by using evolution strategies: the case of the optimal bucket order problem, Multi-objective microzone-based vehicle routing for courier companies: from tactical to operational planning, Heuristics for the multi-period orienteering problem with multiple time windows, Optimum simultaneous discretization with data grid models in supervised classification: a Bayesian model selection approach, Open problems on graph eigenvalues studied with AutoGraphiX, SO-I: a surrogate model algorithm for expensive nonlinear integer programming problems including global optimization applications, A matheuristic approach for the two-machine total completion time flow shop problem, Transshipment service through crossdocks with both soft and hard time windows, Objective function features providing barriers to rapid global optimization, Heuristic procedures for solving the discrete ordered median problem, Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods, Metaheuristics in combinatorial optimization, Discovering patterns in time-varying graphs: a triclustering approach, Multi-commodity demand fulfillment via simultaneous pickup and delivery for a fast fashion retailer, Computing the metric dimension of graphs by genetic algorithms, Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery, Detailed layout planning for irregularly-shaped machines with transportation path design, A matheuristic approach for the quickest multicommodity \(k\)-splittable flow problem, Bi-objective optimisation model for installation scheduling in offshore wind farms, A VNS approach to multi-location inventory redistribution with vehicle routing, Solving multifacility Huff location models on networks using metaheuristic and exact approaches, Variable neighborhood search variants for min-power symmetric connectivity problem, Variable neighbourhood search and tabu search for a discrete time/cost trade-off problem to minimize the maximal cash flow gap, A parallel variable neighborhood search for the vehicle routing problem with divisible deliveries and pickups, A variable neighborhood search and simulated annealing hybrid for the profile minimization problem, Scheduling periodic customer visits for a traveling salesperson, The \(p\)-median problem: a survey of metaheuristic approaches, Solving the unconstrained optimization problem by a variable neighborhood search, Learning multicriteria fuzzy classification method PROAFTN from data, Minimization of the total traveling distance and maximum distance by using a transformed-based encoding EDA to solve the multiple traveling salesmen problem, A metaheuristic approach to solving a multiproduct EOQ-based inventory problem with storage space constraints, Parallel machine total tardiness scheduling with a new hybrid metaheuristic approach, An exact method for the discrete \((r|p)\)-centroid problem, A hybrid method based on linear programming and variable neighborhood descent for scheduling production in open-pit mines, Extended formulations and branch-and-cut algorithms for the black-and-white traveling salesman problem, VNS matheuristic for a bin packing problem with a color constraint, Exploring variable neighborhood search for automatic algorithm configuration, A variable neighborhood search algorithm for the capacitated vehicle routing problem, Order picking with multiple pickers and due dates -- simultaneous solution of order batching, batch assignment and sequencing, and picker routing problems, A multi-start variable neighborhood search for solving the single path multicommodity flow problem, Solving spread spectrum radar polyphase code design problem by tabu search and variable neighbourhood search., Approximative procedures for no-wait job shop scheduling., Task scheduling using two-phase variable neighborhood search algorithm on heterogeneous computing and grid environments, Heuristics for routing heterogeneous unmanned vehicles with fuel constraints, Variable neighbourhood search and mathematical programming for just-in-time job-shop scheduling problem, Model and algorithm for inventory/routing decision in a three-echelon logistics system, Variable neighborhood search for minimum cost berth allocation, Variable neighborhood search for extremal graphs. 16. Some conjectures related to the largest eigenvalue of a graph, General variable neighborhood search for the continuous optimization, Diversified local search strategy under scatter search framework for the probabilistic traveling salesman problem, A discrete particle swarm optimization for lot-streaming flowshop scheduling problem, Nonsmooth optimization through mesh adaptive direct search and variable neighborhood search, Effective metaheuristics for scheduling a hybrid flowshop with sequence-dependent setup times, An efficient local search for the feedback vertex set problem, Comparison and hybridization of crossover operators for the nurse scheduling problem, Expanding neighborhood search-GRASP for the probabilistic traveling salesman problem, A hybrid scheduling approach for a two-stage flexible flow shop with batch processing machines, A variable neighborhood search for the capacitated arc routing problem with intermediate facilities, A reactive variable neighborhood tabu search for the heterogeneous fleet vehicle routing problem with time windows, Local and variable neighborhood search for the \(k\) -cardinality subgraph problem, Combining variable neighborhood search and estimation of distribution algorithms in the protein side chain placement problem, Improving simulated annealing with variable neighborhood search to solve the resource-constrained scheduling problem, Variable neighborhood search for extremal graphs. 21. Conjectures and results about the independence number, A hybrid integer programming and variable neighbourhood search algorithm to solve nurse rostering problems, Layout optimisation for an installation port of an offshore wind farm, Adaptive large neighborhood search heuristics for multi-tier service deployment problems in clouds, A multi-threaded local search algorithm and computer implementation for the multi-mode, resource-constrained multi-project scheduling problem, A hybrid particle swarm optimization -- variable neighborhood search algorithm for constrained shortest path problems, Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm, Large multiple neighborhood search for the clustered vehicle-routing problem, A survey of automated conjectures in spectral graph theory, A GRASP with adaptive large neighborhood search for pickup and delivery problems with transshipment, Managing the tabu list length using a fuzzy inference system: an application to examination timetabling, Large neighbourhood search algorithms for the founder sequence reconstruction problem, Neighborhood search techniques for solving uncapacitated multilevel lot-sizing problems, A variable neighborhood search for minimizing total weighted tardiness with sequence dependent setup times on a single machine, Rounding-based heuristics for nonconvex MINLPS, Honey bees mating optimization algorithm for large scale vehicle routing problems, Variable neighbourhood search: methods and applications, Setting a common due date in a constrained flowshop: a variable neighbourhood search approach, The quadratic minimum spanning tree problem: a lower bounding procedure and an efficient search algorithm, A general variable neighborhood search for solving the uncapacitated single allocation \(p\)-hub median problem, Hybrid variable neighbourhood approaches to university exam timetabling, Accelerated tabu search for no-wait flowshop scheduling problem with maximum lateness criterion, A hybrid scatter search heuristic for personalized crew rostering in the airline industry, Nordhaus-Gaddum relations for proximity and remoteness in graphs, Mathematical models and solution methods for optimal container terminal yard layouts, Attraction probabilities in variable neighborhood search, Parallel machine scheduling with precedence constraints and setup times, Discrepancy search for the flexible job shop scheduling problem, A multi-stage facility location problem with staircase costs and splitting of commodities: model, heuristic approach and application, Iterated greedy local search methods for unrelated parallel machine scheduling, A hybrid heuristic algorithm for the open-pit-mining operational planning problem, Minimizing total tardiness on a single machine with controllable processing times, A population-based variable neighborhood search for the single machine total weighted tardiness problem, An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems, Edge-swapping algorithms for the minimum fundamental cycle basis problem, A novel hybrid differential evolution and particle swarm optimization algorithm for unconstrained optimization, A survey on metaheuristics for stochastic combinatorial optimization, The double traveling salesman problem with multiple stacks: A variable neighborhood search approach, A robust and efficient algorithm for planar competitive location problems, Greedy randomized adaptive search and variable neighbourhood search for the minimum labelling spanning tree problem, Variable neighbourhood search: Methods and applications, A hybrid multi-swarm particle swarm optimization algorithm for the probabilistic traveling salesman problem, Hybridization of very large neighborhood search for ready-mixed concrete delivery problems, Construction of constant GC-content DNA codes via a variable neighbourhood search algorithm, An open vehicle routing problem metaheuristic for examining wide solution neighborhoods, The distributed permutation flowshop scheduling problem, Vendor managed inventory for environments with stochastic product usage, Real-time control of freight forwarder transportation networks by integrating multimodal transport chains, A hybrid model of integer programming and variable neighbourhood search for highly-constrained nurse rostering problems, A non-delayed relax-and-cut algorithm for scheduling problems with parallel machines, due dates and sequence-dependent setup times, An integration of mixed VND and VNS: the case of the multivehicle covering tour problem, The zone-based dynamic facility layout problem, Taking advantage of symmetry in some quadratic assignment problems, On the integrated charge planning with flexible jobs in primary steelmaking processes, A variable neighbourhood search algorithm for the flexible job-shop scheduling problem, Symmetry in Mathematical Programming, A variable neighborhood search method for solving the traveling tournaments problem, Multi-objective iterated greedy variable neighborhood search algorithm for solving a full-load automated guided vehicle routing problem with battery constraints, 0-1 quadratic knapsack problem solved with VNS algorithm, An improved water wave optimization algorithm with the single wave mechanism for the no-wait flow-shop scheduling problem, Comparison of metaheuristics for the bilevel facility location and mill pricing problem, Convergence analysis of the plant propagation algorithm for continuous global optimization, Variable neighbourhood decomposition search for \(0\)-\(1\) mixed integer programs, On black-box optimization in divide-and-conquer SAT solving, Large multiple neighborhood search for the soft-clustered vehicle-routing problem, A hybrid algorithm for the multi-depot heterogeneous dial-a-ride problem, Neighborhood decomposition-driven variable neighborhood search for capacitated clustering, Variable neighborhood search for large offshore wind farm layout optimization, Computational study of a branching algorithm for the maximum \(k\)-cut problem, A mixed truck and robot delivery approach for the daily supply of customers, New variable neighborhood search method for minimum sum coloring problem on simple graphs, Hybrid Metaheuristics: An Introduction, A multi-start evolutionary local search for the one-commodity pickup and delivery traveling salesman problem, A variable neighborhood search algorithm for an integrated physician planning and scheduling problem, Multi-objective energy-efficient hybrid flow shop scheduling using Q-learning and GVNS driven NSGA-II, In memory of Professor Nenad Mladenović (1951--2022), A general variable neighborhood search approach for the minimum load coloring problem, Efficient metaheuristics for the home (health)-care routing and scheduling problem with time windows and synchronized visits, Variable neighborhood search for the single machine scheduling problem to minimize the total early work, Parameter less hybrid IG-Jaya approach for permutation flow shop scheduling problem, A matheuristic for tri-objective binary integer linear programming, Variable neighborhood search based approaches to a vehicle scheduling problem in agriculture, Regression‐based heterogeneity analysis to identify overlapping subgroup structure in high‐dimensional data, Multiple traveling salesperson problem with drones: general variable neighborhood search approach, Metaheuristics for solving the biobjective single‐path multicommodity communication flow problem, A metaheuristic for crew scheduling in a pickup‐and‐delivery problem with time windows, Feature selection in machine learning via variable neighborhood search, A variable neighborhood search heuristic algorithm for the double vehicle routing problem with multiple stacks, A parallel variable neighborhood search approach for the obnoxious p‐median problem, Solving the bi‐objective capacitated p‐median problem with multilevel capacities using compromise programming and VNS, Multiobjective pseudo‐variable neighborhood descent for a bicriteria parallel machine scheduling problem with setup time, Scheduling operating rooms of multiple hospitals considering transportation and deterioration in mass-casualty incidents, Metaheuristics: A Canadian Perspective, Routing in offshore wind farms: a multi-period location and maintenance problem with joint use of a service operation vessel and a safe transfer boat, New neighborhoods and an iterated local search algorithm for the generalized traveling salesman problem, Efficient heuristics for a partial set covering problem with mutually exclusive pairs of facilities, Aggregation tree construction using hierarchical structures, LP relaxation and dynamic programming enhancing VNS for the multiple knapsack problem with setup, A refinement of the gravity model for competitive facility location, A general variable neighborhood search for the traveling salesman problem with time windows under various objectives, Assigning Team Tasks and Multiple Activities to Fixed Work Shifts, Modèle linéaire mixte et heuristique pour un réseau de distribution à deux échelons pour des produits périssables, A genetic algorithm for scheduling open shops with conflict graphs to minimize the makespan, Structure of Nonregular Two-Level Designs, Solving a real-world multi-depot multi-period petrol replenishment problem with complex loading constraints, Mathematical model and a variable neighborhood search algorithm for mixed-model robotic two-sided assembly line balancing problems with sequence-dependent setup times, A hybrid method based on SA and VNS algorithms for solving DAP in DDS, A novel iterated greedy algorithm for no-wait permutation flowshop scheduling to minimize weighted quadratic tardiness, A biobjective decision model to increase security and reduce travel costs in the cash-in-transit sector, A particle swarm optimization algorithm for hybrid flow-shop scheduling with multiprocessor tasks, Continuous Variable Neighborhood Search (C-VNS) for Solving Systems of Nonlinear Equations, HEURISTICS WITH STOCHASTIC NEIGHBORHOOD STRUCTURES FOR TWO-DIMENSIONAL BIN PACKING AND CUTTING STOCK PROBLEMS, Construct, Merge, Solve and Adapt Versus Large Neighborhood Search for Solving the Multi-dimensional Knapsack Problem: Which One Works Better When?, PERMUTATION-BASED GENETIC, TABU, AND VARIABLE NEIGHBORHOOD SEARCH HEURISTICS FOR MULTIPROCESSOR SCHEDULING WITH COMMUNICATION DELAYS, The school bus routing and scheduling problem with transfers, Vehicle Routing Problems with Inter-Tour Resource Constraints, Solving a bus driver scheduling problem with randomized multistart heuristics, A branch‐and‐price approach to k‐clustering minimum biclique completion problem, Recherche à voisinage variable de graphes extrémaux 13. à propos de la maille, Application of semi definite relaxation and variable neighborhood search for multiuser detection in synchronous CDMA, A HYBRID METAHEURISTIC FOR THE SINGLE-MACHINE TOTAL WEIGHTED TARDINESS PROBLEM, Total tardiness minimization in permutation flow shops: a simple approach based on a variable greedy algorithm, Optimal Investment in the Development of Oil and Gas Field, Merging Variables: One Technique of Search in Pseudo-Boolean Optimization, Minimizing Piecewise-Concave Functions Over Polyhedra, On a Three-Level Competitive Pricing Problem with Uniform and Mill Pricing Strategies, SOLVING THE OPEN SHOP SCHEDULING PROBLEM VIA A HYBRID GENETIC-VARIABLE NEIGHBORHOOD SEARCH ALGORITHM, Two effective hybrid metaheuristic algorithms for minimization of multimodal functions, A new variable neighborhood search approach for solving dynamic memory allocation problem, The capacitated single-source p-center problem in the presence of fixed cost and multilevel capacities using VNS and aggregation technique, VNS heuristic for the –centroid problem on the plane, A double VNS heuristic for the facility location and pricing problem, Metaheuristic methods for solving the Bilevel Uncapacitated Facility Location Problem with Clients' Preferences, Solving the minimum labelling spanning tree problem using hybrid local search, Solving Multifacility Huff Location Models on Networks Using Variable Neighborhood Search and Multi-Start Local Search Metaheuristics, Variable neighborhood search method for optimizing the emergency service network of police special forces units, Packing Unit Spheres into a Cube Using VNS, A Simulated Annealing with Variable Neighborhood Search Approach to Construct Mixed Covering Arrays, Gaussian Variable Neighborhood Search and Enhanced Genetic Algorithm for Continuous Optimization, Heuristics and matheuristics for a real‐life machine reassignment problem, Effective Algorithms for a Bounded Version of the Uncapacitated TPP, A Variable Neighborhood Search Algorithm for Cost-Balanced Travelling Salesman Problem, Online Learning of a Weighted Selective Naive Bayes Classifier with Non-convex Optimization, AutoGraphiX: a survey, Local search with an exponential neighborhood for the servers load balancing problem, Adaptive Tunning of All Parameters in a Multi-Swarm Particle Swarm Optimization Algorithm: An Application to the Probabilistic Traveling Salesman Problem

Uses Software

Cites Work