Integrated ant colony and tabu search approach for time dependent vehicle routing problems with simultaneous pickup and delivery
From MaRDI portal
(Redirected from Publication:405689)
Recommendations
- A metaheuristic method for vehicle routing problem based on improved ant colony optimization and tabu search
- An Ant Colony algorithm hybridized with insertion heuristics for the Time Dependent Vehicle Routing Problem with Time Windows
- A hybrid metaheuristics approach for a multi-depot vehicle routing problem with simultaneous deliveries and pickups
- A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service
- A perturbation based variable neighborhood search heuristic for solving the vehicle routing problem with simultaneous pickup and delivery with time limit
Cites work
- scientific article; zbMATH DE number 1062113 (Why is no real title available?)
- scientific article; zbMATH DE number 2144502 (Why is no real title available?)
- A Reactive Tabu Search Metaheuristic for the Vehicle Routing Problem with Time Windows
- A Tabu Search Algorithm For The Site Dependent Vehicle Routing Problem With Time Windows
- A Tabu Search Heuristic for the Vehicle Routing Problem
- A Tabu Search Heuristic for the Vehicle Routing Problem with Backhauls and Time Windows
- A Tabu Search Heuristic for the Vehicle Routing Problem with Stochastic Demands and Customers
- A new rank based version of the ant system. -- A computational study
- A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery
- A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem
- A tabu search algorithm for the heterogeneous fixed fleet vehicle routing problem
- A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service
- A way to optimally solve a time-dependent vehicle routing problem with time windows
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- An Ant Colony algorithm hybridized with insertion heuristics for the Time Dependent Vehicle Routing Problem with Time Windows
- An ant colony system (ACS) for vehicle routing problem with simultaneous delivery and pickup
- Future paths for integer programming and links to artificial intelligence
- Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery
- Heuristics for the traveling salesman problem with pickup and delivery
- Improved tabu search algorithm for the handling of route duration constraints in vehicle routing problems with time windows
- Modelling Intra-City Time-Dependent Travel Speeds for Vehicle Scheduling Problems
- Multi colony ant algorithms
- Technical Note—An n-Constraint Formulation of the (Time-Dependent) Traveling Salesman Problem
- The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
- The vehicle-routing problem with delivery and back-haul options
- Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms
- Time dependent vehicle routing problem with a multi ant colony system
- Vehicle dispatching with time-dependent travel times
- Vehicle routing and reverse logistics: The vehicle routing problem with simultaneous delivery and pick-up
- Vehicle routing problems with simultaneous pick-up and delivery service.
Cited in
(16)- Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care
- A simheuristic algorithm for time-dependent waste collection management with stochastic travel times
- Solving the stochastic time-dependent orienteering problem with time windows
- Time-dependent routing problems: a review
- Pharmacy duty scheduling problem
- Shipper collaboration in forward and reverse logistics
- Application of a fuzzy ant colony system to solve the dynamic vehicle routing problem with uncertain service time
- Approximation schemes for Euclidean vehicle routing problems with time windows
- A metaheuristic method for vehicle routing problem based on improved ant colony optimization and tabu search
- A review of vehicle routing with simultaneous pickup and delivery
- An adaptive memory methodology for the vehicle routing problem with simultaneous pick-ups and deliveries
- Scatter search for the stochastic travel-time vehicle routing problem with simultaneous pick-ups and deliveries
- A risk-constrained time-dependent cash-in-transit routing problem in multigraph under uncertainty
- Electric vehicle routing problem with time-dependent waiting times at recharging stations
- A lower bound for the adaptive two-echelon capacitated vehicle routing problem
- A hybrid ant colony optimization-variable neighborhood descent approach for the cumulative capacitated vehicle routing problem
This page was built for publication: Integrated ant colony and tabu search approach for time dependent vehicle routing problems with simultaneous pickup and delivery
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q405689)