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)- Algorithms for job scheduling problems with distinct time windows and general earliness/tardiness penalties
- Perturbed decomposition algorithm applied to the multi-objective traveling salesman problem
- Exact and heuristic algorithms for order acceptance and scheduling with sequence-dependent setup times
- Stochastic local search with learning automaton for the swap-body vehicle routing problem
- Worst improvement based iterated local search
- A metaheuristic approach to compute pure Nash equilibria
- Shifting representation search for hybrid flexible flowline problems
- Automated slideshow design from a set of photos based on a hybrid Metaheuristic approach
- The family traveling salesman problem with incompatibility constraints
- Enhanced iterated local search for the technician routing and scheduling problem
- Heuristic approaches for the family traveling salesman problem
- GRASP‐ILS and set cover hybrid heuristic for the synchronized team orienteering problem with time windows
- Robust location for quarantine facilities under decentralized room assignment: a bi-level mixed-integer programming approach
- A solution approach from an analytic model to heuristic algorithm for special case of vehicle routing problem with stochastic demands
- 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
- 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 cycle-based evolutionary algorithm for the fixed-charge capacitated multi-commodity network design problem
- Iterated maxima search for the maximally diverse grouping problem
- Improved bounds for large scale capacitated arc routing problem
- Beam-ACO--hybridizing ant colony optimization with beam search: an application to open shop scheduling
- Algorithms for a realistic variant of flowshop scheduling
- A matheuristic for the truck and trailer routing problem
- Deconstructing Nowicki and Smutnicki's \(i\)-TSAB tabu search algorithm for the job-shop scheduling problem
- Bi‐criteria formulation for green scheduling with unrelated parallel machines with sequence‐dependent setup times
- Improving a state‐of‐the‐art heuristic for the minimum latency problem with data mining
- Expansion-based hill-climbing
- A metaheuristic for the double traveling salesman problem with partial last‐in‐first‐out loading constraints
- On the problem of minimizing the cost with optical devices in Wavelength Division Multiplexing optical networks: complexity analysis, mathematical formulation and improved heuristics
- Coalition-based metaheuristic: a self-adaptive metaheuristic using reinforcement learning and mimetism
- 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 simheuristic algorithm for time-dependent waste collection management with stochastic travel times
- Fast neighborhood search for the single machine earliness-tardiness scheduling problem
- A joint quantile and expected shortfall regression framework
- Revisiting search methods for the bounded-diameter minimum spanning tree problem
- The strong network orientation problem
- Extracting maximal objects from three-dimensional solid materials
- Local search for constrained graph clustering in biological networks
- An enhanced simulation-based iterated local search metaheuristic for gravity fed water distribution network design optimization
- Metaheuristics in combinatorial optimization
- scientific article; zbMATH DE number 6783433 (Why is no real title available?)
- Variable neighborhood descent with iterated local search for routing and wavelength assignment
- Local search algorithms for the composite retrieval problem
- Iterated local search with two strategies in the acceptance criterion for the tree t-spanner 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
- PACE solver description: Martin_-J_-Geiger
- A branch-and-bound approach to the no-idle flowshop scheduling problem
- Solving the problem of packing equal and unequal circles in a circular container
- Solving job shop scheduling problems utilizing the properties of backbone and ``big valley
- Improved global convergence probability using multiple independent optimizations
- The double travelling salesman problem with multiple stacks - formulation and heuristic solution approaches
- scientific article; zbMATH DE number 1537457 (Why is no real title available?)
- A hybrid heuristic algorithm for the open-pit-mining operational planning problem
- Embedding a novel objective function in a two-phased local search for robust vertex coloring
- A mixed integer programming model for long term capacity expansion planning: a case study from the Hunter valley coal chain
- Shipper collaboration in forward and reverse logistics
- The vessel swap-body routing problem
- A multi-start evolutionary local search for the one-commodity pickup and delivery traveling salesman problem
- Fast local search for the maximum independent set problem
- Adaptive tabu search for course timetabling
- Classification of applied methods of combinatorial optimization
- The vehicle routing problem with flexible time windows and traveling times
- An MO‐GVNS algorithm for solving a multiobjective hybrid flow shop scheduling problem
- Local search approaches for the test laboratory scheduling problem with variable task grouping
- Towards a theory of practice in metaheuristics design: A machine learning perspective
- Analysis of variable neighborhood descent as a local search operator for total weighted tardiness problem on unrelated parallel machines
- Crossover iterated local search for SDCARP
- Estimation-based metaheuristics for the probabilistic traveling salesman problem
- Improved heuristic algorithms for the job sequencing and tool switching problem
- Scheduling projects with limited number of preemptions
- Efficient approaches for the flooding problem on graphs
- Adaptive sample size and importance sampling in estimation-based local search for the probabilistic traveling salesman problem
- A mixed integer formulation and an efficient metaheuristic for the unrelated parallel machine scheduling problem: total tardiness minimization
- An iterated greedy algorithm with variable neighborhood descent for the planning of specialized diagnostic services in a segmented healthcare system
- Applying the threshold accepting metaheuristic to~curriculum based course timetabling
- Metaheuristics for the traveling salesman problem with pickups, deliveries and handling costs
- On one optimization problem for warehouse goods placement
- An enhanced approach for the dial a ride problem with drivers preferences
- New heuristics for the bicluster editing problem
- Iterated greedy with random variable neighborhood descent for scheduling jobs on parallel machines with deterioration effect
- Variable neighborhood descent for solving the vehicle routing problem with time windows
- A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems
- The impact of parametrization in memetic evolutionary algorithms
- Estimation-based metaheuristics for the single vehicle routing problem with stochastic demands and customers
- A comparison of three metaheuristics for the workover rig routing problem
- A hybrid algorithm for the heterogeneous fleet vehicle routing problem
- CHAMP: a multipass algorithm for Max Sat based on saver variables
- The configurable SAT solver challenge (CSSC)
- The quadratic three-dimensional assignment problem: exact and approximate solution methods
- A hybrid heuristic for a multi-objective real-life car sequencing problem with painting and assembly line constraints
- 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
- Multiple k-opt evaluation multiple k-opt moves with GPU high performance local search to large-scale traveling salesman problems
- Heuristic and exact algorithms for minimum-weight non-spanning arborescences
- Double descent and intermittent color diffusion for landscape exploration
- Iterated local search for the quadratic assignment problem
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)