Corpus ID: 211255672

Dynamic programming for the time-dependent traveling salesman problem with time windows∗

@inproceedings{LeraRomero2020DynamicPF,
  title={Dynamic programming for the time-dependent traveling salesman problem with time windows∗},
  author={Gonzalo Lera-Romero and Juan Jos{\'e} Miranda-Bront and Francisco J. Soulignac},
  year={2020}
}
The recent growth of direct-to-consumer deliveries has stressed the importance of last-mile logistics, becoming one of the critical factors in city planning. One of the key factors lies in the last-mile deliveries, reaching in some cases nearly 50% of the overall parcel delivery cost. Different variants of the the well-known Traveling Salesman Problem (TSP) arise naturally at the core of complex decision making processes within last mile logistics. The Time-Dependent Traveling Salesman Problem… CONTINUE READING

Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

References

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

Dynamic Programming for the Minimum Tour Duration Problem

VIEW 42 EXCERPTS
HIGHLY INFLUENTIAL

An enhanced lower bound for the Time-Dependent Travelling Salesman Problem

VIEW 12 EXCERPTS
HIGHLY INFLUENTIAL

Vehicle dispatching with time-dependent travel times

VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL