A new exact algorithm to solve the multi-trip vehicle routing problem with time windows and limited duration

DOI10.1007/S10288-013-0238-ZMaRDI QIDQ483728zbMATH OpenOpenAlexFDO

Authors Florent Hernandez, Dominique Feillet, Rodolphe Giroudeau, Olivier Naud

Publication date 17 December 2014

Published in 4OR (Search for Journal in Brave)

Full work available at URL https://hal-lirmm.ccsd.cnrs.fr/lirmm-01056150/file/pub00039780.pdf

zbMATH Keywords

dynamic programmingtime windowscolumn generationvehicle routingbranch and pricemulti-trip

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Dynamic programming (90C39) Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06)

Recommendations

• Branch-and-price algorithms for the solution of the multi-trip vehicle routing problem with time windows
• Publication:4944279
• Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model
• An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles
• A new algorithm for vehicle routing problem with time windows and a limited number of vehicles

Cites work

• scientific article; zbMATH DE number 3550182 (Why is no real title available?)
• A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
• A tutorial on column generation and branch-and-price for vehicle routing problems
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• An adaptive guidance approach for the heuristic solution of a minimum multiple trip vehicle routing problem
• An exact algorithm for a single-vehicle routing problem with time windows and multiple routes
• An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles
• An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
• Branch-and-price: Column generation for solving huge integer programs
• Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model

Cited in

(17)

• A two‐tier urban delivery network with robot‐based deliveries
• Multi-trip time-dependent vehicle routing problem with time windows
• Branch-and-price approaches for real-time vehicle routing with picking, loading, and soft time windows
• A mixed-integer linear programming model for optimal vessel scheduling in offshore oil and gas operations
• A branch-and-price algorithm for a routing problem with inbound and outbound requests
• An exact solution framework for multitrip vehicle-routing problems with time windows
• Vehicle routing problems with multiple trips
• Multi-trip vehicle routing problem with order release time
• Solving vehicle routing problems with intermediate stops using VRPSolver models
• A set covering based matheuristic for a real-world city logistics problem
• Optimal vehicle routing with lower and upper bounds on route durations
• Branch-and-price algorithms for the solution of the multi-trip vehicle routing problem with time windows
• Vehicle routing problems with multiple trips
• Skewed general variable neighborhood search for the location routing scheduling problem
• A memetic algorithm for the multi trip vehicle routing problem
• Optimal scheduling of passenger air transportation in regional network
• A way to optimally solve a green time-dependent vehicle routing problem with time windows

Describes a project that uses

Uses Software

• VRP

This page was built for publication: A new exact algorithm to solve the multi-trip vehicle routing problem with time windows and limited duration

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