Integrating Hamiltonian circuits with AHP for optimal route planning
- 1Department of Mathematics, School of Advanced Sciences, Vellore Institute of Technology
Abstract
Urban transportation systems face increasing challenges due to traffic congestion, travel delays, and operational inefficiencies, particularly in municipal solid waste collection services. Traditional route planning methods, including shortest-path algorithms such as Dijkstra’s algorithm, primarily optimize a single factor such as travel distance or travel time, which may not adequately represent the complex traffic and infrastructure conditions encountered in urban environments. Despite advances in route optimization, limited research has integrated coverage-based routing with multi-criteria evaluation within a unified framework. To address this gap, this study proposes an integrated route optimization framework that combines the Hamiltonian Circuit concept with the Analytic Hierarchy Process (AHP). The Hamiltonian Circuit ensures complete coverage of waste collection locations without duplication, while AHP evaluates alternative routes using multiple criteria, including travel time, traffic volume, distance, road width, parking effects, encroachment, and intersection density. The framework is validated using a municipal waste collection network in Vellore, Tamil Nadu, India. The results identify Route 3 as the most efficient alternative, providing the best overall balance among operational and transportation-related criteria. Compared with conventional single-factor approaches based solely on distance or travel time, the proposed framework offers a more comprehensive assessment of route performance. The study demonstrates that integrating graph-based routing with multi-criteria decision-making (MCDM) can support more effective municipal service planning and assist urban authorities in improving operational efficiency and sustainable transportation management.
Related
- Complex dynamics of a fractional-order epidemic system integrating with fractional-order optimal control and PRCC analysis
- Energy, environmental, and economic assessment of sustainable fuels from wet biomass via hydrothermal, sorbent-enhanced gasification, and Fischer-Tropsch route
- A Direct Route for Upcycling Electronic Waste Into High-Performance Palladium Catalysts
- Bottom-up estimation of CO2 emissions from container ships: a proof of concept using real operational data on the Brazil–Asia route
- Rice husk ash-based silica aerogel/UiO-66-NH₂ hybrid for fast and highly selective Pb(ii) capture: a green route toward advanced water treatment.
BibTeX
@article{parkavi2026integrating,
title = {{Integrating Hamiltonian circuits with AHP for optimal route planning}},
author = {S. Parkavi and A. Parthiban},
journal = {Environmental Systems Research},
year = {2026},
month = jul,
doi = {10.1186/s40068-026-00487-x},
url = {https://doi.org/10.1186/s40068-026-00487-x},
note = {CC BY},
}
RIS
TY - JOUR
TI - Integrating Hamiltonian circuits with AHP for optimal route planning
AU - S. Parkavi
AU - A. Parthiban
PY - 2026
DA - 2026/07/01
JO - Environmental Systems Research
DO - 10.1186/s40068-026-00487-x
UR - https://doi.org/10.1186/s40068-026-00487-x
AB - Urban transportation systems face increasing challenges due to traffic congestion, travel delays, and operational inefficiencies, particularly in municipal solid waste collection services. Traditional route planning methods, including shortest-path algorithms such as Dijkstra’s algorithm, primarily optimize a single factor such as travel distance or travel time, which may not adequately represent the complex traffic and infrastructure conditions encountered in urban environments. Despite advances in route optimization, limited research has integrated coverage-based routing with multi-criteria evaluation within a unified framework. To address this gap, this study proposes an integrated route optimization framework that combines the Hamiltonian Circuit concept with the Analytic Hierarchy Process (AHP). The Hamiltonian Circuit ensures complete coverage of waste collection locations without duplication, while AHP evaluates alternative routes using multiple criteria, including travel time, traffic volume, distance, road width, parking effects, encroachment, and intersection density. The framework is validated using a municipal waste collection network in Vellore, Tamil Nadu, India. The results identify Route 3 as the most efficient alternative, providing the best overall balance among operational and transportation-related criteria. Compared with conventional single-factor approaches based solely on distance or travel time, the proposed framework offers a more comprehensive assessment of route performance. The study demonstrates that integrating graph-based routing with multi-criteria decision-making (MCDM) can support more effective municipal service planning and assist urban authorities in improving operational efficiency and sustainable transportation management.
SN - 2193-2697
ER -