Multi-restart iterative search for the pickup and delivery traveling salesman problem with FIFO loading

DOI10.1016/j.cor.2018.04.017zbMath1391.90071OpenAlexW2800115430MaRDI QIDQ1652699

Yongliang Lu, Qinghua Wu, Una Benlic

Publication date: 11 July 2018

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2018.04.017

zbMATH Keywords

heuristicstraveling salesman problempickup and deliveryfirst-in-first-out loadingthreshold search

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Uses Software

• TSPLIB
• SPOT
• irace

Cites Work

• Unnamed Item
• The multiple vehicle pickup and delivery problem with LIFO constraints
• A hybrid metaheuristic approach for the capacitated arc routing problem
• A population-based metaheuristic for the pickup and delivery problem with time windows and LIFO loading
• A multi-restart iterated local search algorithm for the permutation flow shop problem minimizing total flow time
• The tree representation for the pickup and delivery traveling salesman problem with LIFO loading
• A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem
• Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
• The pickup and delivery traveling salesman problem with first-in-first-out loading
• A search space ``cartography for guiding graph coloring heuristics
• Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading
• New optimization heuristics. The great deluge algorithm and the record- to-record travel
• Heuristics for the traveling salesman problem with pickup and delivery
• Two phased hybrid local search for the periodic capacitated arc routing problem
• Multiple pickup and delivery traveling salesman problem with last-in-first-out loading and distance constraints
• Iterated responsive threshold search for the quadratic multiple knapsack problem
• Multidimensional scaling by optimizing goodness of fit to a nonmetric hypothesis
• Variable Neighborhood Search for the Pickup and Delivery Traveling Salesman Problem with LIFO Loading
• A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading
• TSPLIB—A Traveling Salesman Problem Library
• A Backtracking Adaptive Threshold Accepting Algorithm for the Vehicle Routing Problem
• Tabu Thresholding: Improved Search by Nonmonotonic Trajectories
• A Method for Solving Traveling-Salesman Problems
• A threshold accepting approach to the Open Vehicle Routing problem
• An Additive Branch-and-Bound Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO or FIFO Loading