Full text
| |
| Author(s): |
Elias Goraieb
Total Authors: 1
|
| Document type: | Master's Dissertation |
| Press: | Campinas, SP. |
| Institution: | Universidade Estadual de Campinas (UNICAMP). Faculdade de Engenharia Elétrica e de Computação |
| Defense date: | 2005-10-14 |
| Examining board members: |
Vinícius Amaral Armentano;
Horacio Hideki Yanasse;
Franklina Maria Bragion de Toledo;
Takaaki Ohishi
|
| Advisor: | Vinícius Amaral Armentano |
| Abstract | |
This work considers the vehicle routing problem with pickup and delivery with the objectives of minimizing the fleet size and the total traveI distance. Each service request is served by a vehicle within time windows imposed by the clients, and involves a pickup origin that precedes a delivery destination. The capacity of the vehicle and the total route duration are limited. A tabu search algorithm is proposed to solve this problem. Several advanced strategies are incorporated in the algorithm, such as neighborhood reduction, search diversification, and path relinking (AU) | |
| FAPESP's process: | 04/05013-4 - Busca tabu aplicada ao problema de roteamento de veiculos com coleta e entrega. |
| Grantee: | Elias Goraieb |
| Support Opportunities: | Scholarships in Brazil - Master |