Filters








5,254 Hits in 9.1 sec

A multiobjective non-dominated sorting genetic algorithm (NSGA-II) for the Multiple Traveling Salesman Problem

Rubén Iván Bolaños, Mauricio Granada Echeverry, John Willmer Escobar
2015 Decision Science Letters  
This paper considers a multi-objective version of the Multiple Traveling Salesman Problem (MOmTSP).  ...  The problem is formulated as an integer multi-objective optimization model. A non-dominated sorting genetic algorithm (NSGA-II) is proposed to solve the MOmTSP.  ...  Introduction The Multiple Traveling Salesman Problem (MTSP) is a generalization of the well-known Traveling Salesman Problem (TSP) arising when several Hamiltonian tours are considered.  ... 
doi:10.5267/j.dsl.2015.5.003 fatcat:zgqnhcalejgbpefptkz2wvqmpa

A Compromise Decision Support Multi Objective Travelling Salesman Problem

2019 International journal of recent technology and engineering  
In this article, the compromised decision support solutions are processed for a multi objective travelling salesman problem.  ...  Based on decision maker's preference, the compromised solution for the multi objective travelling salesman problem is obtained.  ...  ALGORITHM FOR MULTI OBJECTIVE TRAVELLING SALESMAN PROBLEM Consider a Multi Objective Travelling Salesman Problem.  ... 
doi:10.35940/ijrte.d4501.118419 fatcat:mwbkccm2mfcxzjiunlsqjiuxci

The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times

Louis-Philippe Bigras, Michel Gamache, Gilles Savard
2008 Discrete Optimization  
For these problems, we introduce several integer programming formulations of varying size and strength.  ...  Incorporating these improved LP relaxation bounds, we propose an exact branch-and-bound algorithm able to solve instances of 1|s ij | C j and 1|s ij | T j having up to 50 and 45 jobs respectively.  ...  for the traveling salesman problem.  ... 
doi:10.1016/j.disopt.2008.04.001 fatcat:6t4fxsdpvnhnzbqo77k3dbp4vu

A Performance Study for the Multi-objective Ant Colony Optimization Algorithms on the Job Shop Scheduling Problem

I.D.I.D. Ariyasingha, T.G.I. Fernando
2015 International Journal of Computer Applications  
Two types of models are used by changing the number of ants in a colony and each multi-objective ant colony optimization algorithm is applied to sixteen benchmark problem instances of up to 20 jobs × 5  ...  machines, for evaluating the performances of these algorithms.  ...  Acknowledgement The authors are grateful to Prof. Arjuna Parakrama, Department of English, University of Peradeniya, for language editing of this paper.  ... 
doi:10.5120/ijca2015907638 fatcat:hpi7oh43dbcpzalgv4tld6nt54

The Robust Traveling Salesman Problem with Interval Data

R. Montemanni, J. Barta, M. Mastrolilli, L. M. Gambardella
2007 Transportation Science  
The traveling salesman problem is one of the most famous combinatorial optimization problems, and has been intensively studied in the last decades.  ...  We present a new extension to the basic problem, where travel times are specified as a range of possible values.  ...  Acknowledgements The authors would like to thank Keld Helsgaun and William Cook for their suggestions and help in the use of programs LKH and Concorde respectively, and Leonora Bianchi for the helpful  ... 
doi:10.1287/trsc.1060.0181 fatcat:vyaqkb37zvdzfhevv6awcghjsy

Page 4807 of Mathematical Reviews Vol. , Issue 2003f [page]

2003 Mathematical Reviews  
, Alexey (4-LNDHB-C; Egham) Traveling salesman should not be greedy: domination analysis of greedy-type heuristics for the TSP.  ...  One of the main results of the paper is that there are instances of the ATSP and of the STSP for which these algorithms return the worst tour. (The algorithms have domination number |.)  ... 

Evolutionary multi-objective optimization algorithms with probabilistic representation based on pheromone trails

Hui Li, Dario Landa-silva, Xavier Gandibleux
2010 IEEE Congress on Evolutionary Computation  
salesman problem.  ...  In this paper, we investigate the performance of two state-of-the-art EMO algorithms -MOEA/D and NSGA-II, with probabilistic representation based on pheromone trails, on the multi-objective travelling  ...  For example, in the first implementation of ACO algorithm for the travelling salesman problem, called ant system (AS) [15] , the probability of moving from node c i to node c j was defined as: p ij (t  ... 
doi:10.1109/cec.2010.5585998 dblp:conf/cec/LiSG10 fatcat:3jscrmbkavatvnn4ute7qv3bme

A New Multi-Objective Ant Colony Optimisation Algorithm for Solving the Quadratic Assignment Problem

I. D. I. D. Ariyasingha, T. G. I. Fernando
2019 Vidyodaya Journal of Science  
This paper presents a new ant colony optimisation algorithm for solving multiple objective optimisation problems, and it is named as the random weight-based ant colony optimisation algorithm (RWACO).  ...  One of its major applications is the facility location, which is to find an assignment of all facilities to all locations in the way their total is minimised.  ...  travelling salesman problem.  ... 
doi:10.4038/vjs.v22i1.6060 fatcat:ib5ay3aspvbahkibxa45zzzrvi

Pareto Local Optimum Sets in the Biobjective Traveling Salesman Problem: An Experimental Study [chapter]

Luis Paquete, Marco Chiarandini, Thomas Stützle
2004 Lecture notes in economics and mathematical systems  
The Community is not responsible for any use that might be made of data appearing in this publication. References 1. J.L. Bentley. Fast algorithms for geometric traveling salesman problems.  ...  are at the core of the most successful metaheuristics for solving a wide variety of -hard single objective combinatorial optimization problems such as the Traveling Salesman Problem (TSP) [22,  ... 
doi:10.1007/978-3-642-17144-4_7 fatcat:xp3nvosifvfjfbcgxzzzkqy5ve

Solving the TSP using Traditional Computing Approach

Evans Baidoo, Stephen O.
2016 International Journal of Computer Applications  
The Travel salesman Problem is no exception. As it is an NP-Hard problem, lots of divergent solutions have been created to determine in shortest possible time, the optimal solution.  ...  From the last decade, even though there have been sudden advances in present technology in all areas, there exist some real-world NP composite problems that still escape scientists.  ...  TRAVELLING SALESMAN PROBLEM The origin of the Travelling Salesman Problem and its name is to some extent difficult to understand. .The travelling salesman problem, also recognized as the TSP, is one of  ... 
doi:10.5120/ijca2016911906 fatcat:jam44hqaoraylbahmmmjk72pqi

The time-dependent capacitated profitable tour problem with time windows and precedence constraints

Peng Sun, Lucas P. Veelenturf, Said Dabia, Tom Van Woensel
2018 European Journal of Operational Research  
This heuristic does not guarantee optimality, but is able to find the optimal solution for 32 instances out of the 34 instances.  ...  This problem concerns determining a tour and its departure time at the depot that maximizes the collected profit minus the total travel cost (measured by total travel time).  ...  Acknowledgments The authors gratefully acknowledge funds provided by China Scholarship Council (CSC) under Grant No. 201206160092 .  ... 
doi:10.1016/j.ejor.2017.07.004 fatcat:wkttz6wokjfynpksoczdpuxsmi

A Preliminary Study on Minimum Spanning Tree Algorithm Approach for Travelling Salesman Problem

Evans Baidoo
2016 Communications on Applied Electronics  
An implementation of the travelling salesman problem using a modified pure minimum spanning tree algorithm is also presented.  ...  Much attention has be drawn by the Travelling salesman problem lately as it is one of the problem in mathematics and computer science which although is easy to understand but very difficult to solve.  ...  To adapt the MST algorithm to solve the traveling salesman problem, certain assumptions need to be met for this model to work.  ... 
doi:10.5120/cae2016652386 fatcat:6mrnklztd5cunges5oah3ae4e4

The travelling salesman problem: new solvable cases and linkages with the development of approximation algorithms

F Glover, A P Punnen
1997 Journal of the Operational Research Society  
Halin graphs and the travelling salesman problem. Math Program 26: 287-294. Glover F (1992). Ejection chains, reference structures and alternating path methods for the travelling salesman problem.  ...  All rights reserved. 0160-5682/97 $12.00 7 The travelling salesman problem: new solvable cases and linkages with the development of approximation algorithms F Glover!  ... 
doi:10.1038/sj.jors.2600392 fatcat:zs3hwmhevjb57afyprrh3rlgbm

A Multi-objective Version of the Lin-Kernighan Heuristic for the Traveling Salesman Problem

Emerson Bezerra De Carvalho, Elizabeth Ferreira Gouvêa Goldbarg, Marco Cesar Goldbarg
2018 Revista de Informática Teórica e Aplicada  
The Lin and Kernighan's algorithm for the single objective Traveling Salesman Problem (TSP) is one of the most efficient heuristics for the symmetric case.  ...  Works that applied the Lin and Kernighan's algorithm for the MTSP were driven to weighted sum versions of the problem. We investigate the LK from a Pareto dominance perspective.  ...  e Tecnológico, Brazil, under grants 308062/2014-0 and 302387/2016-1.  ... 
doi:10.22456/2175-2745.76452 fatcat:lnkaaax5lra6vjiab3ehqeds5m

The travelling salesman problem: new solvable cases and linkages with the development of approximation algorithms

F Glover, A P Punnen
1997 Journal of the Operational Research Society  
Halin graphs and the travelling salesman problem. Math Program 26: 287-294. Glover F (1992). Ejection chains, reference structures and alternating path methods for the travelling salesman problem.  ...  All rights reserved. 0160-5682/97 $12.00 7 The travelling salesman problem: new solvable cases and linkages with the development of approximation algorithms F Glover!  ... 
doi:10.1057/palgrave.jors.2600392 fatcat:nax3kr6o5rdybbj3dbyhrs27gm
« Previous Showing results 1 — 15 out of 5,254 results