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

DOI10.1016/J.EJOR.2004.09.055MaRDI QIDQ2491773zbMATH OpenOpenAlexFDO

Authors S. 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

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

Recommendations

• On the tour planning problem
• A note on ``A LP-based heuristic for a time-constrained routing problem
• Technical Note—An Exact Algorithm for the Time-Constrained Traveling Salesman Problem
• Heuristics for the time dependent team orienteering problem: application to tourist route planning
• Methods for routing with time windows

Cites work

• scientific article; zbMATH DE number 956787 (Why is no real title available?)
• A Set-Partitioning-Based Heuristic for the Vehicle Routing Problem
• A set‐partitioning‐based exact algorithm for the vehicle routing problem
• Conflict graphs in solving integer programming problems
• On the Effectiveness of Set Covering Formulations for the Vehicle Routing Problem with Time Windows
• Solving Airline Crew Scheduling Problems by Branch-and-Cut
• Solving a fuel delivery problem by heuristic and exact approaches.
• Solving the asymmetric travelling salesman problem with time windows by branch-and-cut
• The vehicle routing problem

Cited in

(9)

• An Heuristic Method for Solving Time-Sensitive Routeing Problems
• Algorithms for the one-dimensional two-stage cutting stock problem
• Benders decomposition and column-and-row generation for solving large-scale linear programs with column-dependent-rows
• A simple perspective on simultaneous column and row generation
• A note on ``A LP-based heuristic for a time-constrained routing problem
• On the tour planning problem
• Two-dimensional skiving and cutting stock problem with setup cost based on column-and-row generation
• 0-1 reformulations of the multicommodity capacitated network design problem
• Simultaneous column-and-row generation for large-scale linear programs with column-dependent-rows

Describes a project that uses

Uses Software

• VRP
• CPLEX

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

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