Stefan Poikonen

Dr. Stefan Poikonen


Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

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

Representative Publications

View All Publications
1 January 2020 in Computers & Operations Research
Verified
Journal Article
Closed access
SPStefan Poikonen
Stefan Poikonen
BGBruce Golden
Bruce Golden

1 April 2019 in INFORMS Journal on Computing
Verified
Journal Article
Closed access
SPStefan Poikonen
Stefan Poikonen
BGBruce L. Golden
Bruce L. Golden
EWEdward Wasil
Edward Wasil
The Traveling Salesman Problem with a Drone (TSP-D) is a hybrid truck and drone model of delivery, in which the drone rides on the truck and launches from the truck to deliver packages. Our approach to the TSP-D uses branch and bound, whereby each node of the branch-and-bound tree corresponds with a potential order to deliver a subset of packages. An approximate lower bound at each node is given by solving a dynamic program. We provide additional variants of our heuristic approach and compare solution quality and computation times. Consideration is given to various input parameters and distance metrics. The online supplement is available at https://doi.org/10.1287/ijoc.2018.0826 .

1 April 2020 in INFORMS Journal on Computing
Verified
Journal Article
Closed access
SPStefan Poikonen
Stefan Poikonen
BGBruce L. Golden
Bruce L. Golden
The mothership and drone routing problem (MDRP) considers the routing of a two-vehicle tandem. The larger vehicle, which may be a ship or an airplane, is called the mothership; the smaller vehicle, which may be a small boat or unmanned aerial vehicle, is called the drone. We assume that there exists a set of target locations T. For each t in T, the drone must launch from the mothership, visit t, and then return to the mothership to refuel. The drone has a limited range of R time units. In the MDRP, we assume that both mothership and drone operate in the “open seas” (i.e., using the Euclidean metric). We also introduce the mothership and infinite-capacity drone routing problem (MDRP-IC), where a drone launches from the mothership and visits one or more targets consecutively before returning to the mothership. Our exact approach uses branch and bound, where each node of the branch-and-bound tree corresponds to a potential subsequence of the order of target visits. A lower bound at each node is given by solving a second-order cone program, which optimally chooses a launch point and landing point for each target in the subsequence. A set of heuristics that also uses a second-order cone program as an embedded procedure is presented. We show that our schemes are flexible to accommodate a variety of additional constraints and/or objective functions. Computational results and interesting variants of the MDRP and MDRP-IC are also presented.

7 September 2020 in Networks
Verified
Journal Article
Closed access
PDF file
SPStefan Poikonen
Stefan Poikonen
JCJames F. Campbell
James F. Campbell


17 October 2022 in Optimization Letters
Verified
Journal Article
Closed access
PDF file
SKShuhan Kou
Shuhan Kou
BGBruce L. Golden
Bruce L. Golden
SPStefan Poikonen
Stefan Poikonen