TITLE

EDITORIAL

AUTHOR(S)
Ruiz-Vanoye, Jorge A.
PUB. DATE
September 2014
SOURCE
International Journal of Combinatorial Optimization Problems & I;Sep-Dec2014, Vol. 5 Issue 3, p1
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
An introduction to the journal is presented in which the editor discusses various reports published within the issue including an algorithm to solve the traveling salesman problem (TSP) adding three aspects of time, the desirable characteristics that must contain the software repositories for small- and medium-sized businesses (SMBs), and an enhanced walksat with finite learning automata.
ACCESSION #
100278716

 

Related Articles

  • Fast Algorithms for Geometric Traveling Salesman Problems. Bentley, Jon Jouis // ORSA Journal on Computing;Fall92, Vol. 4 Issue 4, p387 

    This paper describes efficient algorithms for computing approximate traveling salesman tours in multidimensional point sets. We describe implementations of a dozen starting heuristics (including Nearest Neighbor and Farthest Insertion) and three local optimizations (including 2-Opt and 3-Opt)....

  • Multi-depot Multiple TSP: a polyhedral study and computational results. Benavent, Enrique; Martínez, Antonio // Annals of Operations Research;Aug2013, Vol. 207 Issue 1, p7 

    We study the Multi-Depot Multiple Traveling Salesman Problem (MDMTSP), which is a variant of the very well-known Traveling Salesman Problem (TSP). In the MDMTSP an unlimited number of salesmen have to visit a set of customers using routes that can be based on a subset of available depots. The...

  • A Time Bucket Formulation for the Traveling Salesman Problem with Time Windows. Dash, Sanjeeb; Günlük, Oktay; Lodi, Andrea; Tramontani, Andrea // INFORMS Journal on Computing;Winter2012, Vol. 24 Issue 1, p132 

    The traveling salesman problem with time windows (TSPTW) is the problem of finding a minimum-cost path visiting a set of cities exactly once, where each city must be visited within a given time window. We present an extended formulation for the problem based on partitioning the time windows into...

  • A Branch-and-Cut Algorithm for the Double Traveling Salesman Problem with Multiple Stacks. Martínez, Manuel A. Alba; Cordeau, Jean-François; Dell'Amico, Mauro; Iori, Manuel // INFORMS Journal on Computing;Winter2013, Vol. 25 Issue 1, p41 

    The double traveling salesman problem with multiple stacks is a variant of the pickup and delivery traveling salesman problem in which all pickups must be completed before any delivery. In addition, items can be loaded on multiple stacks in the vehicle, and each stack must obey the...

  • Wisdom of Artificial Crowds-A Metaheuristic Algorithm for Optimization. Yampolskiy, Roman V.; Ashby, Leif; Hassan, Lucas // Journal of Intelligent Learning Systems & Applications;May2012, Vol. 4 Issue 2, p98 

    Finding optimal solutions to NP-Hard problems requires exponential time with respect to the size of the problem. Consequently, heuristic methods are usually utilized to obtain approximate solutions to problems of such difficulty. In this paper, a novel swarm-based nature-inspired metaheuristic...

  • Computation of the travelling salesman problem by a shrinking blob. Jones, Jeff; Adamatzky, Andrew // Natural Computing;Mar2014, Vol. 13 Issue 1, p1 

    The travelling salesman problem (TSP) is a well known and challenging combinatorial optimisation problem. Its computational intractability has attracted a number of heuristic approaches to generate satisfactory, if not optimal, candidate solutions. Some methods take their inspiration from...

  • Open Vehicle Routing Problem by Ant Colony Optimization. GurpreetSingh; Dhir, Vijay // International Journal of Advanced Computer Science & Application;2014, Vol. 5 Issue 3, p63 

    Vehicle routing problem (VRP) is real-world combinatorial optimization problem which determine the optimal route of a vehicle. Generally, to provide the efficient vehicle serving to the customer through different services by visiting the number of cities or stops, the VRP follows the Travelling...

  • ISPO: A New Way to Solve Traveling Salesman Problem. Xiaohua Wang; Aiqin Mu; Shisong Zhu // Intelligent Control & Automation (2153-0653);May2013, Vol. 4 Issue 2, p122 

    This paper first introduces the concepts of mobile operators and mobile sequence, with which it redefines the rate of particle swarm optimization algorithm and the formula of position updating. Combining this discrete PSO algorithm with neighbors, the paper puts forward Hybrd Particle Swarm...

  • Note on the Inverse Metric Traveling Salesman Problem Against the Minimum Spanning Tree Algorithm. Yerim Chung // Management Science & Financial Engineering;May2014, Vol. 20 Issue 1, p17 

    In this paper, we consider an interesting variant of the inverse minimum traveling salesman problem. Given an instance (G, w) of the minimum traveling salesman problem defined on a metric space, we fix a specified Hamiltonian cycle HC0. The task is then to adjust the edge cost vector w to w' so...

Share

Read the Article

Courtesy of THE LIBRARY OF VIRGINIA

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics