Tabu Search
Metaheuristics in combinatorial optimization: Overview and conceptual comparison
ACM Computing Surveys (CSUR)
Simulation-based optimization: practical introduction to simulation optimization
Proceedings of the 35th conference on Winter simulation: driving innovation
Optimisation of WCDMA radio networks with consideration of link-level performance factors
International Journal of Mobile Network Design and Innovation
Management agent for search algorithms with surface optimization applications
WSEAS Transactions on Computers
Digital workspace for optimal E-business strategies
DNCOCO'08 Proceedings of the 7th conference on Data networks, communications, computers
Management agent for search algorithms
ICCOMP'08 Proceedings of the 12th WSEAS international conference on Computers
WSEAS Transactions on Computers
Metaheuristic approach to assembly line balancing
WSEAS TRANSACTIONS on SYSTEMS
Investigation of the effects of asymmetrical problems on the performance of search management agent
EC'09 Proceedings of the 10th WSEAS international conference on evolutionary computing
A Comparative Investigation on Heuristic Optimization of WCDMA Radio Networks
Proceedings of the 2007 EvoWorkshops 2007 on EvoCoMnet, EvoFIN, EvoIASP,EvoINTERACTION, EvoMUSART, EvoSTOC and EvoTransLog: Applications of Evolutionary Computing
Minimising the delta test for variable selection in regression problems
International Journal of High Performance Systems Architecture
Recourse-based facility-location problems in hybrid uncertain environment
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics - Special issue on gait analysis
Computers and Operations Research
International Journal of Applied Metaheuristic Computing
| Hi-index | 0.00 |
A parametric form of tabu-search is proposed for solving mixed integer programming (MIP) problems that creates and solves a series of linear programming (LP) problems embodying branching inequalities as weighted terms in the objective function. The approach extends and modifies a parametric branch and bound procedure of Glover [Parametic branch and bound. OMEGA, The International Journal of Management Science 1978;6:1-9], replacing its tree search memory by the adaptive memory framework of tabu-search and introducing new associated strategies that are more flexible than the mechanisms of branch and bound.We also introduce new types of intensification and diversification procedures based on scatter search and frequency analysis, and also based on a variant of adaptive memory called model embedded memory. In one form this approach incorporates recency and frequency memory within the objective function structure of the parameterized LP formulations. In another form it generates valid inequalities from the optimized objective of the parameterized LP problem, and uses these as a supplement to traditional types of tabu memory. The integrated parametric approach affords a spectrum of variations that include useful simplifications for pure 0-1 MIP problems and problems with special structures, such as GUB constraints. The approach exploits both spatial and logical relationships, and is appropriate for discovering feasible solutions, as in the case of satisfiability problems. It is particularly designed to provide adaptive strategies for problems that are difficult for branch and bound and for branch and cut procedures, as opposed to problems these latter methods can handle effectively, and hence can be used to complement or supplement these more traditional types of methods.