TTT plots: a perl program to create time-to-target plots

DOI10.1007/s11590-006-0031-4zbMath1220.90102OpenAlexW2120470208MaRDI QIDQ2468777

Renata M. Aiex, Celso Carneiro Ribeiro, Mauricio G. C. Resende

Publication date: 25 January 2008

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-006-0031-4

Mathematics Subject Classification ID

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

Related Items

Heuristic search to the capacitated clustering problem, Heuristics for the constrained incremental graph drawing problem, A biased random-key genetic algorithm to maximize the number of accepted lightpaths in WDM optical networks, Making a state-of-the-art heuristic faster with data mining, MILP formulations and an iterated local search algorithm with tabu thresholding for the order batching problem, Reinforcement learning based tabu search for the minimum load coloring problem, An ILS-based algorithm to solve a large-scale real heterogeneous fleet VRP with multi-trips and docking constraints, Heuristics for the generalized median graph problem, A hybrid Lagrangean heuristic with GRASP and path-relinking for set \(k\)-covering, A hybrid data mining GRASP with path-relinking, Power optimization in ad hoc wireless network topology control with biconnectivity requirements, GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problem, A Pareto-metaheuristic for a bi-objective winner determination problem in a combinatorial reverse auction, GRASP for the uncapacitated \(r\)-allocation \(p\)-hub median problem, Intelligent-guided adaptive search for the maximum covering location problem, An iterated sample construction with path relinking method: application to switch allocation in electrical distribution networks, A nonmonotone GRASP, A biased random-key genetic algorithm for the maximum quasi-clique problem, Hybrid method with CS and BRKGA applied to the minimization of tool switches problem, A variable fixing heuristic with local branching for the fixed charge uncapacitated network design problem with user-optimal flow, Heuristic methods to consecutive block minimization, MineReduce: an approach based on data mining for problem size reduction, Hybrid genetic search for the CVRP: open-source implementation and SWAP* neighborhood, A diversified tabu search approach for the open-pit mine production scheduling problem with metal uncertainty, Tabu search and GRASP for the capacitated clustering problem, GRASP with strategic oscillation for the \(\alpha \)-neighbor \(p\)-center problem, Metaheuristics for the work‐troops scheduling problem, A mesh adaptive basin hopping method for the design of circular antenna arrays, A hybrid data mining heuristic to solve the point‐feature cartographic label placement problem, Model and methods to address urban road network problems with disruptions, Improving a state‐of‐the‐art heuristic for the minimum latency problem with data mining, Combining integer linear programming with a state‐of‐the‐art heuristic for the 2‐path network design problem, Responsive threshold search based memetic algorithm for balanced minimum sum-of-squares clustering, Iterated multilevel simulated annealing for large-scale graph conductance minimization, Evaluating balancing on social networks through the efficient solution of correlation clustering problems, The strong network orientation problem, MLQCC: an improved local search algorithm for the set k‐covering problem, Strategic oscillation for the balanced minimum sum-of-squares clustering problem, Population-based iterated greedy algorithm for the S-labeling problem, A fast tri-individual memetic search approach for the distance-based critical node problem, A general VNS heuristic for the traveling salesman problem with time windows, Hybrid data mining heuristics for the heterogeneous fleet vehicle routing problem, Extending time‐to‐target plots to multiple instances, Finding multiple roots of a box-constrained system of nonlinear equations with a biased random-key genetic algorithm, Using sequential runtime distributions for the parallel speedup prediction of SAT local search, ILS heuristics for the single-machine scheduling problem with sequence-dependent family setup times to minimize total tardiness, An improved configuration checking-based algorithm for the unicost set covering problem, An extended goal programming model for the multiobjective integrated lot-sizing and cutting stock problem, Models and heuristics for the k ‐degree constrained minimum spanning tree problem with node‐degree costs, Effective metaheuristic algorithms for the minimum differential dispersion problem, Path relinking for unconstrained binary quadratic programming, A distributed and hierarchical strategy for autonomic grid-enabled cooperative metaheuristics with applications, Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms, Adaptive memory in multistart heuristics for multicommodity network design, Clonal selection: an immunological algorithm for global optimization over continuous spaces, Variable neighborhood descent with iterated local search for routing and wavelength assignment, \texttt{tttplots-compare}: a Perl program to compare time-to-target plots or general runtime distributions of randomized algorithms, On the problem of minimizing the cost with optical devices in Wavelength Division Multiplexing optical networks: complexity analysis, mathematical formulation and improved heuristics, A hybrid data mining metaheuristic for the p‐median problem, A bus driver scheduling problem: A new mathematical model and a GRASP approximate solution, GRASP heuristic with path-relinking for the multi-plant capacitated lot sizing problem, A biased random-key genetic algorithm for routing and wavelength assignment under a sliding scheduled traffic model, Hybrid algorithms for placement of virtual machines across geo-separated data centers, Large-scale parallelism for constraint-based local search: the costas array case study, Solving the integrated multi-period scheduling routing problem for cleaning debris in the aftermath of disasters, Designing vehicle routes for a mix of different request types, under time windows and loading constraints, A tabu search for time-dependent multi-zone multi-trip vehicle routing problem with time windows

Uses Software

Cites Work