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.
Two Formulations For Minimizing Weight-Distance Objective In Single Vehicle Routing Problem With Quadratic, Cubic Objective Function And Its Linearization
34 Views
6 Downloads