Author
Vera C. Hemmelmayr
Other affiliations: University of Vienna
Bio: Vera C. Hemmelmayr is an academic researcher from Vienna University of Economics and Business. The author has contributed to research in topics: Vehicle routing problem & Metaheuristic. The author has an hindex of 12, co-authored 19 publications receiving 1416 citations. Previous affiliations of Vera C. Hemmelmayr include University of Vienna.
Papers
More filters
TL;DR: Computational experiments show that the proposed adaptive large neighborhood search heuristic outperforms existing solution methods for the 2E-VRP and achieves excellent results on the LRP.
414 citations
TL;DR: It is shown that slight changes of the proposed VNS procedure is also competitive for the Periodic Traveling Salesman Problem (PTSP), and even outperforms existing solution procedures proposed in the literature.
300 citations
TL;DR: A problem faced by the blood bank of the Austrian Red Cross for Eastern Austria: how to cost-effectively organize the delivery of blood products to Austrian hospitals is introduced and solution approaches based on integer programming and variable neighborhood search are presented.
Abstract: We introduce a problem faced by the blood bank of the Austrian Red Cross for Eastern Austria: how to cost-effectively organize the delivery of blood products to Austrian hospitals? We investigate the potential value of switching from the current vendee-managed inventory set up to a vendor-managed inventory system. We present solution approaches based on integer programming and variable neighborhood search and evaluate their performance.
164 citations
TL;DR: A branch-and-cut algorithm based on the solution of a new two-index vehicle-flow formulation, which is strengthened with several families of valid inequalities, is introduced to address the two-echelon capacitated location-routing problem (2E-CLRP).
142 citations
TL;DR: This work develops technology to plan delivery routes for the supply of blood products to hospitals by a blood bank that produces low cost, robust plans that hedge against the natural uncertainty associated with blood product usage at hospitals.
117 citations
Cited by
More filters
TL;DR: This classification is the first to categorize the articles of the VRP literature to this level of detail and is based on an adapted version of an existing comprehensive taxonomy.
800 citations
TL;DR: The purpose is to review the most up-to-date state-of-the-art of GVRP, discuss how the traditional VRP variants can interact with G VRP and offer an insight into the next wave of research into GVRp.
Abstract: Green Logistics has emerged as the new agenda item in supply chain management. The traditional objective of distribution management has been upgraded to minimizing system-wide costs related to economic and environmental issues. Reflecting the environmental sensitivity of vehicle routing problems (VRP), an extensive literature review of Green Vehicle Routing Problems (GVRP) is presented. We provide a classification of GVRP that categorizes GVRP into Green-VRP, Pollution Routing Problem, VRP in Reverse Logistics, and suggest research gaps between its state and richer models describing the complexity in real-world cases. The purpose is to review the most up-to-date state-of-the-art of GVRP, discuss how the traditional VRP variants can interact with GVRP and offer an insight into the next wave of research into GVRP. It is hoped that OR/MS researchers together with logistics practitioners can be inspired and cooperate to contribute to a sustainable industry.
741 citations
TL;DR: Variable neighbourhood search (VNS) is a metaheuristic, or a framework for building heuristics, based upon systematic changes of neighbourhoods both in descent phase, to find a local minimum, and in perturbation phase to emerge from the corresponding valley as mentioned in this paper.
Abstract: Variable neighbourhood search (VNS) is a metaheuristic, or a framework for building heuristics, based upon systematic changes of neighbourhoods both in descent phase, to find a local minimum, and in perturbation phase to emerge from the corresponding valley It was first proposed in 1997 and has since then rapidly developed both in its methods and its applications In the present paper, these two aspects are thoroughly reviewed and an extensive bibliography is provided Moreover, one section is devoted to newcomers It consists of steps for developing a heuristic for any particular problem Those steps are common to the implementation of other metaheuristics
718 citations
TL;DR: This work introduces the electric vehicle-routing problem with time windows and recharging stations E-VRPTW and presents a hybrid heuristic that combines a variable neighborhood search algorithm with a tabu search heuristic, which incorporates the possibility of recharging at any of the available stations using an appropriate recharging scheme.
Abstract: Driven by new laws and regulations concerning the emission of greenhouse gases, carriers are starting to use electric vehicles for last-mile deliveries. The limited battery capacities of these vehicles necessitate visits to recharging stations during delivery tours of industry-typical length, which have to be considered in the route planning to avoid inefficient vehicle routes with long detours. We introduce the electric vehicle-routing problem with time windows and recharging stations E-VRPTW, which incorporates the possibility of recharging at any of the available stations using an appropriate recharging scheme. Furthermore, we consider limited vehicle freight capacities as well as customer time windows, which are the most important constraints in real-world logistics applications. As a solution method, we present a hybrid heuristic that combines a variable neighborhood search algorithm with a tabu search heuristic. Tests performed on newly designed instances for the E-VRPTW as well as on benchmark instances of related problems demonstrate the high performance of the heuristic proposed as well as the positive effect of the hybridization.
695 citations
TL;DR: This paper analyzes the recent literature on the standard LRP and new extensions such as several distribution echelons, multiple objectives or uncertain data and results of state-of-the-art metaheuristics are compared on standard sets of instances for the classical LRP, the two-echelon L RP and the truck and trailer problem.
545 citations