A hybrid heuristic approach for the multi-commodity one-to-one pickup-and-delivery traveling salesman problem
From MaRDI portal
Publication:2359136
Recommendations
- The multi-commodity one-to-one pickup-and-delivery traveling salesman problem: A matheuristic
- A hybrid heuristic approach for the multi-commodity pickup-and-delivery traveling salesman problem
- A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem
- The multi-commodity one-to-one pickup-and-delivery traveling salesman problem
- The multi-commodity pickup-and-delivery traveling salesman problem
Cites work
- scientific article; zbMATH DE number 870411 (Why is no real title available?)
- A Cutting Plane Approach to the Sequential Ordering Problem (with Applications to Job Scheduling in Manufacturing)
- A branch \& cut algorithm for the asymmetric traveling salesman problem with precedence constraints
- A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery
- A branch-and-cut algorithm for solving the Non-preemptive Capacitated Swapping Problem
- A heuristic for the pickup and delivery traveling salesman problem
- A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem
- An Ant Colony System Hybridized with a New Local Search for the Sequential Ordering Problem
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- An algorithm for the traveling salesman problem with pickup and delivery customers
- Exploring relaxation induced neighborhoods to improve MIP solutions
- Greedy randomized adaptive search procedures
- Local branching
- Matheuristics
- Models for the single-vehicle preemptive pickup and delivery problem
- On extended formulations for the precedence constrained asymmetric traveling salesman problem
- Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
- The General Pickup and Delivery Problem
- The multi-commodity one-to-one pickup-and-delivery traveling salesman problem
- The swapping problem
- The traveling salesman problem with backhauls
- The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm
- Variable neighborhood search
Cited in
(12)- The multicommodity traveling salesman problem with priority prizes: a mathematical model and metaheuristics
- An ILP-based local search procedure for the VRP with pickups and deliveries
- A population algorithm based on randomized tabu thresholding for the multi-commodity pickup-and-delivery traveling salesman problem
- The multi-commodity pickup-and-delivery traveling salesman problem
- An MDD-Based Lagrangian Approach to the Multicommodity Pickup-and-Delivery TSP
- A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem
- Das tourenproblem mit fahrzeugen untersehiedlicher ladekapazität
- A survey on matheuristics for routing problems
- The multi-commodity one-to-one pickup-and-delivery traveling salesman problem: A matheuristic
- A hybrid heuristic approach for the multi-commodity pickup-and-delivery traveling salesman problem
- Load-dependent and precedence-based models for pickup and delivery problems
- 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 hybrid heuristic approach for the multi-commodity one-to-one 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 Q2359136)
