Stefan Poikonen
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Stefan Poikonen has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Bruce Golden
Robert H. Smith School of Business University of Maryland College Park MD 20742 USA
4 shared publications Bruce Golden
1 shared publication- Edward Wasil
Kogod School of Business, American University, Washington, DC 20016, USA
1 shared publication - Rui Zhang
Leeds School of Business, University of Colorado Boulder, Boulder, Colorado 80309
1 shared publication - Shuhan Kou
Department of Mathematics University of Maryland College Park MD 20742 USA
1 shared publication - Yuchen Luo
Advanced Analytics Group, Bain & Company, Boston, Massachusetts 02116
1 shared publication
Latest Publications
- 17 October 2022
- Published by Springer Nature in Optimization Letters
- Vol. 17 (1) , 89-105
Optimal TSP tour length estimation using Sammon maps
- 17 October 2022
- Published by Springer Nature in Optimization Letters
- Vol. 17 (1) , 89-105
Optimal TSP tour length estimation using Sammon maps
- 22 February 2022
- Published by Elsevier in Computers & Operations Research
- Vol. 143
A fresh look at the Traveling Salesman Problem with a Center
- 22 February 2022
- Published by Elsevier in Computers & Operations Research
- Vol. 143
A fresh look at the Traveling Salesman Problem with a Center
- Top Cited Papers
- 1 April 2020
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
- Vol. 32 (2) , 249-262
The Mothership and Drone Routing Problem
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.
- 1 April 2020
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
- Vol. 32 (2) , 249-262
Top Cited PapersThe Mothership and Drone Routing Problem
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.
- 1 January 2020
- Published by Elsevier in Computers & Operations Research
- Vol. 113
Multi-visit drone routing problem
- 1 January 2020
- Published by Elsevier in Computers & Operations Research
- Vol. 113
Multi-visit drone routing problem
- Top Cited Papers
- 1 April 2019
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
- Vol. 31 (2) , 335-346
A Branch-and-Bound Approach to the Traveling Salesman Problem with a Drone
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 2019
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
- Vol. 31 (2) , 335-346
Top Cited PapersA Branch-and-Bound Approach to the Traveling Salesman Problem with a Drone
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 .