scientific article; zbMATH DE number 2050711

zbMath1116.90412arXivmath/0102188MaRDI QIDQ4452900

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

Publication date: 7 March 2004

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

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

Related Items (only showing first 100 items - show all)

A stochastic vehicle routing problem with travel time uncertainty: trade-off between cost and customer service ⋮ A hybrid clonal selection algorithm for the location routing problem with stochastic demands ⋮ A review of hyper-heuristics for educational timetabling ⋮ GOAL solver: a hybrid local search based solver for high school timetabling ⋮ Iterated local search for the team orienteering problem with time windows ⋮ A survey of search methodologies and automated system development for examination timetabling ⋮ Effective learning hyper-heuristics for the course timetabling problem ⋮ Decomposition and local search based methods for the traveling umpire problem ⋮ Alternative evaluation functions for the cyclic bandwidth sum problem ⋮ A deterministic iterated local search algorithm for the vehicle routing problem with backhauls ⋮ A three-phased local search approach for the clique partitioning problem ⋮ An integer programming approach to the multimode resource-constrained multiproject scheduling problem ⋮ Classification of applied methods of combinatorial optimization ⋮ 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 ⋮ Minimising total tardiness for a single machine scheduling problem with family setups and resource constraints ⋮ Design of automated negotiation mechanisms for decentralized heterogeneous machine scheduling ⋮ 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 ⋮ A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem ⋮ Improved heuristic algorithms for the job sequencing and tool switching problem ⋮ Hybrid metaheuristics for the clustered vehicle routing problem ⋮ Metaheuristics for the single machine weighted quadratic tardiness scheduling problem ⋮ Improving the quality of heuristic solutions for the capacitated vertex \(p\)-center problem through iterated greedy local search with variable neighborhood descent ⋮ Perturbed decomposition algorithm applied to the multi-objective traveling salesman problem ⋮ Algorithms for job scheduling problems with distinct time windows and general earliness/tardiness penalties ⋮ An exact hybrid method for the vehicle routing problem with time windows and multiple deliverymen ⋮ Stochastic local search with learning automaton for the swap-body vehicle routing problem ⋮ Exact and heuristic algorithms for order acceptance and scheduling with sequence-dependent setup times ⋮ 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 ⋮ The vehicle routing problem with flexible time windows and traveling times ⋮ Solving a concrete sleepers production scheduling by genetic algorithms ⋮ Multiobjective vehicle routing problem with fixed delivery and optional collections ⋮ Coalition-based metaheuristic: a self-adaptive metaheuristic using reinforcement learning and mimetism ⋮ A comparison of three metaheuristics for the workover rig routing problem ⋮ A mixed integer programming model for long term capacity expansion planning: a case study from the Hunter valley coal chain ⋮ A hybrid algorithm for the heterogeneous fleet vehicle routing problem ⋮ A simple and effective metaheuristic for the minimum latency problem ⋮ Parallel local search algorithms for high school timetabling problems ⋮ Iterated local search for single-machine scheduling with sequence-dependent setup times to minimize total weighted tardiness ⋮ 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 set-covering based heuristic algorithm for the periodic vehicle routing problem ⋮ A heuristic approach for packing identical rectangles in convex regions ⋮ Hybridizing evolutionary algorithms with variable-depth search to overcome local optima ⋮ Machine learning for global optimization ⋮ The green location-routing problem ⋮ Vehicle routing with compartments: applications, modelling and heuristics ⋮ An efficient implementation of a VNS/ILS heuristic for a real-life car sequencing problem ⋮ Iterated tabu search for the car sequencing problem ⋮ A hybrid heuristic for a multi-objective real-life car sequencing problem with painting and assembly line constraints ⋮ Effective metaheuristics for scheduling a hybrid flowshop with sequence-dependent setup times ⋮ Crossover iterated local search for SDCARP ⋮ Efficient metaheuristics for the mixed team orienteering problem with time windows ⋮ Formulating and solving the integrated batching, routing, and picker scheduling problem in a real-life spare parts warehouse ⋮ Methods for solving road network problems with disruptions ⋮ The configurable SAT solver challenge (CSSC) ⋮ Fitness landscape analysis for the no-wait flow-shop scheduling problem ⋮ Fast local search for the maximum independent set problem ⋮ A multi-threaded local search algorithm and computer implementation for the multi-mode, resource-constrained multi-project scheduling problem ⋮ A methodology for determining an effective subset of heuristics in selection hyper-heuristics ⋮ An iterated greedy heuristic for a market segmentation problem with multiple attributes ⋮ Heuristics for a flowshop scheduling problem with stepwise job objective function ⋮ Exact and heuristic approaches for the set cover with pairs problem ⋮ People detection through quantified fuzzy temporal rules ⋮ A hybrid evolutionary algorithm for the periodic location-routing problem ⋮ A joint quantile and expected shortfall regression framework ⋮ Efficient branch-and-bound algorithms for weighted MAX-2-SAT ⋮ Variable neighborhood descent with iterated local search for routing and wavelength assignment ⋮ Applying the threshold accepting metaheuristic to~curriculum based course timetabling ⋮ Metaheuristics for the traveling salesman problem with pickups, deliveries and handling costs ⋮ Iterated local search and very large neighborhoods for the parallel-machines total tardiness problem ⋮ Beam-ACO--hybridizing ant colony optimization with beam search: an application to open shop scheduling ⋮ Solving the problem of packing equal and unequal circles in a circular container ⋮ Two-phase Pareto local search for the biobjective traveling salesman problem ⋮ Estimation-based metaheuristics for the probabilistic traveling salesman problem ⋮ Setting a common due date in a constrained flowshop: a variable neighbourhood search approach ⋮ Solving job shop scheduling problems utilizing the properties of backbone and ``big valley ⋮ A hybrid heuristic algorithm for the open-pit-mining operational planning problem ⋮ Shifting representation search for hybrid flexible flowline problems ⋮ Solving the family traveling salesman problem ⋮ Algorithms for a realistic variant of flowshop scheduling ⋮ Design and analysis of stochastic local search for the multiobjective traveling salesman problem ⋮ Integrated production and distribution scheduling with lifespan constraints ⋮ Finding maximin Latin hypercube designs by iterated local search heuristics ⋮ A solution approach from an analytic model to heuristic algorithm for special case of vehicle routing problem with stochastic demands ⋮ Scheduling projects with limited number of preemptions ⋮ The double travelling salesman problem with multiple stacks - formulation and heuristic solution approaches ⋮ The impact of parametrization in memetic evolutionary algorithms ⋮ Hybrid metaheuristics with evolutionary algorithms specializing in intensification and diversification: overview and progress report ⋮ Adaptive sample size and importance sampling in estimation-based local search for the probabilistic traveling salesman problem ⋮ 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 ⋮ Metaheuristics in combinatorial optimization

This page was built for publication: