The traveling salesman problem with delivery and backhauls
From MaRDI portal
Publication:1342089
DOI10.1016/0167-6377(94)90016-7zbMath0814.90119OpenAlexW1991798215MaRDI QIDQ1342089
Publication date: 11 January 1995
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6377(94)90016-7
Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60)
Related Items
An algorithm for the one commodity pickup and delivery traveling salesman problem with restricted depot, A heuristic method for the vehicle routing problem with mixed deliveries and pickups, Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery, Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder), 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, Approximation algorithms for the capacitated traveling salesman problem with pickups and deliveries, 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, 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, Unified heuristics to solve routing problem of reverse logistics in sustainable supply chain, A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service
Cites Work
