Graph Transformations for Vehicle Routing and Job 车辆路径与作业的图变换.pptVIP

ICGT 2002, E. Selensky Graph Transformations for Vehicle Routing and Job Shop Scheduling Problems J.C.Beck, P.Prosser, E.Selensky c.beck@4c.ucc.ie, {pat,evgeny}@dcs.gla.ac.uk Basic Problem Example Motivation Core problem in vehicle routing and shop scheduling Edge weights to node weights: Large for VRP, small for JSP Can we use graph transformations to make VRP look like JSP and vice versa? Vehicle Routing Job Shop Scheduling Hypothesis Cost-Preserving Transformations Assumptions: Graphs: complete (true for VRP, JSP subsumed), undirected (directed case subsumed); A solution is a cycle on the g