Multiobjective routing problems

DOI10.1007/BF02568585zbMath0852.90065OpenAlexW2131045650WikidataQ41069533 ScholiaQ41069533MaRDI QIDQ1919112

Yanyan Li

Publication date: 1 August 1996

Published in: Top (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02568585

zbMATH Keywords

network routingtransportation of hazardous materials\(k\)-shortest path techniquesmultiobjective routing

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06)

Related Items

A comprehensive survey on the quickest path problem, The bi-objective covering tour problem, On the sum-max bicriterion path problem., Multi-objective meta-heuristics for the traveling salesman problem with profits, From Single-Objective to Multi-Objective Vehicle Routing Problems: Motivations, Case Studies, and Methods, Multi-objective vehicle routing problems, Modeling the Mobile Oil Recovery Problem as a Multiobjective Vehicle Routing Problem, Location of paths on trees with minimal eccentricity and superior section, The Maximum Capacity Shortest Path Problem: Generation of Efficient Solution Sets

Cites Work

• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• An algorithm for ranking paths that may contain cycles
• On a multicriteria shortest path problem
• Shortest paths in networks with vector weights
• A parametric approach to solving bicriterion shortest path problems
• The selective travelling salesman problem
• The quickest path problem
• An interactive approach to identify the best compromise solution for two objective shortest path problems
• Solving k-shortest and constrained shortest path problems efficiently
• The maximum covering/shortest path problem: A multiobjective network design and routing formulation
• The shortest path problem with two objective functions
• The hierarchical network design problem
• Multiobjective programming and planning
• A bicriterion shortest path algorithm
• Algorithms for the quickest path problem and the enumeration of quickest paths
• A multicriteria Pareto-optimal path algorithm
• The maximum benefit Chinese postman problem and the maximum benefit traveling salesman problem
• A review of extensive facility location in networks
• An algorithm for the ranking of shortest paths
• An interactive procedure using domination cones for bicriterion shortest path problems
• The median tour and maximal covering tour problems: Formulations and heuristics
• A computational improvement for a shortest paths ranking algorithm
• Equity measurement in facility location analysis: A review and framework
• The hybrid spanning tree problem
• On spanning tree problems with multiple objectives
• An empirical investigation of some bicriterion shortest path algorithms
• A generalized permanent label setting algorithm for the shortest path between specified nodes
• Modeling of Transport Risk for Hazardous Materials
• The Median Shortest Path Problem: A Multiobjective Approach to Analyze Cost vs. Accessibility in the Design of Transportation Networks
• A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees
• Periodic solutions of the restricted problem that are analytic continuations of periodic solutions of Hill's problem for small ?>0
• Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
• Implementation of algorithms forK shortest loopless paths
• A dual algorithm for the constrained shortest path problem
• An efficient algorithm for K shortest simple paths
• Shortest-Route Methods: 1. Reaching, Pruning, and Buckets
• Proactive optimization of toxic waste transportation, location and technology
• Location Models with Routing Considerations for a Single Obnoxious Facility
• The Covering Tour Problem
• The Covering Salesman Problem
• Modeling Equity of Risk in the Transportation of Hazardous Materials
• Finding the K Shortest Loopless Paths in a Network