Buscar
Mostrando ítems 21-30 de 413
A relax and cut approach using the multi-commodity flow formulation for the traveling salesman problem
(Universidad Nacional de Colombia (Sede Medellín). Facultad de Minas., 2015-05-01)
In this paper we explore the multi-commodity flow formulation for the Asymmetric Traveling Salesman Problem (ATSP) to obtain dual bounds. The procedure employed is a variant of a relax and cut procedure proposed in the ...
An architecture for solving sequencing and resource allocation problems using approximation methods
(STOCKTON PRESS, 1998)
In the search for better optimisation techniques, new methods that mix artificial intelligence and operations research have emerged. Search heuristics are integrated with optimisation algorithms. Approximation methods, ...
Using global search heuristics for the capacity vehicle routing problem
(PERGAMON-ELSEVIER SCIENCE LTD, 1998)
In this work, a Frame is posed which allows to define global search heuristics in an efficient and declarative way, which interacts with a specific computational implementation of a problem. An overview of different ways ...
Algoritmo híbrido para o problema do caixeiro viajante dinâmico: otimização por colônia de formigas + buscas locais
(Universidade Federal de Santa MariaBrasilCiência da ComputaçãoUFSMPrograma de Pós-Graduação em Ciência da ComputaçãoCentro de Tecnologia, 2018-03-09)
The present work deals with the resolution of the Dynamic Traveling Salesman Problem (DTSP), it has a great relevance within the literature, being able to be applied to real problems as problems of logistics and ...
Aplicação do travelling salesman problem na roteirização das viaturas da Marinha do Brasil: uma abordagem da teoria dos grafosApplication of the travelling salesman problem in the routes of the Brazilian Navy vehicles: an approach to the theory of graphs
(Departamento de Engenharia de Produção - Universidade Federal de SergipeDEPRO/UFS, 2018)
The bi-objective insular traveling salesman problem with maritime and ground transportation costs
(2018)
This paper introduces and studies the bi-objective insular traveling salesman problem, where a set of rural islands must be served using a single barge following a single route. Each island presents a number of docks from ...
Optimizing leaf sweeping and collection in the Argentine city of Trenque Lauquen
(Sage, 2020)
A solution strategy based on integer linear programming models has been developed for leaf sweeping operations in the Argentine city of Trenque Lauquen. The aim is to achieve efficiency in the assignment of sweepers to ...