A heuristic algorithm for the symmetric and asymmetric vehicle routing problems with backhauls
From MaRDI portal
Publication:1124810
DOI10.1016/S0377-2217(98)00086-1zbMath0947.90011OpenAlexW2079224263WikidataQ127294393 ScholiaQ127294393MaRDI QIDQ1124810
Publication date: 8 November 2000
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(98)00086-1
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
A unified heuristic for a large class of vehicle routing problems with backhauls, A deterministic iterated local search algorithm for the vehicle routing problem with backhauls, Multi-ant colony system (MACS) for a vehicle routing problem with backhauls, Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery, A biased-randomised large neighbourhood search for the two-dimensional vehicle routing problem with backhauls, A memetic algorithm for a vehicle routing problem with backhauls, Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder), The multiple trip vehicle routing problem with backhauls: formulation and a two-level variable neighbourhood search, Vehicle routing with backhauls: review and research perspectives, CLOVES: a cluster-and-search heuristic to solve the vehicle routing problem with delivery and pick-up, AN ALGORITHM FOR THE GENERALIZED VEHICLE ROUTING PROBLEM WITH BACKHAULING, Self-organizing feature maps for the vehicle routing problem with backhauls, New valid inequalities for the symmetric vehicle routing problem with simultaneous pickup and deliveries, An iterative biased‐randomized heuristic for the fleet size and mix vehicle‐routing problem with backhauls, Optimisation d'un réseau de logistique inverse pour le transport des matières dangereuses résiduelles, A decision framework for automatic guided vehicle routing problem with traffic congestions, A novel two-phase heuristic method for vehicle routing problem with backhauls, A hybrid multi-objective evolutionary algorithm for solving truck and trailer vehicle routing problems, Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries, Validating vehicle routing zone construction using Monte Carlo simulation, A heuristic algorithm for the truckload and less-than-truckload problem, A new tabu search algorithm for the vehicle routing problem with backhauls, An iterated local search algorithm for the vehicle routing problem with backhauls, A new model for the asymmetric vehicle routing problem with simultaneous pickup and deliveries, An interactive GRAMPS algorithm for the heterogeneous fixed fleet vehicle routing problem with and without backhauls, A reactive tabu search meta-heuristic for the vehicle routing problem with back-hauls, Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care, Finite and infinite-horizon single vehicle routing problems with a predefined customer sequence and pickup and delivery
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The vehicle routing problem with backhauls
- An O(N log N) planar travelling salesman heuristic based on spacefilling curves
- An additive bounding procedure for the asymmetric travelling salesman problem
- A heuristic algorithm for the asymmetric capacitated vehicle routing problem
- An Algorithm for the Bottleneck Traveling Salesman Problem
- TSPLIB—A Traveling Salesman Problem Library
- An Exact Algorithm for the Vehicle Routing Problem with Backhauls
- Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
- A Branch-and-Bound Algorithm for the Capacitated Vehicle Routing Problem on Directed Graphs
