Multimodal K-shortest viable path problem in Tehran public transportation network and its solution applying ant colony and simulated annealing algorithms
type: Item
instance of: scholarly article
title: Multimodal K-shortest viable path problem in Tehran public transportation network and its solution applying ant colony and simulated annealing algorithms
zbMATH Open document ID: 1254.90104
author: Malihe Niksirat
author: S. Mehdi Hashemi
author: Mehdi Ghatee
published in: Applied Mathematical Modelling
publication date: 2013-01-13T00:00:00Z
Mathematics Subject Classification ID: 90B90
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 05C82
zbMATH DE Number: 6124888
zbMATH Keywords: metaheuristic algorithms
zbMATH Keywords: multimodal networks
zbMATH Keywords: K-shortest path problem
zbMATH Keywords: bi-direction search
zbMATH Keywords: congestion level
zbMATH Keywords: \texttt{CPLEX 12.1}
describes a project that uses: CPLEX
MaRDI profile type: Publication
full work available at URL: j.apm.2012.01.007
OpenAlex ID: W2010677985
cites work: Interpretation of inequality constraints involving interval coefficients and a solution to interval linear programming.
cites work: Finding the k Shortest Paths
cites work: Q4411352
cites work: A utility measure for finding multiobjective shortest paths in urban multimodal transportation networks
cites work: An intermodal optimum path algorithm for multimodal networks with dynamic arc travel times and switching delays
cites work: Object modeling and path computation for multimodal travel systems
cites work: Q4495163
cites work: Q3056948
cites work: Q5480099
cites work: A hybrid metaheuristic for the quadratic assignment problem
cites work: Continuous ant colony system and tabu search algorithms hybridized for global minimization of continuous multi-minima functions
cites work: Descent direction algorithm with multicommodity flow problem for signal optimization and traffic assignment jointly
cites work: Simulated annealing: A tool for operational research
cites work: Comparing descent heuristics and metaheuristics for the vehicle routing problem
cites work: Ant colony approach to constrained redundancy optimization in binary systems
cites work: Finding \(K\) shortest looping paths with waiting time in a time--window network
DOI: 10.1016/J.APM.2012.01.007
description: scientific article; zbMATH DE number 6124888