Advanced search
Start date
Betweenand

Capacity Vehicle Routing Problem with Time Windows and Pickup and Delivery of three-dimensional itens

Grant number: 09/13270-0
Support type:Scholarships in Brazil - Master
Effective date (Start): March 01, 2010
Effective date (End): October 31, 2011
Field of knowledge:Physical Sciences and Mathematics - Computer Science - Theory of Computation
Principal researcher:Flávio Keidi Miyazawa
Grantee:Pedro Henrique Del Bianco Hokama
Home Institution: Instituto de Computação (IC). Universidade Estadual de Campinas (UNICAMP). Campinas , SP, Brazil

Abstract

In this project, we will investigate vehicle routing problems with time windows constraints and pick up and delivery of boxes. In this problem, a set of vehicles leave a depot and must pick and delivery customers boxes. Each collected box must be packed into a truck container so that the unloading of an item are not blocked by further items.

News published in Agência FAPESP Newsletter about the scholarship:
Articles published in other media outlets (0 total):
More itemsLess items
VEICULO: TITULO (DATA)
VEICULO: TITULO (DATA)

Academic Publications
(References retrieved automatically from State of São Paulo Research Institutions)
HOKAMA, Pedro Henrique Del Bianco. The traveling salesman problem with three-dimensional loading constraints. 2011. Master's Dissertation - Universidade Estadual de Campinas (UNICAMP). Instituto de Computação Campinas, SP.

Please report errors in scientific publications list by writing to: cdi@fapesp.br.