Filters








246 Hits in 2.3 sec

On the Recoverable Traveling Salesman Problem [article]

Marc Goerigk and Stefan Lendl and Lasse Wulf
2021 arXiv   pre-print
In this paper we consider the Recoverable Traveling Salesman Problem (TSP).  ...  We discuss consequences for approximability results in the more general area of recoverable robust optimization.  ...  We also study a multi-stage generalization of RecovTSP which we call k-Stage Recoverable Traveling Salesman Problem (k-St-RecovTSP).  ... 
arXiv:2111.09691v1 fatcat:nlhs4ec22ngmhp2ubclv5mleuu

On the recoverable robust traveling salesman problem

André Chassein, Marc Goerigk
2015 Optimization Letters  
We consider an uncertain traveling salesman problem, where distances between nodes are not known exactly, but may stem from an uncertainty set of possible scenarios.  ...  This uncertainty set is given as intervals with an additional bound on the number of distances that may deviate from their expected, nominal value.  ...  Introduction The traveling salesman problem (TSP) is one of the most researched NP-complete optimization problems in the operations research community (see, e.g., [LLKS85] ).  ... 
doi:10.1007/s11590-015-0949-5 fatcat:tybyqeqm4vdoxdzdkzokv3jwle

Page 15 of The Journal of the Operational Research Society Vol. 48, Issue 5 [page]

1997 The Journal of the Operational Research Society  
with nonconvex feasible region Stochastic procedures for scheduling minimum job sets on mixed model assembly lines The travelling salesman problem: new solvable cases and linkages with the development  ...  of approximation algorithms A time-based formulation and upper bounding scheme for the selective travelling salesperson problem Buffering from material recovery uncertainty in a recoverable manufacturing  ... 

Page 1197 of Mathematical Reviews Vol. , Issue 89B [page]

1989 Mathematical Reviews  
This paper describes an efficient heuristic algorithm based on partitioning of a traveling salesman tour.  ...  , David (1-CLMB) Finding the optimal a priori tour and location of a traveling salesman with nonhomogeneous customers.  ... 

Robust Optimization: Concepts and Applications [chapter]

José García, Alvaro Peña
2018 Nature-inspired Methods for Stochastic, Robust and Dynamic Optimization  
There are several ways to apply robust optimization and the choice of form is typical of the problem that is being solved.  ...  Robust optimization is an emerging area in research that allows addressing different optimization problems and specifically industrial optimization problems where there is a degree of uncertainty in some  ...  In [41] , an uncertain traveling salesman problem was developed.  ... 
doi:10.5772/intechopen.75381 fatcat:xeb7v6xxjnfylcpl56uu2grfyu

Ant colony optimization-based multi-mode scheduling under renewable and nonrenewable resource constraints

Heng Li, Hong Zhang
2013 Automation in Construction  
An ant colony optimization (ACO)-based methodology for solving the multi-mode resource-constrained project scheduling problem (MRCPSP) considering both renewable and nonrenewable resources is presented  ...  The parameter-selection and the resultant performance of the proposed ACO methodology are investigated through a series of computational experiments.  ...  ACO has been applied to the traveling salesman problem, quadratic assignment problem, production scheduling, time-tabling, vehicle routing, telecommunications routing and investment planning.  ... 
doi:10.1016/j.autcon.2013.05.030 fatcat:c5u2uxfh7vbeflprwpammmcb2m

Transparent optimistic rollback recovery

David B. Johnson, Willy Zwaenepoel
1991 ACM SIGOPS Operating Systems Review  
We n,casured the performance of distributcd progran~s for solving the n-queens problem, the traveling salesman problem, and Gaus-s|an elimination with partial pivoting.  ...  Essentially, this requires that all other state interval's on which this interval either directly or indirectly depends are recoverable after the failure.  ... 
doi:10.1145/122120.122132 fatcat:nnpsbbzqfrg27gvcrr6m7pcyle

Transparent optimistic rollback recovery

David B. Johnson, Willy Zwaenepoel
1990 Proceedings of the 4th workshop on ACM SIGOPS European workshop - EW 4  
We n,casured the performance of distributcd progran~s for solving the n-queens problem, the traveling salesman problem, and Gaus-s|an elimination with partial pivoting.  ...  Essentially, this requires that all other state interval's on which this interval either directly or indirectly depends are recoverable after the failure.  ... 
doi:10.1145/504136.504152 dblp:conf/sigopsE/JohnsonZ90 fatcat:47yt5il4u5b6ni62leoxefewxu

Solusi Optimal Model Optimisasi Robust Untuk Masalah Traveling Salesman Dengan Ketidaktentuan Kotak Dan Pendekatan Metode Branch And Bound

Poppy Amriyati, Diah Chaerani, Eman Lesmana
2016 Jurnal Teknik Industri  
Traveling Salesman Problem (TSP) is route search technique that starts from a starting point, every city should be visited once and return to place of origin so that the total distance or travel time is  ...  Numerical simulations on Maple application software is presented for some real cases related to application of RTSP such as construction management problem, determining the distance for traveling in Java  ...  Salesman Problem dan Quadratic Assignment Problem (Lawler dan Wood [4]).  ... 
doi:10.9744/jti.17.2.81-88 fatcat:xklwnoqzjzhttnhbr2hs5feycy

An optimisation-based seasonal sugarcane harvest scheduling decision support system for commercial growers in South Africa

B.J. Stray, J.H. van Vuuren, C.N. Bezuidenhout
2012 Computers and Electronics in Agriculture  
The optimisation models underlying the decision support system are based on a time-dependent travelling salesman problem formulation and are solved approximately by means of a tabu search in a Microsoft  ...  The authors' findings are that the decision support system provides support in practical sugarcane harvest scheduling and that one series of regression fits is required for each agroclimatically and management-wise  ...  The second author was funded by the South African National Research Foundation in the form of a research grant (GUN 2072999  ... 
doi:10.1016/j.compag.2012.01.009 fatcat:gr73pgsxqrdozo54qpyredefkq

Multiple probabilistic traveling salesman problem in the coordination of drug transportation—In the context of sustainability goals and Industry 4.0

Sebastian Twaróg, Krzysztof Szwarc, Martyna Wronka-Pośpiech, Małgorzata Dobrowolska, Anna Urbanek, Dragan Pamucar
2021 PLoS ONE  
The main aim of the paper is to demonstrate the above average and utilitarian significance of the multiple probabilistic traveling salesman problem (MPTSP) in the coordination and modeling of sustainable  ...  The study focuses on the issue of planning routes, with particular emphasis on the changing demand of customers.  ...  Depending on the restrictions imposed by business practices, the traveling salesman problem (TSP) or vehicle routing problem (VRP; derived from the TSP) are often used to plan routes as part of a technological  ... 
doi:10.1371/journal.pone.0249077 pmid:33765056 fatcat:5pkbewxgpbedveq63pbtzhenr4

Investigating the Recoverable Robust Single Machine Scheduling Problem Under Interval Uncertainty [article]

Matthew Bold, Marc Goerigk
2022 arXiv   pre-print
We investigate the recoverable robust single machine scheduling problem under interval uncertainty.  ...  We provide positive complexity results for some important special cases of this problem, as well as derive a 2-approximation algorithm to the full problem.  ...  Acknowledgements The authors are grateful for the support of the EPSRC-funded (EP/L015692/1) STOR-i Centre for Doctoral Training.  ... 
arXiv:2107.09310v3 fatcat:lovpakturzeg5ph47coi2l6bnm

Page 248 of Law Reporter Vol. 27, Issue 6 [page]

1984 Law Reporter  
The car is worth $7,200 instead of the $7,500 D paid for it. Car #5 was sold to Consumer E, a travelling salesman and an avid basketball fan.  ...  One day at the Mobile Motors (MM) auto plant, a worker with a problem was not able to give full atten- tion to his job.  ... 

Robust Algorithms for TSP and Steiner Tree

Arun Ganesh, Bruce M. Maggs, Debmalya Panigrahi, Emanuela Merelli, Anuj Dawar, Artur Czumaj
2020 International Colloquium on Automata, Languages and Programming  
In this paper, we study robust algorithms for minimizing regret in NP-hard graph optimization problems, and give constant approximations on regret for the classical traveling salesman and Steiner tree  ...  For graph problems in P, such as shortest path and minimum spanning tree, robust polynomial-time algorithms that obtain a constant approximation on regret are known.  ...  Algorithm for the Robust Traveling Salesman Problem In this section, we give a robust algorithm for the traveling salesman problem: Theorem 5.  ... 
doi:10.4230/lipics.icalp.2020.54 dblp:conf/icalp/GaneshMP20 fatcat:kuyyi6tlnzczpbam3s4b6yod24

Page 1615 of Mathematical Reviews Vol. 55, Issue 5 [page]

1978 Mathematical Reviews  
Miller, Bruce L. 11999 Dispatching from depot repair in a recoverable item inventory system: on the optimality of a heuristic rule. Management Sci. 21 (1974/75), no. 3, 316-325.  ...  Padberg, Zur Oberflachenstruktur des Travelling Salesman Polytopen (pp. 207-216); H. Czap, Geometrische Charakterisie- rung exakter Penalty-Funktionen (pp. 217-226). Lagerhaltung, I: Ch.  ... 
« Previous Showing results 1 — 15 out of 246 results