7th North American International Conference on Industrial Engineering and Operations Management

Two Formulations For Minimizing Weight-Distance Objective In Single Vehicle Routing Problem With Quadratic, Cubic Objective Function And Its Linearization

R.R.K. Sharma, Vinay Singh & KK Lai
Publisher: IEOM Society International
0 Paper Citations
1 Views
1 Downloads
Track: Operations Research

Here we consider a single vehicle routing problem (of unlimited capacity) that visits different dealers. As it visits the first dealer, it offloads the demand of first dealer and moves on to second dealer ‘lighter’. In this context we seek to minimize weight-distance of the entire tour. We give two formulations of the above. It results in a ‘cubic’ and ‘quadratic’ terms in the objective function with negative cost coefficients in one formulation and positive cost coefficients (of ‘cubic’ and ‘quadratic’ terms) in other formulation. We give a novel linearization scheme for the resulting two formulations. It will be interesting to see computational performance of the two formulations given in this paper.

Published in: 7th North American International Conference on Industrial Engineering and Operations Management, Orlando, USA

Publisher: IEOM Society International
Date of Conference: June 11-14, 2022

ISBN: 978-1-7923-9158-3
ISSN/E-ISSN: 2169-8767