Marcio Mine - Academia.edu (original) (raw)
Papers by Marcio Mine
Learning and Nonlinear Models, 2010
Resumo -Este artigo propõe um algoritmo evolutivo híbrido para obter soluções aproximadas para o ... more Resumo -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 instâncias mostram a eficiência e a robustez da heurística proposta.
This work addresses the Vehicle Routing Problem with Simultaneous Pickup and Delivery (VRPSPD). W... more 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 Insertion, Cheapest Insertion with multiple routes, GENIUS, Iterated Local Search (ILS), Variable Neighborhood Descent (VND), Tabu Search (TS) and Path Relinking (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 reduce 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.
This work addresses the Vehicle Routing Problem with Simultaneous Pickup and Delivery (VRPSPD). D... more 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 GENILS-TS. This algorithm combines six heuristic procedures Cheapest Insertion, Cheapest Insertion with multiple routes, GENIUS, Iterated Local Search (ILS), Variable Neighborhood Descent (VND) and Tabu Search (TS). The first three procedures aim to obtain an initial solution, and the VND and TS are used as local search methods for ILS. TS is called after some iterations without success by VND. The algorithm was tested on benchmark instances taken from the literature and it was able to generate good quality solutions.
TRANSPORTES, 2010
O Problema de Roteamento de Veículos (PRV), conhecido na literatura como Vehicle Routing Problem ... more O Problema de Roteamento de Veículos (PRV), conhecido na literatura como Vehicle Routing Problem (VRP), foi originalmente proposto por Dantzig e Ramser (1959) e pode ser definido da seguinte forma: dado um conjunto N de clientes, cada qual com uma demanda d i e uma frota de veículos homogênea com capacidade Q, tem-se como objetivo estabelecer os trajetos de custo mínimo a serem percorridos pelos veículos, de forma a atender completamente a demanda dos clientes.
engopt.org
This work deals with the One Dimensional Cutting Stock Problem, in which a demand of a set of sma... more This work deals with the One Dimensional Cutting Stock Problem, in which a demand of a set of small pieces named items, gotten from large pieces named objects, has to be produced. It is desirable that the cutting layouts have a small waste or the remaining piece must be big enough to be reused in the future. This is an important problem, since even small improvements in the cutting layouts result in large savings of raw material and energy when the amount of produced material is huge. The Cutting Stock Problem is NPhard, so a heuristic combining the Modified First Fit Decreasing (FFD) method, an Integer Programming (IP) model and a Data Mining (DM) module is proposed to solve it. The FFD heuristic is used to produce an upper bound. With this upper bound the IP model becomes able to be solved more quickly. Then, the DM module is proposed to extract common parts from the best current solutions obtained from several iterations of the IP model. Finally the extracted common parts are used to guide the search for better solutions in less computational time. Computational results have shown that the proposed method is able to generate good quality and competitive solutions when compared to the ones presented in the related literature.
International Journal of Logistics Systems and Management, 2011
This work deals with the Vehicle Routing Problem with Simultaneous Pickup and Delivery (VRPSPD). ... more This work deals with the Vehicle Routing Problem with Simultaneous Pickup and Delivery (VRPSPD). The VRPSPD is a common problem in the area of reverse logistics, which aims to plan the transportation of products to customers, as well as the return of leavings or products used by them for recycling or to special depots. The VRPSPD is NP-hard, since it can be reduced to the classical Vehicle Routing Problem (VRP) when no client needs the pickup service. To solve it, we propose a hybrid heuristic algorithm, called GENILS, based on Iterated Local Search (ILS), Variable Neighbourhood Descent and GENIUS. The proposed algorithm was tested on three well-known sets of instances found in literature and it was competitive with the best existing approaches. Among the 72 test-problems of these sets, the GENILS was capable to improve the result of nine instances and to equal another 49.
Learning and Nonlinear Models, 2010
Resumo -Este artigo propõe um algoritmo evolutivo híbrido para obter soluções aproximadas para o ... more Resumo -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 instâncias mostram a eficiência e a robustez da heurística proposta.
This work addresses the Vehicle Routing Problem with Simultaneous Pickup and Delivery (VRPSPD). W... more 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 Insertion, Cheapest Insertion with multiple routes, GENIUS, Iterated Local Search (ILS), Variable Neighborhood Descent (VND), Tabu Search (TS) and Path Relinking (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 reduce 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.
This work addresses the Vehicle Routing Problem with Simultaneous Pickup and Delivery (VRPSPD). D... more 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 GENILS-TS. This algorithm combines six heuristic procedures Cheapest Insertion, Cheapest Insertion with multiple routes, GENIUS, Iterated Local Search (ILS), Variable Neighborhood Descent (VND) and Tabu Search (TS). The first three procedures aim to obtain an initial solution, and the VND and TS are used as local search methods for ILS. TS is called after some iterations without success by VND. The algorithm was tested on benchmark instances taken from the literature and it was able to generate good quality solutions.
TRANSPORTES, 2010
O Problema de Roteamento de Veículos (PRV), conhecido na literatura como Vehicle Routing Problem ... more O Problema de Roteamento de Veículos (PRV), conhecido na literatura como Vehicle Routing Problem (VRP), foi originalmente proposto por Dantzig e Ramser (1959) e pode ser definido da seguinte forma: dado um conjunto N de clientes, cada qual com uma demanda d i e uma frota de veículos homogênea com capacidade Q, tem-se como objetivo estabelecer os trajetos de custo mínimo a serem percorridos pelos veículos, de forma a atender completamente a demanda dos clientes.
engopt.org
This work deals with the One Dimensional Cutting Stock Problem, in which a demand of a set of sma... more This work deals with the One Dimensional Cutting Stock Problem, in which a demand of a set of small pieces named items, gotten from large pieces named objects, has to be produced. It is desirable that the cutting layouts have a small waste or the remaining piece must be big enough to be reused in the future. This is an important problem, since even small improvements in the cutting layouts result in large savings of raw material and energy when the amount of produced material is huge. The Cutting Stock Problem is NPhard, so a heuristic combining the Modified First Fit Decreasing (FFD) method, an Integer Programming (IP) model and a Data Mining (DM) module is proposed to solve it. The FFD heuristic is used to produce an upper bound. With this upper bound the IP model becomes able to be solved more quickly. Then, the DM module is proposed to extract common parts from the best current solutions obtained from several iterations of the IP model. Finally the extracted common parts are used to guide the search for better solutions in less computational time. Computational results have shown that the proposed method is able to generate good quality and competitive solutions when compared to the ones presented in the related literature.
International Journal of Logistics Systems and Management, 2011
This work deals with the Vehicle Routing Problem with Simultaneous Pickup and Delivery (VRPSPD). ... more This work deals with the Vehicle Routing Problem with Simultaneous Pickup and Delivery (VRPSPD). The VRPSPD is a common problem in the area of reverse logistics, which aims to plan the transportation of products to customers, as well as the return of leavings or products used by them for recycling or to special depots. The VRPSPD is NP-hard, since it can be reduced to the classical Vehicle Routing Problem (VRP) when no client needs the pickup service. To solve it, we propose a hybrid heuristic algorithm, called GENILS, based on Iterated Local Search (ILS), Variable Neighbourhood Descent and GENIUS. The proposed algorithm was tested on three well-known sets of instances found in literature and it was competitive with the best existing approaches. Among the 72 test-problems of these sets, the GENILS was capable to improve the result of nine instances and to equal another 49.