Stefan Pickl

Stefan Pickl

Auto-generated profile, based on publicly available information

Stefan Pickl

Institute of Theoretical Computer Science, Mathematics and Operations Research University of the Bundeswehr Munich Neubiberg Germany

Research Focus & Metrics

Academic Career Length

26Years (2001-Present)

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

Representative Publications

View All Publications
12 January 2021 in Applied Sciences
Verified
Journal Article
Open access
PDF file
WAwadi Khalid Anuar
wadi Khalid Anuar
Lai Soon LeeLai Soon Lee
Lai Soon Lee
SPStefan Pickl
Stefan Pickl
HSHsin-Vonn Seow
Hsin-Vonn Seow
The growing field of humanitarian operations is driven by frequent events of disasters seen in the world today. Within this field, Operations Research (OR) plays a critical role in alleviating the suffering of victims that are impacted by disasters. This paper focuses on the branch of a well-known OR problem, known as the Vehicle Routing Problem (VRP), within the selected scope of humanitarian operations. A total of 123 papers of the last decade are reviewed and classified under the humanitarian operations of supply and delivery, evacuation as well as rescue operations. Besides specific disaster management phases and disaster types, various modelling challenges are highlighted, hinting towards a richer and more complex VRP seen under selected model characteristic classifications. Furthermore, established solution approaches, including hybrid solutions, are highlighted and classified, discussing how they are applied in the context of these humanitarian operations. The inclusion of a machine learning solution approach under the same classification is proposed. Finally, the trend and future outlook of VRP for the suggested humanitarian operations are discussed and highlighted.

26 September 2016 in Journal of Optimization Theory and Applications
Verified
Journal Article
Closed access
PDF file
MRManon Raap
Manon Raap
SMSilja Meyer-Nieberg
Silja Meyer-Nieberg
SPStefan Pickl
Stefan Pickl
MZMartin Zsifkovits
Martin Zsifkovits

29 August 2021 in Applied Sciences
Verified
Journal Article
Open access
PDF file
KTkien hua ting
kien hua ting
Lai Soon LeeLai Soon Lee
Lai Soon Lee
SPStefan Pickl
Stefan Pickl
HSHsin-Vonn Seow
Hsin-Vonn Seow
The Shared Mobility Problems (SMP) with the rideshare concept based on sharing a vehicle are fast becoming a trend in many urban cities around the world. Examples of these problems are like ridesharing, carpooling, taxisharing, buspooling, vanpooling, and multi-modal ridesharing. This is the new way to access transportation services by those who are propelling the sharing economy, where access rather than ownership is the new norm. This paper provides a systematic review of SMP using the PRISMA (Preferred Reporting Items for Systematic Reviews and Meta-Analysis) method. A total of 110 papers from the last decade are selected from 12 abstracts and citation databases to be reviewed and classified. This is done based on the problem types, variants, characteristics, and solution approaches. The current trends and analysis of the survey findings are also summarised. From this systematic review, it is observed that both the time window and multi-objective problems are popular among the researchers, while the minimisation of the total cost is the main concern in the literature of the SMP. Both static and dynamic cases of the SMP are the most researched where heuristic and metaheuristic approaches are widely adopted by the researchers in the literature. Finally, challenges and suggestions for future work are discussed and highlighted.

30 July 2022 in Mathematics
Verified
Journal Article
Open access
PDF file
WAwadi Khalid Anuar
wadi Khalid Anuar
Lai Soon LeeLai Soon Lee
Lai Soon Lee
HSHsin-Vonn Seow
Hsin-Vonn Seow
SPStefan Pickl
Stefan Pickl
In the event of a disaster, the road network is often compromised in terms of its capacity and usability conditions. This is a challenge for humanitarian operations in the context of delivering critical medical supplies. To optimise vehicle routing for such a problem, a Multi-Depot Dynamic Vehicle-Routing Problem with Stochastic Road Capacity (MDDVRPSRC) is formulated as a Markov Decision Processes (MDP) model. An Approximate Dynamic Programming (ADP) solution method is adopted where the Post-Decision State Rollout Algorithm (PDS-RA) is applied as the lookahead approach. To perform the rollout effectively for the problem, the PDS-RA is executed for all vehicles assigned for the problem. Then, at the end, a decision is made by the agent. Five types of constructive base heuristics are proposed for the PDS-RA. First, the Teach Base Insertion Heuristic (TBIH-1) is proposed to study the partial random construction approach for the non-obvious decision. The heuristic is extended by proposing TBIH-2 and TBIH-3 to show how Sequential Insertion Heuristic (SIH) (I1) as well as Clarke and Wright (CW) could be executed, respectively, in a dynamic setting as a modification to the TBIH-1. Additionally, another two heuristics: TBIH-4 and TBIH-5 (TBIH-1 with the addition of Dynamic Lookahead SIH (DLASIH) and Dynamic Lookahead CW (DLACW) respectively) are proposed to improve the on-the-go constructed decision rule (dynamic policy on the go) in the lookahead simulations. The results obtained are compared with the matheuristic approach from previous work based on PDS-RA.

4 July 2021 in Mathematics
Verified
Journal Article
Open access
PDF file
WAwadi Khalid Anuar
wadi Khalid Anuar
Lai Soon LeeLai Soon Lee
Lai Soon Lee
HSHsin-Vonn Seow
Hsin-Vonn Seow
SPStefan Pickl
Stefan Pickl
A matheuristic approach based on a reduced two-stage Stochastic Integer Linear Programming (SILP) model is presented. The proposed approach is suitable for obtaining a policy constructed dynamically on the go during the rollout algorithm. The rollout algorithm is part of the Approximate Dynamic Programming (ADP) lookahead solution approach for a Markov Decision Processes (MDP) framed Multi-Depot Dynamic Vehicle Routing Problem with Stochastic Road Capacity (MDDVRPSRC). First, a Deterministic Multi-Depot VRP with Road Capacity (D-MDVRPRC) is presented. Then an extension, MDVRPSRC-2S, is presented as an offline two-stage SILP model of the MDDVRPSRC. These models are validated using small simulated instances with CPLEX. Next, two reduced versions of the MDVRPSRC-2S model (MDVRPSRC-2S1 and MDVRPSRC-2S2) are derived. They have a specific task in routing: replenishment and delivering supplies. These reduced models are to be utilised interchangeably depending on the capacity of the vehicle, and repeatedly during the execution of rollout in reinforcement learning. As a result, it is shown that a base policy consisting of an exact optimal decision at each decision epoch can be obtained constructively through these reduced two-stage stochastic integer linear programming models. The results obtained from the resulting rollout policy with CPLEX execution during rollout are also presented to validate the reduced model and the matheuristic algorithm. This approach is proposed as a simple implementation when performing rollout for the lookahead approach in ADP.

27 February 2016 in The International Journal of Advanced Manufacturing Technology
Verified
Journal Article
Closed access
PDF file
Fei TaoFei Tao
Fei Tao
LZLin Zhang
Lin Zhang
Andrew NeeAndrew Nee
Andrew Nee
SPStefan Wolfgang Pickl
Stefan Wolfgang Pickl