Multimodal K-shortest viable path problem in Tehran public transportation network and its solution applying ant colony and simulated annealing algorithms

DOI10.1016/j.apm.2012.01.007zbMath1254.90104OpenAlexW2010677985MaRDI QIDQ1930787

S. Mehdi Hashemi, Malihe Niksirat, Mehdi Ghatee

Publication date: 13 January 2013

Published in: Applied Mathematical Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apm.2012.01.007

zbMATH Keywords

congestion levelmetaheuristic algorithmsmultimodal networks\texttt{CPLEX 12.1}bi-direction searchK-shortest path problem

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Case-oriented studies in operations research (90B90)

Related Items (2)

An effective krill herd algorithm with migration operator in biogeography-based optimization ⋮ A new AATP model with considering supply chain lead-times and resources and scheduling of the orders in flowshop production systems: a graph-theoretic view

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Simulated annealing: A tool for operational research
• Continuous ant colony system and tabu search algorithms hybridized for global minimization of continuous multi-minima functions
• Ant colony approach to constrained redundancy optimization in binary systems
• An intermodal optimum path algorithm for multimodal networks with dynamic arc travel times and switching delays
• A utility measure for finding multiobjective shortest paths in urban multimodal transportation networks
• Descent direction algorithm with multicommodity flow problem for signal optimization and traffic assignment jointly
• Object modeling and path computation for multimodal travel systems
• Finding \(K\) shortest looping paths with waiting time in a time--window network
• A hybrid metaheuristic for the quadratic assignment problem
• Finding the k Shortest Paths
• Comparing descent heuristics and metaheuristics for the vehicle routing problem
• Interpretation of inequality constraints involving interval coefficients and a solution to interval linear programming.

This page was built for publication: Multimodal K-shortest viable path problem in Tehran public transportation network and its solution applying ant colony and simulated annealing algorithms