Variable neighborhood search

Related Items

Exact and approximate approaches for the Pareto front generation of the single path multicommodity flow problem, A comparison of simulated annealing algorithms for variable selection in principal component analysis and discriminant analysis, The planar multifacility collection depots location problem, Alternative evaluation functions for the cyclic bandwidth sum problem, A revised variable neighborhood search for the discrete ordered median problem, Variable neighborhood search for the degree-constrained minimum spanning tree problem, A VNS-LP algorithm for the robust dynamic maximal covering location problem, Stochastic model of the electric power purchase system on a railway segment, The 2-stage assembly flowshop scheduling problem with total completion time: efficient constructive heuristic and metaheuristic, Solving the bus evacuation problem and its variants, Metaheuristics for the single machine weighted quadratic tardiness scheduling problem, The Boolean quadratic programming problem with generalized upper bound constraints, Lane covering with partner bounds in collaborative truckload transportation procurement, Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion, A quality and distance guided hybrid algorithm for the vertex separator problem, A hybrid variable neighborhood search for the orienteering problem with mandatory visits and exclusionary constraints, Combining VNS with genetic algorithm to solve the one-to-one routing issue in road networks, The multiple trip vehicle routing problem with backhauls: formulation and a two-level variable neighbourhood search, A general variable neighborhood search for the swap-body vehicle routing problem, Variable neighborhood search strategies for the order batching problem, An integration of Lagrangian split and VNS: the case of the capacitated vehicle routing problem, A VNS approach to multi-location inventory redistribution with vehicle routing, Variable neighbourhood search and tabu search for a discrete time/cost trade-off problem to minimize the maximal cash flow gap, Generic Pareto local search metaheuristic for optimization of targeted offers in a bi-objective direct marketing campaign, A heuristic algorithm for a single vehicle static bike sharing rebalancing problem, Two-machine flow shop scheduling problem with blocking, multi-task flexibility of the first machine, and preemption, Efficient local search limitation strategy for single machine total weighted tardiness scheduling with sequence-dependent setup times, Algorithms for job scheduling problems with distinct time windows and general earliness/tardiness penalties, Balancing stochastic two-sided assembly line with multiple constraints using hybrid teaching-learning-based optimization algorithm, An exact hybrid method for the vehicle routing problem with time windows and multiple deliverymen, A multi-start iterated local search algorithm for the generalized quadratic multiple knapsack problem, A fast two-level variable neighborhood search for the clustered vehicle routing problem, A meta-heuristic based goal-selection strategy for mobile robot search in an unknown environment, A variable neighborhood search algorithm for the surgery tactical planning problem, A variable MIP neighborhood descent algorithm for managing inventory and distribution of cash in automated Teller machines, A parallel variable neighborhood search for the vehicle routing problem with divisible deliveries and pickups, A variable neighborhood search heuristic for the maximum ratio clique problem, Exact and heuristic algorithms for order acceptance and scheduling with sequence-dependent setup times, An efficient implementation of a static move descriptor-based local search heuristic, Robust vehicle routing problem with hard time windows under demand and travel time uncertainty, Heuristic algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem, A hybrid metaheuristic algorithm for the vehicle routing problem with stochastic demands, An algorithmic framework for generating optimal two-stratum experimental designs, DRSCRO: A metaheuristic algorithm for task scheduling on heterogeneous systems, Guided dive for the spatial branch-and-bound, A general variable neighborhood search variants for the travelling salesman problem with draft limits, General variable neighborhood search for computing graph separators, A general variable neighborhood search for solving the uncapacitated \(r\)-allocation \(p\)-hub Median problem, Solving the clique partitioning problem as a maximally diverse grouping problem, A metaheuristic approach to solving a multiproduct EOQ-based inventory problem with storage space constraints, A metaheuristic approach to the dominating tree problem, Real-time vehicle routing: Solution concepts, algorithms and parallel computing strategies., Guidelines for the use of meta-heuristics in combinatorial optimization., Variable neighborhood tabu search and its application to the median cycle problem., A variable neighborhood search for graph coloring., Solving spread spectrum radar polyphase code design problem by tabu search and variable neighbourhood search., Solving the resource-constrained project scheduling problem by a variable neighbourhood search., Variable neighborhood search for the cost constrained minimum label spanning tree and label constrained minimum spanning tree problems, Setting a common due date in a constrained flowshop: a variable neighbourhood search approach, A general variable neighborhood search for solving the uncapacitated single allocation \(p\)-hub median problem, Hybrid variable neighbourhood approaches to university exam timetabling, Nordhaus-Gaddum relations for proximity and remoteness in graphs, Vehicle dispatching algorithms for container transshipment hubs, Mathematical models and solution methods for optimal container terminal yard layouts, Attraction probabilities in variable neighborhood search, Industrial aspects and literature survey: fleet composition and routing, 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, A metaheuristic for the min-max windy rural postman problem with K vehicles, 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, Allocation search methods for a generalized class of location-allocation problems, The traveling purchaser problem with budget constraint, A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem, Variable neighborhood search for the heaviest \(k\)-subgraph, VNS and second order heuristics for the min-degree constrained minimum spanning tree problem, The double traveling salesman problem with multiple stacks: A variable neighborhood search approach, The single-finger keyboard layout problem, Norm statistics and the complexity of clustering problems, Greedy randomized adaptive search and variable neighbourhood search for the minimum labelling spanning tree problem, The double travelling salesman problem with multiple stacks - formulation and heuristic solution approaches, Corrigendum to ``Variable space search for graph coloring [Discrete Appl. Math. 156, No.\,13, 2551--2560 (2008; Zbl 1213.05085)], A flexible model and efficient solution strategies for discrete location problems, The impact of parametrization in memetic evolutionary algorithms, Variable neighbourhood search: Methods and applications, Cyber swarm algorithms - improving particle swarm optimization using adaptive memory strategies, A hybrid evolution strategy for the open vehicle routing problem, Hybridization of very large neighborhood search for ready-mixed concrete delivery problems, Local search intensified: very large-scale variable neighborhood search for the multi-resource generalized assignment problem, The distributed permutation flowshop scheduling problem, Vendor managed inventory for environments with stochastic product usage, 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, Clustering qualitative data based on binary equivalence relations: neighborhood search heuristics for the clique partitioning problem, Variable neighborhood search heuristics for selecting a subset of variables in principal component analysis, Stabilized column generation, Perturbation heuristics for the pickup and delivery traveling salesman problem, A reactive tabu search meta-heuristic for the vehicle routing problem with back-hauls, Solving the petroleum replenishment and routing problem with variable demands and time windows, An optimization model for minimizing systemic risk, A restarted and modified simplex search for unconstrained optimization, Graph colouring approaches for a satellite range scheduling problem, A survey of search methodologies and automated system development for examination timetabling, An optimization approach for communal home meal delivery service: A case study, New neighborhood structures for the double traveling salesman problem with multiple stacks, Delivery strategies for blood products supplies, A multi-objective evolutionary algorithm for examination timetabling, Classification of applied methods of combinatorial optimization, Principles for the design of large neighborhood search, A survey for the quadratic assignment problem, A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem, Experimental investigation of heuristics for resource-constrained project scheduling: an update, Heuristics for the mirrored traveling tournament 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, An efficient variable neighborhood search heuristic for very large scale vehicle routing problems, Self-organizing feature maps for the vehicle routing problem with backhauls, A variable neighborhood search based algorithm for finite-horizon Markov decision processes, Ambulance location and relocation problems with time-dependent travel times, New heuristic for harmonic means clustering, Solving the planar \(p\)-Median problem by variable neighborhood and concentric searches, Multi-objective variable neighborhood search: an application to combinatorial optimization problems, A VNS metaheuristic for solving the aircraft conflict detection and resolution problem by performing turn changes, PILOT, GRASP, and VNS approaches for the static balancing of bicycle sharing systems, Fitting censored quantile regression by variable neighborhood search, Design of highly synchronizable and robust networks, Heuristic and exact algorithms for a min-max selective vehicle routing problem, New and efficient DCA based algorithms for minimum sum-of-squares clustering, A multi-start variable neighborhood search for solving the single path multicommodity flow problem, Hybridizing evolutionary algorithms with variable-depth search to overcome local optima, Variable neighborhood search for harmonic means clustering, The orienteering problem with stochastic travel and service times, Securing home health care in times of natural disasters, Risk approaches for delivering disaster relief supplies, Vehicle routing with compartments: applications, modelling and heuristics, A variable neighborhood search heuristic for the design of multicommodity production-distribution networks with alternative facility configurations, Heuristic and exact algorithms for the multi-pile vehicle routing problem, A tabu-search heuristic for deterministic two-mode blockmodeling of binary network matrices, An effective VNS for the capacitated \(p\)-median problem, Model and algorithm for inventory/routing decision in a three-echelon logistics system, Variable neighborhood search for minimum cost berth allocation, A general vehicle routing problem, Variable neighborhood search for extremal graphs. 16. Some conjectures related to the largest eigenvalue of a graph, Skewed VNS enclosing second order algorithm for the degree constrained minimum spanning tree problem, Applying the pilot method to improve VNS and GRASP metaheuristics for the design of SDH/WDM networks, Combining VNS with constraint programming for solving anytime optimization problems, General variable neighborhood search for the continuous optimization, Memetic algorithm based on improved inver-over operator and Lin-Kernighan local search for the Euclidean traveling salesman problem, Nonsmooth optimization through mesh adaptive direct search and variable neighborhood search, An improved column generation algorithm for minimum sum-of-squares clustering, A modified VNS metaheuristic for max-bisection problems, Exact \(L_{2}\)-norm plane separation, A stochastic model related to the Richards-type growth curve. Estimation by means of simulated annealing and variable neighborhood search, A heuristic approach to solve the preventive health care problem with budget and congestion constraints, Design of hybrids for the minimum sum-of-squares clustering problem, A variable neighborhood search for the capacitated arc routing problem with intermediate facilities, 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, A variable-neighbourhood search algorithm for finding optimal run orders in the presence of serial correlation, A memetic algorithm for the flexible flow line scheduling problem with processor blocking, 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, Variable space search for graph coloring, Bounding, filtering and diversification in CP-based local branching, Scatter search for the bandpass problem, A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem, A basic variable neighborhood search heuristic for the uncapacitated multiple allocation \(p\)-hub center problem, J-means and I-means for minimum sum-of-squares clustering on networks, General variable neighborhood search for the uncapacitated single allocation \(p\)-hub center problem, A survey of automated conjectures in spectral graph theory, The heterogeneous \(p\)-median problem for categorization based clustering, Consistent neighborhood search for combinatorial optimization, A reactive GRASP with path relinking for capacitated clustering, Adaptive memory programming: local search parallel algorithms for phylogenetic tree construc\-tion, Alternating local search based VNS for linear classification, Variable neighbourhood search: methods and applications, Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports, Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem, An adaptive memory algorithm for the split delivery vehicle routing problem, Variable neighborhood search for the maximum clique, A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery, Scheduling technicians and tasks in a telecommunications company, A metaheuristic for stochastic service network design, Integrated slicing tree approach for solving the facility layout problem with input and output locations based on contour distance, The multi-vehicle probabilistic covering tour problem, Heuristics for the multi-period orienteering problem with multiple time windows, Automated generation of conjectures on forbidden subgraph characterization, Open problems on graph eigenvalues studied with AutoGraphiX, SO-I: a surrogate model algorithm for expensive nonlinear integer programming problems including global optimization applications, Transshipment service through crossdocks with both soft and hard time windows, A variables neighborhood search algorithm for solving fuzzy quadratic programming problems using modified Kerre's method, An iterated greedy algorithm with variable neighborhood descent for the planning of specialized diagnostic services in a segmented healthcare system, Bi-level programming problem in the supply chain and its solution algorithm, A class of exponential neighbourhoods for the quadratic travelling salesman problem, 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, Heuristic methods for minimum-cost pipeline network design -- a node valency transfer metaheuristic, A variable neighborhood search based matheuristic for a waste cooking oil collection network design problem, Portfolio decision analysis with a generalized balance approach, Modelling and solving the milk collection problem with realistic constraints, A general variable neighborhood search algorithm for a parallel-machine scheduling problem considering machine health conditions and preventive maintenance, Integrating order delivery and return operations for order fulfillment in an online retail environment, The pickup and delivery problem with alternative locations and overlapping time windows, An effective iterated two-stage heuristic algorithm for the multiple traveling salesmen problem, Variable neighborhood search for quadratic multiple constraint variable sized bin-packing problem, A continuous location and maintenance routing problem for offshore wind farms: mathematical models and hybrid methods, A variable neighborhood search algorithm for the \((r\mid p)\) hub-centroid problem under the price war, Algorithm selection for the team orienteering problem, A variable neighborhood search algorithm for human resource selection and optimization problem in the home appliance manufacturing industry, An effective hybrid search algorithm for the multiple traveling repairman problem with profits, E-platooning: optimizing platoon formation for long-haul transportation with electric commercial vehicles, The hybrid electric vehicle-traveling salesman problem with time windows, Packing rectangles into a fixed size circular container: constructive and metaheuristic search approaches, Biased random-key genetic algorithm for scheduling identical parallel machines with tooling constraints, An integrated solution approach for multi-objective, multi-skill workforce scheduling and routing problems, Multiple \(k\)-opt evaluation multiple \(k\)-opt moves with GPU high performance local search to large-scale traveling salesman problems, An integrated dynamic facility layout and job shop scheduling problem: a hybrid NSGA-II and local search algorithm, Double descent and intermittent color diffusion for landscape exploration, Variable neighborhood search for the travelling deliveryman problem, A memetic algorithm for solving optimal control problems of Zika virus epidemic with equilibriums and backward bifurcation analysis, A variable neighborhood search algorithm for the leather nesting problem, Less is more: variable neighborhood search for integrated production and assembly in smart manufacturing, Robust parallel-batching scheduling with fuzzy deteriorating processing time and variable delivery time in smart manufacturing, An algorithmic framework based on primitive directions and nonmonotone line searches for black-box optimization problems with integer variables, Degree-constrained \(k\)-minimum spanning tree problem, A hybrid DBH-VNS for high-end equipment production scheduling with machine failures and preventive maintenance activities, Hybrid evolutionary search for the traveling repairman problem with profits, Variable neighborhood search based algorithms to solve a rich \(k\)-travelling repairmen problem, Hamiltonian decomposition and verifying vertex adjacency in 1-skeleton of the traveling salesperson polytope by variable neighborhood search, Introduction of an underground waste container system-model and solution approaches, A survey on the applications of variable neighborhood search algorithm in healthcare management, Integrated inventory and production policy for manufacturing with perishable raw materials, Conference scheduling: a clustering-based approach, Machine learning at the service of meta-heuristics for solving combinatorial optimization problems: a state-of-the-art, An efficient variable neighborhood search for the space-free multi-row facility layout problem, A new energy-aware flexible job shop scheduling method using modified biogeography-based optimization, Solving the traveling repairman problem with profits: a novel variable neighborhood search approach, Reducing pollutant emissions in a waste collection vehicle routing problem using a variable neighborhood tabu search algorithm: a case study, Less is more: general variable neighborhood search for the capacitated modular hub location problem, Designing a sustainable supply chain network integrated with vehicle routing: a comparison of hybrid swarm intelligence metaheuristics, A new local search for continuous location problems, 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, Minimizing dispersion in multiple drone routing, Designing a sustainable closed-loop supply chain network based on triple bottom line approach: a comparison of metaheuristics hybridization techniques, A hybrid VNS/tabu search algorithm for solving the vehicle routing problem with drones and en route operations, Multi-objective metaheuristic algorithms for the resource-constrained project scheduling problem with precedence relations, A branch-and-bound algorithm for assembly line worker assignment and balancing problems, Cooperative cover of uniform demand, A location-routing problem in glass recycling, Branch-and-price for \(p\)-cluster editing, Variable neighbourhood search for the minimum labelling Steiner tree problem, Neighborhood structures for the container loading problem: a VNS implementation, Merging the local and global approaches to probabilistic satisfiability, Industrial aspects and literature survey: Combined inventory management and routing, A hybrid metaheuristic for the prize-collecting single machine scheduling problem with sequence-dependent setup times, Exact solution of the soft-clustered vehicle-routing problem, An adaptive large neighborhood search approach for multiple traveling repairman problem with profits, Parallel-machine group scheduling with inclusive processing set restrictions, outsourcing option and serial-batching under the effect of step-deterioration, GRASP with variable neighborhood descent for the online order batching problem, Cooperative versus non-cooperative parallel variable neighborhood search strategies: a case study on the capacitated vehicle routing problem, Revenue maximization of Internet of things provider using variable neighbourhood search, Using intermediate infeasible solutions to approach vehicle routing problems with precedence and loading constraints, Hyper-heuristic approaches for the response time variability problem, A reduced variable neighborhood search algorithm for uncapacitated multilevel lot-sizing problems, A meta-heuristic to solve the just-in-time job-shop scheduling problem, Optimization of product category allocation in multiple warehouses to minimize splitting of online supermarket customer orders, Formulations, branch-and-cut and a hybrid heuristic algorithm for an inventory routing problem with perishable products, Variable neighborhood search for a two-stage stochastic programming problem with a quantile criterion, A metaheuristic for the delivery man problem with time windows, Integer programming formulations and efficient local search for relaxed correlation clustering, Heuristic algorithms for the bi-objective hierarchical multimodal hub location problem in cargo delivery systems, GOPS: efficient RBF surrogate global optimization algorithm with high dimensions and many parallel processors including application to multimodal water quality PDE model calibration, On solving the order processing in picking workstations, A matheuristic for the 0--1 generalized quadratic multiple knapsack problem, Finding the maximum multi improvement on neighborhood exploration, A general variable neighborhood search approach based on a \(p\)-median model for cellular manufacturing problems, A variable neighborhood search heuristic for nonnegative matrix factorization with application to microarray data, A parallel variable neighborhood search for solving covering salesman problem, Variable neighborhood programming for symbolic regression, An efficient heuristic for a hub location routing problem, A multi-objective parallel variable neighborhood search for the bi-objective obnoxious p-median problem, A variable neighborhood search for the last-mile delivery problem during major infectious disease outbreak, Bi-objective optimization model for the heterogeneous dynamic dial-a-ride problem with no rejects, A covering traveling salesman problem with profit in the last mile delivery, Non-dominated solutions for time series learning and forecasting. Generating models with a generic two-phase Pareto loca search with VND, Less is more approach in optimization: a road to artificial intelligence, Reliable hub-and-spoke systems with multiple capacity levels and flow dependent discount factor, Routing for unmanned aerial vehicles: touring dimensional sets, Fuzzy metrics and its applications in image processing, Solving the traveling delivery person problem with limited computational time, Mixed-model assembly line balancing problem considering learning effect and uncertain demand, Unrelated parallel machine scheduling with eligibility constraints and delivery times to minimize total weighted tardiness, A variable neighborhood search-based algorithm with adaptive local search for the vehicle routing problem with time windows and multi-depots aiming for vehicle fleet reduction, A general variable neighborhood search for the cyclic antibandwidth problem, A cumulative unmanned aerial vehicle routing problem approach for humanitarian coverage path planning, 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, The team orienteering problem with time windows: an LP-based granular variable neighborhood search, A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem, Variable neighborhood search for metric dimension and minimal doubly resolving set problems, A hybrid algorithm for the heterogeneous fleet vehicle routing problem, A simple and effective metaheuristic for the minimum latency problem, Local search based heuristics for global optimization: atomic clusters and beyond, Variable neighbourhood structures for cycle location problems, Multiple pickup and delivery traveling salesman problem with last-in-first-out loading and distance constraints, On mathematical optimization for the visualization of frequencies and adjacencies as rectangular maps, The static bike relocation problem with multiple vehicles and visits, The probabilistic \(p\)-center problem: planning service for potential customers, Heuristic optimisation in financial modelling, Incorporating neighborhood reduction for the solution of the planar \(p\)-median problem, Automatic integer programming reformulation using variable neighborhood search, A VNS approach for book marketing campaigns generated with quasi-bicliques probabilities, Variable neighborhood search accelerated column generation for the nurse rostering problem, GVNS based heuristic for solving the multi-product multi-vehicle inventory routing problem, A variable neighborhood search approach for the crew pairing problem, A three-phase matheuristic for the time-effective electric vehicle routing problem with partial recharges, A hybrid genetic algorithm and variable neighborhood search for multi-family capacitated lot-sizing problem, Variable neighborhood search algorithms for pickup and delivery problems with loading constraints, Variable neighborhood search for optimizing the transportation of agricultural raw materials, Solving a fuzzy fixed charge solid transportation problem using batch transferring by new approaches in meta-heuristic, On the aircraft conflict resolution problem: a VNS approach in a multiobjective framework, New VNP for automatic programming, A performance study on multi improvement neighborhood search strategy, Drawing graphs with mathematical programming and variable neighborhood search, Scheduling preventive railway maintenance activities with resource constraints, A variable neighborhood search algorithm for the capacitated vehicle routing problem, Clustering approach in maintenance of capillary railway network, Evaluating balancing on social networks through the efficient solution of correlation clustering problems, A generalized variable neighborhood search heuristic for the capacitated vehicle routing problem with stochastic service times, Variable neighborhood scatter search for the incremental graph drawing problem, On biconnected and fragile subgraphs of low diameter, Order matters -- a variable neighborhood search for the swap-body vehicle routing problem, General variable neighborhood search for the order batching and sequencing problem, Novel formulations and VNS-based heuristics for single and multiple allocation \(p\)-hub maximal covering problems, Model and metaheuristics for a scheduling problem integrating procurement, sale and distribution decisions, Sampling and learning Mallows and generalized Mallows models under the Cayley distance, Order-based error for managing ensembles of surrogates in mesh adaptive direct search, A unified matheuristic for solving multi-constrained traveling salesman problems with profits, Variable neighborhood search: basics and variants, Task scheduling using two-phase variable neighborhood search algorithm on heterogeneous computing and grid environments, Enhanced arc-flow formulations to minimize weighted completion time on identical parallel machines, Heuristics for routing heterogeneous unmanned vehicles with fuel constraints, A hybrid GRASP+VND heuristic for the two-echelon vehicle routing problem arising in city logistics, Knowledge-guided local search for the vehicle routing problem, Reformulation, linearization, and a hybrid iterated local search algorithm for economic lot-sizing and sequencing in hybrid flow shop problems, GRASP and VNS for solving the \(p\)-next center problem, The nurse rerostering problem: strategies for reconstructing disrupted schedules, HUBBI: iterative network design for incomplete hub location problems, Single-machine and parallel-machine serial-batching scheduling problems with position-based learning effect and linear setup time, A skewed general variable neighborhood search algorithm with fixed threshold for the heterogeneous fleet vehicle routing problem, Ascent-descent variable neighborhood decomposition search for community detection by modularity maximization, The incremental cooperative design of preventive healthcare networks, Mathematical modelling and heuristic approaches to the location-routing problem of a cost-effective integrated solid waste management, Variable neighborhood search for the set orienteering problem and its application to other orienteering problem variants, Minimizing the maximal ergonomic burden in intra-hospital patient transportation, An efficient local search for the feedback vertex set problem, A variable block insertion heuristic for the blocking flowshop scheduling problem with total flowtime criterion, A multiobjective hub-airport location problem for an airline network design, Median and covering location problems with interconnected facilities, Minimizing latency in post-disaster road clearance operations, A matheuristic for the cell formation problem, Mixed-integer linear programming heuristics for the prepack optimization problem, Scalability of using restricted Boltzmann machines for combinatorial optimization, Dynamic optimisation of preventative and corrective maintenance schedules for a large scale urban drainage system, An effective heuristic for project scheduling with resource availability cost, Solving the maximum min-sum dispersion by alternating formulations of two different problems, A simultaneous facility location and vehicle routing problem arising in health care logistics in the Netherlands, Serial-batching group scheduling with release times and the combined effects of deterioration and truncated job-dependent learning, Variable neighborhood descent with iterated local search for routing and wavelength assignment, Managing the tabu list length using a fuzzy inference system: an application to examination timetabling, A hierarchical algorithm for the planar single-facility location routing problem, Neighborhood search techniques for solving uncapacitated multilevel lot-sizing problems, Variable neighbourhood search for the variable sized bin packing problem, A variable neighborhood search for minimizing total weighted tardiness with sequence dependent setup times on a single machine, A TABU search heuristic for the team orienteering problem, Active guided evolution strategies for large-scale vehicle routing problems with time windows, Reformulation descent applied to circle packing problems, A cooperative parallel meta-heuristic for the vehicle routing problem with time windows, Genetic algorithm with variable neighborhood search for the optimal allocation of goods in shop shelves, Single-solution simulated Kalman filter algorithm for global optimisation problems, HMS: a hybrid multi-start algorithm for solving binary linear programs, ILP-based reduced variable neighborhood search for large-scale minimum common string partition, Algorithms based on VNS for solving the single machine scheduling problem with earliness and tardiness penalties, VND-based local search operator for equality constraint problems in PSO algorithm, A variable neighborhood search for multi-family capacitated lot-sizing problem, Using a variable neighborhood search to solve a bi-objective identical parallel machine scheduling problem, The multiple traveling salesman problem with backup coverage, A hybrid VNS algorithm for solving the multi-level capacitated minimum spanning tree problem, A variable neighborhood descent as ILS local search to the minimization of the total weighted tardiness on unrelated parallel machines and sequence dependent setup times, Optimal decision trees for feature based parameter tuning: integer programming model and VNS heuristic, Candidate groups search for K-harmonic means data clustering, A Pareto-based adaptive variable neighborhood search for biobjective hybrid flow shop scheduling problem with sequence-dependent setup time, Fuzzy J-means: a new heuristic for fuzzy clustering, Tabu search heuristics for the vehicle routing problem with time windows., A mixed integer linear programming model and variable neighborhood search for maximally balanced connected partition problem, Integer programming techniques for the nurse rostering problem, A survey of recent research on location-routing problems, Integrating stochastic time-dependent travel speed in solution methods for the dynamic dial-a-ride problem, A scatter search algorithm for the distributed permutation flowshop scheduling problem, A hybrid algorithm based on variable neighbourhood for the strip packing problem, Configuration and the advantages of the shifting bottleneck procedure for optimizing the job shop total weighted tardiness scheduling problem, An integer programming approach to the multimode resource-constrained multiproject scheduling problem, Uplink scheduling for joint wireless orthogonal frequency and time division multiple access networks, Circulant weighing matrices: a demanding challenge for parallel optimization metaheuristics, Hybrid algorithms for the vehicle routing problem with clustered backhauls and 3D loading constraints, A variable neighborhood search for the capacitated vehicle routing problem with two-dimensional loading constraints, An ILS-based algorithm to solve a large-scale real heterogeneous fleet VRP with multi-trips and docking constraints, Iterated tabu search and variable neighborhood descent for packing unequal circles into a circular container, The bipartite quadratic assignment problem and extensions, Global optimization using \(q\)-gradients, 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, A hybrid genetic algorithm for sequence-dependent disassembly line balancing problem, Heuristics for the traveling repairman problem with profits, A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem, A hybrid metaheuristic approach for the rollon-rolloff vehicle routing problem, Improved bounds for large scale capacitated arc routing problem, Minimising maximum response time, Single string planning problem arising in liner shipping industries: a heuristic approach, Applying two efficient hybrid heuristics for hub location problem with fully interconnected backbone and access networks, A meta-heuristic algorithm for the fuzzy assembly line balancing type-E problem, Statistical analysis of distance-based path relinking for the capacitated vehicle routing problem, A two-stage approach to the orienteering problem with stochastic weights, Location-arc routing problem: heuristic approaches and test instances, A nested heuristic for parameter tuning in support vector machines, Two metaheuristic approaches for solving multidimensional two-way number partitioning problem, 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 high performing metaheuristic for multi-objective flowshop scheduling problem, DE-VNS: self-adaptive differential evolution with crossover neighborhood search for continuous global optimization, Scheduled penalty variable neighborhood search, Decomposition based hybrid VNS-TS algorithm for distributed parallel factories scheduling with virtual corporation, A variable neighborhood search particle filter for bearings-only target tracking, Variable neighborhood search based algorithms for high school timetabling, Combining intensification and diversification strategies in VNS. An application to the vertex separation problem, 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, Maxminmin \(p\)-dispersion problem: a variable neighborhood search approach, A hybrid variable neighborhood search algorithm for solving the limited-buffer permutation flow shop scheduling problem with the makespan criterion, A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows, Variable neighborhood search for the workload balancing problem in service enterprises, A two phase variable neighborhood search for the multi-product inventory routing problem, Variable neighborhood search for the bi-objective post-sales network design problem: a fitness landscape analysis approach, The multi-depot vehicle routing problem with heterogeneous vehicle fleet: formulation and a variable neighborhood search implementation, Two level general variable neighborhood search for attractive traveling salesman problem, \(rs\)-sparse principal component analysis: a mixed integer nonlinear programming approach with VNS, A unified mixed-integer programming model for simultaneous fluence weight and aperture optimization in VMAT, tomotherapy, and cyberknife, Skewed general variable neighborhood search for the location routing scheduling problem, New heuristic algorithms for solving the planar \(p\)-median problem, Variable neighborhood search for location routing, A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime, An efficient hybrid meta-heuristic for aircraft landing problem, Hybrid column generation and large neighborhood search for the dial-a-ride problem, Variable neighborhood search for the vertex separation problem, A nonmonotone GRASP, A bi-level programming model for protection of hierarchical facilities under imminent attacks, A bi-objective approach for scheduling ground-handling vehicles in airports, Compromise ratio with weighting functions in a tabu search multi-criteria approach to examination timetabling, Integrating matheuristics and metaheuristics for timetabling, The multiple team formation problem using sociometry, The dynamic vehicle allocation problem with application in trucking companies in Brazil, Efficient techniques for the multi-period vehicle routing problem with time windows within a branch and price framework, An iterative approach for the serial batching problem with parallel machines and job families, Branch-and-price algorithms for the two-echelon capacitated vehicle routing problem, Analysing the scalability of multiobjective evolutionary algorithms when solving the motif discovery problem, Algorithms for the maximum \(k\)-club problem in graphs, Lower and upper bounds for the bin packing problem with fragile objects, Structural learning of Bayesian networks using local algorithms based on the space of orderings, Combining probabilistic algorithms, constraint programming and Lagrangian relaxation to solve the vehicle routing problem, The tree representation for the pickup and delivery traveling salesman problem with LIFO loading, Global optimality conditions and optimization methods for quadratic assignment problems, Heuristics for a project management problem with incompatibility and assignment costs, A general VNS heuristic for the traveling salesman problem with time windows, A GRASP based on DE to solve single machine scheduling problem with SDST, An integer linear programming based heuristic for the capacitated \(m\)-ring-star problem, A hybrid adaptive large neighborhood search heuristic for lot-sizing with setup times, Product line pricing for services with capacity constraints and dynamic substitution, Estimating the four parameters of the Burr III distribution using a hybrid method of variable neighborhood search and iterated local search algorithms, Similarities between meta-heuristics algorithms and the science of life, Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints, Biobjective sparse principal component analysis, Fast metaheuristics for the discrete \((r|p)\)-centroid problem, A variable neighborhood search based matheuristic for nurse rostering problems, A simultaneous and iterative approach for parallel machine scheduling with sequence-dependent family setups, A filling function method for unconstrained global optimization, Optimization of algorithms with OPAL, The min-degree constrained minimum spanning tree problem: formulations and branch-and-cut algorithm, A survey on optimization metaheuristics, A discrete gravitational search algorithm for solving combinatorial optimization problems, A variable iterated greedy algorithm for the traveling salesman problem with time windows, Connecting a population dynamic model with a multi-period location-allocation problem for post-disaster relief operations, A mathematical model and a metaheuristic approach for a memory allocation problem, Dynamic scaling in the mesh adaptive direct search algorithm for blackbox optimization, A hybrid heuristic approach for the multi-commodity one-to-one pickup-and-delivery traveling salesman problem, On characterization of maximal independent sets via quadratic optimization, ParadisEO-MO: from fitness landscape analysis to efficient local search algorithms, The multi-vehicle profitable pickup and delivery problem, Automated conjectures on upper bounds for the largest Laplacian eigenvalue of graphs, Problems of discrete optimization: challenges and main approaches to solve them, Multiobjective GRASP with path relinking, Scheduling a hybrid assembly-differentiation flowshop to minimize total flow time, The continuous \(p\)-centre problem: an investigation into variable neighbourhood search with memory, A perturbation based variable neighborhood search heuristic for solving the vehicle routing problem with simultaneous pickup and delivery with time limit, A hybrid VND method for the split delivery vehicle routing problem, Variable neighbourhood search for the \(k\)-labelled spanning forest problem, A generalized variable neighborhood search for combinatorial optimization problems, 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, Construction of mixed covering arrays using a combination of simulated annealing and variable neighborhood search, VNS approach for solving a financial portfolio design problem, Boosting an exact logic-based Benders decomposition approach by variable neighborhood search, A variable neighborhood search method for solving the traveling tournaments problem, New multi-objective approach for the home care service problem based on scheduling algorithms and variable neighborhood descent, A hybrid variable neighborhood search algorithm for targeted offers in direct marketing, A variable neighborhood search for the vehicle routing problem with time windows and preventive maintenance activities, VNS variants for the Max-Mean dispersion problem, A variable neighborhood search for solving the multi-vehicle covering tour problem, A variable neighborhood search heuristic for periodic routing problems, A variable neighbourhood search algorithm for the open vehicle routing problem, Variable neighbourhood search for bandwidth reduction, Solving a capacitated hub location problem, Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder), Variable neighbourhood decomposition search for \(0\)-\(1\) mixed integer programs, Variable neighborhood search for the dial-a-ride problem, Two multi-start heuristics for the \(k\)-traveling salesman problem, A variable neighborhood search for the network design problem with relays, Optimization model applied to radiotherapy planning problem with dose intensity and beam choice, A review of vehicle routing with simultaneous pickup and delivery, A trilevel \(r\)-interdiction selective multi-depot vehicle routing problem with depot protection, Large multiple neighborhood search for the soft-clustered vehicle-routing problem, Minimizing maximum tardiness on a single machine with family setup times and machine disruption, A reinforcement learning iterated local search for makespan minimization in additive manufacturing machine scheduling problems, The aircraft runway scheduling problem: a survey, Integrated real-time control of mixed-model assembly lines and their part feeding processes, An efficient variable neighborhood search with tabu shaking for a class of multi-depot vehicle routing problems, Neighborhood decomposition-driven variable neighborhood search for capacitated clustering, A hybrid ant colony optimization-variable neighborhood descent approach for the cumulative capacitated vehicle routing problem, Adaptive large neighborhood search for vehicle routing problems with transshipment facilities arising in city logistics, Branch-and-check approaches for the tourist trip design problem with rich constraints, Variable neighborhood search for large offshore wind farm layout optimization, A branch-and-cut algorithm for the maximum \(k\)-balanced subgraph of a signed graph, Learning variable neighborhood search for a scheduling problem with time windows and rejections, A directional approach to gradual cover, Variable neighborhood search for stochastic linear programming problem with quantile criterion, Algorithms for single machine total tardiness scheduling with sequence dependent setups, A variable neighborhood decomposition search method for supply chain management planning problems, A general variable neighborhood search for single-machine total tardiness scheduling problem with step-deteriorating jobs, Repairing MIP infeasibility through local branching, A variable neighborhood search method for generalized blockmodeling of two-mode binary matrices, A continuous variable neighborhood search heuristic for finding the three-dimensional structure of a molecule, A hybrid heuristic ordering and variable neighbourhood search for the nurse rostering problem, A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem, A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems, On bags and bugs, A unified framework for partial and hybrid search methods in constraint programming, On-line resources allocation for ATM networks with rerouting, Variable neighborhood search and local branching, Sequential search and its application to vehicle-routing problems, A survey of local search methods for graph coloring, Scheduling workover rigs for onshore oil production, First vs. best improvement: an empirical study, A probabilistic cooperative-competitive hierarchical model for global optimization, A tabu search algorithm for the Min-Max \(k\)-Chinese postman problem, Variable neighborhood search for graphical model energy minimization, Improving the linear relaxation of maximum \(k\)-cut with semidefinite-based constraints, Modeling two-stage UHL problem with uncertain demands, Handling fairness issues in time-relaxed tournaments with availability constraints, The location routing problem using electric vehicles with constrained distance, Matheuristic for the decentralized factories scheduling problem, Skewed bivariate models and nonparametric estimation for the CTE risk measure, A new discrete particle swarm optimization approach for the single-machine total weighted tardiness scheduling problem with sequence-dependent setup times, Mitigating partial-disruption risk: a joint facility location and inventory model considering customers' preferences and the role of substitute products and backorder offers, Analysis of variable neighborhood descent as a local search operator for total weighted tardiness problem on unrelated parallel machines, A hybrid heuristic of variable neighbourhood descent and great deluge algorithm for efficient task scheduling in grid computing, A modeling framework and local search solution methodology for a production-distribution problem with supplier selection and time-aggregated quantity discounts, Vehicle routing with transportable resources: using carpooling and walking for on-site services, A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems, A nonlinear multidimensional knapsack problem in the optimal design of mixture experiments, Combinatorial GVNS (general variable neighborhood search) optimization for dynamic garbage collection, Solution techniques for the inter-modal pickup and delivery problem in two regions, A new nonsmooth optimization algorithm for minimum sum-of-squares clustering problems, MOAQ and ant-Q algorithm for multiple objective optimization problems, An improved particle swarm optimization algorithm to solve hybrid flowshop scheduling problems with the effect of human factors -- a case study, Scheduling of road vehicles in sugarcane transport: a case study at an Australian sugar mill, Variable neighborhood search for the vertex weighted \(k\)-cardinality tree problem, A multistart iterated local search for the multitrip cumulative capacitated vehicle routing problem, Hybrid metaheuristic method for determining locations for long-term health care facilities, A heuristic algorithm to solve the single-facility location routing problem on Riemannian surfaces, Time series interpolation via global optimization of moments fitting, Variable neighborhood search for minimum sum-of-squares clustering on networks, Heuristics for multi-attribute vehicle routing problems: a survey and synthesis, Iterative approaches for a dynamic memory allocation problem in embedded systems, Hybrid meta-heuristics for minimizing the total weighted completion time on uniform parallel machines, An efficient metaheuristic to improve accessibility by rural road network planning, On the integrated charge planning with flexible jobs in primary steelmaking processes, A variable neighbourhood search algorithm for the flexible job-shop scheduling problem, Dynamic job shop scheduling using variable neighbourhood search, Development of a hybrid metaheuristic to minimise earliness and tardiness in a hybrid flowshop with sequence-dependent setup times, A HYBRID HARMONY SEARCH ALGORITHM FOR THE NO-WAIT FLOW-SHOP SCHEDULING PROBLEMS, Unnamed Item, Generating Fingerings for Polyphonic Piano Music with a Tabu Search Algorithm, Minimizing the total tardiness and the total carbon emissions in the permutation flow shop scheduling problem, Metaheuristics with restart and learning mechanisms for the no-idle flowshop scheduling problem with makespan criterion, Exact and heuristic methods for the integrated berth allocation and specific time-invariant quay crane assignment problems, Metaheuristics for the permutation flowshop problem with a weighted quadratic tardiness objective, Solving the capacitated dispersion problem with variable neighborhood search approaches: from basic to skewed VNS, A simheuristic algorithm for the portfolio optimization problem with random returns and noisy covariances, Application of a hybrid evolutionary algorithm to resource-constrained parallel machine scheduling with setup times, 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, A hybrid algorithm for the drilling rig routing problem, A variable neighborhood search algorithm for an integrated physician planning and scheduling problem, A branch-and-cut approach for the distributed no-wait flowshop scheduling problem, In memory of Professor Nenad Mladenović (1951--2022), An exact method to generate all nondominated spanning trees, Multistart Branch and Bound for Large Asymmetric Distance-Constrained Vehicle Routing Problem, Local Search Based on Genetic Algorithms, Mathematical formulations and solution methods for the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem, A supply chain network design for blood and its products using genetic algorithm: a case study of Turkey, A Green Vehicle Routing Problem with Multi-Depot, Multi-Tour, Heterogeneous Fleet and Split Deliveries: a mathematical model and heuristic approach, Intelligent water drops algorithm, A particle swarm optimization algorithm for hybrid flow-shop scheduling with multiprocessor tasks, An Investigation on Compound Neighborhoods for VRPTW, A simple metaheuristic approach to the simultaneous scheduling of machines and automated guided vehicles, Solution approaches to large shift scheduling problems, The Hubbert diffusion process: Estimation via simulated annealing and variable neighborhood search procedures—application to forecasting peak oil production, 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, Graph Coloring Models and Metaheuristics for Packing Applications, A Two-Step Model Identification for Stirred Tank Reactors: Incremental and Integral Methods, Accelerating benders decomposition with heuristicmaster problem solutions, Variable Neighborhood Programming as a Tool of Machine Learning, The school bus routing and scheduling problem with transfers, Recent Models and Algorithms for One-to-One Pickup and Delivery Problems, One-to-Many-to-One Single Vehicle Pickup and Delivery Problems, Vehicle Routing Problems with Inter-Tour Resource Constraints, Health Care Logistics, Emergency Preparedness, and Disaster Relief: New Challenges for Routing Problems with a Focus on the Austrian Situation, Models and heuristics for the k ‐degree constrained minimum spanning tree problem with node‐degree costs, On the Foundations and the Applications of Evolutionary Computing, Local search with perturbations for the prize-collecting Steiner tree problem in graphs, A GRASP/VND heuristic for the phylogeny problem using a new neighborhood structure, Use of quadratic models with mesh-adaptive direct search for constrained black box optimization, Randomized heuristics for the Max-Cut problem, Supercomputer Scheduling with Combined Evolutionary Techniques, A HYBRID METAHEURISTIC FOR THE SINGLE-MACHINE TOTAL WEIGHTED TARDINESS PROBLEM, Very large-scale variable neighborhood search for the generalized assignment problem, Solving thep-Center problem with Tabu Search and Variable Neighborhood Search, Total tardiness minimization in permutation flow shops: a simple approach based on a variable greedy algorithm, Using Merging Variables-Based Local Search to Solve Special Variants of MaxSAT Problem, Merging Variables: One Technique of Search in Pseudo-Boolean Optimization, A research survey: review of flexible job shop scheduling techniques, Data-Mining-Driven Neighborhood Search, Solving Engineering Optimization Problems Without Penalty, Minimizing Piecewise-Concave Functions Over Polyhedra, Algorithms with greedy heuristic procedures for mixture probability distribution separation, Variable neighbourhood search for financial derivative problem, Distance-Based Clique Relaxations in Networks: s-Clique and s-Club, Influence of a neighborhood shape on the efficiency of continuous variable neighborhood search, Improved starting solutions for the planar p-median problem, Optimization-Based Very Large-Scale Neighborhood Search for Generalized Assignment Problems with Location/Allocation Considerations, A heuristic hybrid framework for vector job scheduling, Metaheuristic approaches for the Berth Allocation Problem, Variable neighborhood formulation search approach for the multi-item capacitated lot-sizing problem with time windows and setup times, The capacitated m two node survivable star problem, A new variable neighborhood search approach for solving dynamic memory allocation problem, Variable neighborhood search for the strong metric dimension problem, A Variable Neighbourhood Search approach to the Cutwidth Minimization Problem, An efficient GVNS for solving Traveling Salesman Problem with Time Windows, A variable neighborhood search for the multi-product inventory routing problem, Applying Variable Neighborhood Search to the Single-machine Maximum Lateness Rescheduling Problem, A variable neighborhood decomposition search algorithm for multilevel capacitated lot-sizing problems, A Hybrid Metaheuristic Based on Variable Neighborhood Search and Tabu Search for the Web Service Selection Problem, VNS based heuristic for solving the Unit Commitment problem, Variable neighborhood search for Multiple Level Warehouse Layout Problem, Variable Neighborhood Search and Tabu Search for the Web Service Selection Problem, Variable neighborhood search method for optimizing the emergency service network of police special forces units, Variable neighborhood descent heuristic for covering design problem, Packing Unit Spheres into a Cube Using VNS, MPI Parallelization of Variable Neighborhood Search, A Simulated Annealing with Variable Neighborhood Search Approach to Construct Mixed Covering Arrays, Estimating Differential Evolution crossover parameter with VNS approach for continuous global optimization, Gaussian Variable Neighborhood Search and Enhanced Genetic Algorithm for Continuous Optimization, Multilevel neighborhood search for solving full truckload routing problems arising in timber transportation, An efficient two-phase metaheuristic algorithm for the time dependent traveling Salesman problem, Metaheuristics—the metaphor exposed, A LEARNING AUTOMATA-BASED ALGORITHM TO THE STOCHASTIC MIN-DEGREE CONSTRAINED MINIMUM SPANNING TREE PROBLEM, An Exact Algorithm for Blockmodeling of Two-Mode Network Data, Particle swarm optimization and differential evolution for the single machine total weighted tardiness problem, A Variable Neighborhood Search Algorithm for Cost-Balanced Travelling Salesman Problem, AutoGraphiX: a survey, A Hybrid Metaheuristic for Routing on Multicast Networks, A variable neighborhood search algorithm to generate piano fingerings for polyphonic sheet music, Comparison of metaheuristics for the k‐labeled spanning forest problem, Generalized mixed integer and VNS heuristic approach to solving the multisize containers drayage problem, Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem, Parallel variable neighborhood search for the min–max order batching problem, An integration of mixed VND and VNS: the case of the multivehicle covering tour problem, Design of a quality control network for an international food company, On the effect of using sensors and dynamic forecasts in inventory-routing problems, The zone-based dynamic facility layout problem, Taking advantage of symmetry in some quadratic assignment problems, A variable neighborhood search algorithm for a PET/CT examination scheduling problem considering multi-stage process and deteriorating effect, Dynamic resource allocation and collaborative scheduling in R\&D and manufacturing processes of high-end equipment with budget constraint, An improved matheuristic for solving the electric vehicle routing problem with time windows and synchronized mobile charging/battery swapping, Adopting a hierarchical diagnosis and treatment system to optimize elective surgery scheduling, A GVNS algorithm applied to the single allocation hub location problem with heterogeneous economies of scale, Adaptive variable neighbourhood search approach for time-dependent joint location and dispatching problem in a multi-tier ambulance system, Multi-objective energy-efficient hybrid flow shop scheduling using Q-learning and GVNS driven NSGA-II, Scheduling in a flexible job shop followed by some parallel assembly stations considering lot streaming, A new variable neighbourhood search with a constraint programming search strategy for the open shop scheduling problem with operation repetitions, A stochastic approach for planning airport ground support resources, Combining variable neighborhood search and machine learning to solve the vehicle routing problem with crowd-shipping, General variable neighborhood search for the minimum stretch spanning tree problem, A general variable neighborhood search approach for the minimum load coloring problem, General variable neighborhood search approach to group Steiner tree problem, Variable neighborhood search for the single machine scheduling problem to minimize the total early work, General variable neighborhood search for the parallel machine scheduling problem with two common servers, Fat-tailed distributions for continuous variable neighborhood search, The consistent production routing problem, The multifacility center problems with random demand weights, New algorithms for the minimum coloring cut problem, Variable neighborhood search based approaches to a vehicle scheduling problem in agriculture, Less is more approach: basic variable neighborhood search for the obnoxious p‐median problem, The intermittent travelling salesman problem, Variable neighborhood search algorithms for the vehicle routing problem with two‐dimensional loading constraints and mixed linehauls and backhauls, An MO‐GVNS algorithm for solving a multiobjective hybrid flow shop scheduling problem, Skewed general variable neighborhood search for the cumulative capacitated vehicle routing problem, A hybrid modified-NSGA-II VNS algorithm for the multi-objective critical disruption path problem, Scheduling multi-staged jobs on parallel identical machines and a central server with sequence-dependent setup times: an application to an automated kitchen, Multiple traveling salesperson problem with drones: general variable neighborhood search approach, Variable neighborhood search to solve the generalized orienteering problem, Multirobot search for a stationary object placed in a known environment with a combination of GRASP and VND, Solving the clustered traveling salesman problem with ‐relaxed priority rule, The uncapacitated r‐allocation p‐hub center problem, Improving a state‐of‐the‐art heuristic for the minimum latency problem with data mining, Using horizontal cooperation concepts in integrated routing and facility‐location decisions, Metaheuristics for solving the biobjective single‐path multicommodity communication flow problem, Analysis of stochastic local search methods for the unrelated parallel machine scheduling problem, Expansion-based hill-climbing, Same‐day deliveries in omnichannel retail: Integrated order picking and vehicle routing with vehicle‐site dependencies, Local search algorithms for the composite retrieval problem, A fix‐and‐optimize heuristic for the minmax regret shortest path arborescence problem under interval uncertainty, The bus sightseeing problem, From fitness landscapes evolution to automatic local search algorithm generation, The strong network orientation problem, Feature selection in machine learning via variable neighborhood search, A VNS based framework for early diagnosis of the Alzheimer's disease converted from mild cognitive impairment, Minimum common string partition: on solving large‐scale problem instances, A variable neighborhood search heuristic algorithm for the double vehicle routing problem with multiple stacks, Multi‐mode resource‐constrained project scheduling using modified variable neighborhood search heuristic, Exponential quality function for community detection in complex networks, A variable neighborhood search for flying sidekick traveling salesman problem, VNS methods for home care routing and scheduling problem with temporal dependencies, and multiple structures and specialties, A variable neighborhood search simheuristic for the multiperiod inventory routing problem with stochastic demands, Multiobjective pseudo‐variable neighborhood descent for a bicriteria parallel machine scheduling problem with setup time, Research trends in combinatorial optimization, A variable neighborhood search simheuristic algorithm for reliability optimization of smart grids under uncertainty, A game‐theoretic approach for the location of terror response facilities with both disruption risk and hidden information, Optimal decision trees for the algorithm selection problem: integer programming based approaches, Variable neighborhood search approach to community detection problem, Metaheuristics: A Canadian Perspective, Location Science in Canada, Operational Research: Milestones and Highlights of Canadian Contributions, On mathematical optimization for clustering categories in contingency tables, Covering delivery problem with electric vehicle and parcel lockers: variable neighborhood search approach, Designing a multi-modal and variable-echelon delivery system for last-mile logistics, Formulating and solving integrated order batching and routing in multi-depot AGV-assisted mixed-shelves warehouses, Partial linear recharging strategy for the electric fleet size and mix vehicle routing problem with time windows and recharging stations, Exact and heuristic methods for a workload allocation problem with chain precedence constraints, Parallel machine scheduling with linearly increasing energy consumption cost, Dynamic scheduling of patients in emergency departments, Efficient heuristics for a partial set covering problem with mutually exclusive pairs of facilities, A multi-objective approach for manufacturing systems with multiple production routes based on supervisory control theory and heuristic algorithms, An efficient implementation of a VNS heuristic for the weighted fair sequences problem, LP relaxation and dynamic programming enhancing VNS for the multiple knapsack problem with setup, 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, Orchard algorithm (OA): a new meta-heuristic algorithm for solving discrete and continuous optimization problems, Variable neighborhood search: the power of change and simplicity, Unnamed Item, Unnamed Item, PERMUTATION-BASED GENETIC, TABU, AND VARIABLE NEIGHBORHOOD SEARCH HEURISTICS FOR MULTIPROCESSOR SCHEDULING WITH COMMUNICATION DELAYS, Variable neighborhood search: Principles and applications, Heuristic solution approaches for the cumulative capacitated vehicle routing problem, Recherche à voisinage variable de graphes extrémaux 13. à propos de la maille, New MIP model for multiprocessor scheduling problem with communication delays, J-MEANS: A new local search heuristic for minimum sum of squares clustering, New heuristics for one-dimensional bin-packing, Consistency checking within local search applied to the frequency assignment with polarization problem, VARIABLE NEIGHBORHOOD SEARCH FOR ORDER BATCHING IN A WAREHOUSE, Solving balanced multi-weighted attribute set partitioning problem with variable neighborhood search, The balanced \(p\)-median problem with unitary demand, Memetic search for the minmax multiple traveling salesman problem with single and multiple depots, Physician scheduling problem in mobile cabin hospitals of China during Covid-19 outbreak, A novel variable neighborhood strategy adaptive search for SALBP-2 problem with a limit on the number of machine's types, An integrated rolling horizon and adaptive-refinement approach for disjoint trajectories optimization, Designing an integrated responsive-green-cold vaccine supply chain network using Internet-of-Things: artificial intelligence-based solutions, On optimally solving sub‐tree scheduling for wireless sensor networks with partial coverage: A branch‐and‐cut algorithm, The multi‐purpose K‐drones general routing problem, A new fuzzy model for multi-criteria project portfolio selection based on modified Kerre's inequality, A novel iterated greedy algorithm for no-wait permutation flowshop scheduling to minimize weighted quadratic tardiness, Topology reconstruction using time series data in telecommunication networks

Cites Work