Multiobjective routing problems

Azevedo, J.A., M.E.O.S. Costa, J.J.E.R.S. Madeira and E.Q.V. Martins (1993). An algorithm for the ranking of shortest paths.EJOR,69, 97–106.

Azevedo, J.A., J.J.E.R.S. Madeira and E.Q.V. Martins (1994). A computational improvement of an algorithm for shortest path ranking. EJOR,73, 188–191.

Boffey, T.B. (1992).Distributed Computing: associated combinatorial problems. Blackwell-Scientific, Oxford.

Boffey, T.B. and J. Karkazis (1993). Model and methods for location and routing decisions relating to hazardous materials.Studies in Locational Analysis.5, 149–166.

Brumbaugh-Smith, J. and D. Shier (1989). An empirical investigation of some bicriterion shortest path problems.EJOR,43, 216–234.

Chen, Y.L. (1990). An algorithm for finding thek quickest paths in a network.Opns. Res.,20, 59–65.

Chen, Y.L. (1994). The hybrid spanning three problem.EJOR,77, 179–188.

Chen, Y.L. and Y.H. Chin (1990). The quickest path problem.Comput. Opns. Res.,17, 153–161.

Chin, S.-M. and P.D.-M. Cheng (1989). Bicriterion routing scheme for nuclear spent fuel transportation.Trans. Res. Rec.,1245, 60–64.

Climaco, J.C.N. and E.Q.V. Martins (1982): A bicriterion path problem.EJOR,11, 399–404.

Cohon, J.L. (1978).Multiobjective Programming and Planning. Academic Press, New York.

Corley H.W. and I.D. Moon (1985). Shortest paths in networks with vector weights.J. Optimization Theory & Applications,46, 79–86.

Cox, R. and M. Turquist (1986). Scheduling truck shipments of hazardous materials in the presence of curfews.Trans Res. Rec.,1063, 21–26.

Current, J.R., C.S. ReVelle and J.L. Cohon (1985). The maximum covering/shortest path problem: a multiobjective network design and routing formulation.EJOR,21, 189–199.

Current, J.R., C.S. ReVelle and J.L. Colon (1986). The hierarchical network design problem.EJOR,27, 57–66.

Current, J.R., C.S. ReVelle and J.L. Cohon (1987). The median shortest path problem: a multiobjective approach to analyze cost vs. accessibility in the design of transportation networks.Trans. Sci.,21, 188–197.

Current, J.R., C.S. ReVelle and J.L. Cohon (1990). An interactive approach to identify the best compromise solution for two objective shortest path problems.Comput. Opns. Res.,17, 187–198.

Current, J.R. and D.A. Schilling (1989). The covering salesman problem.Trans. Sci.,23, 208–213.

Current, J.R. and D.A. Schilling (1994). The median tour and maximal covering tour problems: formulations and heuristics.EJOR,73, 114–126.

Denardo, E.V. and B.L. Fox (1979). Shortest route methods: 1. Reaching, pruning and buckets.Opns. Res. 27, 161–186.

Dial, R., F. Glover, D. Karney and D. Klingman (1974). A computational analysis of alternative algorithms and labelling techniques for finding shortest path trees.Networks,9, 215–248.

Dijkstra, E.W. (1959). A note on two problems in connection with graphs.Num. Maths.,1, 269–271.

Erkut, E. and V. Verter (1995). Hazardous materials logistics: a review. In Z Drezner,Facility Location: models and methods, Springer-Verlag.

Gendreau, M., G. Laporte and F. Semet (1996). The covering tour problem.Opns. Res. To appear.

Geoffrion, A.L. (1974). Lagrangean relaxation.Math. Programming Study,2, 82–114.

Gopalan, R., K.S. Kolluri, R. Batta and M.H. Karwan (1990). Modeling equity of risk in the transportation of hazardous materials.Opns. Res.,38, 961–973.

Hamacher, H.W. and G. Ruhe (1994). On spanning tree problems with multiple objectives.Annals of OR,52, 209–230.

Handler, G.Y. and I. Zang (1980). A dual algorithm for the constrained shrotest path problem.Networks,10, 293–310.

Hansen, P. (1990), “Bicriterion path problems.” in G. Fandel and T. Gal (eds.),Multiple Criteria Decision Making: Theory and Application.Lecture Notes in Economics and Mathematical Systems 177, Springer-Verlag, Berlin, 109–127.

Hart, P., N. Nilsson and B. Raphael (1968). A formal basic for the heuristic determination of minimal cost paths.IEEE Trans. Syst. Man. Cybernet.,4, 100–107.

Henig, I.H. (1985). The shortest path problem with two objective functions.EJOR,25, 281–291.

Horne, G.J. (1980). Finding thek least cost paths in an acyclic activity network.J. Opl Res. Soc.,31, 443–448.

Katoh, N., T. Ibaraki and H. Mine (1982). An efficient algorithm fork shortest simple paths.Networks,12, 411–427.

Laporte, G. and S. Martello (1990). The selective traveling salesman problem.Discrete Applied Mathematics.26, 193–207.

LeBlanc, L.J., E.K. Morlok and W.P. Pierskalla (1975). An efficient approach to solving the road network equilibrium problem.Trans. Res.,9, 309–318.

Lindner-Dutton, L., R. Batta and M.H. Karwan (1991). Equitable sequencing of a given set of hazardous materials shipments.Trans. Sci.,25, 124–137.

Malandraki, C. and M.S. Daskin (1993). The maximum benefit Chinese postman problem and the maximum benefit traveling salesman problem.EJOR,65, 218–234.

Marsh, M.T. and D.A. Schilling (1994). Equity measurement in facility location analysis: a review and framework.EJOR,74, 1–17.

Martins, E.Q.V. (1982). On a multicriteria path problem.EJOR,16, 236–245.

Martins, E.Q.V. (1984). An algorithm for ranking paths that may contain cycles.EJOR,18, 123–130.

Mesa, J.A. and T.B. Boffey (1996). Location of extensive facilities in networks.EJOR. To appear.

Miaou, S.-P. and S.-M. Chin (1991). Computingk-shortest path for nuclear spent fuel highway transportation.EJOR,53, 64–80.

Mote, J., I. Murthy and D.L. Olson (1991). A parametric approach to solving bicriterion shortest path problems.EJOR,53, 81–92.

Murthy, I. and D.L. Olson (1994). An interactive procedure using domination cones for bicriterion shortest path problems.EJOR,72, 417–431.

Nemhauser, G.L. (1972). A generalized permanent label setting algorithm for the shortest path between specified nodes.J. Math. Analysis & Applic.,38, 328–334.

Ochi, L.S., E.M. dos Santos, A.A. Montenegro and N. Maculan (1995). Artificial genetic algorithms for the Travelling Purchaser Problem.Proceedings of the Metaheuristics International Conference, Breckenridge, Colorado, Kluwer, Norwell, Mass.

Peeters, P.H.M.. (1992). Kortste pad probleem in netwerken met bijkomende restricties. Masters thesis, Vrije Universiteit, Brussels.

Perko, A. (1983). A representation of disjoint sets with fast initialization.Information Processing Lett.,16, 21.

Perko, A. (1986). Implementation of algorithms fork shortest loopless paths.Networks,16, 149–160.

ReVelle, C.S., J. Cohon and D. Shobrys (1991). Simultaneous siting and routing in the disposal of hazardous wastes.Trans. Sci.,25, 138–145.

Rosen, J.B., S.-Z. Sun and G.-L. Xue (1991). Algorithms for the quickest path problem and the enumeration of quickest paths.Comput. Opns. Res.,18, 579–584.

Skiscim, C.C. and B.L. Golden (1989). Solvingk-shortest and constrained shortest path problems efficiently.Annals of O.R.,20, 249–282.

Stowers, C.L. and U.S. Palekar (1993). Location models with routing considerations for a single obnoxious facility.Trans. Sci.,27, 350–362.

Tung, C.T. and K.L. Chew (1988). A bicriterion Pareto-optimal path algorithm.APJOR,5, 166–172.

Tung, C.T. and K.L. Chew (1992). A multicriteria Pareto-optimal path algorithm.EJOR,62, 203–209.

Vincke, Ph. (1974). Problème multicritères.Cahiers du Centre d'Études de Recherche Opérationelle,16, 425–439.

Warburton, A. (1987). Approximation of Pareto optima in multi-objective, shortest path problems.Opns. Res.,35, 70–79.

Wyman, M.M. and M. Kuby (1996). Proactive optimization of waste transportation, location and technology. To appear inLocation Science,3.

Yates, D.F. (1995). Private communication.

Yen, J.Y. (1971). Finding thek-shortest, loopless paths in a network.Mgmt. Sci.,17, 712–715.