A LP-based heuristic for a time-constrained routing problem

DOI10.1016/j.ejor.2004.09.055zbMath1125.90031OpenAlexW2018902895MaRDI QIDQ2491773

Saverio Salerno, Pasquale Avella, Bernardo D'auria

Publication date: 29 May 2006

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2004.09.055

zbMATH Keywords

set packingcolumn-and-row generationIntelligent Tourist Problemtime constrained routing

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)

Related Items (6)

A note on ``A LP-based heuristic for a time-constrained routing problem ⋮ Two-dimensional skiving and cutting stock problem with setup cost based on column-and-row generation ⋮ Benders decomposition and column-and-row generation for solving large-scale linear programs with column-dependent-rows ⋮ Simultaneous column-and-row generation for large-scale linear programs with column-dependent-rows ⋮ Algorithms for the one-dimensional two-stage cutting stock problem ⋮ 0-1 reformulations of the multicommodity capacitated network design problem

Uses Software

• CPLEX
• VRP

Cites Work

• Unnamed Item
• Solving a fuel delivery problem by heuristic and exact approaches.
• Conflict graphs in solving integer programming problems
• The Vehicle Routing Problem
• Solving Airline Crew Scheduling Problems by Branch-and-Cut
• On the Effectiveness of Set Covering Formulations for the Vehicle Routing Problem with Time Windows
• A Set-Partitioning-Based Heuristic for the Vehicle Routing Problem
• A set‐partitioning‐based exact algorithm for the vehicle routing problem
• Solving the asymmetric travelling salesman problem with time windows by branch-and-cut

This page was built for publication: A LP-based heuristic for a time-constrained routing problem