Integrated ant colony and tabu search approach for time dependent vehicle routing problems with simultaneous pickup and delivery
DOI10.1007/s10878-014-9741-1zbMath1303.90012OpenAlexW2043800474MaRDI QIDQ405689
Tao Zhang, Yue-Jie Zhang, Wanpracha Art Chaovalitwongse
Publication date: 5 September 2014
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-014-9741-1
reverse logisticstabu search algorithmant colony systemtime dependent vehicle routing problemVRP with simultaneous pick-ups and deliveries (VRPSPD)
Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35)
Related Items (12)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- An Ant Colony algorithm hybridized with insertion heuristics for the Time Dependent Vehicle Routing Problem with Time Windows
- A tabu search algorithm for the heterogeneous fixed fleet vehicle routing problem
- An ant colony system (ACS) for vehicle routing problem with simultaneous delivery and pickup
- Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery
- A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery
- A way to optimally solve a time-dependent vehicle routing problem with time windows
- A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem
- Heuristics for the traveling salesman problem with pickup and delivery
- A new rank based version of the ant system. -- A computational study
- Future paths for integer programming and links to artificial intelligence
- Multi colony ant algorithms
- Vehicle dispatching with time-dependent travel times
- Time dependent vehicle routing problem with a multi ant colony system
- Vehicle routing problems with simultaneous pick-up and delivery service.
- A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- Modelling Intra-City Time-Dependent Travel Speeds for Vehicle Scheduling Problems
- Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms
- The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
- A Tabu Search Heuristic for the Vehicle Routing Problem with Backhauls and Time Windows
- A Reactive Tabu Search Metaheuristic for the Vehicle Routing Problem with Time Windows
- Improved tabu search algorithm for the handling of route duration constraints in vehicle routing problems with time windows
- Technical Note—An n-Constraint Formulation of the (Time-Dependent) Traveling Salesman Problem
- A Tabu Search Heuristic for the Vehicle Routing Problem
- The vehicle-routing problem with delivery and back-haul options
- A Tabu Search Heuristic for the Vehicle Routing Problem with Stochastic Demands and Customers
- A Tabu Search Algorithm For The Site Dependent Vehicle Routing Problem With Time Windows
- Vehicle routing and reverse logistics: The vehicle routing problem with simultaneous delivery and pick-up
This page was built for publication: Integrated ant colony and tabu search approach for time dependent vehicle routing problems with simultaneous pickup and delivery