scientific article; zbMATH DE number 2050711
From MaRDI portal
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
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, A metaheuristic for the double traveling salesman problem with partial last‐in‐first‐out loading constraints, The strong network orientation problem, Local search approaches for the test laboratory scheduling problem with variable task grouping, Ils-based algorithms for the profit maximizing uncapacitated hub network design problem with multiple allocation, Efficient iterated greedy for the two-dimensional bandwidth minimization problem, New pricing strategies and an effective exact solution framework for profit-oriented ring arborescence problems, New neighborhoods and an iterated local search algorithm for the generalized traveling salesman problem, A mixed integer formulation and an efficient metaheuristic for the unrelated parallel machine scheduling problem: total tardiness minimization, An efficient implementation of a VNS heuristic for the weighted fair sequences problem, Inter-depot moves and dynamic-radius search for multi-depot vehicle routing problems, A branch-and-bound approach to the no-idle flowshop scheduling problem, ParadisEO-MO: from fitness landscape analysis to efficient local search algorithms, Collection of different types of milk with multi-tank tankers under uncertainty: a real case study, 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, Optimal design of large-scale screening experiments: a critical look at the coordinate-exchange algorithm, Adaptive tabu search for course timetabling, Fast neighborhood search for the single machine earliness-tardiness scheduling problem, An iterated local search algorithm for the team orienteering problem with variable profits, The quadratic three-dimensional assignment problem: exact and approximate solution methods, Metaheuristics and cooperative approaches for the bi-objective ring star problem, Scatter search for minimizing weighted tardiness in a single machine scheduling with setups, Ants can orienteer a thief in their robbery, A Progressive Approximation Approach for the Exact Solution of Sparse Large-Scale Binary Interdiction Games, A memory-based iterated local search algorithm for the multi-depot open vehicle routing problem, Efficient approaches for the flooding problem on graphs, The secure time-dependent vehicle routing problem with uncertain demands, 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, Local search based heuristics for global optimization: atomic clusters and beyond, A tutorial on the balanced minimum evolution problem, Stochastic runtime analysis of a cross-entropy algorithm for traveling salesman problems, The vessel swap-body routing problem, A multi-start evolutionary local search for the one-commodity pickup and delivery traveling salesman problem, The vehicle sharing and task allocation problem: MILP formulation and a heuristic solution approach, An adaptive iterated local search heuristic for the heterogeneous fleet vehicle routing problem, MPILS: an automatic tuner for MILP solvers, Analysis of a local search heuristic for the generalized assignment problem with resource-independent task profits and identical resource capacity, Approximating the chance-constrained capacitated vehicle routing problem with robust optimization, Metaheuristics for the work‐troops scheduling problem, Multiple \(k\)-opt evaluation multiple \(k\)-opt moves with GPU high performance local search to large-scale traveling salesman problems, Automated slideshow design from a set of photos based on a hybrid Metaheuristic approach, The family traveling salesman problem with incompatibility constraints, An MO‐GVNS algorithm for solving a multiobjective hybrid flow shop scheduling problem, Enhanced iterated local search for the technician routing and scheduling problem, Model and methods to address urban road network problems with disruptions, Bi‐criteria formulation for green scheduling with unrelated parallel machines with sequence‐dependent setup times, Heuristic approaches for the family traveling salesman problem, Improving a state‐of‐the‐art heuristic for the minimum latency problem with data mining, Expansion-based hill-climbing, Heuristic and exact algorithms for minimum-weight non-spanning arborescences, GRASP‐ILS and set cover hybrid heuristic for the synchronized team orienteering problem with time windows, A metaheuristic for crew scheduling in a pickup‐and‐delivery problem with time windows, Local search algorithms for the composite retrieval problem, Double descent and intermittent color diffusion for landscape exploration, Local Search Based on Genetic Algorithms, A Metaheuristic Approach to Compute Pure Nash Equilibria, CHAMP: a multipass algorithm for Max Sat based on saver variables, Hybrid data mining heuristics for the heterogeneous fleet vehicle routing problem, Memetic algorithms outperform evolutionary algorithms in multimodal optimisation, An algorithmic framework based on primitive directions and nonmonotone line searches for black-box optimization problems with integer variables, Discriminative Structure Learning of Markov Logic Networks, A dynamic game with monopolist manufacturer and price-competing duopolist retailers, On the use of meta-heuristic algorithms for automated test suite generation in software testing, An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives, A hybrid adaptive iterated local search with diversification control to the capacitated vehicle routing problem, Local search algorithms for finding the Hamiltonian completion number of line graphs, Some effective heuristics for no-wait flowshops with setup times to minimize total completion time, Machine learning at the service of meta-heuristics for solving combinatorial optimization problems: a state-of-the-art, City-courier routing and scheduling problems, The warehouse-inventory-transportation problem for supply chains, Breakout local search for the Steiner tree problem with revenue, budget and hop constraints, A bi-objective coordination setup problem in a two-stage production system, Embedding a novel objective function in a two-phased local search for robust vertex coloring, Multi-objective metaheuristic algorithms for the resource-constrained project scheduling problem with precedence relations, Improved local search algorithms for the rectangle packing problem with general spatial costs, Deconstructing Nowicki and Smutnicki's \(i\)-TSAB tabu search algorithm for the job-shop scheduling problem, Improved global convergence probability using multiple independent optimizations, Image registration with iterated local search, Agile Earth observation satellite scheduling: an orienteering problem with time-dependent profits and travel times, Maximizing breaks and bounding solutions to the mirrored traveling tournament problem, Iterated local search for the quadratic assignment problem, Matheuristics for a parallel machine scheduling problem with non-anticipatory family setup times: application in the offshore oil and gas industry, Metaheuristic for the Vehicle Routing Problem with Backhauls and Time Windows, Compact formulations and an iterated local search-based matheuristic for the minimum weighted feedback vertex set problem, Neighborhood decomposition based variable neighborhood search and tabu search for maximally diverse grouping, Metaheuristics for the online printing shop scheduling problem, Capacitated ring arborescence problems with profits, Formulations, branch-and-cut and a hybrid heuristic algorithm for an inventory routing problem with perishable products, Efficient algorithms for cluster editing, Joint generalized quantile and conditional tail expectation regression for insurance risk analysis, An iterated local search algorithm for the vehicle routing problem with backhauls, A simheuristic approach for throughput maximization of asynchronous buffered stochastic mixed-model assembly lines, On the problem of minimizing the cost with optical devices in Wavelength Division Multiplexing optical networks: complexity analysis, mathematical formulation and improved heuristics, Analysis of variable neighborhood descent as a local search operator for total weighted tardiness problem on unrelated parallel machines, On solving the time window assignment vehicle routing problem via iterated local search, A simheuristic algorithm for time-dependent waste collection management with stochastic travel times, Iterated local search for the placement of wildland fire suppression resources, The multicommodity traveling salesman problem with priority prizes: a mathematical model and metaheuristics, A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems, A dynamic neighborhood based tabu search algorithm for real-world flight instructor scheduling problems, A Variable Neighborhood Search Algorithm for Cost-Balanced Travelling Salesman Problem, Adaptive Iterated Local Search with Random Restarts for the Balanced Travelling Salesman Problem, Towards a theory of practice in metaheuristics design: A machine learning perspective, The multiple traveling salesman problem in presence of drone- and robot-supported packet stations, Lifted graphical models: a survey, Estimation-based metaheuristics for the single vehicle routing problem with stochastic demands and customers, The parallel drone scheduling problem with multiple drones and vehicles, A matheuristic for the truck and trailer routing problem
