A Hybrid Solution Approach for Ready-Mixed Concrete Delivery

Authors:
Verena Schmid;Karl F. Doerner;Richard F. Hartl;Martin W. P. Savelsbergh;Wolfgang Stoecher
Affiliations:
Department of Business Administration, University of Vienna, A-1210 Vienna, Austria;Department of Business Administration, University of Vienna, A-1210 Vienna, Austria;Department of Business Administration, University of Vienna, A-1210 Vienna, Austria;H. Milton Stewart School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, Georgia 30332;Profactor Produktionsforschungs GmbH, A-4407 Steyr-Gleink, Austria
Venue:
Transportation Science
Year:
2009

Citing 9
Cited 7

Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
Variable neighborhood search

Computers and Operations Research
Network Models in Optimization and Their Applications in Practice

Network Models in Optimization and Their Applications in Practice
A Reactive Variable Neighborhood Search for the Vehicle-Routing Problem with Time Windows

INFORMS Journal on Computing
A Variable Neighborhood Search for the Multi Depot Vehicle Routing Problem with Time Windows

Journal of Heuristics
An efficient variable neighborhood search heuristic for very large scale vehicle routing problems

Computers and Operations Research
OR PRACTICE---The Dance of the Thirty-Ton Trucks: Dispatching and Scheduling in a Dynamic Environment

Operations Research
Hybridization of very large neighborhood search for ready-mixed concrete delivery problems

Computers and Operations Research
Combining metaheuristics and exact algorithms in combinatorial optimization: a survey and classification

IWINAC'05 Proceedings of the First international work-conference on the Interplay Between Natural and Artificial Computation conference on Artificial Intelligence and Knowledge Engineering Applications: a bioinspired approach - Volume Part II

Hybridization of very large neighborhood search for ready-mixed concrete delivery problems

Computers and Operations Research
Multiple Variable Neighborhood Search Enriched with ILP Techniques for the Periodic Vehicle Routing Problem with Time Windows

HM '09 Proceedings of the 6th International Workshop on Hybrid Metaheuristics
Combining Exact and Heuristic Approaches for the Capacitated Fixed-Charge Network Flow Problem

INFORMS Journal on Computing
Survey: matheuristics for rich vehicle routing problems

HM'10 Proceedings of the 7th international conference on Hybrid metaheuristics
A branch-and-price guided search approach to maritime inventory routing

Computers and Operations Research
Branch-and-Price Guided Search for Integer Programs with an Application to the Multicommodity Fixed-Charge Network Flow Problem

INFORMS Journal on Computing
Improved Load Plan Design Through Integer Programming Based Local Search

Transportation Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Companies in the concrete industry are facing the following scheduling problem on a daily basis: Concrete produced at several plants has to be delivered at customers' construction sites using a heterogeneous fleet of vehicles in a timely, but cost-effective manner. As the ordered quantity of concrete typically exceeds the capacity of a single vehicle several deliveries need to be scheduled in order to fulfill an order. The deliveries cannot overlap and the time between consecutive deliveries has to be small. Our solution approach effectively integrates optimization and heuristic techniques. Information is passed back and forth between an integer multicommodity flow optimization component and a variable neighborhood search component in order to find high-quality solutions in a reasonable amount of time. Even though both components are capable of producing feasible solutions, the integrated approach is far more effective. Computational results show that our hybrid approach outperforms an innovative metaheuristic approach by more than 6% on average for large instances.