Buscar
Mostrando ítems 141-150 de 377
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 ...
Hybrid fuzzy predictive control based on genetic algorithms for the temperature control of a batch reactor
(PERGAMON-ELSEVIER SCIENCE LTD, 2008-12-22)
In this paper we describe the design of hybrid fuzzy predictive control based on a genetic algorithm (GA). We also present a simulation test of the proposed algorithm and a comparison with two hybrid predictive control ...
Some heuristic algorithms for total tardiness minimization in a flowshop with blocking
(PERGAMON-ELSEVIER SCIENCE LTD, 2009)
The flowshop scheduling problem with blocking in-process is addressed in this paper. In this environment, there are no buffers between successive machines: therefore intermediate queues of jobs waiting in the system for ...
Global optimization approach for the H2-norm model reduction problem
(1999-12-01)
A branch and bound algorithm is proposed to solve the H2-norm model reduction problem for continuous-time linear systems, with conditions assuring convergence to the global optimum in finite time. The lower and upper bounds ...
Global optimization approach for the H2-norm model reduction problem
(1999-12-01)
A branch and bound algorithm is proposed to solve the H2-norm model reduction problem for continuous-time linear systems, with conditions assuring convergence to the global optimum in finite time. The lower and upper bounds ...
Formulations and algorithms to design communication networks
(Universidade Federal de Minas GeraisUFMG, 2012-05-11)
The study of networks has roots in graph theory dating back to 1730s. From then on, networks have been used to model and simulate interactions among elements of intricate systems, such as transportation, communication and ...
Formulações e algoritmos baseados em programação linear inteira para o problema quadrático da árvore geradora mínima = Formulations and algorithms based on linear integer programming for the quadratic minimum spanning tree problem.
(Universidade Federal de Minas GeraisUFMG, 2014-03-26)
This work adresses the Vehicle Routing Problem with Simultaneous Pickup and Delivery,where routes must be devised to fulfil the pickup and delivery requests of a setof customers. Each customer must be served by only one ...
Applications of integer Programming and decomposition to Scheduling Problems: the Strategic Mine Planning Problem and the Bin Packing Problem with Time Lag
(2020)
In scheduling problems, the goal is to assign time slots to a set of activities. In these problems, there are typically precedence constraints between
activities that dictate the order in which they can be carried out and ...
Period Decompositions for the Capacitated Lot Sizing Problem with Setup Times
(Informs, 2015-06-01)
We study the multi-item capacitated lot sizing problem with setup times. Based on two strong reformulations of the problem, we present a transformed reformulation and valid inequalities that speed up column generation and ...