REAL-LIFE VEHICLE ROUTING WITH TIME WINDOWS FOR VISUAL ATTRACTIVENESS AND OPERATIONAL ROBUSTNESS

B. L. Hollis () and P. J. Green ()
Additional contact information
B. L. Hollis: School of Physical Sciences, The University of Queensland, QLD 4072, Australia
P. J. Green: Transport Planning & Optimisation Manager, Beverages Logistics Department, Schweppes Australia Pty. Ltd., Level 5, 111 Cecil Street, South Melbourne VIC 3205, Australia

Asia-Pacific Journal of Operational Research (APJOR), 2012, vol. 29, issue 04, 1-29

Abstract: This paper describes an algorithm for producing visually attractive and operationally robust solutions to a real-life vehicle routing problem with time windows. Visually attractive and operationally robust solutions are usually synonymous with compact, nonoverlapping routes with little or no intra-route cross over. The visual attractiveness of routes, for practical routing applications, is often of paramount importance.We present a two phase solution approach. The first phase is inspired by the sequential insertion algorithm of Solomon (1987) and includes a range of novel enhancements to ensure visually attractive solutions are produced in the face of a range of nonstandard real-life constraints: A constrained and heterogeneous vehicle fleet; tight time windows and banned delivery windows; multiple route capacity measures; driver breaks; minimum route volumes; vehicle-location compatibility rules; nonreturn to base routes; peak hour traveling times; vehicle type dependent service times; and replenishment back at the depot. The second phase is based on the guided local search algorithm of Kilby et al. (1999). It uses an augmented objective function designed to seek solutions which strike a balance between minimizing traditional cost measures, whilst maximizing the visual attractiveness of the solution.Our two phase solution approach is particularly adept at producing solutions that both aggressively minimize the total number of routes, a feature that we believe has been missing in algorithms presented in equivalent literature, as well as minimizing traditional cost measures whilst delivering a very high degree of visual attractiveness.The algorithm presented has been successfully implemented and deployed for the real-life, daily beverage distribution problem of Schweppes Australia Pty. Ltd. for a range of capital cities throughout Australia.

Keywords: Vehicle routing with time windows; construction heuristics; meta heuristics (search for similar items in EconPapers)
Date: 2012
References: View complete reference list from CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://www.worldscientific.com/doi/abs/10.1142/S0217595912500170
Access to full text is restricted to subscribers

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wsi:apjorx:v:29:y:2012:i:04:n:s0217595912500170

Ordering information: This journal article can be ordered from

DOI: 10.1142/S0217595912500170

Access Statistics for this article

Asia-Pacific Journal of Operational Research (APJOR) is currently edited by Gongyun Zhao

More articles in Asia-Pacific Journal of Operational Research (APJOR) from World Scientific Publishing Co. Pte. Ltd.
Bibliographic data for series maintained by Tai Tone Lim ().