Sauleh Siddiqui*, Steven A Gabriel and Shapour Azarm Johns Hopkins University, Baltimore, MD, USA; Department of Civil Engineering, Applied Mathematics & Statistics, and Scientific Computation Program, University of Maryland, College Park, MD, USA; and Department of Mechanical Engineering, Applied Mathematics & Statistics, and Scientific Computation Program, University of Maryland, College Park...

In this paper, a strict formulation of a generalization of the classical pick up and delivery problem is presented. Here, we add the flexibility of providing the option for passengers to transfer from one vehicle to another at specific locations. As part of the mathematical formulation, we include transfer nodes where vehicles may interact interchanging passengers. Additional variables to keep ...

The aim of this paper is to demonstrate that CP could be a better candidate than MIP for solving the master problem within a Benders decomposition approach. Our demonstration is based on a case study of a workforce scheduling problem encountered in a large call center of Bouygues Telecom, a French mobile phone operator. Our experiments show that CP can advantageously replace MIP for the impleme...

Benders decomposition has been widely used for solving network design problems. In this paper, we use a branch-and-cut algorithm to improve the separation procedure of Gabrel et al. and Knippel et al. for capacitated network design. We detail experiments on bi-layer networks, comparing with Knippel’s previous results.

We use logic-based Benders decomposition to minimize tardiness in single-facility scheduling problems with many jobs and long time horizons. Release dates and due dates are given. A mixed integer linear programming (MILP) based master problem allocates jobs to segments of the time horizon, and a constraint programming (CP) based subproblem schedules the jobs in each segment.

In this paper, we focus on the capacitated survivable network design problem when the survivability is expressed in terms of rerouting techniques. We propose an approach that permits to achieve optimal solution in reasonable time. Our approach uses both Benders decomposition and a cutting plane approach to reduce the high dimensionality of the problem. Some numerical results are also presented.

Operator-counting is a recently developed framework for analysing and integrating many state-ofthe-art heuristics for planning using Linear Programming. In cost-optimal planning only the objective value of these heuristics is traditionally used to guide the search. However the primal solution, i.e. the operator counts, contains useful information. We exploit this information using a SATbased ap...

Active distribution networks characterized by high flexibility and controllability are an important development mode of future smart grids to be interconnected with large scale distributed generation sources including intermittent energies. However, the uncertainty of intermittent energy and the diversity of controllable devices make the optimal operation of distribution network a challenging i...

The available transfer capability (ATC) is an important index indicating the remaining transfer capability in the physical transmission network for further commercial activity above existing commitments, In this paper, ATC mathematical model considering post-contingency generation rescheduling and load curtailment is first formulated. Benders decomposition method is then used to partition the A...

This paper addresses the solution of a two-stage stochastic programming model for a supply chain investment planning problem applied to the petroleum products supply chain. In this context, we present the development of acceleration techniques for the stochastic Benders decomposition that aim to strengthen the cuts generated, as well as to improve the quality of the solutions obtained during th...