Presentation is loading. Please wait.

Presentation is loading. Please wait.

MULTIPLE VEHICLE ROUTING PROBLEM Arjun Chandrasekaran Praveesh Govindan Ashwin Sukumar Janet Yeh Ning Zhong ISYE6203 HW5 Question #3 Group 4 Dr. Marc Goetschalckx.

Published byMalik Oxford Modified over 9 years ago

Similar presentations

Presentation on theme: "MULTIPLE VEHICLE ROUTING PROBLEM Arjun Chandrasekaran Praveesh Govindan Ashwin Sukumar Janet Yeh Ning Zhong ISYE6203 HW5 Question #3 Group 4 Dr. Marc Goetschalckx."— Presentation transcript:

1 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

2 PROBLEM DESCRIPTION One supplier, sixty customers One truck per route Truck Capacity – 300 Units

3 N ODE L OCATION

4 S WEEP A LGORITHM AND T WO -C YCLE E XCHANGE I MPROVEMENT Two-Cycle Exchange Improvement based on Sweep DISTANCE RouteDepotPath Taken 1d1572931302235155150220383.49 2d11460373325114423524714625.83 3d14324338155426.87 4d1215810563216269085.53 5d113483918424110513.93 6d1595440201734461917821.62 7d1927534512616139.71 8d13678285549419433.80 Total:113430.78

5 S WEEP & 2-O PT Total: 113430.78

6 G ENERALIZED ASSIGNMENT PROBLEM HEURISTIC Generalized Assignment Heuristic for the VRP RouteDepotPath TakenDistanceTruck Quantity 1d1 7495528853451726116.85 296 2d1 29430223515515031220170.31 294 3d1 1457603733251144235215637.74 267 4d1 212447433428.24 239 5d1 3381105855414.97 299 6d1 92659411316325611834.24 293 7d1 424839184020344613200.62 296 8d1 2736126195411620.95 298 Total:107423.92

7 GAP H EURISTIC Total: 107423.92

8 VRP S OLVER (L ARRY S NYDER, L EHIGH U NIVERSITY ) Clarke-Wright with Enhancement RouteDepotPath TakenDistance Truck Quantity 1d133815632161059073.10294 2d1927364295719799.54285 3d114602315051351537332511442318618.70273 4d112534517204034465421104.42296 5d143524724214033.42284 6d130224955288722619.25288 7d16195926588715.09282 8d141421839481310513.93280 Total:104477.45

9 VRP S OLVER Total: 104477.45

10 R EFERENCES Snyder, Larry. "Larry Snyder - Software." Lehigh University. N.p., n.d. Web. 15 Nov. 2010.. "Matlog Reference." Edward P. Fitts Department of Industrial and Systems Engineering at North Carolina State University. N.p., n.d. Web. 15 Nov. 2010.. Corporation, Fair Isaac. "FICO Xpress BCL Model-Building Interface." Decision Management - FICO. N.p., n.d. Web. 15 Nov. 2010..

11 T HANK YOU

Download ppt "MULTIPLE VEHICLE ROUTING PROBLEM Arjun Chandrasekaran Praveesh Govindan Ashwin Sukumar Janet Yeh Ning Zhong ISYE6203 HW5 Question #3 Group 4 Dr. Marc Goetschalckx."

Similar presentations

© Dr Evgeny Selensky, 2001 Motivation Hard industrially important problems Identify problem features making one technique better than the other Use domain.

© Dr Evgeny Selensky, 2001 Motivation Hard industrially important problems Identify problem features making one technique better than the other Use domain.
Test practice Multiplication. Multiplication 9x2.

Test practice Multiplication. Multiplication 9x2.
 Permitting Routing › Definition › Permits Type › Permitting Process  Project Purpose › Proposed Solution  GIS › Definition › Functions › Benefits.

 Permitting Routing › Definition › Permits Type › Permitting Process  Project Purpose › Proposed Solution  GIS › Definition › Functions › Benefits.
$100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300.

$100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300.
VEHICLE ROUTING PROBLEM

VEHICLE ROUTING PROBLEM
An Exact Algorithm for the Vehicle Routing Problem with Backhauls

An Exact Algorithm for the Vehicle Routing Problem with Backhauls
Vehicle Routing & Scheduling Multiple Routes Construction Heuristics –Sweep –Nearest Neighbor, Nearest Insertion, Savings –Cluster Methods Improvement.

Vehicle Routing & Scheduling Multiple Routes Construction Heuristics –Sweep –Nearest Neighbor, Nearest Insertion, Savings –Cluster Methods Improvement.
The most comprehensive Oracle applications & technology content under one roof Procure to Pay Automation Bevan Wright Fusion5 NZ Oracle User Group.

The most comprehensive Oracle applications & technology content under one roof Procure to Pay Automation Bevan Wright Fusion5 NZ Oracle User Group.
CRM Chapter 9 Analytics. Analytics  Collection, extraction, modification, measurement, identification, and reporting of information designed to be useful.

CRM Chapter 9 Analytics. Analytics  Collection, extraction, modification, measurement, identification, and reporting of information designed to be useful.
1 Chapter 7 IT Infrastructures Business-Driven Technology

1 Chapter 7 IT Infrastructures Business-Driven Technology
131.123.247.253 -> 131.123.246.52 -> 131.123.11.254 131.123.8.1 131.123.11.254 131.123.247.253 131.123.246.52.

> >
David Janzen Software Engineering II – Scratch Thursday, July 9, 2009.

David Janzen Software Engineering II – Scratch Thursday, July 9, 2009.
Chapter 5 TCP/IP: Routing – Part 1 Dr. V.T. Raja Oregon State University.

Chapter 5 TCP/IP: Routing – Part 1 Dr. V.T. Raja Oregon State University.
Carl Bro a|s - Route 2000 Solving real life vehicle routing problems Carl Bro a|s International consulting engineering company 2100 employees worldwide.

Carl Bro a|s - Route 2000 Solving real life vehicle routing problems Carl Bro a|s International consulting engineering company 2100 employees worldwide.
Vehicle Routing & Scheduling: Part 2 Multiple Routes Construction Heuristics –Sweep –Nearest Neighbor, Nearest Insertion, Savings –Cluster Methods Improvement.

Vehicle Routing & Scheduling: Part 2 Multiple Routes Construction Heuristics –Sweep –Nearest Neighbor, Nearest Insertion, Savings –Cluster Methods Improvement.
Solving the Vehicle Routing Problem with Multiple Multi-Capacity Vehicles Michael Sanders.

Solving the Vehicle Routing Problem with Multiple Multi-Capacity Vehicles Michael Sanders.
Supply Chain Planning Dinesh Garg Indian Institute of Science Bangalore-India September 27, 2003 Foundations of Global Supply Chain Management.

Supply Chain Planning Dinesh Garg Indian Institute of Science Bangalore-India September 27, 2003 Foundations of Global Supply Chain Management.
Edward Kent Jason Atkin Rong Qi 1. Contents Vehicle Routing Problem VRP in Forestry Commissioning Loading Bay Constraints Ant Colony Optimisation Handing.

Edward Kent Jason Atkin Rong Qi 1. Contents Vehicle Routing Problem VRP in Forestry Commissioning Loading Bay Constraints Ant Colony Optimisation Handing.
$100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300.

$100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300.
Vehicle Routing & Scheduling: Developments & Applications in Urban Distribution Assoc. Prof. Russell G. Thompson Department of Infrastructure Engineering.

Vehicle Routing & Scheduling: Developments & Applications in Urban Distribution Assoc. Prof. Russell G. Thompson Department of Infrastructure Engineering.

Similar presentations

Ads by Google