Browsing by Author "Mine, Marcio Tadayuki"

Now showing 1 - 4 of 4
  • No Thumbnail Available
    Item
    Um algoritmo evolutivo híbrido para o problema de recobrimento de rotas com coletas de premios.
    (2010) Silva, Matheus de Souza Alves; Mine, Marcio Tadayuki; Ochi, Luiz Satoru; Souza, Marcone Jamilson Freitas
    Este artigo propõe um algoritmo evolutivo híbrido para obter soluções aproximadas para o Problema de Recobrimento de Rotas com Coleta de Prêmios (PRRCP). O algoritmo proposto combina estratégias heurísticas baseadas nos procedimentos Busca Local Iterada, Busca em Vizinhança Variável, Reconexão por Caminhos e GENIUS. Resultados computacionais para um conjunto de instancias mostram a eficiência e a robustez da heurística proposta.
  • No Thumbnail Available
    Item
    Genils-TS-CL-PR : um algoritmo heurístico para resolução do problema de roteamento de veículos com coleta e entrega simultânea.
    (2012) Silva, Thaís Cotta Barbosa da; Cruz, Raphael Carlos; Souza, Marcone Jamilson Freitas; Martins, Alexandre Xavier; Coelho, Vitor Nazário; Mine, Marcio Tadayuki
    This work addresses the Vehicle Routing Problem with Simultaneous Pickup and Delivery (VRPSPD). We propose the algorithm GENILS-TS-CL-PR for solving it. This algorithm combines the heuristic procedures Cheapest In- sertion, Cheapest Insertion with multiple routes, GENIUS, Iterated Local Search (ILS), Variable Neighborhood Descent (VND), Tabu Search (TS) and Path Relin king (PR). The first three procedures aim to obtain a good initial solution, and the VND and TS are used as local search methods for ILS. TS is applied after some iterations without any improvement through of the VND. The PR procedure is performed for each ILS iteration and it connects a local optimum with an elite solution generated during the search. The algorithm also uses a strategy to re- duce the number of solutions evaluated in the solution space. It was tested on benchmark instances taken from the literature and it was able to generate high quality solutions.
  • No Thumbnail Available
    Item
    GENVNS-TS-CL-PR: a heuristic approach for solving the vehicle routing problem with simultaneous pickup and delivery.
    (2012) Cruz, Raphael Carlos; Silva, Thaís Cotta Barbosa da; Souza, Marcone Jamilson Freitas; Coelho, Vitor Nazário; Mine, Marcio Tadayuki; Martins, Alexandre Xavier
    This work addresses the Vehicle Routing Problem with Simultaneous Pickup and Delivery (VRPSPD). Due to its complexity, we propose a heuristic algorithm for solving it, so-called GENVNS-TS-CL-PR. This algorithm combines the heuristic procedures Cheapest Insertion, Cheapest Insertion with multiple routes, GENIUS, Variable Neighborhood Search (VNS), Variable Neighborhood Descent (VND), Tabu Search (TS) and Path Relinking (PR). The first three procedures aim to obtain an good initial solution, and the VND and TS are used as local search methods for VNS. TS is called after some iterations without any improvement through of the VND. The PR procedure is called after each VNS iteration and it connects a local optimum with an elite solution generated during the search. The algorithm uses an strategy based on Candidate List to reduce the number of solutions evaluated in the solution space. The algorithm was tested on benchmark instances taken from the literature and it was able to generate high quality solutions.
  • No Thumbnail Available
    Item
    O problema de roteamento de veículos com coleta e entrega simultânea : uma abordagem via Iterated Local Search e GENIUS.
    (2010) Mine, Marcio Tadayuki; Silva, Matheus de Souza Alves; Ochi, Luiz Satoru; Souza, Marcone Jamilson Freitas; Silva, Thaís Cotta Barbosa da
    Este trabalho apresenta o algoritmo GENILS para resolver o Problema de Roteamento de Veículos com Coleta e Entrega Simultânea (PRVCES). GENILS é um algoritmo heurístico baseado nas técnicas heurísticas Iterated Local Search, Variable Neighborhood Descent e adaptações das heurísticas Inserção Mais Barata e GENIUS. O algoritmo proposto foi testado em três conjuntos consagrados de problemas-teste da literatura e se mostrou superior aos demais algoritmos da literatura com relação à capacidade de encontrar as melhores soluções conhecidas.