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

DOI10.1016/J.COR.2017.08.015MaRDI QIDQ1652456zbMATH OpenOpenAlexFDO

Authors Kevin Dalmeijer, Remy Spliet

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

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

Recommendations

• The discrete time window assignment vehicle routing problem
• 2-path cuts for the vehicle routing problem with time windows
• A Branch-and-Cut Procedure for the Vehicle Routing Problem with Time Windows
• Addressing orientation symmetry in the time window assignment vehicle routing problem
• Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows

Cites work

• A new branch-and-cut algorithm for the capacitated vehicle routing problem
• 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
• Integer Programming Formulation of Traveling Salesman Problems
• Optimal Routing under Capacity and Distance Restrictions
• Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints
• Self-imposed time windows in vehicle routing problems
• Solving the asymmetric travelling salesman problem with time windows by branch-and-cut
• Stochastic vehicle routing
• The Euclidean traveling salesman problem is NP-complete
• The discrete time window assignment vehicle routing problem
• Topological sorting of large networks

Cited in

(14)

• Time window optimization for attended home service delivery under multiple sources of uncertainties
• Stochastic optimization models for a home service routing and appointment scheduling problem with random travel and service times
• Mathematical formulations for consistent travelling salesman problems
• A branch and cut algorithm for the time-dependent profitable tour problem with resource constraints
• Delay-resistant robust vehicle routing with heterogeneous time windows
• Consistent routing for local same-day delivery via micro-hubs
• Multi-period time window assignment for attended home delivery
• A survey of attended home delivery and service problems with a focus on applications
• On solving the time window assignment vehicle routing problem via iterated local search
• Route-based approximate dynamic programming for dynamic pricing in attended home delivery
• The discrete time window assignment vehicle routing problem
• Branch-and-price algorithms for the solution of the multi-trip vehicle routing problem with time windows
• Addressing orientation symmetry in the time window assignment vehicle routing problem
• General VNS for asymmetric vehicle routing problem with time and capacity constraints

Describes a project that uses

Uses Software

• CVRPSEP
• CVRPSP

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1652456)