A personalized walking bus service requiring optimized route decisions: a real case
From MaRDI portal
Publication:2029258
Recommendations
- The school bus routing problem: a case study
- The school bus routing problem: an analysis and algorithm
- School bus routing and scheduling problem
- The school bus routing and scheduling problem with transfers
- A heuristic algorithm for finding cost-effective solutions to real-world school bus routing problems
Cites work
- 2-path cuts for the vehicle routing problem with time windows
- A branch-and-bound algorithm for the asymmetrical distance-constrained vehicle routing problem
- A column generation approach for a school bus routing problem with resource constraints
- A new branch-and-cut algorithm for the capacitated vehicle routing problem
- A Polyhedral Approach to the Asymmetric Traveling Salesman Problem
- An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation
- scientific article; zbMATH DE number 1749222 (Why is no real title available?)
- Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
- Minimal spanning trees with a constraint on the number of leaves
- Optimal vehicle routing with lower and upper bounds on route durations
- Pyomo -- optimization modeling in Python
- Shortest Path Problems with Resource Constraints
- Spanning trees with a constraint on the number of leaves. A new formulation
- The multilevel capacitated minimum spanning tree problem
- The traveling salesman problem. A computational study.
Cited in
(2)
This page was built for publication: A personalized walking bus service requiring optimized route decisions: a real case
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2029258)