A personalized walking bus service requiring optimized route decisions: a real case
From MaRDI portal
Publication:2029258
DOI10.1016/j.ejor.2019.07.046zbMath1487.90176OpenAlexW2964237478MaRDI QIDQ2029258
Federico Malucelli, Emanuele Tresoldi, Maddalena Nonato
Publication date: 3 June 2021
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11392/2406456
Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A column generation approach for a school bus routing problem with resource constraints
- Minimal spanning trees with a constraint on the number of leaves
- Spanning trees with a constraint on the number of leaves. A new formulation
- A new branch-and-cut algorithm for the capacitated vehicle routing problem
- Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
- 2-Path Cuts for the Vehicle Routing Problem with Time Windows
- The Multilevel Capacitated Minimum Spanning Tree Problem
- A branch-and-bound algorithm for the asymmetrical distance-constrained vehicle routing problem
- A Polyhedral Approach to the Asymmetric Traveling Salesman Problem
- Optimal vehicle routing with lower and upper bounds on route durations
- An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation
- Shortest Path Problems with Resource Constraints
- Pyomo -- optimization modeling in Python