Semi-greedy heuristics: An empirical study
From MaRDI portal
Publication:1821033
DOI10.1016/0167-6377(87)90021-6zbMath0615.90082OpenAlexW2110376540MaRDI QIDQ1821033
Andrew W. Shogan, J. Pirie Hart
Publication date: 1987
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6377(87)90021-6
Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Integer programming (90C10)
Related Items
Quadratic bottleneck knapsack problems, ParadisEO-MO: from fitness landscape analysis to efficient local search algorithms, Applying tabu search to the job-shop scheduling problem, The Bipartite QUBO, The electric fleet size and mix vehicle routing problem with time windows and recharging stations, Computational aspects of the maximum diversity problem, Optimization procedures for the bipartite unconstrained 0-1 quadratic programming problem, A probabilistic heuristic for a computationally difficult set covering problem, Metaheuristics: A bibliography, A review on discrete diversity and dispersion maximization from an OR perspective, Tabu search for the BWC problem, Self-adaptive randomized constructive heuristics for the multi-item capacitated lot sizing problem, Initialization of metaheuristics: comprehensive review, critical analysis, and research directions, A critical analysis of the “improved Clarke and Wright savings algorithm”, Scheduling wagons to unload in bulk cargo ports with uncertain processing times, A guided reactive GRASP for the capacitated multi-source Weber problem, Heuristic Ranking Classification Method for Complex Large-Scale Survival Data, Evolutionary-based searching method for quantum circuit architecture, Partitioning of supply/demand graphs with capacity limitations: an ant colony approach, The discrete p-dispersion problem, Heuristics from Nature for Hard Combinatorial Optimization Problems, Analyzing Heuristic-based Randomized Search Strategies for the Quantum Circuit Compilation Problem, A GRASP for a difficult single machine scheduling problem, A novel ant colony optimization strategy for the quantum circuit compilation problem, A survey on optimization metaheuristics, Case-based reasoning and improved adaptive search for project scheduling, Avoiding local optima in the \(p\)-hub location problem using tabu search and GRASP, Two-stage hybrid flow shop with precedence constraints and parallel machines at second stage, A TABU search heuristic for the team orienteering problem, Heuristics for multi-stage interdiction of stochastic networks, A grasp algorithm for m-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness, A hybrid heuristic for the diameter constrained minimum spanning tree problem, Enhanced savings calculation and its applications for solving capacitated vehicle routing problem, Bilinear Assignment Problem: Large Neighborhoods and Experimental Analysis of Algorithms, A bus driver scheduling problem: A new mathematical model and a GRASP approximate solution, Distribution requirements and compactness constraints in school timetabling, Bubblesearch: a simple heuristic for improving priority-based greedy algorithms, Solving the traveling delivery person problem with limited computational time, Solving zero-one mixed integer programming problems using tabu search, Metaheuristics in combinatorial optimization
Cites Work
- Unnamed Item
- Optimization by Simulated Annealing
- Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
- Implementing vehicle routing algorithms
- A statistical approach to the tsp
- Networks and vehicle routing for municipal waste collection
- A Heuristic Algorithm for the Vehicle-Dispatch Problem
