#### Filter Results:

- Full text PDF available (54)

#### Publication Year

1997

2018

- This year (4)
- Last 5 years (35)
- Last 10 years (57)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

The maximum diversity problem (MDP) consists of identifying optimally diverse subsets of elements from some larger collection. The selection of elements is based on the diversity of their characteristics, calculated by a function applied on their attributes. This problem belongs to the class of NP-hard problems. This paper presents new GRASP heuristics for… (More)

- Anand Subramanian, Lúcia Maria de A. Drummond, Cristiana Bentes, Luiz Satoru Ochi, Ricardo C. Farias
- Computers & OR
- 2010

This paper presents a parallel approach for solving the Vehicle Routing Problem with Simultaneous Pickup and Delivery (VRPSPD). The parallel algorithm is embedded with a multi-start heuristic which consists of a variable neighborhood descent procedure, with a random neighborhood ordering (RVND), integrated in an iterated local search (ILS) framework. The… (More)

- Puca Huachi Vaz Penna, Anand Subramanian, Luiz Satoru Ochi
- J. Heuristics
- 2013

This paper deals with the Heterogeneous Fleet Vehicle Routing Problem (HFVRP). The HFVRP is N P-hard since it is a generalization of the classical Vehicle Routing Problem (VRP), in which clients are served by a heterogeneous fleet of vehicles with distinct capacities and costs. The objective is to design a set of routes in such a way that the sum of the… (More)

- Luiz Satoru Ochi, Dalessandro Soares Vianna, Lúcia Maria de A. Drummond, André O. Victor
- IPPS/SPDP Workshops
- 1998

Nowadays genetic algorithms stand as a trend to solve NPcomplete and NP-hard problems. In this paper, we present a new hybrid metaheuristic which uses Parallel Genetic Algorithms and Scatter Search coupled with a decomposition-into-petals procedure for solving a class of Vehicle Routing and Scheduling Problems. The parallel genetic algorithm presented is… (More)

- Haroldo G. Santos, Luiz Satoru Ochi, Marcone J. F. Souza
- ACM Journal of Experimental Algorithmics
- 2005

The Class/Teacher Timetabling Problem (CTTP) deals with the weekly scheduling of encounters between teachers and classes of an educational institution. Since CTTP is a NP-hard problem for nearly all of its variants, the use of heuristic methods for its resolution is justified. This paper presents an efficient Tabu Search (TS) heuristic with two different… (More)

- Haroldo G. Santos, Luiz Satoru Ochi, E. H. Marinho, Lúcia Maria de A. Drummond
- Neurocomputing
- 2006

The aim of this work is to present some alternatives to improve the performance of an Evolutionary Algorithm applied to the problem known as the Oil Collecting Vehicle Routing Problem. Some proposals based on the insertion of Local Search and Data Mining modules in a Genetic Algorithm (GA) are presented. Four algorithms were developed: a Genetic Algorithm,… (More)

- Anand Subramanian, Puca Huachi Vaz Penna, Eduardo Uchoa, Luiz Satoru Ochi
- European Journal of Operational Research
- 2012

This paper deals with the Heterogeneous Fleet Vehicle Routing Problem (HFVRP). The HFVRP generalizes the classical Capacitated Vehicle Routing Problem by considering the existence of different vehicle types, with distinct capacities and costs. The objective is to determine the best fleet composition as well as the set of routes that minimize the total… (More)

- Lúcia Maria de A. Drummond, Luiz Satoru Ochi, Dalessandro Soares Vianna
- Future Generation Comp. Syst.
- 2001

This paper presents an asynchronous parallel metaheuristic for the period vehicle routing problem (PVRP). The PVRP generalizes the classical vehicle routing problem by extending the planning period from a single day to M days. The algorithm proposed is based on concepts used in parallel genetic algorithms and local search heuristics. The algorithm employs… (More)

- Marcos Melo Silva, Anand Subramanian, Thibaut Vidal, Luiz Satoru Ochi
- European Journal of Operational Research
- 2012

The Minimum Latency Problem (MLP) is a variant of the Traveling Salesman Problem which aims to minimize the sum of arrival times at vertices. The problem arises in a number of practical applications such as logistics for relief supply, scheduling and data retrieval in computer networks. This paper introduces a simple metaheuristic for the MLP, based on a… (More)