A Benders Decomposition Approach for the Symmetric TSP with Generalized Latency Arising in the Design of Semiflexible Transit Systems

No abstract is available for this paper.

• Publication year

  2017

• Venue

  Transportation Science

• Publication date

  2017-05-01

• Fields of study

  Mathematics, Computer Science, Engineering

• Identifiers
  DOI 10.1287/trsc.2015.0636
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• The Minimum Flow Cost Hamiltonian Cycle Problem: A comparison of formulations

  2015cited by this paper
• The Traveling Salesman Problem and its Variations

  2014cited by this paper
• Capacitated Network Design using Bin-Packing

  2013influential reference
• A survey on planning semi-flexible transit systems: Methodological issues and a unifying framework

  2013cited by this paper
• Exact approaches to the single‐source network loading problem

  2012cited by this paper
• Speed-up Benders decomposition using maximum density cut (MDC) generation

  2012cited by this paper
• On cut‐based inequalities for capacitated network design polyhedra

  2011cited by this paper
• Benders Decomposition for Large-Scale Uncapacitated Hub Location

  2011cited by this paper
• The design problem for single-line demand-adaptive transit systems

  2011influential reference
• Improving benders decomposition using maximum feasible subsystem (MFS) cut generation strategy

  2010cited by this paper
• Accelerating Benders method using covering cut bundle generation

  2010cited by this paper
• A Guide for Planning and Operating Flexible Public Transportation Services

  2010cited by this paper
• An interior-point Benders based branch-and-cut algorithm for mixed integer programs

  2010cited by this paper
• Accelerating Benders Decomposition by Local Branching

  2009cited by this paper
• Solving a capacitated hub location problem

  2008cited by this paper
• A new formulation for the Traveling Deliveryman Problem

  2008cited by this paper
• A Cut-and-Branch algorithm for the Multicommodity Traveling Salesman Problem

  2008cited by this paper
• The traveling salesman problem and its variations

  2007cited by this paper
• The Traveling Salesman Problem: A Computational Study

  2007cited by this paper
• A survey on benders decomposition applied to fixed-charge network design problems

  2005cited by this paper
• Relax-and-Cut for Capacitated Network Design

  2005cited by this paper
• Operational Experiences with Flexible Transit Services

  2004cited by this paper
• A branch‐and‐cut algorithm for the single‐commodity, uncapacitated, fixed‐charge network flow problem

  2003cited by this paper
• On capacitated network design cut–set polyhedra

  2002cited by this paper
• Lagrangian Cardinality Cuts and Variable Fixing for Capacitated Network Design

  2002cited by this paper
• Efficient separation routines for the symmetric traveling salesman problem I: general tools and comb separation

  2002cited by this paper
• Bundle-based relaxation methods for multicommodity capacitated fixed charge network design

  2001cited by this paper
• Benders-and-cut algorithm for fixed-charge capacitated network design problem

  2000cited by this paper
• A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem

  2000cited by this paper
• A branch-and-cut algorithm for capacitated network design problems

  1999cited by this paper
• Inexact Cuts in Benders Decomposition

  1999cited by this paper
• Simultaneous Assignment of Locomotives and Cars to Passenger Trains

  1998cited by this paper
• Solving the Uncapacitated Network Design Problem by a Lagrangean Heuristic and Branch-and-Bound

  1998cited by this paper
• A Benders Decomposition Approach for the Locomotive and Car Assignment Problem

  1998cited by this paper
• Network Design Using Cut Inequalities

  1996cited by this paper
• Capacitated Network Design - Polyhedral Structure and Computation

  1996cited by this paper
• The Delivery Man Problem and Cumulative Matroids

  1993cited by this paper
• An analytical comparison of different formulations of the travelling salesman problem

  1991influential reference
• An efficient algorithm for the minimum capacity cut problem

  1990cited by this paper
• Time-dependent traveling salesman problem-the deliveryman case

  1990cited by this paper
• Valid inequalities and facets of the capacitated plant location problem

  1989cited by this paper
• Tailoring Benders decomposition for uncapacitated network design

  1986influential reference
• Odd Minimum Cut-Sets and b-Matchings

  1982cited by this paper
• Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria

  1981influential reference
• A Modified Benders' Partitioning Algorithm for Mixed Integer Programming

  1977cited by this paper
• Partitioning procedures for solving mixed-variables programming problems

  1962cited by this paper

• Operational route planning under uncertainty for Demand Adaptive Systems

  2025cites this paper
• Branch and Price for the Stochastic Traveling Salesman Problem with Generalized Latency

  2024cites this paper
• A survey of Flex-Route Transit problem and its link with Vehicle Routing Problem

  2024cites this paper
• Multi-mitigation strategies in medical supplies for epidemic outbreaks

  2023cites this paper
• Branch-and-Price for the Stochastic TSP with Generalized Latency

  2023influential citation
• Two-Stage emergency material scheduling based on benders decomposition considering traffic congestion after a disaster

  2022cites this paper
• Multi-warehouse package consolidation for split orders in online retailing

  2021cites this paper
• On Optimizing a Multi-Mode Last-Mile Parcel Delivery System with Vans, Truck and Drone

  2021cites this paper
• An Exact Algorithm for Heterogeneous Drone-Truck Routing Problem

  2021cites this paper
• The Single-Line Design Problem for Demand-Adaptive Transit Systems: A Modeling Framework and Decomposition Approach for the Stationary-Demand Case

  2021cites this paper
• Spectrum of Public Transit Operations: From Fixed Route to Microtransit

  2020cites this paper
• Enhancing Benders decomposition algorithm to solve a combat logistics problem

  2020cites this paper
• Decomposition-based algorithms for the crew scheduling and routing problem in road restoration

  2020influential citation
• A branch-and-Benders-cut algorithm for the Crew Scheduling and Routing Problem in road restoration

  2019influential citation
• An Exact Algorithm for Multilevel Uncapacitated Facility Location

  2019cites this paper
• Planification en Distribution Urbaine : Optimisation des tournées dans un contexte collaboratif

  2018cites this paper
• Multi-level facility location problems

  2017cites this paper
• The Benders decomposition algorithm: A literature review

  2017cites this paper
• Exact approaches for lifetime maximization in connectivity constrained wireless multi-role sensor networks

  2015cites this paper