The vehicle routing problem with backhauls

DOI10.1016/0377-2217(89)90057-XzbMath0669.90074OpenAlexW2067546516MaRDI QIDQ1119178

Charlotte Jacobs-Blecha, Marc Goetchalckx

Publication date: 1989

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(89)90057-x

zbMATH Keywords

heuristicsvehicle routinglogisticsgreedy algorithmsbackhaulscomputational analysisK-median algorithmspickup/delivery problemspacefilling curvestwo-phased solution methodology

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Inventory, storage, reservoirs (90B05) Boolean programming (90C09)

Related Items

The multiple trip vehicle routing problem with backhauls in random fuzzy environment: using (α,β)-cost minimization model under the Hurwicz criterion, A unified heuristic for a large class of vehicle routing problems with backhauls, The spacefilling curve with optimal partitioning heuristic for the vehicle routing problem, A heuristic method for the vehicle routing problem with mixed deliveries and pickups, Rich vehicle routing problems: from a taxonomy to a definition, 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, Hybrid algorithms for the vehicle routing problem with clustered backhauls and 3D loading constraints, 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, A new branching strategy for time constrained routing problems with application to backhauling, Routing problems: A bibliography, AN ALGORITHM FOR THE GENERALIZED VEHICLE ROUTING PROBLEM WITH BACKHAULING, The traveling salesman problem with backhauls, A heuristic algorithm for the symmetric and asymmetric vehicle routing problems with backhauls, Self-organizing feature maps for the vehicle routing problem with backhauls, A multiperiod drayage problem with customer-dependent service periods, 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, On the exact solution of vehicle routing problems with backhauls, Multi-trip pickup and delivery problem with time windows and synchronization, A Lagrangian relaxation-based heuristic for the vehicle routing with full container load, Creating lasso-solutions for the traveling salesman problem with pickup and delivery by tabu search, Solution strategies for the vehicle routing problem with backhauls, An iterated local search algorithm for the vehicle routing problem with convex time penalty functions, A SCATTER SEARCH FOR MULTI-DEPOT VEHICLE ROUTING PROBLEM WITH WEIGHT-RELATED COST, Heuristics for vehicle routing problems with backhauls, time windows, and 3D loading constraints, Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries, A new tabu search algorithm for the vehicle routing problem with backhauls, Probabilistic time-dependent vehicle routing problem, A unified solution framework for multi-attribute vehicle routing problems, 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, Combination of local search and CLP in the vehicle-fleet scheduling problem, Heuristic approaches to vehicle routing with backhauls and time windows, A parametric analysis of heuristics for the vehicle routing problem with side-constraints, Perturbation heuristics for the pickup and delivery traveling salesman problem, 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, Heuristics for multi-attribute vehicle routing problems: a survey and synthesis

Uses Software

• VRP

Cites Work

• An O(N log N) planar travelling salesman heuristic based on spacefilling curves
• Algorithm 37. Algorithm for the solution of the 0-1 single Knapsack problem
• The Truck Dispatching Problem
• Heuristics Based on Spacefilling Curves for Combinatorial Problems in Euclidean Space
• Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
• A branch and bound algorithm for the generalized assignment problem
• A Heuristic Algorithm for the Vehicle-Dispatch Problem
• Algorithms for Large-scale Travelling Salesman Problems
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• Unnamed Item
• Unnamed Item