A Time-Dependent No-Overlap Constraint: Application to Urban Delivery Problems
From MaRDI portal
Publication:5741450
DOI10.1007/978-3-319-18008-3_1zbMath1464.90071OpenAlexW841791096MaRDI QIDQ5741450
Philippe Laborie, Christine Solnon, Penélope Aguiar Melgarejo
Publication date: 25 July 2016
Published in: Integration of AI and OR Techniques in Constraint Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-18008-3_1
Related Items (7)
An integer programming approach for the time-dependent traveling salesman problem with time windows ⋮ On path ranking in time-dependent graphs ⋮ Solving the time dependent minimum tour duration and delivery man problems with dynamic discretization discovery ⋮ Exact and anytime approach for solving the time dependent traveling salesman problem with time windows ⋮ An enhanced lower bound for the time-dependent travelling salesman problem ⋮ Iterated maximum large neighborhood search for the traveling salesman problem with time windows and its time-dependent version ⋮ An assign-and-route matheuristic for the time-dependent inventory routing problem
This page was built for publication: A Time-Dependent No-Overlap Constraint: Application to Urban Delivery Problems
