The Time-Dependent Multiple-Vehicle Prize-Collecting Arc Routing Problem

@inproceedings{Black2015TheTM,
  title={The Time-Dependent Multiple-Vehicle Prize-Collecting Arc Routing Problem},
  author={Daniel David Black and Richard W. Eglese and Sanne W{\o}hlk},
  year={2015}
}
In this paper, we introduce a multi vehicle version of the Time-Dependent Prize-Collecting Arc Routing Problem (TD-MPARP). It is inspired by a situation where a transport manager has to choose between a number of full truck load pick-ups and deliveries to be performed by a fleet of vehicles. Real-life traffic situations where the travel times change with the time of day are taken into account. Two metaheuristic algorithms, one based on Variable Neighborhood Search and one based on Tabu Search… CONTINUE READING

Figures and Tables from this paper.

Citations

Publications citing this paper.

References

Publications referenced by this paper.
SHOWING 1-10 OF 34 REFERENCES

Variable Neighborhood Search

N Mladenovir, E Hansen 't
  • Lecture Notes in Computer Science
  • 2018
VIEW 2 EXCERPTS

Similar Papers