Simultaneous node and link districting in transportation networks: model, algorithms and railway application
From MaRDI portal
Publication:2030544
DOI10.1016/j.ejor.2020.10.013zbMath1487.90178OpenAlexW3093002666MaRDI QIDQ2030544
Publication date: 7 June 2021
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2020.10.013
Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80)
Related Items (3)
A real-world mine excavators timetabling methodology in open-pit mining ⋮ The Capacitated and Economic Districting Problem ⋮ Timetable coordination in a rail transit network with time-dependent passenger demand
Cites Work
- A multi-criteria police districting problem for the efficient and effective design of patrol sector
- A redistricting problem applied to meter reading in power distribution networks
- Large-scale pickup and delivery work area design
- The coastal seaspace patrol sector design and allocation problem
- New models for commercial territory design
- A reactive GRASP for a commercial territory design problem with multiple balancing requirements
- Disruption management in the airline industry-concepts, models and methods
- Some simplified NP-complete graph problems
- Constrained clustering via diagrams: a unified theory and its application to electoral district design
- An exact algorithm for designing optimal districts in the collection of waste electric and electronic equipment through an improved reformulation
- A tabu search heuristic and adaptive memory procedure for political districting
- Nominal and robust train timetabling problems
- A dual bounding scheme for a territory design problem
- A review of urban transportation network design problems
- Column-generation based bounds for the homogeneous areas problem
- A branch and bound algorithm for scheduling trains in a railway network
- Political districting: from classical models to recent approaches
- Configuration of airspace sectors for balancing air traffic controller workload
- Employee workload balancing by graph partitioning
- Multiple criteria districting problemsthe public transportation network pricing system of the Paris region
- The sector design and assignment problem for snow disposal operations
- Local search algorithms for political districting
- Towards a unified territorial design approach - applications, algorithms and GIS integration. (With comments and rejoinder)
- Branch-and-Price: Column Generation for Solving Huge Integer Programs
- An Optimization Based Heuristic for Political Districting
- A novel model for arc territory design: promoting Eulerian districts
- Districting for Arc Routing
- Fast Approximation Methods for Sales Force Deployment
- Algorithms for partitioning of large routing networks
- School redistricting: embedding GIS tools with integer programming
- Minimally Infeasible Set-Partitioning Problems with Balanced Constraints
- The Set-Partitioning Problem: Set Covering with Equality Constraints
This page was built for publication: Simultaneous node and link districting in transportation networks: model, algorithms and railway application
