An annotated bibliography of GRASP-Part II: Applications
From MaRDI portal
Publication:3393983
DOI10.1111/j.1475-3995.2009.00664.xzbMath1168.90582OpenAlexW2120572648MaRDI QIDQ3393983
Paola Festa, Mauricio G. C. Resende
Publication date: 28 August 2009
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/j.1475-3995.2009.00664.x
Related Items
Comparison of metaheuristics for the k‐labeled spanning forest problem, Branch-and-cut and hybrid local search for the multi-level capacitated minimum spanning tree problem, Minimizing total tardiness in parallel machine scheduling with setup times: an adaptive memory-based GRASP approach, Making a state-of-the-art heuristic faster with data mining, Solution approaches for the vehicle routing problem with occasional drivers and time windows, A GRASP with penalty objective function for the green vehicle routing problem with private capacitated stations, Heuristics for the generalized median graph problem, Packing items to feed assembly lines, A hybrid Lagrangean heuristic with GRASP and path-relinking for set \(k\)-covering, A hybrid data mining GRASP with path-relinking, A GRASP with path-relinking heuristic for the survivable IP/MPLS-over-WSON multi-layer network optimization problem, Power optimization in ad hoc wireless network topology control with biconnectivity requirements, GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problem, Intelligent-guided adaptive search for the maximum covering location problem, Branch and bound for the cutwidth minimization problem, A nonmonotone GRASP, The constrained shortest path tour problem, A GRASP for simultaneously assigning and sequencing product families on flexible assembly lines, A GRASP algorithm to solve the unicost set covering problem, GRASP with strategic oscillation for the \(\alpha \)-neighbor \(p\)-center problem, A sequential GRASP for the therapist routing and scheduling problem, The multi-vehicle cumulative covering tour problem, Heuristic and metaheuristic methods for the multi‐skill project scheduling problem with partial preemption, Metaheuristics for the work‐troops scheduling problem, Thirty years of International Transactions in Operational Research: past, present, and future direction, Systematic reviews as a metaknowledge tool: caveats and a review of available options, A hybrid heuristic approach to minimize number of tardy jobs in group technology systems, Multirobot search for a stationary object placed in a known environment with a combination of GRASP and VND, A metaheuristic for crew scheduling in a pickup‐and‐delivery problem with time windows, The constrained forward shortest path tour problem: Mathematical modeling and GRASP approximate solutions, A GRASP with path‐relinking and restarts heuristic for the prize‐collecting generalized minimum spanning tree problem, An enhanced GRASP approach for the index tracking problem, Efficient GRASP solution approach for the prisoner transportation problem, Mathematical formulations and solution methods for the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem, MIRHA: multi-start biased randomization of heuristics with adaptive local search for solving non-smooth routing problems, A metaheuristic for security budget allocation in utility networks, A biased random-key genetic algorithm for data clustering, A GRASP metaheuristic to improve accessibility after a disaster, GRASP and VNS for solving the \(p\)-next center problem, A branch-and-cut algorithm for the equitable coloring problem using a formulation by representatives, A survey on optimization metaheuristics, Models and heuristics for the k ‐degree constrained minimum spanning tree problem with node‐degree costs, A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem, Restart strategies for GRASP with path-relinking heuristics, A distributed and hierarchical strategy for autonomic grid-enabled cooperative metaheuristics with applications, Solving a bus driver scheduling problem with randomized multistart heuristics, A HYBRID GREEDY RANDOMIZED ADAPTIVE SEARCH HEURISTIC TO SOLVE THE DIAL-A-RIDE PROBLEM, A multi-product production/distribution system design problem with direct shipments and lateral transshipments, Probabilistic stopping rules for GRASP heuristics and extensions, Improved heuristics for the regenerator location problem, Greedy random adaptive memory programming search for the capacitated clustering problem, Flow shop scheduling problem with position-dependent processing times, Hybridizations of GRASP with path relinking for the far from most string problem, A hybrid data mining metaheuristic for the p‐median problem, Using iterated local search for solving the flow‐shop problem: Parallelization, parametrization, and randomization issues, A bus driver scheduling problem: A new mathematical model and a GRASP approximate solution, GRASP with path-relinking for the generalized quadratic assignment problem, Queueing maximal covering location-allocation problem: an extension with \textit{M/G/1} queueing systems, Diversification strategies in local search for a nonbifurcated network loading problem, Towards an efficient resolution of printing problems, An approach for efficient ship routing, A Hybrid Metaheuristic for Routing on Multicast Networks, An efficient GRASP-like algorithm for the multi-product straight pipeline scheduling problem
Uses Software
