MULTIPLE VEHICLE ROUTING PROBLEM Arjun Chandrasekaran Praveesh Govindan Ashwin Sukumar Janet Yeh Ning Zhong ISYE6203 HW5 Question #3 Group 4 Dr. Marc Goetschalckx 11/16/2010
PROBLEM DESCRIPTION One supplier, sixty customers One truck per route Truck Capacity – 300 Units
N ODE L OCATION
S WEEP A LGORITHM AND T WO -C YCLE E XCHANGE I MPROVEMENT Two-Cycle Exchange Improvement based on Sweep DISTANCE RouteDepotPath Taken 1d d d d d d d d Total:
S WEEP & 2-O PT Total:
G ENERALIZED ASSIGNMENT PROBLEM HEURISTIC Generalized Assignment Heuristic for the VRP RouteDepotPath TakenDistanceTruck Quantity 1d d d d d d d d Total:
GAP H EURISTIC Total:
VRP S OLVER (L ARRY S NYDER, L EHIGH U NIVERSITY ) Clarke-Wright with Enhancement RouteDepotPath TakenDistance Truck Quantity 1d d d d d d d d Total:
VRP S OLVER Total:
R EFERENCES Snyder, Larry. "Larry Snyder - Software." Lehigh University. N.p., n.d. Web. 15 Nov "Matlog Reference." Edward P. Fitts Department of Industrial and Systems Engineering at North Carolina State University. N.p., n.d. Web. 15 Nov Corporation, Fair Isaac. "FICO Xpress BCL Model-Building Interface." Decision Management - FICO. N.p., n.d. Web. 15 Nov
T HANK YOU