47 citations · 163 across the 17 of their papers we have counts for
21 papers
Accelerated Benders decomposition for bi-objective mixed integer programming
Duleabom An, Chungmok Lee, Sophie N. Parragh
We investigate bi-objective mixed integer programming to which Benders decomposition can be applied, a widely used technique for exploiting problem structures in real-world applica…
The Bi-objective Electric Autonomous Dial-a-Ride Problem
Yue Su, Sophie N. Parragh, Nicolas Dupin +1
The electric autonomous dial-a-ride problem (E-ADARP) introduces electric, autonomously driving vehicles and their unique requirements into the classic dial-a-ride problem, where p…
An exact approach for the multi-depot electric vehicle scheduling problem
Xenia Haslinger, Elisabeth Gaar, Sophie N. Parragh
The "avoid - shift - improve" framework and the European Clean Vehicles Directive set the path for improving the efficiency and ultimately decarbonizing the transport sector. While…
Progressive hedging for multi-stage stochastic lot sizing problems with setup carry-over under uncertain demand
Manuel Schlenkrich, Jean-François Cordeau, Sophie N. Parragh
We investigate multi-stage demand uncertainty for the multi-item multi-echelon capacitated lot sizing problem with setup carry-over. Considering a multi-stage decision framework he…
Enhancing Rolling Horizon Production Planning Through Stochastic Optimization Evaluated by Means of Simulation
Manuel Schlenkrich, Wolfgang Seiringer, Klaus Altendorfer +1
Production planning must account for uncertainty in a production system, arising from fluctuating demand forecasts and execution-level friction. This article integrates scenario-ba…
Adaptive Improvements of Multi-Objective Branch and Bound
Julius Bauß, Sophie N. Parragh, Michael Stiglmayr
Branch and bound methods which are based on the principle "divide and conquer" are a well established solution approach in single-objective integer programming. In multi-objective…
Bi-objective risk-averse facility location using a subset-based representation of the conditional value-at-risk
Najmesadat Nazemi, Sophie N. Parragh, Walter J. Gutjahr
For many real-world decision-making problems subject to uncertainty, it may be essential to deal with multiple and often conflicting objectives while taking the decision-makers' ri…
Adaptive large neighborhood search for a personnel task scheduling problem with task selection and parallel task assignments
Martin Gutjahr, Sophie N. Parragh, Fabien Tricoire
Motivated by a real-world application, we model and solve a complex staff scheduling problem. Tasks are to be assigned to workers for supervision. Multiple tasks can be covered in…
Enhancing Branch-and-Bound for Multi-Objective 0-1 Programming
Nicolas Forget, Sophie N. Parragh
In the bi-objective branch-and-bound literature, a key ingredient is objective branching, i.e. to create smaller and disjoint sub-problems in the objective space, obtained from the…
A Branch-and-Price Algorithm for the Electric Autonomous Dial-A-Ride Problem
Yue Su, Nicolas Dupin, Sophie N. Parragh +1
The Electric Autonomous Dial-A-Ride Problem (E-ADARP) consists in scheduling a fleet of electric autonomous vehicles to provide ride-sharing services for customers that specify the…
A matheuristic for tri-objective binary integer programming
Duleabom An, Sophie N. Parragh, Markus Sinnl +1
Many real-world optimisation problems involve multiple objectives. When considered concurrently, they give rise to a set of optimal trade-off solutions, also known as efficient sol…
An outer approximation algorithm for multi-objective mixed-integer linear and non-linear programming
Fritz Bökler, Sophie N. Parragh, Markus Sinnl +1
In this paper, we present the first outer approximation algorithm for multi-objective mixed-integer linear programming problems with any number of objectives. The algorithm also wo…
A LP relaxation based matheuristic for multi-objective integer programming
Duleabom An, Sophie N. Parragh, Markus Sinnl +1
Motivated by their success in the single-objective domain, we propose a very simple linear programming-based matheuristic for tri-objective binary integer programming. To tackle th…
The bi-objective multimodal car-sharing problem
Miriam Enzi, Sophie N. Parragh, Jakob Puchinger
The aim of the bi-objective multimodal car-sharing problem (BiO-MMCP) is to determine the optimal mode of transport assignment for trips and to schedule the routes of available car…
Bi-objective facility location under uncertainty with an application in last-mile disaster relief
Najmesadat Nazemi, Sophie N. Parragh, Walter J. Gutjahr
Multiple and usually conflicting objectives subject to data uncertainty are main features in many real-world problems. Consequently, in practice, decision-makers need to understand…
A branch-and-Benders-cut algorithm for a bi-objective stochastic facility location problem
Sophie N. Parragh, Fabien Tricoire, Walter Gutjahr
In many real-world optimization problems, more than one objective plays a role and input parameters are subject to uncertainty. In this paper, motivated by applications in disaster…
Modeling and solving a vehicle-sharing problem considering multiple alternative modes of transport
Miriam Enzi, Sophie N. Parragh, David Pisinger
Motivated by the change in mobility patterns, we present a scheduling approach for a vehicle-sharing problem, considering several alternative modes of transport, from a company vie…
Modeling and solving the multimodal car- and ride-sharing problem
Miriam Enzi, Sophie N. Parragh, David Pisinger +1
We introduce the multimodal car- and ride-sharing problem (MMCRP), in which a pool of cars is used to cover a set of ride requests while uncovered requests are assigned to other mo…
Resource-constrained multi-project scheduling with activity and time flexibility
Viktoria A. Hauder, Andreas Beham, Sebastian Raggl +2
Project scheduling in manufacturing environments often requires flexibility in terms of the selection and the exact length of alternative production activities. Moreover, the simul…
Branch-and-bound for bi-objective integer programming
Sophie N. Parragh, Fabien Tricoire
In bi-objective integer optimization the optimal result corresponds to a set of non-dominated solutions. We propose a generic bi-objective branch-and-bound algorithm that uses a pr…
A Local-Search Based Heuristic for the Unrestricted Block Relocation Problem
Dominique Feillet, Sophie N. Parragh, Fabien Tricoire
The unrestricted block relocation problem is an important optimization problem encountered at terminals, where containers are stored in stacks. It consists in determining the minim…