Stefan Ropke

Stefan Ropke

Auto-generated profile, based on publicly available information

Stefan Ropke

Technical University of Denmark

Research Focus & Metrics

Academic Career Length

21Years (2006-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 November 2006 in Transportation Science
Verified
Journal Article
Closed access
SRStefan Ropke
Stefan Ropke
DPDavid Pisinger
David Pisinger
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 request involves moving a number of goods from a pickup location to a delivery location. Our task is to construct routes that visit all locations such that corresponding pickups and deliveries are placed on the same route, and such that a pickup is performed before the corresponding delivery. The routes must also satisfy time window and capacity constraints. This paper presents a heuristic for the problem based on an extension of the large neighborhood search heuristic previously suggested for solving the vehicle routing problem with time windows. The proposed heuristic is composed of a number of competing subheuristics that are used with a frequency corresponding to their historic performance. This general framework is denoted adaptive large neighborhood search. The heuristic is tested on more than 350 benchmark instances with up to 500 requests. It is able to improve the best known solutions from the literature for more than 50% of the problems. The computational experiments indicate that it is advantageous to use several competing subheuristics instead of just one. We believe that the proposed heuristic is very robust and is able to adapt to various instance characteristics.

1 August 2007 in Computers & Operations Research
Verified
Journal Article
Closed access
DPDavid Pisinger
David Pisinger
SRStefan Ropke
Stefan Ropke

1 May 2019 in Transportation Research Part C: Emerging Technologies
Verified
Journal Article
Closed access
DSDavid Sacramento
David Sacramento
DPDavid Pisinger
David Pisinger
SRStefan Ropke
Stefan Ropke

1 August 2016 in European Journal of Operational Research
Verified
Journal Article
Closed access
GHGerhard Hiermann
Gerhard Hiermann
Jakob PuchingerJakob Puchinger
Jakob Puchinger
SRStefan Ropke
Stefan Ropke
RHRichard F Hartl
Richard F Hartl

1 August 2009 in Transportation Science
Verified
Journal Article
Closed access
SRStefan Ropke
Stefan Ropke
JCJean-François Cordeau
Jean-François Cordeau
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 delivery location, under capacity, time window, and precedence constraints. This paper introduces a new branch-and-cut-and-price algorithm in which lower bounds are computed by solving through column generation the linear programming relaxation of a set partitioning formulation. Two pricing subproblems are considered in the column generation algorithm: an elementary and nonelementary shortest path problem. Valid inequalities are added dynamically to strengthen the relaxations. Some of the previously proposed inequalities for the pickup and delivery problem with time windows are also shown to be implied by the set partitioning formulation. Computational experiments indicate that the proposed algorithm outperforms a recent branch-and-cut algorithm.

1 June 2006 in European Journal of Operational Research
Verified
Journal Article
Closed access
SRStefan Ropke
Stefan Ropke
DPDavid Pisinger
David Pisinger