Heuristic approaches to vehicle routing with backhauls and time windows
From MaRDI portal
Publication:2564754
DOI10.1016/0305-0548(96)00018-4zbMath0867.90046OpenAlexW1969191070MaRDI QIDQ2564754
Tong Sun, Sam R. Thangiah, Jean-Yves Potvin
Publication date: 15 January 1997
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0305-0548(96)00018-4
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 ⋮ Hybrid algorithms for the vehicle routing problem with clustered backhauls and 3D loading constraints ⋮ Solving multiobjective vehicle routing problem with stochastic demand via evolutionary computation ⋮ A hybrid heuristic procedure for the windy rural postman problem with zigzag time windows ⋮ Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder) ⋮ 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 ⋮ Routing problems: A bibliography ⋮ AN ALGORITHM FOR THE GENERALIZED VEHICLE ROUTING PROBLEM WITH BACKHAULING ⋮ Self-organizing feature maps for the vehicle routing problem with backhauls ⋮ Multi-trip pickup and delivery problem with time windows and synchronization ⋮ Comparing backhauling strategies in vehicle routing using ant colony optimization ⋮ A reactive tabu search algorithm for the vehicle routing problem with simultaneous pickups and deliveries ⋮ 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 ⋮ Extended guided tabu search and a new packing algorithm for the two-dimensional loading vehicle routing problem ⋮ Metaheuristic for the Vehicle Routing Problem with Backhauls and Time Windows ⋮ Optimizing logistics routings in a network perspective of supply and demand nodes ⋮ A parametric analysis of heuristics for the vehicle routing problem with side-constraints ⋮ 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
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An algorithm for the traveling salesman problem with pickup and delivery customers
- The vehicle routing problem with backhauls
- The vehicle routing problem: An overview of exact and approximate algorithms
- A new branching strategy for time constrained routing problems with application to backhauling
- The traveling salesman problem with backhauls
- Probabilistic diversification and intensification in local search for vehicle routing
- Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
- A parallel route building algorithm for the vehicle routing and scheduling problem with time windows
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- Solution Improvement Heuristics for the Vehicle Routing and Scheduling Problem with Time Window Constraints
- An Optimization-Based Heuristic for Vehicle Routing and Scheduling with Soft Time Window Constraints
- An Exact Algorithm for the Vehicle Routing Problem with Backhauls
- Cyclic Transfer Algorithm for Multivehicle Routing and Scheduling Problems
- Algorithms for the Vehicle Routing Problems with Time Deadlines
- Capacitated clustering problems by hybrid simulated annealing and tabu search
- Computer Solutions of the Traveling Salesman Problem