A Two-Stage Hybrid Algorithm for Pickup and Delivery Vehicle Routing Problems with Time Windows

@inproceedings{Bent2003ATH,
  title={A Two-Stage Hybrid Algorithm for Pickup and Delivery Vehicle Routing Problems with Time Windows},
  author={Russell Bent and Pascal Van Hentenryck},
  booktitle={CP},
  year={2003}
}
This paper presents a two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows and multiple vehicles (PDPTW). The first stage uses a simple simulated annealing algorithm to decrease the number of routes, while the second stage uses LNS to decrease total travel cost. Experimental results show the effectiveness of the algorithm which has produced many new best solutions on problems with 100, 200, and 600 customers. In particular, it has improved 47% and 76% of… Expand
Combining Heuristic and Exact Methods to Solve the Vehicle Routing Problem with Pickups, Deliveries and Time Windows
TLDR
A new method based on branch and bound optimisation attempts to optimise the final ordering of requests in routes to further improve the solutions of the vehicle routing problem with pickups, deliveries and time windows. Expand
A New Two-phase Hybrid Metaheuristic for Vehicle Routing Problem with Time Windows
This paper proposes a new two-phase hybrid metaheuristic for vehicle routing problems with time windows (VRPTW). The first phase is to minimize the number of routes by means of variable neighborhoodExpand
Ant Colony Optimization Algorithm for Pickup and Delivery Problem with Time Windows
TLDR
Experimental results on 56 instances of 100 customers of Li and Lim’s benchmark show that the ACO coupled with PDPTW dedicated local search algorithms outperform existing algorithms. Expand
A heuristic for the vehicle routing problem with due times
TLDR
This paper studies the vehicle routing problem with due times and suggests a mixed integer programming formulation and a heuristic based on the tabu search for a practical use that gives a good solution in a short computation time. Expand
A guided simulated annealing search for solving the pick-up and delivery problem with time windows and capacity constraints
Routing and scheduling requests with pick-ups and deliveries is still one of the greatest operative challenges in inter-company logistics. Pick-up and delivery activities have to be bundled intoExpand
Ant Colony Optimization for the Single Vehicle Pickup and Delivery Problem with Time Window
TLDR
Experimental results show that the proposed ACO can outperform genetic algorithm and tabu search in terms of solution quality and validate the effectiveness of the repair operator in improving the feasibility and length of routes. Expand
A heuristic method for the vehicle routing problem with backhauls and inventory
TLDR
A heuristic method, variable neighborhood tabu search (VNTS), adopting six neighborhood searching approaches to obtain the optimal solution of the vehicle routing problem with backhauls and inventory (VRPBI), is proposed. Expand
Solving Vehicle Routing Problem with Time Window Constraints
TLDR
A heuristic, tabu-disturbance algorithm (TDA), to efficiently and effectively solve vehicle routing problem with time window constraints (VRPTW). Expand
Heuristics for dynamic vehicle routing problems with pickups and deliveries and time windows
The work presented in this thesis concerns the problem of dynamic vehicle routing. The motivation for this is the increasing demands on transportation services to deliver fast, efficient and reliableExpand
Meta-Heuristic Algorithms Comparison for Heterogeneous Fleet and Split Delivery of Vehicle Routing Problem with Time Windows อนันต์ มุ่งวฒันา
This research is compared between the meta-heuristic algorithms for heterogeneous fleet and split delivery of vehicle routing problem with time windows (VRPTW). The objective is comparing theExpand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 26 REFERENCES
A Two-Stage Hybrid Local Search for the Vehicle Routing Problem with Time Windows
TLDR
A two-stage hybrid algorithm that minimizes the number of vehicles, using simulated annealing, and minimizes travel cost by using a large neighborhood search that may relocate a large number of customers is proposed. Expand
Two Evolutionary Metaheuristics For The Vehicle Routing Problem With Time Windows
TLDR
Two evolution strategies for solving the vehicle routing problem with time windows are proposed and generated new best known solutions indicate that evolution strategies are effective in reducing both the number of vehicles and the total travel distance. Expand
The Pickup and Delivery Problem with Time Windows
TLDR
This paper presents an exact algorithm which solves the pickup and delivery problem when transporting goods using a column generation scheme with a constrained shortest path as a subproblem. Expand
Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
  • M. Solomon
  • Mathematics, Computer Science
  • Oper. Res.
  • 1987
TLDR
This paper considers the design and analysis of algorithms for vehicle routing and scheduling problems with time window constraints and finds that several heuristics performed well in different problem environments; in particular an insertion-type heuristic consistently gave very good results. Expand
Solving the Pickup and Delivery Problem with Time Windows Using Reactive Tabu Search Transportation
TLDR
A reactive tabu search approach is presented to solve the pickup and delivery problem with time windows using three distinct move neighborhoods that capitalize on the dominance of the precedence and coupling constraints. Expand
Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems
TLDR
This work uses a local search method that is analogous to the shuffling technique of job-shop scheduling, and so meshes well with constraint programming technology, to solve vehicle routing problems. Expand
SOLVING THE PICKUP AND DELIVERY PROBLEM WITH TIME WINDOWS USING iSSQUEAKY WHEELli OPTIMIZATION WITH LOCAL SEARCH
TLDR
Deployment of a relatively new optimization technique, known as “Squeaky Wheel” Optimization (SWO), to the Pickup and Delivery Problem with Time Windows to minimize the fleet size, travel distances, schedule durations and waiting times is described. Expand
Pickup and Delivery with Time Windows: Algorithms and Test Case Generation
TLDR
A two-phase method to solve the PDPTW is presented, in the first phase, a novel construction heuristics is applied to generate an initial solution, and a tabu search method is proposed to improve the solution. Expand
A Dynamic Programming Solution to the Single Vehicle Many-to-Many Immediate Request Dial-a-Ride Problem
TLDR
An investigation of the single-vehicle, many-to-many, immediate-request dial-a-ride problem is developed, with a Dynamic Programming approach which exhibits a computational effort which is asymptotically lower than the corresponding effort of the classical Dynamic Programming algorithm applied to a Traveling Salesman Problem of the same size. Expand
Vehicle Routing with Time Windows: Two Optimization Algorithms
TLDR
A K-Tree relaxation with time windows added as side constraints and a Lagrangian decomposition in which variable splitting is used to divide the problem into two subproblems—a semi-assignment problem and a series of shortest path problems with time window constraints. Expand
...
1
2
3
...