Buscar
Mostrando ítems 1-10 de 12
A new memetic algorithm for the asymmetric traveling salesman problem
(SpringerDordrechtHolanda, 2004)
A Study of Different Subsequence Elimination Strategies for the Soft Drink Production Planning
(Univ Nacional Autonoma Mexico, 2015)
Strategies to model scheduling decisions to plan the soft drink production process
(2012-06-13)
In this paper we present a mixed integer model that integrates lot sizing and lot scheduling decisions for the production planning of a soft drink company. The main contribution of the paper is to present a model that ...
Aplicaçaõ das técnicas Path-relinking e Vocabulary buiding na melhoria de performance do algoritmo memético para o problema do caixeiro viajante assimétrico
(Universidade Federal do Rio Grande do NorteBRUFRNPrograma de Pós-Graduação em Matemática Aplicada e EstatísticaProbabilidade e Estatística; Modelagem Matemática, 2009-07-10)
The present essay shows strategies of improvement in a well succeded evolutionary metaheuristic to solve the Asymmetric Traveling Salesman Problem. Such steps consist in a Memetic Algorithm projected mainly to this problem. ...
Uma análise experimental de abordagens heurísticas aplicadas ao problema do caixeiro viajante
(Universidade Federal do Rio Grande do NorteBRUFRNPrograma de Pós-Graduação em Sistemas e ComputaçãoCiência da Computação, 2006-07-27)
Due to great difficulty of accurate solution of Combinatorial Optimization Problems, some heuristic methods have been developed and during many years, the analysis of performance of these approaches was not carried through ...
O problema do caixeiro viajante com passageiros
(BrasilUFRNPROGRAMA DE PÓS-GRADUAÇÃO EM SISTEMAS E COMPUTAÇÃO, 2017-07-31)
This thesis presents a vehicle seat sharing model in order to reduce travel costs for drivers
and passengers, contributing significantly to the environment and society. The problem
is also described by a linear programming ...
Formulações e abordagens lagrangeanas para problemas de subrotas : aplicações ao caixeiro viajante com coleta de prêmios e ao dimensionamento e seqüenciamento de lotes
(Universidade Federal de Minas GeraisBrasilENG - DEPARTAMENTO DE ENGENHARIA PRODUÇÃOPrograma de Pós-Graduação em Engenharia de ProduçãoUFMG, 2022-02-22)
This paper deals with the Traveling Salesman Problem with Prize Collection – PCTSP,
asymmetric version. It consists of finding a minimum cost route that starts at the root
node r, visits each node i at most once, and ...