Data
Two-echelon Vehicle Routing Problem in City Logistics (2E-VRPCL)
Vehicle Routing Problem with Simultaneous Pickup and Delivery Considering Occasional Drivers (VRPSPDOD)
Location-Routing Problem (LRP)
Reference: Vincent F. Yu, Shih-Wei Lin*, Wenyih Lee, Ching-Jung Ting. A simulated annealing heuristic for the capacitated location routing problem. Computers & Industrial Engineering 2010; 58(2):288-299.
Open Location-Routing Problem (OLRP)
Reference: Vincent F. Yu*, Shin-Yu Lin. A simulated annealing heuristic for the open location-routing problem. Computers & Operations Research 2015; 62:184-196.
Location-Routing Problem with Simulataneous Pickup and Delivery (LRPSPD)
Reference: Vincent F. Yu*, Shin-Yu Lin. Solving the location-routing problem with simultaneous pickup and delivery by simulated annealing. International Journal of Production Research 2015.
Two-Echelon Open Location-Routing Problem (2E-OLRP)
Location-Routing Problem with Demand Range (LRPDR)
Reference: Vincent F. Yu, Panca Jodiawan, Yi-Hsuan Ho, Shih-Wei Lin*. Location-routing problem with demand range. IEEE Access 2019; accepted.
Team Orienteering Problem with Time Windows (TOPTW)
Multi-Modal Team Orienteering Problem with Time Windows (MM-TOPTW)
Team Orienteering Problem with Time Windows and Mandatory Visits (TOPTW-MV)
Team Orienteering Problem with Time Windows and Partial Scores (TOPTW-PS)
Team Orienteering Problem with Time Windows and Time-dependent Scores (TOPTW-TDS)
Truck and Trailer Routing Problem (TTRP)
Description
The truck and trailer routing problem (TTRP) is a variant of the well known vehicle routing problem (VRP). Different from the VRP, in the TTRP, customers are serviced by a fleet of trucks and trailers. Due to practical constraints, some customers (truck customer; TC) can only be serviced by a single truck. The other customers (vehicle customer; VC) can be serviced by a single truck or a truck pulling a trailer.
Test Instances
21 TTRP instances (Chao, 2002)
The numbers in the first line are Truck Capacity, Trailer Capacity, Number of Customers
The numbers in each of the subsequent lines are Customer Number, X-coordinate, Y-coordinate, Demand, Indicator of Truck Customer (1 = TC, 0 = VC)
The 2nd line is for the depot (node 0) so the last two numbers in the line can be ignored.
References
Lin SW, Yu VF*, Lu CC. A simulated annealing heuristic for the truck and trailer routing problem with time windows. Expert Systems with Applications 2011; 38(12):15244-15252.
Lin SW, Yu VF*, Chou SY. A note on the truck and trailer routing problem. Expert Systems with Applications 2010; 37(1):899-903.
Lin SW, Yu VF*, Chou SY. Solving the truck and trailer routing problem based on a simulated annealing heuristic. Computers & Operations Research 2009; 36(5):1683-1692.
Drexl M. A branch-and-price algorithm for the truck-and-trailer routing problem. Technical report. RWTH Aachen University, Germany; 2007.
Scheuerer S. A tabu search heuristic for the truck and trailer routing problem. Computers & Operations Research 2006;33:894-909
Chao IM. A tabu search method for the truck and trailer routing problem. Computers & Operations Research 2002;29(1):33-51
Vehicle Routing Problem with Cross-docking (VRPCD)
VRPCD Instances
Open Vehicle Routing Problem with Cross-docking (OVRPCD)
Heterogeneous Fleet Vehicle Routing Problem with Multiple Crossdocks (HF-VRPMCD)
Vehicle Routing Problem with Parcel Lockers (VRPPL)
Vehicle Routing Problem with Simultaneous Pickup and Delivery and Parcel Lockers (VRPSPDPL)