Search
Now showing items 1-9 of 9
Formulations and branch-and-cut algorithms for the generalized vehicle routing problem
(Informs, 2011-08)
The generalized vehicle routing problem (GVRP) consists of finding a set of routes for a number of capacitated vehicles on a graph where the vertices are partitioned into clusters with given demands, such that the total ...
Bounding strategies for the hybrid flow shop scheduling problem
(Elsevier, 2011-07-01)
In this paper, we investigate new lower and upper bounds for the multiple-center hybrid flow shop scheduling problem. We propose a family of center-based lower bounds as well as a destructive lower bound that is based on ...
Solving two-stage hybrid flow shop using climbing depth-bounded discrepancy search
(Elsevier, 2011-03)
This paper investigates how to adapt a discrepancy-based search method to solve two-stage hybrid flowshop scheduling problems in which each stage consists of several identical machines operating in parallel. The objective ...
Relaxations and exact solution of the variable sized bin packing problem
(Springer Science+Business Media, 2011-03)
We address a generalization of the classical one-dimensional bin packing problem with unequal bin sizes and costs. We investigate lower bounds for this problem as well as exact algorithms. The main contribution of this ...
Two classes of quadratic assignment problems that are solvable as linear assignment problems
(Elsevier, 2011-08)
The Quadratic Assignment Problem is one of the hardest combinatorial optimization problems known. We present two new classes of instances of the Quadratic Assignment Problem that can be reduced to the Linear Assignment ...
Lane-exchange mechanisms for truckload carrier collaboration
(Informs, 2011-02)
Because of historically high fuel prices, the trucking industry's operating expenses are higher than ever and thus profit margins are lower than ever. To cut costs, the trucking industry is searching for and exploring new ...
Exact approaches for integrated aircraft fleeting and routing at TunisAir
(Science+Business Media, 2011-06)
We describe models and exact solutions approaches for an integrated aircraft fleeting and routing problem arising at TunisAir. Given a schedule of flights to be flown, the problem consists of determining a minimum cost ...
Exact methods for the robotic cell problem
(Springer Science+Business Media, 2011-06)
This paper investigates an exact method for the Robotic Cell Problem. We present a branch-and-bound algorithm which is the first exact procedure specifically designed with regard to this complex flow shop scheduling variant. ...
Flexible aircraft fleeting and routing at TunisAir
(Palgrave Macmillan, 2011-02)
This paper addresses a Flexible Aircraft Fleeting and Routing Problem, which is motivated by the Tunisian national carrier TunisAir. A solution to this problem specifies the departure time of each flight, the subset of ...
Share this page