David Pisinger

Prof. David Pisinger

orcid

Research Focus & Metrics

Academic Career Length

32Years (1995-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 January 2004
Verified
Book
Closed access
HKHans Kellerer
Hans Kellerer
UPUlrich Pferschy
Ulrich Pferschy
DPDavid Pisinger
David Pisinger

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 April 2000 in Operations Research
Verified
Journal Article
Closed access
SMSilvano Martello
Silvano Martello
DPDavid Pisinger
David Pisinger
DVDaniele Vigo
Daniele Vigo
The problem addressed in this paper is that of orthogonally packing a given set of rectangular-shaped items into the minimum number of three-dimensional rectangular bins. The problem is strongly NP-hard and extremely difficult to solve in practice. Lower bounds are discussed, and it is proved that the asymptotic worst-case performance ratio of the continuous lower bound is 1/8. An exact algorithm for filling a single bin is developed, leading to the definition of an exact branch-and-bound algorithm for the three-dimensional bin packing problem, which also incorporates original approximation algorithms. Extensive computational results, involving instances with up to 90 items, are presented: It is shown that many instances can be solved to optimality within a reasonable time limit.

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