An Exact Algorithm for the Vehicle Routing Problem with ：车辆路径问题的精确算法.pptVIP

An Exact Algorithm for the Vehicle Routing Problem with Backhauls A Thesis Submitted to the Department of Industrial Engineering and the Institute of Engineering and Science of Bilkent University in Partial Fulfillment of the Requirements For the Degree of Master of Science by Cumhur Alper GELO?ULLARI Supervisor Assoc. Prof. Osman O?UZ 28.08.2001 Outline Importance of Routing Problems Problem Statement Literature Review The Algorithm Computational Experiments Conclusion Motivation Logistics: “That part of the supply chain process that plans, implements and controls the efficient, effective flow and storage of goods, services, and related information from the point of origin to the point of consumption in order to meet customers’ requirements” Problem Statement The basic Vehicle Routing Problem (VRP): Problem Statement The basic Vehicle Routing Problem (VRP): Minimize total distance traveled subject to each customer is serviced each route starts and ends at the depot capacity restrictions on the vehicles Problem Statement The VRPs exhibit a wide range of real world applications. Dial-a-ride problem House call tours by a doctor Preventive maintenance inspection tours Collection of coins from mail boxes Waste Collection School Bus Routing Problem Statement Problem Statement The Vehicle Routing Problem with Backhauls (VRPB): linehaul (delivery) customers backhaul (pick up) customers Problem Statement The VRP replaces deadhead trip back to the depot with a profitable activity. Yearly savings of $160 millions in USA grocery industry. Literature Review Related Problems: The TSP and m-TSP Traveling Salesman Problem (TSP) Multiple Traveling Salesman Problem (m-TSP) m-TSP is a special case of the VRP. Literature Review Exact Algorithms for the VRPB Vehicles are assumed to be rear-loaded. Two exact algorithms for the VRPB: Toth Vigo (1997) Mingozi Giorgi (1999) The Algorithm The VRPB under consideration is Asymmetric Linehaul and Backh