Heuristics for the traveling salesman problem with pickup and delivery
From MaRDI portal
Publication:1302721
DOI10.1016/S0305-0548(98)00085-9zbMath0957.90069OpenAlexW1999750851MaRDI QIDQ1302721
Gilbert Laporte, Daniele Vigo, Michel Gendreau
Publication date: 22 September 1999
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0305-0548(98)00085-9
Search theory (90B40) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items
A unified heuristic for a large class of vehicle routing problems with backhauls, A heuristic method for the vehicle routing problem with mixed deliveries and pickups, Mathematical formulations for a 1-full-truckload pickup-and-delivery problem, 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), A traveling salesman problem with pickups and deliveries, time windows and draft limits: case study from chemical shipping, Multi-restart iterative search for the pickup and delivery traveling salesman problem with FIFO loading, 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, Analyses of advanced iterated tour partitioning heuristics for generalized vehicle routing problems, A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem, Pickup and delivery problems with autonomous vehicles on rings, Learn global and optimize local: a data-driven methodology for last-mile routing, Integrated ant colony and tabu search approach for time dependent vehicle routing problems with simultaneous pickup and delivery, 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, Scatter search for the stochastic travel-time vehicle routing problem with simultaneous pick-ups and deliveries, Metaheuristics for the traveling salesman problem with pickups, deliveries and handling costs, 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 pickup and delivery traveling salesman problem with first-in-first-out loading, The vehicle routing problem with simultaneous pickup and delivery and handling costs, The multi-commodity pickup-and-delivery traveling salesman problem, Lasso solution strategies for the vehicle routing problem with pickups and deliveries, A covering traveling salesman problem with profit in the last mile delivery, Unified heuristics to solve routing problem of reverse logistics in sustainable supply chain, An adaptive memory methodology for the vehicle routing problem with simultaneous pick-ups and deliveries, A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service, A truck scheduling problem arising in intermodal container transportation
