A population algorithm based on randomized tabu thresholding for the multi-commodity pickup-and-delivery traveling salesman problem
From MaRDI portal
Publication:1628071
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
Cites work
- scientific article; zbMATH DE number 5829047 (Why is no real title available?)
- scientific article; zbMATH DE number 1054944 (Why is no real title available?)
- scientific article; zbMATH DE number 1054954 (Why is no real title available?)
- scientific article; zbMATH DE number 1953194 (Why is no real title available?)
- A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem
- A genetic/tabu thresholding hybrid algorithm for the process allocation problem
- A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem
- A hybrid heuristic approach for 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
- A hybrid metaheuristic approach for the capacitated arc routing problem
- A new adaptive multi-start technique for combinatorial global optimizations
- A population-based variable neighborhood search for the single machine total weighted tardiness problem
- A tabu thresholding algorithm for arc crossing minimization in bipartite graphs
- A tabu thresholding implementation for the irregular stock cutting problem
- Load-dependent and precedence-based models for pickup and delivery problems
- MILP formulations and an iterated local search algorithm with tabu thresholding for the order batching problem
- Multi-start methods for combinatorial optimization
- Probabilistic GRASP-tabu search algorithms for the UBQP problem
- Tabu Thresholding: Improved Search by Nonmonotonic Trajectories
- The multi-commodity one-to-one pickup-and-delivery traveling salesman problem
- The multi-commodity one-to-one pickup-and-delivery traveling salesman problem: A matheuristic
- The multi-commodity pickup-and-delivery traveling salesman problem
- The one‐commodity pickup‐and‐delivery traveling salesman problem: Inequalities and algorithms
- The travelling salesman problem with pick-up and delivery
Cited in
(5)- 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
- Dynamic multi-stage failure-specific cooperative recourse strategy for logistics with simultaneous pickup and delivery
- A multicommodity pickup and delivery problem with time windows and handling time in the omni-channel last-mile delivery
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)