Results 91 to 100 of about 4,732 (227)
Zero-one IP problems: Polyhedral descriptions & cutting plane procedures
, 1994 A systematic way for tightening an IP formulation is by employing classes of linear inequalities that define facets of the convex hull of the feasible integer points of the respective problems.
Mitra, G, Yarrow, L, Abdul-Hamid, F
core
Problema do caixeiro viajante: um algoritmo para resolução de problemas de grande porte baseado em busca local dirigida [PDF]
, 2000 Dissertação (Mestrado) - Universidade Federal de Santa Catarina, Centro Tecnológico.Neste trabalho é proposto um algoritmo para a resolução do Problema do Caixeiro Viajante (PCV), baseado em estratégia de particionamento, que atua em conjunto com a recém
Rodrigues, Marco Antonio Pereira
core
IEEE AccessFirefly Algorithm (FA) mimics the flashing light characteristic of fireflies to solve optimization problems. An area where its utilization is limited is Travelling Salesman Problem (TSP).
Ravneil Nand +2 more
doaj +1 more source
MAPSOFT: A Multi-Agent based Particle Swarm Optimization Framework for Travelling Salesman Problem
Journal of Intelligent Systems, 2020 This paper proposes a Multi-Agent based Particle Swarm Optimization (PSO) Framework for the Traveling salesman problem (MAPSOFT). The framework is a deployment of the recently proposed intelligent multi-agent based PSO model by the authors.
Blamah Nachamada Vachaku +3 more
doaj +1 more source
A DISTRIBUTED APPROACH TO ANT COLONY OPTIMIZATION [PDF]
Swarm Intelligence(SI) is the emergent collective intelligence of groups of simple agents. Economy is an example of SI. Simulating an economy using Ant Colony algorithms would allow prediction and control of fluctuations in the complex emergent behavior ...
Eng. Sorin Ilie Ph. D Student +1 more
core
A new Lagrangean Approach for the Travelling Salesman Problem [PDF]
, 2015 In this paper, we use a reformulation of the symmetric and the asymmetric travelling salesman problem more suitable for Lagrangean relaxation and analyse the new approach on examples from TSP Lib.
Jörnsten, Kurt, Kalcsics, Jörg
core
Different approaches to Travelling Salesman Problem [PDF]
, 2022 Treballs Finals de Grau de Matemàtiques, Facultat de Matemàtiques, Universitat de Barcelona, Any: 2022, Director: Eloi Sans Gispert[en] This thesis is a comparison of some to solve the Travelling Salesman Problem.
Nogales Giné, Roger
core
An iterative solution for the travelling salesman problem
, 2006 The travelling salesman problem (TSP) is a typical NP-hard problem. In this paper, a well implied enumeration method for TSP is presented where the solution of the TSP is obtained by an iterative process.
Nie YY(聂义勇), Su LJ(苏丽杰)
core
, 2016 Travelling Salesman Problem (TSP) is one of the most researched combinatorial problems in mathematics. This chapter incorporates chaotic maps in evolutionary algorithms as random number generators and applies it to the TSP.
Zelinka, Ivan +3 more
core
The Travelling Salesman Problem and Related Problems [PDF]
, 1978 New formulations are presented for the Travelling Salesman problem, and their relationship to previous formulations is investigated. The new formulations are extended to include a variety of transportation scheduling problems, such as the Multi ...
Graves, Stephen C., Gavish, Bezalel
core