Multiobjective routing of hazardous materials in stochastic networks

DOI10.1016/0377-2217(93)90142-AMaRDI QIDQ2368293zbMATHOpenAlexFDO

Authors 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)

Cites work

• scientific article; zbMATH DE number 3694968 (Why is no real title available?)
• A bicriterion shortest path algorithm
• A note on two problems in connexion with graphs
• An interactive approach to identify the best compromise solution for two objective shortest path problems
• Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
• Markov and Markov-Regenerative <scp>pert</scp> Networks
• On a multicriteria shortest path problem
• On the Maximum Expected Flow in a Network
• Optimal paths in probabilistic networks: A case with temporary preferences
• Shortest Paths in Probabilistic Graphs
• Shortest paths in networks with vector weights
• 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
• The Stochastic Shortest Route Problem
• The use of cutsets in Monte Carlo analysis of stochastic networks

Cited in

(10)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2368293)