115 Hits in 3.3 sec

Cut-and-solve: An iterative search strategy for combinatorial optimization problems

Sharlee Climer, Weixiong Zhang
2006 Artificial Intelligence  
In this paper, we demonstrate the cut-and-solve strategy by implementing a generic version of it for the Asymmetric Traveling Salesman Problem (ATSP).  ...  Our unoptimized implementation outperformed state-of-the-art solvers for five out of seven real-world problem classes of the ATSP.  ...  Acknowledgements This research was supported in part by NDSEG and Olin Fellowships, by NSF grants IIS-0196057, ITR/EIA-0113618, and IIS-0535257, and in part by DARPA Cooperative Agreement F30602-00-2-0531  ... 
doi:10.1016/j.artint.2006.02.005 fatcat:xdj3xevzdvbypm4b44wsum6ebm

Exact Methods for the Asymmetric Traveling Salesman Problem [chapter]

Matteo Fischetti, Andrea Lodi, Paolo Toth
2007 Combinatorial Optimization  
Finally, in Section 5 all these methods are computationally tested on a large set of instances, and compared with an effective branch-and-cut code for the symmetric TSP.  ...  In Section 3 a branchand-bound method based on the computation of an additive bound is described, while in Section 4 a branch-and-cut approach is discussed.  ...  importance for the solution of some real-world instances.  ... 
doi:10.1007/0-306-48213-4_4 fatcat:di6bmwwsrjezjmi5zqoadtoflm

Models and algorithms for the Asymmetric Traveling Salesman Problem: an experimental comparison

Roberto Roberti, Paolo Toth
2012 EURO Journal on Transportation and Logistics  
are derived, and the most effective branch-and-bound and branch-andcut algorithms are described.  ...  The polynomial ILP formulations proposed for the ATSP are then presented and analyzed. The considered algorithms and formulations are finally experimentally compared on a set of benchmark instances.  ...  Acknowledgments Work supported by Ministero dell'Istruzione, dell'Universitàà e della Ricerca (M.I.U.R.), Italy.  ... 
doi:10.1007/s13676-012-0010-0 fatcat:h34rdkzg4vhodouxq6lulici5u

Solving the Asymmetric Travelling Salesman Problem with time windows by branch-and-cut

Norbert Ascheuer, Matteo Fischetti, Martin Grötschel
2001 Mathematical programming  
The real-world application we aim at is the control of a stacker crane in a warehouse.  ...  Computational results for real-world instances with up to 233 nodes are reported, showing that a new model presented in a companion paper outperforms the other two models we considered -at least for our  ...  This branch&cut code (based on ABACUS and CPLEX 5.0) was tested on real-world and modified real-world instances with sizes of up to about 250 nodes.  ... 
doi:10.1007/pl00011432 fatcat:5guogdgmuzawfdtcb26cqx5lmy

Exact algorithms and heuristics for the Quadratic Traveling Salesman Problem with an application in bioinformatics

A. Fischer, F. Fischer, G. Jäger, J. Keilwagen, P. Molitor, I. Grosse
2014 Discrete Applied Mathematics  
In these tests, the branch-and-cut approach turned out to be superior for solving the real-world instances from bioinformatics.  ...  Finally, we compare all algorithms on real-world instances from bioinformatics and on randomly generated instances.  ...  Acknowledgments We thank IPK Gatersleben, JKI Quedlinburg, and UZI Halle-Wittenberg for financial support.  ... 
doi:10.1016/j.dam.2013.09.011 fatcat:jgfkfizo3vcrzdt3jzg72jc2lu

Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups

Roger Z. Ríos-Mercado, Jonathan F. Bard
1998 Computers & Operations Research  
This paper presents a branch-and-cut B&C algorithm for the problem of minimizing the makespan associated with scheduling n jobs in an m-machine owshop with setup times SDST owshop.  ...  It was found that the B&C approach outperforms conventional branch and bound. With respect to computational e ort, model B proved superior.  ...  Acknowledgments We thank Manfred Padberg and Giovanni Rinaldi for providing us with a C implementation of their MINCUT algorithm 12 .  ... 
doi:10.1016/s0305-0548(97)00079-8 fatcat:72ffefoq4zhdbbuprsfwkeh3jy

Exact solution of large-scale, asymmetric traveling salesman problems

G. Carpaneto, M. Dell'Amico, P. Toth
1995 ACM Transactions on Mathematical Software  
For the undirected graph case (Symmetric Traveling Salesman Problem), a Euclidean instance with 2392 vertices has been solved through a sequential branch-and-cut procedure, using facet-inducing  ...  In addition, we solved on a PC 486/33 (with 8MB of main memory) no-wait fZow shop problems (see Papadimitriou and Kanel- lakis [ 1980]) with up to 1000 jobs in less than 11 minutes and real-world  ... 
doi:10.1145/212066.212081 fatcat:ajeikaj3ufedzd5u2ci4eahazi

Cuts, Primal Heuristics, and Learning to Branch for the Time-Dependent Traveling Salesman Problem [article]

Christoph Hansknecht, Imke Joormann, Sebastian Stiller
2018 arXiv   pre-print
We introduce multiple families of cutting planes for the TDTSP as well as different LP-based primal heuristics, a propaga- tion method and a branching rule.  ...  We consider the time-dependent traveling salesman problem (TDTSP), a generalization of the asymmetric traveling salesman problem (ATSP) to incorporate time-dependent cost functions.  ...  Since A is an α-approximation, the optimal tour T opt has θ arr (T opt ) > n and G is not Hamiltonian.  ... 
arXiv:1805.01415v1 fatcat:boe2r2nqjjhiplcn6iiwr3sdve

An asymmetric TSP with time windows and with time-dependent travel times and costs: An exact solution through a graph transformation

José Albiach, José María Sanchis, David Soler
2008 European Journal of Operational Research  
Computational results are presented on a set of 270 adapted instances from benchmark ATSPTW instances.  ...  Unlike other existing papers about time-dependent routing problems, we focus on an exact method for solving this new problem.  ...  we constructed the ATSP instance to be solved, and finally we transformed the ATSP instance into a GATSP instance by adding a large positive number to each arc cost in order to assure the occurrence of  ... 
doi:10.1016/j.ejor.2006.09.099 fatcat:gcvn3wmm4bgkhkrsa7tlgphuza

Page 3692 of Mathematical Reviews Vol. , Issue 2002E [page]

2002 Mathematical Reviews  
with time windows by branch-and-cut.  ...  Computational experience indicates that most ATSP-TW instances with 50-70 nodes can be solved to op- timality via branch and cut codes on any of the three models.  ... 

The Attractive Traveling Salesman Problem

Güneş Erdoğan, Jean-François Cordeau, Gilbert Laporte
2010 European Journal of Operational Research  
A linearization is proposed and is strengthened through the introduction of valid inequalities, and a branch-and-cut algorithm is developed. A tabu search algorithm is also implemented.  ...  , and the attractiveness of the facility vertex.  ...  Acknowledgments: This work was partially funded by the Canadian Natural Sciences and Engineering Research Council under grants 227837-04 and 39682-05. This support is gratefully acknowledged.  ... 
doi:10.1016/j.ejor.2009.06.029 fatcat:5njahm5lobfbhdmifhxltulkde

Page 5977 of Mathematical Reviews Vol. , Issue 2001H [page]

2001 Mathematical Reviews  
Real world (> 200 nodes) and benchmark instances of TSPLIB can be solved in a reasonable amount of 91 GAME THEORY, ECONOMICS, SOCIAL AND BEHAVIORAL SCIENCES For the web version of Mathematical Reviews,  ...  The implementation of a branch and cut algorithm is described in detail.  ... 

The Rural Postman Problem with time windows

Marcela Monroy-Licht, Ciro Alberto Amaya, André Langevin
2014 Networks  
We propose a cutting plane algorithm to solve the problem based on valid inequalities for the Traveling Salesman Problem with Time Windows and the Precedence Constrained Traveling Salesman Problem and  ...  We give different formulations and compare them on sets of instances adapted from the literature.  ...  Ascheuer et al. (2001) solve the Asymmetric TSP with Time Windows (ATSP-TW) by a branch-and-cut method; they solve in a satisfactory way real-world instances of the control of a stacker crane in a warehouse  ... 
doi:10.1002/net.21569 fatcat:za3cqpdcgjgwjcuscz6y6tey34

Genetic algorithm for asymmetric traveling salesman problem with imprecise travel times

J. Majumdar, A.K. Bhunia
2011 Journal of Computational and Applied Mathematics  
Here the ATSP (with interval objective) is formulated using the usual interval arithmetic. To solve the interval ATSP (I-ATSP), a genetic algorithm with interval valued fitness function is proposed.  ...  This paper presents a variant of the asymmetric traveling salesman problem (ATSP) in which the traveling time between each pair of cities is represented by an interval of values (wherein the actual travel  ...  [56] solved TSPs with interval data from the graph-theoretic view point, for which they used some exact algorithms like branch and bound, branch and cut, Benders' decomposition and some heuristic and  ... 
doi:10.1016/ fatcat:bqbc4pvlfjfm3hlcjuosqcwd6a

SelfSplit parallelization for mixed-integer linear programming

Matteo Fischetti, Michele Monaci, Domenico Salvagnin
2018 Computers & Operations Research  
Both adhoc and general purpose MILP codes have been considered. Computational results show that SelfSplit, in spite of its simplicity, can achieve good speedups even in the MILP context.  ...  Nonlinear Optimization: Approaches and Applications"), and by the Vienna Science and Technology Fund (WWTF) through project ICT15-014.  ...  Acknowledgements This research was supported by the University of Padova (Progetto di Ateneo "Exploiting randomness in Mixed-Integer Linear Programming"), by MiUR, 885 Italy (PRIN project "Mixed-Integer  ... 
doi:10.1016/j.cor.2018.01.011 fatcat:woycukb6kvh5dosf6f5nlrqnjq
« Previous Showing results 1 — 15 out of 115 results