The Multiple Vehicle TSP with Time Windows and Equity Constraints over a Multiple Day Horizon
From MaRDI portal
Publication:5689802
DOI10.1287/trsc.30.2.120zbMath0865.90128OpenAlexW2169357647MaRDI QIDQ5689802
Rajan Batta, Mark H. Karwan, Robert F. Dell
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
Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06)
Related Items (4)
Solving the linear multiple choice knapsack problem with two objectives: Profit and equity ⋮ Mathematical formulations and exact algorithm for the multitrip cumulative capacitated single-vehicle routing problem ⋮ Heuristics for routing heterogeneous unmanned vehicles with fuel constraints ⋮ 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