Keyword: optimization: simulated annealing

Found 552 papers in total
Port space allocation with a time dimension
2007,
In the Port of Singapore, as in many other ports, space has to be allocated in yards...
Computational approaches to a combinatorial optimization problem arising from text classification
2007,
We present a combinatorial optimization problem with a particular cost structure: a...
A hybrid meta-heuristic for multi-objective optimization: MOSATS
2007,
Real optimization problems often involve not one, but multiple objectives, usually in...
Hub location under capacity constraints
2007,
Hub-and-spoke networks are employed in cargo transportation. This paper presents a...
Heuristics for search sequencing under time-dependent probabilities of existence
2007,
We consider the problem of determining a route of a search resource to search visually...
Effective heuristics for the dynamic demand joint replenishment problem
2007,
This paper considers the dynamic demand joint replenishment problem where there is a...
Efficient formation of storage classes for warehouse storage location assignment: A simulated annealing approach
2007,
Class-based storage policy distributes products among a number of classes and for each...
Colour map design through optimization
2007,
Often in engineering systems, full-colour images have to be displayed on limited...
Global optimization analysis of slope stability by simulated annealing with dynamic bounds and Dirac function
2007,
In slope stability analysis, the search for the minimum factor of safety is a...
Two-machine flow shop problems with a single server
2006,
Scheduling models that allow the handling of pre-operational setup have been a source...
An effective hybrid algorithm for university course timetabling
2006,
The university course timetabling problem is an optimisation problem in which a set of...
A hybrid simulated annealing for capacitated vehicle routing problems with the independent route length
2006,
This paper presents a linear integer model of capacitated vehicle routing problems...
A generalized crossing local search method for solving vehicle routing problems
2007,
In this paper, we propose a generalized crossing local search method for solving...
Engineering optimization using a real-parameter genetic-algorithm-based hybrid method
2006,
A hybrid optimization algorithm which combines the respective merits of the genetic...
A simulated annealing approach to the traveling tournament problem
2006,
Automating the scheduling of sport leagues has received considerable attention in...
Optimization of transit network layout and headway with a combined genetic algorithm and simulated annealing method
2006,
This article proposes a methodology for optimizing transit networks, including both...
Simulated annealing for solving near-optimal low-thrust orbit transfer
2005,
The effectiveness of simulated annealing (SA) to design near-optimal low-thrust...
Scheduling fixtures for New Zealand cricket
2005,
This paper describes the problem faced every year by New Zealand Cricket in scheduling...
Preemptive goal programming using simulated annealing
2005,
Goal programming is a commonly used technique for modelling and solving multiple...
A hybrid heuristic for the uncapacitated single allocation hub location problem
2007,
The uncapacitated single allocation hub location problem (USAHLP), with the...
Agility in two-stage hybrid flow shop parallel machine scheduling through simulated annealing
2007,
The problem of flexible hybrid flow shop scheduling with identical and nonidentical...
Total tardiness minimization on unrelated parallel machine scheduling with auxiliary equipment constraints
2006,
This research deals with scheduling jobs on unrelated parallel machines with auxiliary...
A comparative study of single-phase and two-phase approaches for the layout problem with material handling costs
2007,
A comparative study of one- and two-phase procedures for material handling cost-based...
A discrete-time approximation technique for the time–cost trade-off in PERT networks
2007,
We develop a discrete-time approximation technique dealing with the time–cost...
Papers per page: