Buscar
Mostrando ítems 41-50 de 296
Lagrangian decomposition methods for large-scale fixed-charge capacitated multicommodity network design problem
(Universidade Federal de Minas GeraisBrasilENG - DEPARTAMENTO DE ENGENHARIA PRODUÇÃOPrograma de Pós-Graduação em Engenharia de ProduçãoUFMG, 2020-09-22)
Tipicamente presente nas áreas de logística e telecomunicações, o problema de síntese de redes multi-fluxo de custo fixo e capacitada permanece desafiador, especialmente quando contextos de grande escala estão envolvidos. ...
An integer programming approach for the time-dependent traveling salesman problem with time windows
(Pergamon-Elsevier Science Ltd, 2017-12)
Congestion in large cities and populated areas is one of the major challenges in urban logistics, andshould be addressed at different planning and operational levels. The Time Dependent Travelling Sales-man Problem (TDTSP) ...
The pickup and delivery problem with transfers: Formulation and a branch-and-cut solution method
(ELSEVIER, 2010)
In this paper, a strict formulation of a generalization of the classical pickup and delivery problem is presented.
Here, we add the flexibility of providing the option for passengers to transfer from one vehicle to
another ...
Problema de coloreo de Grafos : un estudio poliedral y un algoritmo Branch-and-Cut
(Facultad de Ciencias Exactas y Naturales. Universidad de Buenos Aires, 2003)
A BRANCH AND CUT ALGORITHM FOR SHEDULING THE HIGHLY-CONSTRAINED CHILEAN SOCCER TOURNAMENT
(SPRINGER, 2007)
The qualifying phase of the Chilean soccer championship follows the structure of a compact single round robin tournament. Good schedules are of major importance for the success of the tournament, making them more balanced, ...
A Branch-and-cut Algorithm For A Class Of Sum-of-ratios Problems
(ELSEVIER SCIENCE INCNEW YORK, 2015)
Formulações e algoritmos em programação inteira para o problema do caixeiro viajante com coleta e entrega sobre carregamento lifo
(Universidade Federal de Minas GeraisUFMG, 2014-05-22)
This dissertation addresses the Pickup and Delivery Travelling Salesman Problem withMultiple Stacks and algorithmic approaches to obtain its exact solution. In this problem,a single vehicle must serve a set of customer ...
Métodos híbridos para o problema de roteamento de veículos com janelas de tempo e múltiplos entregadores
(Universidade Federal de São CarlosUFSCarPrograma de Pós-Graduação em Engenharia de Produção - PPGEPCâmpus São Carlos, 2016-02-29)
In this dissertation we address the vehicle routing problem with time windows and multiple deliverymen, a variant of the vehicle routing problem that involves the additional decision of the crew size definition of the ...