Time dependent vehicle routing problem with a multi ant colony system

@article{Donati2008TimeDV,
  title={Time dependent vehicle routing problem with a multi ant colony system},
  author={Alberto V. Donati and Roberto Montemanni and Norman Casagrande and Andrea Emilio Rizzoli and Luca Maria Gambardella},
  journal={Eur. J. Oper. Res.},
  year={2008},
  volume={185},
  pages={1174-1191}
}
View via Publisher
people.idsia.ch
366 Citations
Highly Influential Citations
32
Background Citations
106
Methods Citations
103
Results Citations
10

366 Citations

Citation Type

Citation Type

An Ant Colony Algorithm for Time-Dependent Vehicle Routing Problem with Time Windows
TLDR
This paper proposes an Ant Colony Optimization algorithm and implements the algorithm to solve the time-dependent case where the objective is to minimize the total tour time, and addresses the Vehicle Routing Problem with Time Windows, both time-independent and -dependent cases.
A Heuristic for the Time-Dependent Vehicle Routing Problem with Time Windows
TLDR
A heuristic based on column generation and on Variable Neighborhood Descent (vnd) for solving the Time-Dependent Vehicle Routing Problem (tdvrptw), a generalization of the Vehicle Routed Problem with Time Windows where the travel time between any pair of clients can vary over the time.
An Ant Colony heuristic for the Time Dependent Vehicle Routing Problem with Time Windows
TLDR
An Ant Colony heuristic for the Time Dependent Vehicle Routing Problem with Time Windows is presented and turned out to be competitive when tested with Solomon’s benchmark instances.
A network-consistent time-dependent travel time layer for routing optimization problems
Multi-trip time-dependent vehicle routing problem with time windows
Branch and cut and price for the time dependent vehicle routing problem with time windows
TLDR
This paper proposes the first exact method to solve the Time-Dependent Vehicle Routing Problem with Time Windows (TDVRPTW), and aims to determine the set of routes with the least total travel time.
A hybrid algorithm for time-dependent vehicle routing problem with time windows
A Branch-and-price Algorithm for the Vehicle Routing Problem with Time Dependent Travel Times
TLDR
A branch-and-price algorithm to solve the time dependent vehicle routing problem (TDVRP), which assumes that the travel time between two locations is not only affected by the distance traveled, but by many other factors including the time of the day.
A model for the time dependent vehicle routing problem with time windows under traffic conditions with intelligent travel times
TLDR
A new mixed-integer nonlinear programming model is presented for the time-dependent vehicle routing problem with time windows and intelligent travel times and results indicate that the initial travel time is estimated appropriately and updated properly in accordance with to the repeating traffic conditions.
Solving the Time Dependent Vehicle Routing Problem Using Real-world Speed Profiles
TLDR
The proposed research will take into account the timedependent aspects of the traffic environment and solve two complex problems: finding a time dependent shortest path in a graph, and solving the time dependent vehicle routing problem.
...
...

References

SHOWING 1-10 OF 48 REFERENCES
Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms
TLDR
Mixed integer linear programming formulations of the TDVRP and the TDTSP are presented that treat the travel time functions as step functions that preclude modification of most of the algorithms that have been developed for the vehicle routing problem.
Vehicle dispatching with time-dependent travel times
Applying the ANT System to the Vehicle Routing Problem
TLDR
A recently proposed metaheuristic, the Ant System, is used to solve the Vehicle Routing Problem in its basic form, i.e., with capacity and distance restrictions, one central depot and identical vehicles.
Ant system: optimization by a colony of cooperating agents
TLDR
It is shown how the ant system (AS) can be applied to other optimization problems like the asymmetric traveling salesman, the quadratic assignment and the job-shop scheduling, and the salient characteristics-global data structure revision, distributed communication and probabilistic transitions of the AS.
MAX-MIN Ant System and local search for the traveling salesman problem
  • T. Stutzle, H. Hoos
  • Computer Science
    Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97)
  • 1997
TLDR
The results clearly show that MAX-MIN Ant System has the property of effectively guiding the local search heuristics towards promising regions of the search space by generating good initial tours.
An improved Ant System algorithm for theVehicle Routing Problem
TLDR
An improved ant system algorithm for the Vehicle RoutingProblem with one central depot and identical vehicles is presented and a comparison with five other metaheuristic approaches for solving Vehicle Routed Problems is given.
Ant colony system: a cooperative learning approach to the traveling salesman problem
TLDR
The results show that the ACS outperforms other nature-inspired algorithms such as simulated annealing and evolutionary computation, and it is concluded comparing ACS-3-opt, a version of the ACS augmented with a local search procedure, to some of the best performing algorithms for symmetric and asymmetric TSPs.
HAS-SOP: Hybrid Ant System for the Sequential Ordering Problem
TLDR
Experimental results on a set of twenty-three test problems taken from the TSPLIB show that HAS-SOP outperforms existing methods both in terms of solution quality and computation time.
Ant-Q: A Reinforcement Learning Approach to the Traveling Salesman Problem
An Ant Colony System Hybridized with a New Local Search for the Sequential Ordering Problem
We present a new local optimizer called SOP-3-exchange for the sequential ordering problem that extends a local search for the traveling salesman problem to handle multiple constraints directly…
...
...