Looking ahead with the pilot method
From MaRDI portal
Publication:816423
DOI10.1007/s10479-005-2060-2zbMath1114.90064OpenAlexW2101216945MaRDI QIDQ816423
Andreas Fink, Stefan Voß, Cees W. Duin
Publication date: 9 March 2006
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-005-2060-2
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Related Items
Comparison of metaheuristics for the k‐labeled spanning forest problem, Total distance approximations for routing solutions, Managing platelet supply through improved routing of blood collection vehicles, Carousel greedy: a generalized greedy algorithm with applications in optimization, New insights on the block relocation problem, Robust min-max regret covering problems, Enhanced second order algorithm applied to the capacitated minimum spanning tree problem, PILOT, GRASP, and VNS approaches for the static balancing of bicycle sharing systems, Heuristic and metaheuristic methods for the multi‐skill project scheduling problem with partial preemption, Initialization of metaheuristics: comprehensive review, critical analysis, and research directions, Partitioning of supply/demand graphs with capacity limitations: an ant colony approach, A demand‐responsive feeder service with a maximum headway at mandatory stops, A rollout algorithm framework for heuristic solutions to finite-horizon stochastic dynamic programs, Effective patient prioritization in mass casualty incidents using hyperheuristics and the pilot method, Solving real-world vehicle routing problems in uncertain environments, Skewed VNS enclosing second order algorithm for the degree constrained minimum spanning tree problem, Applying the pilot method to improve VNS and GRASP metaheuristics for the design of SDH/WDM networks, An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem, An analysis of constructive algorithms for the airport baggage sorting station assignment problem, Search tree based approaches for parallel machine scheduling, Single-pass and approximate dynamic-programming algorithms for order acceptance and capacity planning, Probabilistic stopping rules for GRASP heuristics and extensions, Variable neighbourhood search for the minimum labelling Steiner tree problem, Integrating the ambulance dispatching and relocation problems to maximize system's preparedness, Scheduling trains as a blocking parallel-machine job shop scheduling problem, VNS and second order heuristics for the min-degree constrained minimum spanning tree problem, Greedy randomized adaptive search and variable neighbourhood search for the minimum labelling spanning tree problem, Solution techniques for the inter-modal pickup and delivery problem in two regions
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A rollout metaheuristic for job shop scheduling problems
- An ant colony optimization algorithm for the minimum weight vertex cover problem
- Optimal placement of add/drop multiplexers: Static and dynamic models
- Applications of modern heuristic search methods to pattern sequencing problems
- A classification of formulations for the (time-dependent) traveling salesman problem
- Solving the continuous flow-shop scheduling problem by metaheuristics.
- Rollout algorithms for stochastic scheduling problems
- Fiber-to-object assignment heuristics
- Benchmarks for basic scheduling problems
- A user's guide to tabu search
- Rollout algorithms for combinatorial optimization
- The pilot method: A strategy for heuristic repetition with application to the Steiner problem in graphs
- Guided Local Search with Shifting Bottleneck for Job Shop Scheduling
- On finding steiner vertices
- The Lessons of Flowshop Scheduling Research
- The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
- Optimal Load Balancing on Sonet Bidirectional Rings
- Guided Local Search
- Scheduling tasks on unrelated machines: large neighborhood improvement procedures
