Jakob Puchinger

Orcid: 0000-0001-7355-8070

According to our database1, Jakob Puchinger authored at least 42 papers between 2004 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Improving critical buildings energy resilience via shared autonomous electric vehicles - A sequential optimization framework.
Comput. Oper. Res., March, 2024

2023
A conceptual digital twin framework for city logistics.
Comput. Environ. Urban Syst., 2023

A deterministic annealing local search for the electric autonomous dial-a-ride problem.
Eur. J. Oper. Res., 2023

Control-based integration of rejection rates into endogenous demand ride-pooling simulations.
Proceedings of the 8th International Conference on Models and Technologies for Intelligent Transportation Systems, 2023

2022
The bi-objective multimodal car-sharing problem.
OR Spectr., 2022

Van-based robot hybrid pickup and delivery routing problem.
Eur. J. Oper. Res., 2022

Comparison of anticipatory algorithms for a dial-a-ride problem.
Eur. J. Oper. Res., 2022

Extending JSprit to solve electric vehicle routing problems with recharging.
Proceedings of the 13th International Conference on Ambient Systems, 2022

Implementing reinforcement learning for on-demand vehicle rebalancing in MATSim.
Proceedings of the 13th International Conference on Ambient Systems, 2022

2021
Integrating autonomous delivery service into a passenger transportation system.
Int. J. Prod. Res., 2021

2019
Routing a mix of conventional, plug-in hybrid, and electric vehicles.
Eur. J. Oper. Res., 2019

The role of operational research in green freight transportation.
Eur. J. Oper. Res., 2019

Shared Autonomous Vehicle Simulation and Service Design.
CoRR, 2019

Robo-Taxi service fleet sizing: assessing the impact of user trust and willingness-to-use.
CoRR, 2019

Shared Autonomous Electric Vehicle Service Performance: Assessing the Impact of Charging Infrastructure and Battery Capacity.
CoRR, 2019

2017
Preface: Special issue on the VeRoLog 2015 conference.
Networks, 2017

A critical analysis of travel demand estimation for new one-way carsharing systems.
Proceedings of the 20th IEEE International Conference on Intelligent Transportation Systems, 2017

2016
The Electric Fleet Size and Mix Vehicle Routing Problem with Time Windows and Recharging Stations.
Eur. J. Oper. Res., 2016

Dynamic programming based metaheuristics for the dial-a-ride problem.
Ann. Oper. Res., 2016

2015
Metaheuristics for solving a multimodal home-healthcare scheduling problem.
Central Eur. J. Oper. Res., 2015

2013
Hybrid Metaheuristics for Dynamic and Stochastic Vehicle Routing.
Proceedings of the Hybrid Metaheuristics, 2013

On the way to a multi-modal energy-efficient route.
Proceedings of the IECON 2013, 2013

2012
Hybrid Heuristics for Multimodal Homecare Scheduling.
Proceedings of the Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems, 2012

2011
Dantzig-Wolfe decomposition and branch-and-price solving in G12.
Constraints An Int. J., 2011

Hybrid metaheuristics in combinatorial optimization: A survey.
Appl. Soft Comput., 2011

Models and Algorithms for Intermodal Transportation and Equipment Selection.
Proceedings of the Operations Research Proceedings 2011, Selected Papers of the International Conference on Operations Research (OR 2011), August 30, 2011

2010
MetaBoosting: Enhancing Integer Programming Techniques by Metaheuristics.
Proceedings of the Matheuristics - Hybridizing Metaheuristics and Mathematical Programming, 2010

The Multidimensional Knapsack Problem: Structure and Algorithms.
INFORMS J. Comput., 2010

2009
Branch-and-Price Solving in G12.
Proceedings of the Models and Algorithms for Optimization in Logistics, 21.06., 2009

2008
Combining (Integer) Linear Programming Techniques and Metaheuristics for Combinatorial Optimization.
Proceedings of the Hybrid Metaheuristics, An Emerging Approach to Optimization, 2008

A Lagrangian Decomposition/Evolutionary Algorithm Hybrid for the Knapsack Constrained Maximum Spanning Tree Problem.
Proceedings of the Recent Advances in Evolutionary Computation for Combinatorial Optimization, 2008

Bringing order into the neighborhoods: relaxation guided variable neighborhood search.
J. Heuristics, 2008

Automating branch-and-bound for dynamic programs.
Proceedings of the 2008 ACM SIGPLAN Symposium on Partial Evaluation and Semantics-based Program Manipulation, 2008

Flexible, Rule-Based Constraint Model Linearisation.
Proceedings of the Practical Aspects of Declarative Languages, 2008

From High-Level Model to Branch-and-Price Solution in G12.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2008

The Core Concept for 0/1 Integer Programming.
Proceedings of the Theory of Computing 2008. Proc. Fourteenth Computing: The Australasian Theory Symposium (CATS 2008), 2008

2007
Models and algorithms for three-stage two-dimensional bin packing.
Eur. J. Oper. Res., 2007

Combining Lagrangian Decomposition with an Evolutionary Algorithm for the Knapsack Constrained Maximum Spanning Tree Problem.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2007

2006
The Core Concept for the Multidimensional Knapsack Problem.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2006

2005
Combining Metaheuristics and Exact Algorithms in Combinatorial Optimization: A Survey and Classification.
Proceedings of the Artificial Intelligence and Knowledge Engineering Applications: A Bioinspired Approach: First International Work-Conference on the Interplay Between Natural and Artificial Computation, 2005

2004
An Evolutionary Algorithm for Column Generation in Integer Programming: An Effective Approach for 2D Bin Packing.
Proceedings of the Parallel Problem Solving from Nature, 2004

Solving a Real-World Glass Cutting Problem.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2004


  Loading...