Exact algorithms for the traveling salesman problem with draft limits

DOI10.1016/J.EJOR.2013.10.042MaRDI QIDQ2256207zbMATH OpenOpenAlexFDO

Authors Maria Battarra, Artur Alves Pessoa, A. Subramanian, Eduardo Uchoa

Publication date 19 February 2015

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

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

zbMATH Keywords

cutting planescolumn generationtraveling salesmanextended formulationdraft limits

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Transportation, logistics and supply chain management (90B06)

Recommendations

• The traveling salesman problem with draft limits
• A general variable neighborhood search variants for the travelling salesman problem with draft limits
• A traveling salesman problem with pickups and deliveries, time windows and draft limits: case study from chemical shipping
• The traveling salesman problem: An overview of exact and approximate algorithms
• Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints

Cites work

• scientific article; zbMATH DE number 2064406 (Why is no real title available?)
• Branch-cut-and-price for the vehicle routing problem with simultaneous pickup and delivery
• Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems
• Integer Programming Formulation of Traveling Salesman Problems
• New route relaxation and pricing strategies for the vehicle routing problem
• Solution of a Large-Scale Traveling-Salesman Problem
• Technical Note—An n-Constraint Formulation of the (Time-Dependent) Traveling Salesman Problem
• The shortest-path problem with resource constraints and \(k\)-cycle elimination for \(k\geq 3\)
• The time dependent traveling salesman problem: polyhedra and algorithm
• The traveling salesman problem with draft limits

Cited in

(8)

• Exact and heuristic algorithms for the parallel machine total completion time scheduling problem with dual resources, ready times, and sequence-dependent setup times
• Theory and application of reciprocal transformation of “path problem” and “time float problem”
• Cargo routing and scheduling problem in deep-sea transportation: case study from a fertilizer company
• The traveling salesman problem with draft limits
• The heterogeneous fleet vehicle routing problem with draft limits
• A branch-and-price approach to the feeder network design problem
• Tight lower bounds for the traveling salesman problem with draft limits
• A general variable neighborhood search variants for the travelling salesman problem with draft limits

Describes a project that uses

Uses Software

• CVRPSEP

This page was built for publication: Exact algorithms for the traveling salesman problem with draft limits

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