A branch-and-cut algorithm for the time window assignment vehicle routing problem

DOI10.1016/J.COR.2017.08.015zbMath1391.90051OpenAlexW2753434807MaRDI QIDQ1652456

Remy Spliet, Kevin Dalmeijer

Publication date: 11 July 2018

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: http://repub.eur.nl/pub/97802

zbMATH Keywords

vehicle routingtime window assignmentprecedence inequalities

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80)

Related Items (6)

Stochastic optimization models for a home service routing and appointment scheduling problem with random travel and service times ⋮ A survey of attended home delivery and service problems with a focus on applications ⋮ Route-based approximate dynamic programming for dynamic pricing in attended home delivery ⋮ On solving the time window assignment vehicle routing problem via iterated local search ⋮ Addressing Orientation Symmetry in the Time Window Assignment Vehicle Routing Problem ⋮ Time window optimization for attended home service delivery under multiple sources of uncertainties

Uses Software

• CVRPSEP
• CVRPSP

Cites Work

• The discrete time window assignment vehicle routing problem
• Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints
• The Euclidean traveling salesman problem is NP-complete
• Stochastic vehicle routing
• A new branch-and-cut algorithm for the capacitated vehicle routing problem
• Self-imposed time windows in vehicle routing problems
• Integer Programming Formulation of Traveling Salesman Problems
• Topological sorting of large networks
• Optimal Routing under Capacity and Distance Restrictions
• A polyhedral study of the asymmetric traveling salesman problem with time windows
• An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation
• Solving the asymmetric travelling salesman problem with time windows by branch-and-cut

This page was built for publication: A branch-and-cut algorithm for the time window assignment vehicle routing problem