A population algorithm based on randomized tabu thresholding for the multi-commodity pickup-and-delivery traveling salesman problem

DOI10.1016/j.cor.2018.08.006zbMath1458.90115OpenAlexW2887376815WikidataQ129367182 ScholiaQ129367182MaRDI QIDQ1628071

Una Benlic, Yongliang Lu, Qinghua Wu

Publication date: 3 December 2018

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

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

zbMATH Keywords

heuristicstraveling salesman problempickup and deliverytabu thresholding

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items

Hybrid search with neighborhood reduction for the multiple traveling salesman problem, An adaptive tabu search algorithm embedded with iterated local search and route elimination for the bike repositioning and recycling problem, Dynamic multi-stage failure-specific cooperative recourse strategy for logistics with simultaneous pickup and delivery

Uses Software

• SPOT
• irace

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• MILP formulations and an iterated local search algorithm with tabu thresholding for the order batching problem
• A hybrid heuristic approach for the multi-commodity pickup-and-delivery traveling salesman problem
• A hybrid metaheuristic approach for the capacitated arc routing problem
• Probabilistic GRASP-tabu search algorithms for the UBQP problem
• Load-dependent and precedence-based models for pickup and delivery problems
• A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem
• A population-based variable neighborhood search for the single machine total weighted tardiness problem
• The multi-commodity one-to-one pickup-and-delivery traveling salesman problem
• The travelling salesman problem with pick-up and delivery
• A new adaptive multi-start technique for combinatorial global optimizations
• A tabu thresholding algorithm for arc crossing minimization in bipartite graphs
• A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem
• Multi-start methods for combinatorial optimization
• A hybrid heuristic approach for the multi-commodity one-to-one pickup-and-delivery traveling salesman problem
• A genetic/tabu thresholding hybrid algorithm for the process allocation problem
• The multi-commodity pickup-and-delivery traveling salesman problem
• The Multi-Commodity One-to-One Pickup-and-Delivery Traveling Salesman Problem: A Matheuristic
• A tabu thresholding implementation for the irregular stock cutting problem
• Tabu Thresholding: Improved Search by Nonmonotonic Trajectories
• The one‐commodity pickup‐and‐delivery traveling salesman problem: Inequalities and algorithms