Multiobjective routing problems

Top

Volumn 3, Issue 2, 1995, Pages 167-220

  Boffey, B ^a   García, Francisco Ramón Fernández ^b   Laporte, Gilbert ^c   Mesa, Juan A ^b   Pelegrín, Blas Pelegrín ^d  

^a UNIVERSITY OF LIVERPOOL   (United Kingdom)

^b UNIVERSITY OF SEVILLE   (Spain)

^c HEC MONTRÉAL   (Canada)

^d UNIVERSITY OF MURCIA   (Spain)

Author keywords

Efficient Solutions; Hazardous materials; k Shortest Path Methods

Indexed keywords

EID: 51249170044     PISSN: 11345764     EISSN: 18638279     Source Type: Journal    
DOI: 10.1007/BF02568585     Document Type: Article

References (116)

1. An algorithm for the ranking of shortest paths
2. A computational improvement of an algorithm for shortest path ranking
3. Model and methods for location and routing decisions relating to hazardous materials
4. An empirical investigation of some bicriterion shortest path problems
5. An algorithm for finding the k quickest paths in a network
6. The hybrid spanning three problem
7. The quickest path problem
8. Bicriterion routing scheme for nuclear spent fuel transportation
9. A bicriterion path problem
10. Shortest paths in networks with vector weights
11. Scheduling truck shipments of hazardous materials in the presence of curfews
12. The maximum covering/shortest path problem: a multiobjective network design and routing formulation
13. The hierarchical network design problem
14. The median shortest path problem: a multiobjective approach to analyze cost vs. accessibility in the design of transportation networks
15. An interactive approach to identify the best compromise solution for two objective shortest path problems
16. The covering salesman problem
17. The median tour and maximal covering tour problems: formulations and heuristics
18. Shortest route methods: 1. Reaching, pruning and buckets
19. A computational analysis of alternative algorithms and labelling techniques for finding shortest path trees
20. A note on two problems in connection with graphs
21. Lagrangean relaxation
22. Modeling equity of risk in the transportation of hazardous materials
23. On spanning tree problems with multiple objectives
24. A dual algorithm for the constrained shrotest path problem
25. Bicriterion path problems
26. A formal basic for the heuristic determination of minimal cost paths
27. The shortest path problem with two objective functions
28. Finding the k least cost paths in an acyclic activity network
29. An efficient algorithm for k shortest simple paths
30. The selective traveling salesman problem
31. An efficient approach to solving the road network equilibrium problem
32. Equitable sequencing of a given set of hazardous materials shipments
33. The maximum benefit Chinese postman problem and the maximum benefit traveling salesman problem
34. Equity measurement in facility location analysis: a review and framework
35. On a multicriteria path problem
36. An algorithm for ranking paths that may contain cycles
37. Computing k-shortest path for nuclear spent fuel highway transportation
38. A parametric approach to solving bicriterion shortest path problems
39. An interactive procedure using domination cones for bicriterion shortest path problems
40. A generalized permanent label setting algorithm for the shortest path between specified nodes
41. A representation of disjoint sets with fast initialization
42. Implementation of algorithms for k shortest loopless paths
43. Simultaneous siting and routing in the disposal of hazardous wastes
44. Algorithms for the quickest path problem and the enumeration of quickest paths
45. Solving k-shortest and constrained shortest path problems efficiently
46. Location models with routing considerations for a single obnoxious facility
47. A bicriterion Pareto-optimal path algorithm
48. A multicriteria Pareto-optimal path algorithm
49. Problème multicritères
50. Approximation of Pareto optima in multi-objective, shortest path problems
51. Finding the k-shortest, loopless paths in a network
52. Multicriteria analysis with partial information about the weighting coefficients
53. Efficient interactive metods for a class of mutiattribute shortest path problems
54. Multiobjective combinatorial optimization problems: A survey
55. Applications of Network Optimization
56. Modeling and Implementation Issues in Vehicle Routing
57. How to Select and How to Rank Projects: The PROMETHEE Method
58. Scheduling of Vehicles from a Central Depot to a Number of Delivery Points
59. Planning of Freight Transportation: STAN, An Interactive Graphic System
60. Combinatorial Optimization Problems with Soft and hard Requirements
61. New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
62. A Tabu Search Heuristic for the Vehicle Routing Problem
63. Locating Rapid Transit Lines
64. A Heuristic Algorithm for the Vehicle Dispatch Problem
65. Multicriteria Ranking of Urban Transportation System Alternatives
66. Maximizing User Convenience and Postal Service Efficiency in Post Box Location
67. Computer Solutions of the Traveling Salesman Problem
68. Network Design and Transportation Planning: Models and Algorithms
69. Bounded Rationality, Ambiguity and the Engineering of Choice
70. Spatial Accessibility of Health Care Facilities in Suhum District, Ghana
71. Probabilistic Diversification and Intensification in Local Search for Vehicle Routing
72. NETPLAN: A Network Optimization Model for Tactical Planning on the Less-then-Truckload Motor Carrier Industry
73. Multiobjective transportation, network design and routing problems: taxonomy and annotation
74. Modeling and analysis for hazardous materials transportation: risk, analysis, routing/scheduling and facility location
75. The variance-constrained shortest path problem
76. Multiobjective routing of hazardous materials in stochastic networks
77. An algorithm for the resource constrained shortest path problem
78. Optimal minimax path of a single service unit on a network to nonservice destinations
79. A parametric programming methodology to solve the Lagrangian dual for network problems with multiple side-constraints
80. A minimax-arc-path problem
81. An algorithm for finding k-quickest paths in a network
82. Efficient algorithms for solving the shortest covering path problem
83. Shortest path algorithms. Taxonomy and annotation
84. The lagrangian relaxation methods for solving integer programming problems
85. Shortest path algorithms
86. Approximation schemes for the restricted shortest path problem
87. The equity constrained shortest path problem
88. An application oriented guide for designing lagrangian dual ascent algorithms
89. Solving mini-max shortest path problems on a network
90. A network-based model for transporting extremely hazardous materials