The Traveling Salesman Problem

Author: David L. Applegate
Publisher: Princeton University Press
ISBN: 1400841100
Format: PDF, ePub, Docs
Download Now
This book presents the latest findings on one of the most intensely investigated subjects in computational mathematics--the traveling salesman problem. It sounds simple enough: given a set of cities and the cost of travel between each pair of them, the problem challenges you to find the cheapest route by which to visit all the cities and return home to where you began. Though seemingly modest, this exercise has inspired studies by mathematicians, chemists, and physicists. Teachers use it in the classroom. It has practical applications in genetics, telecommunications, and neuroscience. The authors of this book are the same pioneers who for nearly two decades have led the investigation into the traveling salesman problem. They have derived solutions to almost eighty-six thousand cities, yet a general solution to the problem has yet to be discovered. Here they describe the method and computer code they used to solve a broad range of large-scale problems, and along the way they demonstrate the interplay of applied mathematics with increasingly powerful computing platforms. They also give the fascinating history of the problem--how it developed, and why it continues to intrigue us.

In Pursuit of the Traveling Salesman

Author: William Cook
Publisher: Princeton University Press
ISBN: 0691152705
Format: PDF, ePub
Download Now
Covers the history, applications, theory, and computation of the traveling salesman problem right up to state-of-the-art solution machinery.

The Princeton Companion to Applied Mathematics

Author: Nicholas J. Higham
Publisher: Princeton University Press
ISBN: 1400874475
Format: PDF, Mobi
Download Now
This is the most authoritative and accessible single-volume reference book on applied mathematics. Featuring numerous entries by leading experts and organized thematically, it introduces readers to applied mathematics and its uses; explains key concepts; describes important equations, laws, and functions; looks at exciting areas of research; covers modeling and simulation; explores areas of application; and more. Modeled on the popular Princeton Companion to Mathematics, this volume is an indispensable resource for undergraduate and graduate students, researchers, and practitioners in other disciplines seeking a user-friendly reference book on applied mathematics. Features nearly 200 entries organized thematically and written by an international team of distinguished contributors Presents the major ideas and branches of applied mathematics in a clear and accessible way Explains important mathematical concepts, methods, equations, and applications Introduces the language of applied mathematics and the goals of applied mathematical research Gives a wide range of examples of mathematical modeling Covers continuum mechanics, dynamical systems, numerical analysis, discrete and combinatorial mathematics, mathematical physics, and much more Explores the connections between applied mathematics and other disciplines Includes suggestions for further reading, cross-references, and a comprehensive index

Advanced Manufacturing and Sustainable Logistics

Author: Wilhelm Dangelmaier
Publisher: Springer Science & Business Media
ISBN: 3642124615
Format: PDF, ePub, Mobi
Download Now
Intimesofdecliningeconomicgrowth,companieshavetocontroltheircostsmore than ever to saveresources needed in the future. Regardless of the economic size of the company, the processes of production and logistics play a decisive role in stabilizing procedures and avoiding waste. Both are important cost drivers in manufacturing companies and therefore they o?er large potential savings. Pervasive networking in the last years has contributed to a hitherto unknown transparency of global markets. This harmonization opened up new possibilities of entering foreign markets for procurement and sales to the companies. The emerging global procurement strategy was understood as a chance to rethink the relocation of existing production facilities to pro?t from existing di?erences in price and performance as a resource-saving factor. Many companies tended towards a reduction of their vertical integration by outsourcing sections of their value chain. These contracted services of production result in higher transport volumes, increased complexity of supply processes and new requirements on - gistic networks. This trend of outsourcing has not stopped, but is slowing down noticeably. Additionally,thereisanincreasingproportionofcompaniesrestoring business units that were outsourced before. Reasons for turning back decisions are often to be found in missed goals. It is not unusual that important cost f- tors were disregarded in the original basis of decision-making. In the meantime many companies have realized that it is easier to achieve stability of processes and therewith a control of costs by increasing their own contribution to p- duction. Especially in times of under-utilized capacities like in the current crisis, insourcingcanbeastrategicoption.

Computational Combinatorial Optimization

Author: Michael Jünger
Publisher: Springer
ISBN: 3540455868
Format: PDF, ePub, Mobi
Download Now
This tutorial contains written versions of seven lectures on Computational Combinatorial Optimization given by leading members of the optimization community. The lectures introduce modern combinatorial optimization techniques, with an emphasis on branch and cut algorithms and Lagrangian relaxation approaches. Polyhedral combinatorics as the mathematical backbone of successful algorithms are covered from many perspectives, in particular, polyhedral projection and lifting techniques and the importance of modeling are extensively discussed. Applications to prominent combinatorial optimization problems, e.g., in production and transport planning, are treated in many places; in particular, the book contains a state-of-the-art account of the most successful techniques for solving the traveling salesman problem to optimality.

Combinations of Intelligent Methods and Applications

Author: Ioannis Hatzilygeroudis
Publisher: Springer
ISBN: 3319268600
Format: PDF, Mobi
Download Now
This volume includes extended and revised versions of the papers presented at the 4th Workshop on “Combinations of Intelligent Methods and Applications” (CIMA 2014) which was intended to become a forum for exchanging experience and ideas among researchers and practitioners dealing with combinations of different intelligent methods in Artificial Intelligence. The aim is to create integrated or hybrid methods that benefit from each of their components. Some of the existing presented efforts combine soft computing methods (fuzzy logic, neural networks and genetic algorithms). Another stream of efforts integrates case-based reasoning or machine learning with soft-computing methods. Some of the combinations have been more widely explored, like neuro-symbolic methods, neuro-fuzzy methods and methods combining rule-based and case-based reasoning. CIMA 2014 was held in conjunction with the 26th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2014).

Experimental Algorithms

Author: Andrew V. Goldberg
Publisher: Springer
ISBN: 3319388517
Format: PDF
Download Now
This book constitutes the refereed proceedings of the 15th International Symposium on Experimental Algorithms, SEA 2016, held in St. Petersburg, Russia, in June 2016. The 25 revised full papers presented were carefully reviewed and selected from 54 submissions. The main theme of the symposium is the role of experimentation and of algorithm engineering techniques in the design and evaluation of algorithms and data structures. SEA covers a wide range of topics in experimental algorithmics, bringing together researchers from algorithm engineering, mathematical programming, and combinatorial optimization communities.

Local Search in Combinatorial Optimization

Author: Emile Aarts
Publisher: Princeton University Press
ISBN: 0691187568
Format: PDF, ePub, Docs
Download Now
In the past three decades, local search has grown from a simple heuristic idea into a mature field of research in combinatorial optimization that is attracting ever-increasing attention. Local search is still the method of choice for NP-hard problems as it provides a robust approach for obtaining high-quality solutions to problems of a realistic size in reasonable time. Local Search in Combinatorial Optimization covers local search and its variants from both a theoretical and practical point of view, each topic discussed by a leading authority. This book is an important reference and invaluable source of inspiration for students and researchers in discrete mathematics, computer science, operations research, industrial engineering, and management science. In addition to the editors, the contributors are Mihalis Yannakakis, Craig A. Tovey, Jan H. M. Korst, Peter J. M. van Laarhoven, Alain Hertz, Eric Taillard, Dominique de Werra, Heinz Mühlenbein, Carsten Peterson, Bo Söderberg, David S. Johnson, Lyle A. McGeoch, Michel Gendreau, Gilbert Laporte, Jean-Yves Potvin, Gerard A. P. Kindervater, Martin W. P. Savelsbergh, Edward J. Anderson, Celia A. Glass, Chris N. Potts, C. L. Liu, Peichen Pan, Iiro Honkala, and Patric R. J. Östergård.

Operations Research Proceedings 2014

Author: Marco Lübbecke
Publisher: Springer
ISBN: 3319286978
Format: PDF, ePub, Docs
Download Now
This book contains a selection of refereed papers presented at the "International Conference on Operations Research (OR 2014)", which took place at RWTH Aachen University, Germany, September 2-5, 2014. More than 800 scientists and students from 47 countries attended OR 2014 and presented more than 500 papers in parallel topical streams, as well as special award sessions. The theme of the conference and its proceedings is "Business Analytics and Optimization".

The Traveling Salesman Problem and Its Variations

Author: G. Gutin
Publisher: Springer Science & Business Media
ISBN: 0306482134
Format: PDF, ePub
Download Now
A brilliant treatment of a knotty problem in computing. This volume contains chapters written by reputable researchers and provides the state of the art in theory and algorithms for the traveling salesman problem (TSP). The book covers all important areas of study on TSP, including polyhedral theory for symmetric and asymmetric TSP, branch and bound, and branch and cut algorithms, probabilistic aspects of TSP, and includes a thorough computational analysis of heuristic and metaheuristic algorithms.