A branch-and-cut framework for the consistent traveling salesman problem

DOI10.1016/J.EJOR.2015.07.030MaRDI QIDQ320686zbMATH OpenOpenAlexFDO

Authors Anirudh Subramanyam, Chrysanthos E. Gounaris

Publication date 7 October 2016

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

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

zbMATH Keywords

traveling salesman problembranch-and-cutservice consistencymulti-period routing

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Transportation, logistics and supply chain management (90B06)

Recommendations

• The periodic vehicle routing problem with driver consistency
• A template-based adaptive large neighborhood search for the consistent vehicle routing problem
• The multi-objective generalized consistent vehicle routing problem
• The indefinite period traveling salesman problem
• A branch-and-cut algorithm for vehicle routing problems

Cites work

• scientific article; zbMATH DE number 3943559 (Why is no real title available?)
• scientific article; zbMATH DE number 2064407 (Why is no real title available?)
• A Polyhedral Approach to the Asymmetric Traveling Salesman Problem
• A branch-and-cut algorithm for the undirected prize collecting traveling salesman problem
• A comparative analysis of several asymmetric traveling salesman problem formulations
• A mixed-integer model for solving ordering problems with side constraints
• A new branch-and-cut algorithm for the capacitated vehicle routing problem
• A polyhedral study of the asymmetric traveling salesman problem with time windows
• A result on projection for the vehicle routing problem
• A template-based adaptive large neighborhood search for the consistent vehicle routing problem
• A two-commodity flow formulation for the traveling salesman and the makespan problems with time windows
• An efficient algorithm for the minimum capacity cut problem
• Benchmarking optimization software with performance profiles.
• Facets of the Asymmetric Traveling Salesman Polytope
• Forty years of periodic vehicle routing
• Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
• Integer Programming Formulation of Traveling Salesman Problems
• Integer Programming and Combinatorial Optimization
• Odd Minimum Cut-Sets and b-Matchings
• On service consistency in multi-period vehicle routing
• On the symmetric travelling salesman problem I: Inequalities
• Reducibility among combinatorial problems
• Solution of a Large-Scale Traveling-Salesman Problem
• Solving the asymmetric travelling salesman problem with time windows by branch-and-cut
• TSPLIB—A Traveling Salesman Problem Library
• The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm

Cited in

(16)

• A template-based adaptive large neighborhood search for the consistent vehicle routing problem
• scientific article; zbMATH DE number 1953192 (Why is no real title available?)
• Mathematical formulations for consistent travelling salesman problems
• The consistent vehicle routing problem with heterogeneous fleet
• Product-oriented time window assignment for a multi-compartment vehicle routing problem
• The vehicle routing problem with profits and consistency constraints
• Branch-and-check approaches for the tourist trip design problem with rich constraints
• The travelling salesman problem with positional consistency constraints: an application to healthcare services
• The multi-objective generalized consistent vehicle routing problem
• The consistent production routing problem
• The time‐consistent dial‐a‐ride problem
• A branch-and-cut algorithm for the target visitation problem
• A branch and cut algorithm for the time-dependent profitable tour problem with resource constraints
• Discrete optimization model and algorithm for driver planning in periodic driver routing problem
• Branch-and-cut algorithms for the covering salesman problem
• Binary driver-customer familiarity in service routing

Describes a project that uses

Uses Software

• CVRPSP
• Concorde
• TSPLIB

This page was built for publication: A branch-and-cut framework for the consistent traveling salesman problem

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