A population algorithm based on randomized tabu thresholding for the multi-commodity pickup-and-delivery traveling salesman problem
DOI10.1016/J.COR.2018.08.006zbMATH Open1458.90115OpenAlexW2887376815WikidataQ129367182 ScholiaQ129367182MaRDI QIDQ1628071FDOQ1628071
Authors: Yongliang Lu, Una Benlic, 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
Recommendations
- The multi-commodity pickup-and-delivery traveling salesman problem
- The multi-commodity one-to-one pickup-and-delivery traveling salesman problem
- A hybrid heuristic approach for the multi-commodity pickup-and-delivery traveling salesman problem
- scientific article; zbMATH DE number 1953194
- A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Transportation, logistics and supply chain management (90B06)
Cites Work
- A tabu thresholding implementation for the irregular stock cutting problem
- Title not available (Why is that?)
- The multi-commodity one-to-one pickup-and-delivery traveling salesman problem
- Probabilistic GRASP-tabu search algorithms for the UBQP problem
- The one‐commodity pickup‐and‐delivery traveling salesman problem: Inequalities and algorithms
- A new adaptive multi-start technique for combinatorial global optimizations
- MILP formulations and an iterated local search algorithm with tabu thresholding for the order batching problem
- Tabu Thresholding: Improved Search by Nonmonotonic Trajectories
- The travelling salesman problem with pick-up and delivery
- A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem
- A hybrid heuristic approach for the multi-commodity one-to-one pickup-and-delivery traveling salesman problem
- The multi-commodity pickup-and-delivery traveling salesman 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
- 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
- Multi-start methods for combinatorial optimization
- Title not available (Why is that?)
- A tabu thresholding algorithm for arc crossing minimization in bipartite graphs
- The multi-commodity one-to-one pickup-and-delivery traveling salesman problem: A matheuristic
- Title not available (Why is that?)
- A genetic/tabu thresholding hybrid algorithm for the process allocation problem
- Title not available (Why is that?)
Cited In (5)
- Dynamic multi-stage failure-specific cooperative recourse strategy for logistics with simultaneous pickup and delivery
- Hybrid search with neighborhood reduction for the multiple traveling salesman problem
- Vehicle routing problems with multiple commodities: a survey
- An adaptive tabu search algorithm embedded with iterated local search and route elimination for the bike repositioning and recycling problem
- A multicommodity pickup and delivery problem with time windows and handling time in the omni-channel last-mile delivery
Uses Software
This page was built for publication: A population algorithm based on randomized tabu thresholding for the multi-commodity pickup-and-delivery traveling salesman problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1628071)
