Advanced search
Start date

Algorithms for the location-routing with loading constraints problem

Grant number: 13/08278-8
Support Opportunities:Scholarships in Brazil - Post-Doctoral
Effective date (Start): September 01, 2013
Effective date (End): February 28, 2014
Field of knowledge:Physical Sciences and Mathematics - Computer Science - Theory of Computation
Principal Investigator:Flávio Keidi Miyazawa
Grantee:Thiago Alves de Queiroz
Host Institution: Instituto de Computação (IC). Universidade Estadual de Campinas (UNICAMP). Campinas , SP, Brazil


This research defines and investigates a new integrated problem which involves location of facilities and vehicle routing with loading constraints. The specialized literature has been considered only the integrated location-routing problem, or the vehicle routing with loading constraints problem. Now, we deals with a logistic problem which considers simultaneous decisions for three NP-hard problems: facility location, vehicle routing and packing of items (into the cargo vehicle). The objective is propose exact and heuristic algorithms for this new integrated problem, which better approximates real-life situations in logistic area: to determine where locate potential facilities for which routes for vehicles may be defined to visit customers which items must be packed into the vehicles, all of this with minimum location and routing costs. Several numerical experiments on generic and real-world instances will be carried out in order to validate the algorithms, as well as the publication of papers in journals and conferences with the main results. (AU)

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

Scientific publications
(References retrieved automatically from Web of Science and SciELO through information on FAPESP grants and their corresponding numbers as mentioned in the publications by the authors)
DE QUEIROZ, THIAGO ALVES; MIYAZAWA, FLAVIO KEIDI; WAKABAYASHI, YOSHIKO. On the L-approach for generating unconstrained two-dimensional non-guillotine cutting patterns. 4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH, v. 13, n. 2, p. 199-219, . (13/08278-8, 13/03447-6)

Please report errors in scientific publications list using this form.