The following pages link to Optimization by Simulated Annealing (Q82025):
Displaying 50 items.
- A new capacitated vehicle routing problem with split service for minimizing fleet cost by simulated annealing (Q357949) (← links)
- Magnetic charged system search: a new meta-heuristic algorithm for optimization (Q359468) (← links)
- A simulated annealing based genetic local search algorithm for multi-objective multicast routing problems (Q363596) (← links)
- Exact and approximate methods for a one-dimensional minimax bin-packing problem (Q363606) (← links)
- A hyper-heuristic approach to sequencing by hybridization of DNA sequences (Q367628) (← links)
- Robust portfolio optimization with a hybrid heuristic algorithm (Q373173) (← links)
- A double-multiplicative dynamic penalty approach for constrained evolutionary optimization (Q373947) (← links)
- Binary accelerated particle swarm algorithm (BAPSA) for discrete optimization problems (Q377748) (← links)
- A time-dependent scheduling problem to minimize the sum of the total weighted tardiness among two agents (Q380599) (← links)
- Survey of modeling and optimization strategies to solve high-dimensional design problems with computationally-expensive black-box functions (Q381435) (← links)
- Optimal design of thin-walled columns for buckling under loadings controlled by displacements (Q381515) (← links)
- A survey on approaches for reliability-based optimization (Q381530) (← links)
- A survey of multidisciplinary design optimization methods in launch vehicle design (Q381758) (← links)
- Optimal design of clamped columns for stability under combined axial compression and torsion (Q381775) (← links)
- Modified-modal-pushover-based seismic optimum design for steel structures considering life-cycle cost (Q381802) (← links)
- Shape optimization of thin-walled pressure vessel end closures (Q381893) (← links)
- Partitioned solution of an unsteady adjoint for strongly coupled fluid-structure interactions and application to parameter identification of a one-dimensional problem (Q381917) (← links)
- A multiparametric strategy for the two step optimization of structural assemblies (Q381973) (← links)
- Three-dimensional identification of microorganisms using a digital holographic microscope (Q382540) (← links)
- Minimizing makespan for scheduling stochastic job shop with random breakdown (Q388592) (← links)
- A greedy algorithm for combined scheduling of computations and data exchanges in real-time systems (Q395472) (← links)
- Cellular automata on graphs: topological properties of ER graphs evolved towards low-entropy dynamics (Q406078) (← links)
- Optimal control of a fed-batch fermentation involving multiple feeds (Q410901) (← links)
- A survey of methods available for the numerical optimization of continuous dynamic systems (Q415366) (← links)
- Crossover can provably be useful in evolutionary computation (Q418021) (← links)
- Clustering and selecting suppliers based on simulated annealing algorithms (Q418322) (← links)
- Permutation flow shop scheduling with order acceptance and weighted tardiness (Q419558) (← links)
- Optimal variable shape parameter for multiquadric based RBF-FD method (Q419601) (← links)
- Quantifying the impact of inland transport times on container fleet sizing in liner shipping services with uncertainties (Q421075) (← links)
- Isoseparation and robustness in parametric Bayesian inference (Q421437) (← links)
- Constructing circular phylogenetic networks from weighted quartets using simulated annealing (Q423083) (← links)
- A new hybrid method for solving global optimization problem (Q426339) (← links)
- A multicast routing algorithm based on searching in directed graph (Q426417) (← links)
- An iterative method for the creation of structured hexahedral meshes over complex orography (Q426435) (← links)
- Estimating the parameters of a Gompertz-type diffusion process by means of simulated annealing (Q426535) (← links)
- Convergence analysis and performance of the extended artificial physics optimization algorithm (Q426928) (← links)
- Modified particle swarm optimization algorithm with simulated annealing behavior and its numerical verification (Q426984) (← links)
- Optimizing reserve capacity of urban road networks in a discrete network design problem (Q427136) (← links)
- The new and computationally efficient MIL-SOM algorithm: potential benefits for visualization and analysis of a large-scale high-dimensional clinically acquired geographic data (Q428295) (← links)
- Heuristics for a project management problem with incompatibility and assignment costs (Q429511) (← links)
- A general VNS heuristic for the traveling salesman problem with time windows (Q429659) (← links)
- Using Markov chains to analyze the effectiveness of local search algorithms (Q429676) (← links)
- Quantum annealing of the graph coloring problem (Q429697) (← links)
- Sidelobe level reduction in linear array pattern synthesis using particle swarm optimization (Q430945) (← links)
- Optimal marriage Fitting for imperfect statistics (Q430963) (← links)
- Static resource allocation for heterogeneous computing environments with tasks having dependencies, priorities, deadlines, and multiple versions (Q436910) (← links)
- Cyclic-order neighborhoods with application to the vehicle routing problem with stochastic demand (Q439376) (← links)
- A graph-pair representation and MIP-model-based heuristic for the unequal-area facility layout problem (Q439505) (← links)
- Supply chain design considering economies of scale and transport frequencies (Q439589) (← links)
- A sequential niching memetic algorithm for continuous multimodal function optimization (Q440701) (← links)
