Title: Mathematical model and genetic algorithm for distribution logistics problem with maximum route length

Authors: P. Sivakumar, K. Ganesh, S. Arunachalam

Addresses: Department of Mechanical Engineering, Vickram College of Engineering, Sreenivas Garden, Enathi, Sivagangai, 630561, TamilNadu, India. ' Manufacturing Industry Solutions Unit, Tata Consultancy Services Limited, Mumbai 400 079, Maharashtra, India. ' School of Computing and Technology, University of East London, Essex C09-3PY, UK

Abstract: Logistics is no longer seen as tactical and cost-driven – it is strategic. Considering the driver-on-time rules and with the perishable nature of the products, the travel length/time is one of the critical constraints in distribution logistics. We consider a typical logistics problem with maximum route length constraint. The variant is termed as simultaneous delivery and pick-up with maximum route length (SDPM). We developed a unified mixed-integer-linear programming (MILP) model and genetic algorithm to solve SDPM and the standard variant, vehicle routing problem with simultaneous delivery and pick-up (VRPSDP). Benchmark datasets for VRPSDP and randomly generated datasets for SDPM are solved using MILP model and genetic algorithm and the results are compared with best-known solution. The results of genetic algorithm are encouraging.

Keywords: distribution logistics; genetic algorithms; GAs; maximum route length; MILP; mixed integer linear programming; VRPSDP; vehicle routing problem; simultaneous delivery; simultaneous pick-up; mathematical modelling.

DOI: 10.1504/IJLEG.2008.023164

International Journal of Logistics Economics and Globalisation, 2008 Vol.1 No.3/4, pp.307 - 329

Published online: 12 Feb 2009 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article