scientific article; zbMATH DE number 2050711
From MaRDI portal
Publication:4452900
Recommendations
- Iterated local search for the quadratic assignment problem
- scientific article; zbMATH DE number 2079895
- Analysing the run-time behaviour of iterated local search for the travelling salesman problem.
- scientific article; zbMATH DE number 1082099
- Local search algorithms for combinatorial problems. Analysis, improvements, and new applications (Thesis TU Darmstadt 1998)
Cited in
(only showing first 100 items - show all)- Beam-ACO--hybridizing ant colony optimization with beam search: an application to open shop scheduling
- Adaptive tabu search for course timetabling
- Design and analysis of stochastic local search for the multiobjective traveling salesman problem
- A hybrid clonal selection algorithm for the location routing problem with stochastic demands
- A set-covering based heuristic algorithm for the periodic vehicle routing problem
- Bicriteria scheduling problem for unrelated parallel machines with release dates
- Hybrid flow shop scheduling with not-all-machines options via local search with controlled deterioration
- Hybrid method with CS and BRKGA applied to the minimization of tool switches problem
- Integrated production and distribution scheduling with lifespan constraints
- A mixed integer formulation and an efficient metaheuristic for the unrelated parallel machine scheduling problem: total tardiness minimization
- Two-phase Pareto local search for the biobjective traveling salesman problem
- ParadisEO-MO: from fitness landscape analysis to efficient local search algorithms
- Applying the threshold accepting metaheuristic to~curriculum based course timetabling
- Metaheuristics and cooperative approaches for the bi-objective ring star problem
- Metaheuristics for the traveling salesman problem with pickups, deliveries and handling costs
- Improved local search algorithms for the rectangle packing problem with general spatial costs
- Multi-objective metaheuristic algorithms for the resource-constrained project scheduling problem with precedence relations
- A review of hyper-heuristics for educational timetabling
- GOAL solver: a hybrid local search based solver for high school timetabling
- A survey of search methodologies and automated system development for examination timetabling
- Maximizing breaks and bounding solutions to the mirrored traveling tournament problem
- A tutorial on the balanced minimum evolution problem
- Improved heuristic algorithms for the job sequencing and tool switching problem
- Iterated local search for single-machine scheduling with sequence-dependent setup times to minimize total weighted tardiness
- An adaptive iterated local search heuristic for the heterogeneous fleet vehicle routing problem
- A comparison of three metaheuristics for the workover rig routing problem
- A hybrid algorithm for the heterogeneous fleet vehicle routing problem
- A simple and effective metaheuristic for the minimum latency problem
- An iterated local search algorithm for the vehicle routing problem with backhauls
- Effective learning hyper-heuristics for the course timetabling problem
- An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives
- Some effective heuristics for no-wait flowshops with setup times to minimize total completion time
- Solving the problem of packing equal and unequal circles in a circular container
- On solving the time window assignment vehicle routing problem via iterated local search
- Estimation-based metaheuristics for the probabilistic traveling salesman problem
- Classification of applied methods of combinatorial optimization
- A joint quantile and expected shortfall regression framework
- Solving job shop scheduling problems utilizing the properties of backbone and ``big valley
- Vehicle routing with compartments: applications, modelling and heuristics
- Scheduling projects with limited number of preemptions
- The double travelling salesman problem with multiple stacks - formulation and heuristic solution approaches
- Variable neighborhood descent with iterated local search for routing and wavelength assignment
- A hybrid heuristic algorithm for the open-pit-mining operational planning problem
- Deconstructing Nowicki and Smutnicki's \(i\)-TSAB tabu search algorithm for the job-shop scheduling problem
- A matheuristic for the truck and trailer routing problem
- A deterministic iterated local search algorithm for the vehicle routing problem with backhauls
- The vehicle routing problem with flexible time windows and traveling times
- Adaptive sample size and importance sampling in estimation-based local search for the probabilistic traveling salesman problem
- A three-phased local search approach for the clique partitioning problem
- A multi-threaded local search algorithm and computer implementation for the multi-mode, resource-constrained multi-project scheduling problem
- An integer programming approach to the multimode resource-constrained multiproject scheduling problem
- Iterated local search for the quadratic assignment problem
- Algorithms for a realistic variant of flowshop scheduling
- Iterated local search for the team orienteering problem with time windows
- A hybrid evolutionary algorithm for the periodic location-routing problem
- MILP formulations and an iterated local search algorithm with tabu thresholding for the order batching problem
- A multi-objective local search heuristic for scheduling Earth observations taken by an agile satellite
- A mixed integer programming model for long term capacity expansion planning: a case study from the Hunter valley coal chain
- Design of automated negotiation mechanisms for decentralized heterogeneous machine scheduling
- Minimising total tardiness for a single machine scheduling problem with family setups and resource constraints
- Choice by iterative search
- 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
- A dynamic neighborhood based tabu search algorithm for real-world flight instructor scheduling problems
- A cycle-based evolutionary algorithm for the fixed-charge capacitated multi-commodity network design problem
- Iterated maxima search for the maximally diverse grouping problem
- Coalition-based metaheuristic: a self-adaptive metaheuristic using reinforcement learning and mimetism
- An algorithmic framework based on primitive directions and nonmonotone line searches for black-box optimization problems with integer variables
- An iterated local search for solving a location-routing problem
- Hybrid metaheuristics for the clustered vehicle routing problem
- Improving the quality of heuristic solutions for the capacitated vertex \(p\)-center problem through iterated greedy local search with variable neighborhood descent
- A stochastic vehicle routing problem with travel time uncertainty: trade-off between cost and customer service
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- Improved bounds for large scale capacitated arc routing problem
- Shifting representation search for hybrid flexible flowline problems
- Decomposition and local search based methods for the traveling umpire problem
- A dynamic game with monopolist manufacturer and price-competing duopolist retailers
- Vehicle routing problems with time windows and multiple service workers: a systematic comparison between ACO and GRASP
- A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem
- Machine learning at the service of meta-heuristics for solving combinatorial optimization problems: a state-of-the-art
- A hybrid heuristic for a multi-objective real-life car sequencing problem with painting and assembly line constraints
- A metaheuristic for crew scheduling in a pickup‐and‐delivery problem with time windows
- A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems
- Machine learning for global optimization
- Shipper collaboration in forward and reverse logistics
- An iterated greedy algorithm with variable neighborhood descent for the planning of specialized diagnostic services in a segmented healthcare system
- Solving a concrete sleepers production scheduling by genetic algorithms
- Embedding a novel objective function in a two-phased local search for robust vertex coloring
- The warehouse-inventory-transportation problem for supply chains
- Exact and heuristic approaches for the set cover with pairs problem
- Hybrid metaheuristics with evolutionary algorithms specializing in intensification and diversification: overview and progress report
- Effective metaheuristics for scheduling a hybrid flowshop with sequence-dependent setup times
- Local Search Based on Genetic Algorithms
- Metaheuristics in combinatorial optimization
- Setting a common due date in a constrained flowshop: a variable neighbourhood search approach
- Multiobjective vehicle routing problem with fixed delivery and optional collections
- A heuristic approach for packing identical rectangles in convex regions
- Fast local search for the maximum independent set problem
- Local search based heuristics for global optimization: atomic clusters and beyond
- Crossover iterated local search for SDCARP
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4452900)