Multiobjective routing of hazardous materials in stochastic networks

DOI10.1016/0377-2217(93)90142-AzbMath0775.90159OpenAlexW2011252401MaRDI QIDQ2368293

Ajith B. Wijeratne, Mark A. Turnquist, Pitu B. Mirchandani

Publication date: 24 August 1993

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(93)90142-a

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Stochastic network models in operations research (90B15)

Related Items (10)

Multiobjective transportation network design and routing problems: Taxonomy and annotation ⋮ Hazardous material transportation problems: a comprehensive overview of models and solution approaches ⋮ Selected Multicriteria Shortest Path Problems: An Analysis of Complexity, Models and Adaptation of Standard Algorithms ⋮ Bicriteria shortest path in networks of queues ⋮ The cross-entropy method for solving bi-criteria network flow problems in discrete-time dynamic networks ⋮ Simulated annealing based GRASP for Pareto-optimal dissimilar paths problem ⋮ Multicriteria adaptive paths in stochastic, time-varying networks ⋮ On finding dissimilar Pareto-optimal paths ⋮ A review of extensive facility location in networks ⋮ Dynamic shortest path in stochastic dynamic networks: Ship routing problem

Cites Work

• Unnamed Item
• A note on two problems in connexion with graphs
• The use of cutsets in Monte Carlo analysis of stochastic networks
• On a multicriteria shortest path problem
• Shortest paths in networks with vector weights
• An interactive approach to identify the best compromise solution for two objective shortest path problems
• Optimal paths in probabilistic networks: A case with temporary preferences
• A bicriterion shortest path algorithm
• Technical Note—A Note on the Stochastic Shortest Route Problem
• Technical Note—An Improved Implementation of Conditional Monte Carlo Estimation of Path Lengths in Stochastic Networks
• Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
• On the Maximum Expected Flow in a Network
• The Stochastic Shortest Route Problem
• Markov and Markov-Regenerative <scp>pert</scp> Networks
• Shortest Paths in Probabilistic Graphs

This page was built for publication: Multiobjective routing of hazardous materials in stochastic networks