Constructive and Exchange Algorithms for the Frequency Assignment Problem
Author : Titus F. Dorstenstein
Publisher :
Page : 44 pages
File Size : 20,71 MB
Release : 2001
Category :
ISBN :
Author : Titus F. Dorstenstein
Publisher :
Page : 44 pages
File Size : 20,71 MB
Release : 2001
Category :
ISBN :
Author : Panos M. Pardalos
Publisher : Springer Science & Business Media
Page : 571 pages
File Size : 19,18 MB
Release : 2013-04-18
Category : Mathematics
ISBN : 1475753624
In 1995 the Handbook of Global Optimization (first volume), edited by R. Horst, and P.M. Pardalos, was published. This second volume of the Handbook of Global Optimization is comprised of chapters dealing with modern approaches to global optimization, including different types of heuristics. Topics covered in the handbook include various metaheuristics, such as simulated annealing, genetic algorithms, neural networks, taboo search, shake-and-bake methods, and deformation methods. In addition, the book contains chapters on new exact stochastic and deterministic approaches to continuous and mixed-integer global optimization, such as stochastic adaptive search, two-phase methods, branch-and-bound methods with new relaxation and branching strategies, algorithms based on local optimization, and dynamical search. Finally, the book contains chapters on experimental analysis of algorithms and software, test problems, and applications.
Author : Arie Marinus Catharinus Antonius Koster
Publisher : Arie Koster
Page : 88 pages
File Size : 15,82 MB
Release : 1999
Category :
ISBN : 9090131191
Author :
Publisher :
Page : 776 pages
File Size : 47,26 MB
Release : 2001
Category : Dissertation abstracts
ISBN :
Author : Celso C. Ribeiro
Publisher : Springer Science & Business Media
Page : 647 pages
File Size : 11,1 MB
Release : 2012-12-06
Category : Computers
ISBN : 1461515076
Finding exact solutions to many combinatorial optimization problems in busi ness, engineering, and science still poses a real challenge, despite the impact of recent advances in mathematical programming and computer technology. New fields of applications, such as computational biology, electronic commerce, and supply chain management, bring new challenges and needs for algorithms and optimization techniques. Metaheuristics are master procedures that guide and modify the operations of subordinate heuristics, to produce improved approx imate solutions to hard optimization problems with respect to more simple algorithms. They also provide fast and robust tools, producing high-quality solutions in reasonable computation times. The field of metaheuristics has been fast evolving in recent years. Tech niques such as simulated annealing, tabu search, genetic algorithms, scatter search, greedy randomized adaptive search, variable neighborhood search, ant systems, and their hybrids are currently among the most efficient and robust optimization strategies to find high-quality solutions to many real-life optimiza tion problems. A very large nmnber of successful applications of metaheuristics are reported in the literature and spread throughout many books, journals, and conference proceedings. A series of international conferences entirely devoted to the theory, applications, and computational developments in metaheuristics has been attracting an increasing number of participants, from universities and the industry.
Author : Rainer Burkard
Publisher : SIAM
Page : 403 pages
File Size : 37,86 MB
Release : 2012-10-31
Category : Mathematics
ISBN : 1611972221
Assignment Problems is a useful tool for researchers, practitioners and graduate students. In 10 self-contained chapters, it provides a comprehensive treatment of assignment problems from their conceptual beginnings through present-day theoretical, algorithmic and practical developments. The topics covered include bipartite matching algorithms, linear assignment problems, quadratic assignment problems, multi-index assignment problems and many variations of these. Researchers will benefit from the detailed exposition of theory and algorithms related to assignment problems, including the basic linear sum assignment problem and its variations. Practitioners will learn about practical applications of the methods, the performance of exact and heuristic algorithms, and software options. This book also can serve as a text for advanced courses in areas related to discrete mathematics and combinatorial optimisation. The revised reprint provides details on a recent discovery related to one of Jacobi's results, new material on inverse assignment problems and quadratic assignment problems, and an updated bibliography.
Author : Stanford University
Publisher :
Page : 247 pages
File Size : 20,28 MB
Release : 2000
Category :
ISBN :
Author : Marco Dorigo
Publisher : MIT Press
Page : 324 pages
File Size : 18,99 MB
Release : 2004-06-04
Category : Computers
ISBN : 9780262042192
An overview of the rapidly growing field of ant colony optimization that describes theoretical findings, the major algorithms, and current applications. The complex social behaviors of ants have been much studied by science, and computer scientists are now finding that these behavior patterns can provide models for solving difficult combinatorial optimization problems. The attempt to develop algorithms inspired by one aspect of ant behavior, the ability to find what computer scientists would call shortest paths, has become the field of ant colony optimization (ACO), the most successful and widely recognized algorithmic technique based on ant behavior. This book presents an overview of this rapidly growing field, from its theoretical inception to practical applications, including descriptions of many available ACO algorithms and their uses. The book first describes the translation of observed ant behavior into working optimization algorithms. The ant colony metaheuristic is then introduced and viewed in the general context of combinatorial optimization. This is followed by a detailed description and guide to all major ACO algorithms and a report on current theoretical findings. The book surveys ACO applications now in use, including routing, assignment, scheduling, subset, machine learning, and bioinformatics problems. AntNet, an ACO algorithm designed for the network routing problem, is described in detail. The authors conclude by summarizing the progress in the field and outlining future research directions. Each chapter ends with bibliographic material, bullet points setting out important ideas covered in the chapter, and exercises. Ant Colony Optimization will be of interest to academic and industry researchers, graduate students, and practitioners who wish to learn how to implement ACO algorithms.
Author : J. Labetoulle
Publisher : Elsevier
Page : 1562 pages
File Size : 23,10 MB
Release : 2013-10-22
Category : Computers
ISBN : 1483294188
The International Teletraffic Congress (ITC) is a recognized international organization taking part in the work of the International Telecommunications Union. The congress traditionally deals with the development of teletraffic theory and its applications to the design, planning and operation of telecommunication systems, networks and services. The contents of ITC 14 illustrate the important role of teletraffic in the current period of rapid evolution of telecommunication networks. A large number of papers address the teletraffic issues behind developments in broadband communications and ATM technology. The extension of possiblities for user mobility and personal communications together with the generalization of common channnel signalling and the provision of new intelligent network services are further extremely significant developments whose teletraffic implications are explored in a number of contributions. ITC 14 also addresses traditional teletraffic subjects, proposing enhancements to traffic engineering practices for existing circuit and packet switched telecommunications networks and making valuable original contributions to the fundamental mathematical tools on which teletraffic theory is based. The contents of these Proceedings accurately reflect the extremely wide scope of the ITC, extending from basic mathematical theory to day-to-day traffic engineering practices, and constitute the state of the art in 1994 of one of the fundamental telecommunications sciences.
Author : Ding-Zhu Du
Publisher : Springer Science & Business Media
Page : 395 pages
File Size : 44,88 MB
Release : 2006-08-18
Category : Business & Economics
ISBN : 0387238301
This is a supplementary volume to the major three-volume Handbook of Combinatorial Optimization set. It can also be regarded as a stand-alone volume presenting chapters dealing with various aspects of the subject in a self-contained way.