نتایج جستجو برای Tabu search

تعداد نتایج: 223475  

2007
Sadiq M. Sait, Mohammed Faheemuddin, Mustafa Imran Ali, Syed Sanaullah,

In this paper, Simulated Evolution based goodness attributes are incorporated into Tabu Search and Genetic Algorithms to enhance performance as compared to canonical strategies. In TS, the goodness is used in generating the candidate list of neighboring solutions. In GA, allele fitness is used to define a new crossover which significantly improves over traditional recombination strategies. Both...

2006
Malek Rahoual, Rachid Saad,

As demand for Education increases and diversifies, so does the difficulty of designing workable timetables for schools and academic institutions. Besides the intractability of the basic problem, there is an increasing variety of constraints that come into play. In this paper we present a hybrid of two metaheuristics (genetic algorithm and tabu search) to tackle the problem in its most general s...

Journal: :Computers & OR 1999
Gülay Barbarosoglu, Demet Özgür,

The purpose of this study is to develop a new tabu seach heuristic to solve the single-depot vehicle routing problem of a distribution company carrying goods from a depot to a set of dedicated dealers. The heuristic proposes a new neighbourhood generation procedure which considers the scattering pattern in the locations of the dealers. A set of neighbours are generated by first executing a proc...

2008
Ben Weber,

The dynamic and non-hierarchical nature of the military domain presents a challenge for traditional supply chain optimization. Flow networks and simulation techniques have been applied to the military distribution problem, but are unable to provide time-definite delivery to customers. Recently, optimization approaches have been independently applied towards strategic and operational levels of p...

2009
Albert Corominas, Alberto García-Villoria, Rafael Pastor,

This problem has a broad range of real-world applications: among others, to sequence on mixed-model assembly lines under the just-in-time production system, to resource allocation in computer multi-threaded systems such as operating systems, network servers and mediabased applications, in the periodic machine maintenance problem when the times between consecutive services of the same machine sh...

Journal: :European Journal of Operational Research 2011
Amina Lamghari, Jacques A. Ferland,

Article history: Received 21 January 2010 Accepted 27 October 2010 Available online 9 November 2010

2009
Yufei Wu, Samuel Pierre,

There are many factors that have to be considered during planning phase of mobile radio networks. Some of the most important factors are: quality of service (QoS), cost of implementation and provisioning, traffic coverage ratio, and resource utilization. This paper analyzes economic aspects of 3G mobile radio network deployment and presents a planning model which explicitly takes into account s...

2003
Marcus Randall,

Recently, the Tabu Search (TS) metaheuristic has been applied to a number of combinatorial optimisation problems with success [1, 14, 15, 18, 19]. TS is an enhancement of the well known hill climbing heuristic and it searches the entire neighbourhood for a solution with a cost better than the current cost. If a local optimum is encountered, it will accept the solution whose cost deteriorates th...

Journal: :J. Scheduling 2005
Peter Brucker, Thomas Kampmeyer,

A general framework is developed to model a large variety of different cyclic machine scheduling problems with blocking with the objective to minimize the cycle time. For this framework tabu search algorithms are developed. Neighborhoods are derived which generalize the block-approach based neighborhoods which have been successfully applied to noncyclic job-shop problems and cyclic job-shop pro...

2014
Isabel Méndez-Díaz, Graciela L. Nasini, Daniel E. Severin,

The Equitable Coloring Problem is a variant of the Graph Coloring Problem where the sizes of two arbitrary color classes differ in at most one unit. This additional condition, called equity constraints, arises naturally in several applications. Due to the hardness of the problem , current exact algorithms can not solve large-sized instances. Such instances must be addressed only via heuristic m...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید