An adaptive large neighborhood search for the two-echelon multiple-trip vehicle routing problem with satellite synchronization

@article{Grangier2016AnAL,
  title={An adaptive large neighborhood search for the two-echelon multiple-trip vehicle routing problem with satellite synchronization},
  author={Philippe Grangier and Michel Gendreau and Fabien Lehu{\'e}d{\'e} and Louis-Martin Rousseau},
  journal={European Journal of Operational Research},
  year={2016},
  volume={254},
  pages={80-91}
}
The two-echelon vehicle routing problem (2E-VRP) consists in making deliveries to a set of customers using two distinct fleets of vehicles. First-level vehicles pick up requests at a distribution center and bring them to intermediate sites. At these locations, the requests are transferred to second-level vehicles, which deliver them. This paper addresses a variant of the 2E-VRP that integrates constraints arising in City Logistics such as time window constraints, synchronization constraints… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-10 of 17 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 42 references

A Hybrid GRASP+ VND heuristic for the two-echelon vehicle routing problem arising in City Logistics

  • Zheng-Yang Zeng, W Xu, Zhi-Yu Xu, Wei-Hui Shao
  • Technical report, School of Electronics and…
  • 2014
1 Excerpt

The DialA - Ride Problem with Transfers

  • A. Trentini Masson, F. Lehuédé, N. Malhéné, O. Péton, H. Tlahig
  • Computers & Operations Research
  • 2014

Similar Papers

Loading similar papers…