The Multiple Vehicle TSP with Time Windows and Equity Constraints over a Multiple Day Horizon

DOI10.1287/TRSC.30.2.120zbMATH Open0865.90128OpenAlexW2169357647MaRDI QIDQ5689802FDOQ5689802

Authors: Robert Dell, Rajan Batta, Mark H. Karwan 

Publication date: 7 January 1997

Published in: Transportation Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/trsc.30.2.120

Recommendations

• Survey Paper—Time Window Constrained Routing and Scheduling Problems
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• Methods for routing with time windows
• Multi-trip time-dependent vehicle routing problem with soft time windows and overtime constraints
• Routing with time windows by column generation

zbMATH Keywords

time windowsequity constraintsmultiple vehicle traveling salesman

Mathematics Subject Classification ID

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

Cited In (7)

• A model for the traveling salesman problem including the EC regulations on driving hours
• Vehicle routing problem considering equity of demand satisfaction
• Mathematical formulations and exact algorithm for the multitrip cumulative capacitated single-vehicle routing problem
• Solving the linear multiple choice knapsack problem with two objectives: Profit and equity
• Heuristics for routing heterogeneous unmanned vehicles with fuel constraints
• The multiple TSP with time windows: vehicle bounds based on precedence graphs
• A multistart iterated local search for the multitrip cumulative capacitated vehicle routing problem

This page was built for publication: The Multiple Vehicle TSP with Time Windows and Equity Constraints over a Multiple Day Horizon

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