To stop or not to stop: a time-constrained trip covering location problem on a tree network

DOI10.1007/s10479-021-03981-wzbMath1497.90121OpenAlexW3132272275MaRDI QIDQ2675712

Juan A. Mesa, M. C. López-de-los-Mozos

Publication date: 26 September 2022

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-021-03981-w

zbMATH Keywords

networklocationcovering problemmixed distances

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Traffic problems in operations research (90B20) Discrete location and assignment (90B80)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A maximum trip covering location problem with an alternative mode of transportation on tree networks and segments
• Maximizing trip coverage in the location of a single rapid transit alignment
• Locating stops along bus or railway lines -- a bicriteria problem
• Transportation systems analysis. Models and applications.
• Stop location design in public transportation networks: covering and accessibility objectives
• A general approach for the location of transfer points on a network with a trip covering criterion and mixed distances
• THE CONTINUOUS STOP LOCATION PROBLEM IN PUBLIC TRANSPORTATION NETWORKS
• Convex Location Problems on Tree Networks
• Locating stations on rapid transit lines

This page was built for publication: To stop or not to stop: a time-constrained trip covering location problem on a tree network