以通用启发式演算化求解工业管理上的相关问题.PPT

* 1. Introduction LRP is applicable to a wide variety of fields such as food and drink distribution blood bank location newspapers delivery waste collection bill delivery military application parcel delivery various consumer goods distribution * 1. Introduction The LRP belongs to the class of NP-hard problems since it combines two difficult sub-problems: the facility location problem (FLP) and the vehicle routing problem (VRP), both of them are shown to be NP-hard As the problem size grows larger, heuristic approaches become the only viable alternative. * 2. Problem Definition * 2. Problem Definition Each route must start and terminate at the same depot, and its total load must not exceed vehicle capacity. The total load of the routes assigned to a depot must fit the capacity of the depot. The objective is to determine which depots should be opened and which routes should be constructed to minimize the total cost. * 2. Problem Definition Blue circle: depot Red circle: customer Open Cost for depot Vehicle Cost for each route Traveling cost between customers Depot capacity Vehicle capacity * 3. The Proposed Approach -Solution Representation A solution is represented by a string of numbers consisting of a permutation of n customers denoted by the set , m potential depots denoted by the set {n+1, n+2, …, n+m}, and Ndummy zeros. The ith number in denotes the ith customer to be serviced. The first number in a solution is always in {n+1, n+2, …, n+m} indicating the first depot under consideration. * * 3. Solution method -Example of Solution Representation * 3. Solution method -Example of Solution Representation * 3. Solution method -Initial Solution Step 1: Choose the unused depot with the most unassigned customers closest to it. Step 2: For all unassigned customers, assigned them to the chosen depot one by one in the increasing order of the distance between the customer and the chosen depot. Stop when the capacity of the depot is violate