scientific article; zbMATH DE number 2050711

zbMATH Open1116.90412arXivmath/0102188MaRDI QIDQ4452900FDOQ4452900

Thomas Stützle, Helena R. Lourenço, O. C. Martin

Publication date: 7 March 2004

Full work available at URL: https://arxiv.org/abs/math/0102188

Title of this publication is not available (Why is that?)

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)

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Cited In (only showing first 100 items - show all)

• Maximizing breaks and bounding solutions to the mirrored traveling tournament problem
• A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem
• ParadisEO-MO: from fitness landscape analysis to efficient local search algorithms
• Metaheuristics and cooperative approaches for the bi-objective ring star problem
• An adaptive iterated local search heuristic for the heterogeneous fleet vehicle routing problem
• A stochastic vehicle routing problem with travel time uncertainty: trade-off between cost and customer service
• A dynamic neighborhood based tabu search algorithm for real-world flight instructor scheduling problems
• An algorithmic framework based on primitive directions and nonmonotone line searches for black-box optimization problems with integer variables
• A hybrid clonal selection algorithm for the location routing problem with stochastic demands
• Improved local search algorithms for the rectangle packing problem with general spatial costs
• A set-covering based heuristic algorithm for the periodic vehicle routing problem
• Choice by iterative search
• A review of hyper-heuristics for educational timetabling
• GOAL solver: a hybrid local search based solver for high school timetabling
• Effective learning hyper-heuristics for the course timetabling problem
• Design and analysis of stochastic local search for the multiobjective traveling salesman problem
• Two-phase Pareto local search for the biobjective traveling salesman problem
• Decomposition and local search based methods for the traveling umpire problem
• A survey of search methodologies and automated system development for examination timetabling
• A deterministic iterated local search algorithm for the vehicle routing problem with backhauls
• A three-phased local search approach for the clique partitioning problem
• A hybrid evolutionary algorithm for the periodic location-routing problem
• Vehicle routing with compartments: applications, modelling and heuristics
• Integrated production and distribution scheduling with lifespan constraints
• An integer programming approach to the multimode resource-constrained multiproject scheduling problem
• Iterated local search for the team orienteering problem with time windows
• 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 simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
• Iterated local search for single-machine scheduling with sequence-dependent setup times to minimize total weighted tardiness
• Shifting representation search for hybrid flexible flowline problems
• 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
• 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
• Algorithms for a realistic variant of flowshop scheduling
• 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 joint quantile and expected shortfall regression framework
• Variable neighborhood descent with iterated local search for routing and wavelength assignment
• 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
• 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
• The double travelling salesman problem with multiple stacks - formulation and heuristic solution approaches
• A hybrid heuristic algorithm for the open-pit-mining operational planning problem
• A mixed integer programming model for long term capacity expansion planning: a case study from the Hunter valley coal chain
• Adaptive tabu search for course timetabling
• Classification of applied methods of combinatorial optimization
• The vehicle routing problem with flexible time windows and traveling times
• A mixed integer formulation and an efficient metaheuristic for the unrelated parallel machine scheduling problem: total tardiness minimization
• Improved heuristic algorithms for the job sequencing and tool switching problem
• Estimation-based metaheuristics for the probabilistic traveling salesman problem
• Scheduling projects with limited number of preemptions
• Adaptive sample size and importance sampling in estimation-based local search for the probabilistic traveling salesman problem
• Applying the threshold accepting metaheuristic to~curriculum based course timetabling
• Metaheuristics for the traveling salesman problem with pickups, deliveries and handling costs
• A comparison of three metaheuristics for the workover rig routing problem
• A hybrid algorithm for the heterogeneous fleet vehicle routing 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
• Iterated local search for the quadratic assignment problem
• A simple and effective metaheuristic for the minimum latency problem
• A dynamic game with monopolist manufacturer and price-competing duopolist retailers
• An iterated local search algorithm for the vehicle routing problem with backhauls
• An iterated local search for solving a location-routing problem
• Vehicle routing problems with time windows and multiple service workers: a systematic comparison between ACO and GRASP
• A tutorial on the balanced minimum evolution problem
• A multi-threaded local search algorithm and computer implementation for the multi-mode, resource-constrained multi-project scheduling problem
• Multi-objective metaheuristic algorithms for the resource-constrained project scheduling problem with precedence relations
• On solving the time window assignment vehicle routing problem via iterated local search
• Efficient algorithms for cluster editing
• The vehicle sharing and task allocation problem: MILP formulation and a heuristic solution approach
• Efficient branch-and-bound algorithms for weighted MAX-2-SAT
• People detection through quantified fuzzy temporal rules
• Memetic algorithms outperform evolutionary algorithms in multimodal optimisation
• A metaheuristic for crew scheduling in a pickup‐and‐delivery problem with time windows
• Exact and heuristic approaches for the set cover with pairs problem
• Discriminative Structure Learning of Markov Logic Networks
• Local Search Based on Genetic Algorithms
• Iterated local search and very large neighborhoods for the parallel-machines total tardiness problem
• Setting a common due date in a constrained flowshop: a variable neighbourhood search approach
• Hybridizing evolutionary algorithms with variable-depth search to overcome local optima
• Machine learning for global optimization
• Solving the family traveling salesman problem
• The warehouse-inventory-transportation problem for supply chains
• An efficient implementation of a VNS/ILS heuristic for a real-life car sequencing problem
• Effective metaheuristics for scheduling a hybrid flowshop with sequence-dependent setup times
• Optimal design of large-scale screening experiments: a critical look at the coordinate-exchange algorithm
• Machine learning at the service of meta-heuristics for solving combinatorial optimization problems: a state-of-the-art
• Iterated tabu search for the car sequencing problem
• Efficient metaheuristics for the mixed team orienteering problem with time windows

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)