Search Results - "RØPKE, Stefan"

Formulations and Branch-and-Cut Algorithms for the Generalized Vehicle Routing Problem by BEKTAS, Tolga, ERDOGAN, Güneş, RØPKE, Stefan

“…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…”
Get full text

Branch and Cut and Price for the Pickup and Delivery Problem with Time Windows by Ropke, Stefan, Cordeau, Jean-Francois

“…In the pickup and delivery problem with time windows vehicle routes must be designed to satisfy a set of transportation requests, each involving a pickup and…”
Get full text

Models for the discrete berth allocation problem: A computational comparison by Buhrkal, Katja, Zuglian, Sara, Ropke, Stefan, Larsen, Jesper, Lusby, Richard

“…► We investigate several mixed integer models for the dynamic berth allocation problem. ► The best of the models can solve a large number of previously…”
Get full text

Scheduling technicians and tasks in a telecommunications company by Cordeau, Jean-François, Laporte, Gilbert, Pasin, Federico, Ropke, Stefan

“…This paper proposes a construction heuristic and an adaptive large neighborhood search heuristic for the technician and task scheduling problem arising in a…”
Get full text

A general heuristic for vehicle routing problems by Pisinger, David, Ropke, Stefan

“…We present a unified heuristic which is able to solve five different variants of the vehicle routing problem: the vehicle routing problem with time windows…”
Get full text

An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows by Ropke, Stefan, Pisinger, David

“…The pickup and delivery problem with time windows is the problem of serving a number of transportation requests using a limited amount of vehicles. Each…”
Get full text

A column-generation-based matheuristic for periodic and symmetric train timetabling with integrated passenger routing by Martin-Iradi, Bernardo, Ropke, Stefan

“…•An algorithm based on a novel graph formulation for periodic train timetabling.•Symmetry and frequency aspects of the line are included in the graph.•The…”
Get full text

An adaptive large neighborhood search heuristic for the multi-port continuous berth allocation problem by Martin-Iradi, Bernardo, Pacino, Dario, Ropke, Stefan

“…In this paper, we study a problem that integrates the vessel scheduling problem with the berth allocation into a collaborative problem denoted as the…”
Get full text

An adaptive large neighborhood search metaheuristic for the vehicle routing problem with drones by Sacramento, David, Pisinger, David, Ropke, Stefan

“…•New optimization problem for delivery activities using drones in collaboration with trucks.•Fleet of delivery trucks, each of them equipped with a single…”
Get full text

The Electric Fleet Size and Mix Vehicle Routing Problem with Time Windows and Recharging Stations by Hiermann, Gerhard, Puchinger, Jakob, Ropke, Stefan, Hartl, Richard F.

“…•A new rich heterogeneous electric fleet routing problem is modeled and solved.•A new benchmark set with bounds computed using a branch-and-price solver is…”
Get full text

Improved formulations and an Adaptive Large Neighborhood Search heuristic for the integrated berth allocation and quay crane assignment problem by Iris, Çağatay, Pacino, Dario, Ropke, Stefan

“…•Novel valid inequalities, variable fixing methods and properties for the problem.•Enhancements which improve a range of formulations and solution methods of…”
Get full text

The mobile production vehicle routing problem: Using 3D printing in last mile distribution by Wang, Yu, Ropke, Stefan, Wen, Min, Bergh, Simon

Get full text

A comparison of acceptance criteria for the adaptive large neighbourhood search metaheuristic by Santini, Alberto, Ropke, Stefan, Hvattum, Lars Magnus

“…Adaptive large neighborhood search (ALNS) is a useful framework for solving difficult combinatorial optimisation problems. As a metaheuristic, it consists of…”
Get full text

A Branch-and-Cut Algorithm for the Symmetric Two-Echelon Capacitated Vehicle Routing Problem by Jepsen, Mads, Spoorendonk, Simon, Ropke, Stefan

“…This paper presents an exact method for solving the symmetric two-echelon capacitated vehicle routing problem, a transportation problem concerned with the…”
Get full text

Simultaneous Optimization of Container Ship Sailing Speed and Container Routing with Transit Time Restrictions by Karsten, Christian Vad, Ropke, Stefan, Pisinger, David

“…We introduce a decision support tool for liner shipping companies to optimally determine the sailing speed and needed fleet for a global network. We…”
Get full text

Integrated Berth Allocation and Quay Crane Assignment Problem: Set partitioning models and computational results by Iris, Çağatay, Pacino, Dario, Ropke, Stefan, Larsen, Allan

“…•Novel set partitioning formulations for Berth Allocation and Quay Crane Assignment Problem.•Various column reduction techniques for GSPP models.•Effects of…”
Get full text

The time constrained multi-commodity network flow problem and its application to liner shipping network design by Karsten, Christian Vad, Pisinger, David, Ropke, Stefan, Brouer, Berit Dangaard

“…•Show that it is essential to include transit time constraints in LSND.•Present a tailored algorithm for the solution of the MCF problem.•Show through…”
Get full text

A unified heuristic for a large class of Vehicle Routing Problems with Backhauls by Ropke, Stefan, Pisinger, David

“…The Vehicle Routing Problem with Backhauls is a generalization of the ordinary capacitated vehicle routing problem where goods are delivered from the depot to…”
Get full text

Flexible ship loading problem with transfer vehicle assignment and scheduling by Iris, Çağatay, Christensen, Jonas, Pacino, Dario, Ropke, Stefan

“…•The integrated management of ship loading operations, including operational stowage planning, load sequencing, planning of the equipment to use and their…”
Get full text

Solving unconstrained binary polynomial programs with limited reach: Application to low autocorrelation binary sequences by Clausen, Jens Vinther, Crama, Yves, Lusby, Richard, Rodríguez-Heck, Elisabeth, Ropke, Stefan

“…Unconstrained Binary Polynomial Programs (UBPs) are a class of optimization problems relevant in a broad array of fields. In this paper, we examine an example…”
Get full text