A Pricing Algorithm for the Vehicle Routing Problem with Soft Time Windows

DOI10.1007/978-3-540-92944-4_13zbMath1178.90044OpenAlexW1506410475MaRDI QIDQ5850940

Matteo Salani, Federico Liberatore, Giovanni Righini

Publication date: 20 January 2010

Published in: Lecture Notes in Economics and Mathematical Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-92944-4_13

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10)

Related Items (1)

A branch-and-price algorithm for the multi-depot heterogeneous-fleet pickup and delivery problem with soft time windows

Cites Work

• Unnamed Item
• Unnamed Item
• Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming
• A branch-and-cut algorithm for the capacitated profitable tour problem
• Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints
• Accelerated label setting algorithms for the elementary resource constrained shortest path problem
• Pickup and Delivery of Partial Loads with “Soft” Time Windows
• An Optimization-Based Heuristic for Vehicle Routing and Scheduling with Soft Time Window Constraints
• Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW
• A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
• An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
• A metaheuristic for the vehicle-routeing problem with soft time windows
• Simple Heuristics for the Vehicle Routeing Problem with Soft Time Windows

This page was built for publication: A Pricing Algorithm for the Vehicle Routing Problem with Soft Time Windows