Papers by Marco Cesar Goldbarg
Revista Brasileira de Estudos Pedagógicos, Jun 18, 2019
Programação Linear e Fluxos em Redes, 2015
Programação Linear e Fluxos em Redes, 2015
Pesquisa Operacional, 2008
Técnicas de Inteligência Computacional com Aplicações em Problemas Inversos de Engenharia, 2014
Anais do 22 o …, 2004
Page 1. Comparando Algoritmos Genéticos e Transgenéticos para Otimizar a Configuração de um Servi... more Page 1. Comparando Algoritmos Genéticos e Transgenéticos para Otimizar a Configuração de um Serviço de Distribuição de Vídeo Baseado em Replicação Móvel Luiz EC Leite1 lecl@cin.ufpe.br Guido Souza Filho2 guido@di.ufpb.br Marco Goldbarg3 gold@dimap.ufrn.br ...
Brazilian Journal of Development, 2019
Neste artigo apresentamos uma análise sobre o Problema do Caixeiro Viajante Alugador com Passagei... more Neste artigo apresentamos uma análise sobre o Problema do Caixeiro Viajante Alugador com Passageiros (CaRSP) e seus subproblemas. O CaRSP é uma variante do clássico Problema do Caixeiro Viajante (PCV) que leva em consideração duas tendências atuais no sistema de transportes: o aluguel e o compartilhamento de veículos. A variante do PCV que trabalha com
This study addresses a new variant of the Quota Traveling Salesman Problem in which the salesman ... more This study addresses a new variant of the Quota Traveling Salesman Problem in which the salesman is thought to be a driver of a vehicle and can share travel costs with passengers in his car. The vehicle has limited capacity. The salesman can choose to collect or not the bonus of a visited vertex. The bonus collection requires that some time is spent on the vertex. There is a ride request associated with each person who demands a ride. The ride request consists of pickup and drop-off location, maximum travel duration, and budget limit. A travel request can be accepted if the origin and destination points agree with the direction of the salesman's route, and the car capacity is not exceeded. This study presents a mathematical formulation for the Quota Traveling Salesman Problem with Passengers and Collection Time problem and the first exact and heuristic results. We present a Greedy Randomized Adaptive Search Procedure hybridized with Variable Neighborhood Search and the results of a computational experiment with 90 instances up to 200 vertices.
Computers & Operations Research, Sep 1, 2021
Institution of Engineering and Technology eBooks, Sep 29, 2018
Hybridisation of metaheuristics is an important subject that has been explored by several researc... more Hybridisation of metaheuristics is an important subject that has been explored by several researchers. Multiagent systems have been important tools to accomplish the task of hybridising metaheuristics. In those multiagent approaches, however, each metaheuristic is performed separately, and the potential of the hybridisation is not fully explored. In order to bridge this gap, this chapter presents MAHM (multiagent architecture for hybridisation of metaheuristics), a multiagent approach for metaheuristics hybridisation inspired on particle swarm optimisation (PSO). Introduced as a metaheuristic, PSO can be viewed as a multiagent system once particles can be thought as agents that interact and work together to achieve specific goals. In this context, particles are identified to autonomous virtual entities with social ability, reactivity, and pro-activeness. Each agent in MAHM may use different sets of predefined metaheuristics in different moments of the search to look for high-quality solutions of an optimisation problem. Thus, several elements of different metaheuristics can be found running in the swarm every MAHM iteration. In order to show the potentiality of the proposed architecture, computational experiments were carried out with the travelling salesman problem and the quadratic assignment problem, two important test grounds for algorithmic ideas.
Neste artigo apresentamos uma analise sobre o Problema do Caixeiro Viajante Eletrico com Passagei... more Neste artigo apresentamos uma analise sobre o Problema do Caixeiro Viajante Eletrico com Passageiros - PCVEP. O problema e uma variante do classico Problema do Caixeiro Viajante (PCV), que considera elementos de compartilhamento solidario de assentos em veiculos, alem do advento do veiculo utilizado pelo caixeiro ser unicamente eletrico, sendo ambas as questoes atuais, importantes e bastante discutidas nas areas de pesquisa operacional e otimizacao combinatoria. No PCVEP, alem de se determinar a menor rota mediante um conjunto de cidades como no PCV, os custos de deslocamento do motorista sao reduzidos atraves do rateio das despesas, ou seja, mediante o compartilhamento de assentos com os passageiros por meio de ridesharing. Alem disso, o PCVEP deve considerar uma autonomia linear a capacidade de deslocamento, incluindo uma restricao de recarga da autonomia antes do recarregamento. Este trabalho apresenta a descricao, o estado da arte, os algoritmos propostos e os experimentos computacionais. O banco de instancias e composto por 69 problemas, sendo 55 randomicas e 14 advindas da TSPLIB e adaptadas ao PCVEP. Os resultados obtidos sao analisados e as conclusoes acerca do desempenho sao expostas.,
Uploads
Papers by Marco Cesar Goldbarg