Below is the format of the definitions of the ITP instances (.itp) of the Integrated Operational Transportation Planning Problem. These instances are generated and solved in Wang, Xin; Kopfer, Herbert; Gendreau, Michel: Operational Transportation Planning of Freight Forwarding Companies in Horizontal Coalitions, Chair of Logistics Working Paper No. 5, University of Bremen, 2013. The ITP files (.itp) can be opened and edited by any program which can be used for text files (.txt). NUMBER OF REQUESTS n (The next line gives the information about the depot) No. PDPTW X Y DEMAND INSTANC No.i 2*n+1 0 x_{2*n+1} y_{2*n+1} 0 EARLIEST PICKUP/ DELIVERY TIME b_{2*n+1} LATEST PICKUP/ DELIVERY TIME e_{2*n+1} (The next 2*n lines give the information about the pickup and delivery operationsii) No. PDPTW X Y DEMAND EARLIEST LATEST INSTANC PICKUP/ PICKUP/ No. DELIVERY DELIVER TIME Y TIME 1 … x_{1} y_{1} l_{1} b_{1} e_{1} 2 … x_{2} y_{2} l_{2} b_{2} e_{2} … … … … … … … n … x_{n} y_{n} l_{n} b_{n} e_{n} n+1 … x_{n+1} y_{n+1} l_{n+1} b_{n+1} e_{n+1} n+2 … x_{n+2} y_{n+2} l_{n+2} b_{n+2} e_{n+2} … … … … … … … 2*n … x_{2*n} y_{2*n} l_{2*n} b_{2*n} e_{2*n} SERVICE TIME 0 SERVICE TIME s_{1} s_{2} … s_{n} s_{n+1} s_{n+2} … s_{2*n} COST OF SUBCONTRACTING TO COMMON CARRIERS 0 COST OF SUBCONTRACTING TO COMMON CARRIERS γ_{1} γ _{2} … γ _{n} γ _{1} γ _{2} … γ _{n} (The next line gives the total number of vehicles of the forwarder) NUMBER OF VEHICLES |K| (The next lines give the information about vehicles) No. START END CAPACITY FIXED DEPOT DEPOT COST 0 2*n+1 2*n+1 Q_{0} α_{0} 1 2*n+1 2*n+1 Q_{1} α _{1} … … … … … |K|-1 2*n+1 2*n+1 Q_{|K|-1} α _{|K|-1} i VARIABLE COST β _{0} β _{1} … β_{|K|-1} VELOCITY 1 1 … 1 FULFILLMENT MODEiii 1 1 … 3 MAX. LENGTH OF TOUR 10000(unlimited) 10000(unlimited) … 80(limited) PDPTW instance No.: This number is the number assigned to this operation in Li & Lim’s PDPTW benchmark instances. The PDPTW instances and their best-known solutions can be found at http://www.sintef.no/pdptw. ii The first n operations are pickup operations and the next n operations are the corresponding delivery operations. For any pickup operation i, i=1,…,n, the corresponding delivery operation is i+n. iii Fulfillment mode of a vehicle: 1 for self-fulfillment (own vehicle), 2 for vehicles hired from dependent subcontractors on a tour basis, 3 for vehicles hired from dependent subcontractors on a daily basis.

© Copyright 2020 ExpyDoc