M
Manfred Gronalt
Researcher at University of Natural Resources and Life Sciences, Vienna
Publications - 91
Citations - 1375
Manfred Gronalt is an academic researcher from University of Natural Resources and Life Sciences, Vienna. The author has contributed to research in topics: Supply chain & Vehicle routing problem. The author has an hindex of 18, co-authored 86 publications receiving 1184 citations. Previous affiliations of Manfred Gronalt include University of Vienna & University of Agricultural Sciences, Dharwad.
Papers
More filters
Journal ArticleDOI
Designing a regional forest fuel supply network
Manfred Gronalt,Peter Rauch +1 more
TL;DR: In this article, a new approach to configure a wood biomass supply network for a certain region, a federal state of Austria, is described, which consists of several forest areas and a number of energy plants with a total demand of 1.2 million loose cubic meter (lcbm) wood biomass and 502,000 lcbm forest fuels.
Journal ArticleDOI
Securing home health care in times of natural disasters
TL;DR: A model formulation and solution approach for the daily planning of home health care services that minimizes the sum of driving times and waiting times, and the dissatisfaction levels of clients and nurses is presented.
Journal ArticleDOI
New savings based algorithms for time constrained pickup and delivery of full truckloads
TL;DR: This paper presents an exact formulation of the problem, a relaxed problem formulation based on network flows, which can be used to calculate a lower bound to the solution value, and proposes four different savings based heuristics for the problem.
Journal ArticleDOI
Exact and heuristic algorithms for the vehicle routing problem with multiple interdependent time windows
TL;DR: A model and several solution procedures for a novel type of vehicle routing problems where time windows for the pickup of perishable goods depend on the dispatching policy used in the solution process are presented and show that the heuristic algorithms find solutions reasonably close to the optimum in fractions of a second.
Journal IssueDOI
Metaheuristics for the vehicle routing problem with loading constraints
TL;DR: This work considers a combination of the capacitated vehicle routing problem and a class of additional loading constraints involving a parallel machine scheduling problem, and solves the problem by means of two different metaheuristics algorithms: a Tabu Search and an Ant Colony Optimization.