The travelling salesman problem with pick-up and delivery
From MaRDI portal
Publication:1342068
DOI10.1016/0377-2217(94)90360-3zbMath0815.90135OpenAlexW2032686693MaRDI QIDQ1342068
Publication date: 11 January 1995
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(94)90360-3
Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06)
Related Items (36)
An algorithm for the one commodity pickup and delivery traveling salesman problem with restricted depot ⋮ Reference policies for non-myopic sequential network design and timing problems ⋮ A population algorithm based on randomized tabu thresholding for the multi-commodity pickup-and-delivery traveling salesman problem ⋮ A heuristic method for the vehicle routing problem with mixed deliveries and pickups ⋮ The traveling salesman problem with delivery and backhauls ⋮ A hybrid heuristic approach for the multi-commodity pickup-and-delivery traveling salesman problem ⋮ Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery ⋮ Single liner shipping service design ⋮ A memetic algorithm for the capacitated location-routing problem with mixed backhauls ⋮ Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder) ⋮ A traveling salesman problem with pickups and deliveries, time windows and draft limits: case study from chemical shipping ⋮ A parallel variable neighborhood search for the vehicle routing problem with divisible deliveries and pickups ⋮ Heuristic algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem ⋮ CLOVES: a cluster-and-search heuristic to solve the vehicle routing problem with delivery and pick-up ⋮ An approximation algorithm for the pickup and delivery vehicle routing problem on trees ⋮ General solutions to the single vehicle routing problem with pickups and deliveries ⋮ Self-organizing feature maps for the vehicle routing problem with backhauls ⋮ A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem ⋮ A branch-and-cut algorithm for the one-commodity pickup and delivery location routing problem ⋮ Creating lasso-solutions for the traveling salesman problem with pickup and delivery by tabu search ⋮ A reactive tabu search algorithm for the vehicle routing problem with simultaneous pickups and deliveries ⋮ Vehicle routing problems with simultaneous pick-up and delivery service. ⋮ One-to-Many-to-One Single Vehicle Pickup and Delivery Problems ⋮ The single vehicle routing problem with deliveries and selective pickups ⋮ A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem ⋮ Metaheuristics for the traveling salesman problem with pickups, deliveries and handling costs ⋮ Counting feasible solutions of the traveling salesman problem with pickups and deliveries is \#\(P\)-complete ⋮ A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery ⋮ Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries ⋮ The vehicle routing problem with pickups and deliveries on some special graphs ⋮ The multi-commodity pickup-and-delivery traveling salesman problem ⋮ Lasso solution strategies for the vehicle routing problem with pickups and deliveries ⋮ Unified heuristics to solve routing problem of reverse logistics in sustainable supply chain ⋮ The multi-commodity one-to-one pickup-and-delivery traveling salesman problem ⋮ A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service ⋮ IntraClusTSP -- an incremental intra-cluster refinement heuristic algorithm for symmetric travelling salesman problem
Cites Work
This page was built for publication: The travelling salesman problem with pick-up and delivery
