^{}Department of Industrial engineering, Yazd University, Yazd, Iran

Abstract

In this research author reviews references related to the topic of multi criterion (goal programming, multiple objective linear and nonlinear programming, bi-criterion programming, Multi Attribute Decision Making, Compromise Programming, Surrogate Worth Trade-off Method) and various versions of vehicle routing problem (VRP), Multi depot VRP (MDVRP), VRP with time windows (VRPWTW), Stochastic VRP (SVRP), Capacitated VRP (CVRP), Fuzzy VRP (FVRP), Location VRP (LVRP), Backhauling VRP(BHVRP), Facility Location VRP (FLVRP), and Inventory control VRP (ICVRP). Although, VRP is a research area with rich research works and powerful researchers there found only 81 articles that relates various vehicle routing type problems with various multiple objectives techniques. This author found that there is no research done in some areas of VRP (i.e., FVRP, ICVRP, LRP and CVRP). It is interesting to see that this research area was completely an unattractive to master students (with zero research reported) and a somewhat attractive area to doctoral students (with 6 researches reported). Among the many multi criterion programming techniques available only three of them (goal programming, bi-criterion programming, linear and nonlinear multi objective programming) are being employed to solve the problem.

Angel, E., E. Bampis and L. Gourvès, (2004), “Approximating the Pareto curve with local search for the bi-criteria TSP (1, 2) problem”, Theoretical Computer Science 310 (2004), pp. 135–146.

Bacopulas, A., and I.Singer,(1977) “On Convex Vectorial optimization in Linear Spaces” Journal of Optimization Theory and Applications, Vol. 21, pp.175-188.

Baker, B.M., Ayechew, M.A., (2003) “A Genetic Algorithm for the Vehicle Routing Problem”, Computers and Operations Research, Vol. 30, pp.787-800.

Balakrishnan, N., (1993), “Simple Heuristics for the Vehicle Routing Problem with Soft Time Windows”, Journal of the Operational Research Society, Vol. 44, pp. 279–287.

Balinski, M.L. and R.E. Quandt, (1964), “On an Integer Operations Program for a Delivery Program,” Operations Research, Vol. 12, pp .300-304.

Ball, M., B., Golden, A., Assad, and L. Bodin (1983), "Planning for Truck Fleet Size in the Presence of a Common-Carrier Option”, Decision Science, Vol. 14, pp. 103-120.

Bard, J.F., G. Kontoravdis and G. Yu, (2002), “A branch-and-cut procedure for the vehicle routing problem with time windows”, Transportation Science, Vol. 36, pp. 250–269.

Bell, J.and McMullen, R., (2004), “Ant Colony Optimization Techniques for the Vehicle Routing Problem”, Advanced Engineering Informatics, Vol. 18, pp.41-48.

Baràn, B., M. Schaerer, (2003), “A multi-objective ant colony system for vehicle routing problem with time windows”, in: Proceedings of the Twenty-first IASTED International Conference on Applied Informatics, pp. 97–102.

Bent, R., Hentenrych, P.V., (2006), “A two-Stage hybrid for Pickup and Delivery Vehicle Routing Problems with Time Windows”, Computers and Operations Research, Vol. 33, pp.875-893.

Berman, O., Jaillet, P., Simchi-Levi, D., (1995), “Location-Routing Problems with uncertainty” In: Drezner, Z. (Ed.), Facility Location: A Survey of Applications and Methods, Springer, New York, pp.427-452.

Bianchi, L., et al., (2004), “Meta-heuristics for the Vehicle Routing Problem with Stochastic Demands”, PPSN, VIII, LNCS 3242, pp.450-460.

Bianchi, L., et al., (2006), “Hybrid Meta-Heuristics for the Vehicle Routing Problem with Stochastic Demands”, Journal of Mathematical Modeling and Algorithms, pp.91-110.

Bodin, L.D., (1979), “A Taxonomic Structure for Vehicle Routing and Scheduling problems,” Computers Urban Society., Vol. 1, pp.11-29.

Bodin, L., Golden, B., Assad, A., and Ball, M., (1983), “Vehicle Routing and Scheduling”, Computer and Operations Research, Vol. 10, pp. 67-211.

Boffey, B., (1995), “Multi-objective routing problems”, Top 3, pp. 167–220.

Borges, P.C., and M.P. Hansen, (2002), “Essays and surveys in metaheuristics, chapter A study of Global Convexity for a Multiple Objective Traveling Salesman Problem”, Kluwer Academic Publishers, Norwell, pp. 129–150.

Bowerman, R., B. Hall and P. Calamai, (1995), “A multi-objective optimization approach to urban school bus routing: Formulation and solution method”, Transportation Research Part A, Vol. 29, pp. 123–197.

Bres, E.S., D., Burnes, A. Charnes, and W.W.Cooper,(1980) “A Goal Programming Model for Planning Office Accessions”, management Science, Vol. 26, pp.773-783.

Buxery, G., (1979), “The Vehicle Scheduling Problem and Monte-Carlo Simulation” Journal Of Operations Research society, Vol. 30, pp .563-573

Calvete, H.I., Carmen Galé, María-José Oliveros, and Belén Sánchez-Valverde, (2007), “A Goal programming approach to vehicle routing problems with soft time windows”, European Journal of Operational Research, Vol. 177, pp .1720-1733.

Chaing, W.C., R. Russell, “Simulated Annealing Meta-Heuristics for the Vehicle Routing Problem with Time Windows”, An Operations Research, Vol. 93, pp.3-27.

Charnes, A., and Cooper, W.W. “Management Models and Industrial Applications of Linear Programming”, Wiley, New York, 1961.

Chitty, D.M., and M.L. Hernandez (2004), A hybrid ant colony optimisation technique for dynamic vehicle routing. In: K. Deb et al., Editors, GECCO 2004, Lecture Notes in Computer Science, Vol. 3102, Springer-Verlag, pp. 48–59.

Chen, Y., and Yang,H., (2003), “Minimization of Travel time and weighted number of steps in a Traffic Light Network”, European Journal Of Operational Research, Vol. 144, pp.565-580.

Christofides, N. and Eilon, S., (1979), “The Vehicle Routing Problem”, Combinatorial Optimization, New York: Wiley. Christofides, N., Eilon, S., 1972, “Algorithms for Large Scale TSP”, Operational Research Quarterly,Vol. 23, pp.511-518.

Clarke, G., Wright, J. W., (1964), “Scheduling of Vehicle from a Central Depot to a Number of Delivery Points”, Operations Research, Vol. 12, pp. 568-581.

C.A. Coello Coello, D.A. Van Veldhuizen and G.B. Lamont, “Evolutionary algorithms for solving multi-objective problems”, Kluwer, New York (2002).

C.A. Coello Coello, (2000) “An updated survey of GA-based multiobjective optimization techniques”, ACM Computing Surveys, Vol. 32(2), pp. 109–143.

Corberan, A., Fernandez, E., Laguna M., Marti, R., (2002), “Heuristic Solutions to the Problems of Routing School Buses with Multiple Objectives”, Journal of Operational Research Society, Vol. 53, PP.427-435.

Cook, M. T., and Russell, R. A., (1978), “A Simulation and Statistical Analysis of Stochastic Vehicle Routing with Timing Constraints”, Decision Science, Vol. 9, PP. 673-687.

Cordeau, J.F., G. Laporte and A. Mercier, (2001),“A Unified Tabu Search Heuristic for Vehicle Routing problems with Time Windows”, Journal of the Operational Research Society, Vol. 52, PP. 928–936

Current, J.R., and D.A. Schilling(1994), The median tour and maximal covering tour problems: Formulations and heuristics, European Journal of Operational Research, Vol. 73, pp. 114–126.

Current, J.R., Velle, C.S.Re, and Cohon, J.L., (1985), “The Maximum Covering/Shortest Path Problem: A Multi objective Network Design and Routing Formulation”, European Journal of Operational Research, Vol. 21, PP.189-199.

J. Current and M. Marsh, (1993) Multi objective transportation network design and routing problems: Taxonomy and annotation. European Journal of Operational Research, vol. 65, pp. 4–19.

J. Current and H. Min, (1986) Multi objective design of transportation networks: Taxonomy and annotation. European Journal of Operational Research, Vol. 26, pp. 187–201.

J. Current, H. Min and D.A. Schilling,(1990) Multi objective analysis of facility location decisions. European Journal of Operational Research, Vol. 49, pp. 295–307.

J. Current, C. ReVelle and I. Cohon, (1984) The application of location models to the multi objective design of transportation networks. Regional Science Review, Vol. 14, pp. 1–23.

Czyżak, P., and A. Jaszkiewicz, (1998), “Pareto simulated annealing—a Metaheuristic Technique for Multiple-objective combinatorial optimization”, Journal of Multi-Criteria Decision Analysis, Vol. 7, pp. 34–37.

Da Silva, G.C., Figueira, J., Climaco, J., (2007), “Integrating Pareto Optimization with Scatter Search for Solving Bi-Criteria {0, 1} Knapsack problems”, European Journal of Operational Research, Vol. 177, PP. 1656-1677.

Daskin, M., (1985), “Logistics: An Overview of the State of the Art and Perspectives on Future Research”, Transportation Research Part A, Voll. 19, PP. 383-398.

K. Deb(1999), Multi-objective genetic algorithms: problem difficulties and construction of test problems, Evolutionary Computation, Vol. 7(3), pp. 205–230.

K. Deb, A. Pratap, S. Agarwal and T. Meyarivan (2002), A fast and elitist multi-objective genetic algorithm NSGA-II, IEEE Transactions on Evolutionary Computation, Vol. 6(2), pp. 182–197.

Desrochers,M., J. Desrosiers and M. Solomon, (1992), “A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows”, Operations Research, Vol. 40, PP. 342–354.

Desrosiers, J., F. Somis and M. Destrochers, (1984), “Routing with Time Windows by Column Generation”, Network, Vol. 14, PP.545-565.

Doerner, K., A. Focke and W.J. Gutjahr, (2006), “Multicriteria tour planning for mobile healthcare facilities in a developing country”, European Journal of Operational Research (2006).

Donati, A.V., Montemanni, R., Norman, C., Rizzoli, A.E., Gambardella, L.C., (2007), “Time Dependent Vehicle Routing Problem with a Multi Ant Colony system”, European Journal of Operational Research 2007 (in press)

Dror, M., Laporte, G., (1993), “Vehicle Routing with Stochastic Demands and Restricted Failures”, Zeitschrift Fur Operations Research, Vol. 37, PP.273-283.

Dror, M., Trudreau, P., (1986), “Stochastic Vehicle Routing with Modified Savings Algorithms”, European Journal of Operational research, Vol. 23, PP. 228-235.

M. Ehrgott and X. Gandibleux,Kluwer, Dordrecht (2002), Multiobjective combinatorial optimization. In: M. Ehrgott and X. Gandibleux, Editors, International series in operations research and management science vol. 52, pp. 369–444.

Ehrgott, M., (2000), “Approximation algorithms for combinatorial multi-criteria problems”, International Transactions in Operations Research, Vol. 7, pp. 5–31.

El-Sherbeny, N., (2001), “Resolution of a vehicle routing problem with multi-objective simulated annealing method”. Ph.D. thesis, Faculté Polytechnique de Mons, Mons, Belgique, 2001.

Federgruen, A., and P., Zipkin, (1984), “A combined Vehicle Routing and Inventory Allocation Problem”, Operations Research, vol. 32, pp. 1019-1037.

Fisher, M.L., (1987), “Lagrangian Optimization Algorithms for Vehicle Routing Problems” Operational Research, PP. 635-649 Flavell, R.B., “A New Goal programming formulation”, Omega, Vol. 4, pp. 1976, 731-732.

Foster, B.A., and Ryan, D. M., (1976), “An Integer Programming Approach to the Vehicle Scheduling Problem”, Operational Research Quarterly,vol. 27, PP.3367-3384.

Fonseca, C.M., (1995), “Multi-objective Genetic Algorithms with Application to Control Engineering Problems”, Ph.D. Thesis, Department of Automatic Control and Systems Engineering, University of Shefield, Shefield, UK.

Fonseca, C.M., Fleming, P.J., (1995), “Multiple Objective Genetic Algorithms Made Easy: Selection, Sharing and Mating Restrictions”, In IEEE Int. Conference on Genetic Algorithms in Engineering Systems: Innovations and Applications, Page 45, Sheffield, U.K.

Gambardella L.M, Taillard E., Agazzi G., (1999), MACS-VRPTW: “A Multiple Ant Colony System for Vehicle Routing Problems with Time Windows” , In D. Corne, M. Dorigo and F. Glover, editors, New Ideas in Optimization. McGraw-Hill, London, UK, PP. 63-76.

Gearhart, W.B.,(1979) “On the Characterization of Pareto Optimal Solutions in Bicriterion Optimization”, Journal of Optimization Theory and Applications, Vol. 27(2), PP.301-307.

Gendreau, M., A. Hertz, G. Laporte, (1994), “Tabu Search Heuristic for the Vehicle Routing Problem”, Management Science, Vol. 40, PP. 1276-1290.

Geoffrion, A. “Solving Bicriterion Mathematical Programming”, ORSA, 1967.

Geoffrion, A.(1968), Proper efficiency and theory of vector maximization, Journal of Mathematical Analysis and Applications, Vol. 22, pp. 618–630.

Geiger, M.J., (2001), “Genetic algorithms for multiple objective vehicle routing”, in: metaheuristic International Conference 2001 (MIC’2001), pp. 348–353.

Geiger, M.J., (2003), “Multi-Criteria und Fuzzy System in Theory und Praxis chapter A Computational Study of Genetic Crossover Operators for Multi-objective Vehicle Routing Problem with Soft Time Windows”, Deutscher Universitats-Verlag (2003) pp. 191–207.

Giannikos, I., (1998), “A multi objective goal programming model for locating treatment sites and routing hazardous wastes”, European Journal of Operational Research, Vol. 104, pp. 333–342.

Gillet, B.E., L. R. Miller, (1974), "A Heuristic Algorithm for the Vehicle Dispatch Problem", Operations Research, Vol. 22, PP.340-349.

Golden, B., Laporte, G., and Tailard, E.D., (1997), “An Adaptive Memory Heuristic for a Class of VRP with MinMax objectives”, Computers and Operations Research, Vol. 24, PP: 445-452.

Golden, B. L., Stewart, R. A., (1977), “Vehicle Routing with Probabilistic Demands”, Proceedings of the Tenth Annual Symposium on the Interface of Computer Science and Statistics, Gaithersburg, Maryland.

Golden, B. L., and Yee, J. R. 1979, A Framework for Probabilistic Vehicle Routing. AIIE, Vol. 11, pp.109-112.

Greistorfer, P.(2003), A tabu-scatter search metaheuristic for the arc routing problem, Computers and Industrial Engineering, Vol. 44(2), pp. 249–266.

Haimes, Y.Y., L.S.Lasdon, and D.A. Wismer, (1971) “On a Bicriterion Formulation of the Problems of Integrated System Identification and System Optimization” IEEE Transaction on Systems, Man and Cybernetics, pp.296-297.

Haugland, D., Ho, S.C., and Laporte, G., (2005), Designing Delivery Districts for Vehicle Routing Problem with Stochastic Demand. A. Hertz, G. Laporte and M. Mittaz, A tabu search heuristic for the capacitated arc routing problem, Operations Research 48 (2000) (1), pp. 129–135.

Hong S.C., Park, Y.B., (1999) “A Heuristic for Bi-Objective Vehicle Routing Problem with Time Windows Constraints”, International Journal of Production Economics, Vol. 62, PP. 249-258.

Jacobs-Blecha, C., and Goetschalcky, M., (1998) “The Vehicle Routing Problem with Backhauls: Properties and Solution Algorithms”, School of Industrial Engineering and System Engineering, Georgia Institute of Technology.

Jaillet, P., Odoni, A.R., (1988), “The Probabilistic Vehicle Routing Problem”, In Golden, B.L., and Assad, A.A. (Eds.), Vehicle Routing: Methods and Studies, North-Holland, Amsterdam.

Jaillet, P., (1987), “Stochastic Routing Problems”, In: Andretta, G., Mason, F., Serafini, P. (Eds.), Stochastic in Combinatorial Optimization, World Scientific, New Jersey.

Jaszkiewicz, A., (2001), “Genetic Local Search for Multiple objective Combinatorial Optimization”, European Journal of Operational Research , Vol.137, PP.50-71,.

Jaszkiewicz, A., Do multiple objective metaheuristics deliver on their promises? a computational experiment on the set covering problem, IEEE Transactions on Evolutionary Computation 7 (2003) (2), pp. 133–143.

Jones, D.F., S.K. Mirrazavi and M. Tamiz, (2002), “Multi-objective meta-heuristics: An overview of the current state-of-the-art”, European Journal of Operational Research, Vol. 137, pp. 1–9.

Jozefowiez, N., (2004), “Modélisation et résolution Approchées de Problèmes de tournées multi-objectif”, Ph.D. thesis, Laboratoire d’Informatique Fondamentale de Lille, Université des Sciences et Technologies de Lille, Villeneuve d’Ascq, France, December 2004.

Jozefowiez, N., F. Semet and E-G. Talbi, (2002), “Parallel and hybrid models for multi-objective optimization: Application to the vehicle routing problem”, In: J.J. Merelo Guervos et al., Editors, Parallel Problem Solving from Nature VII, Lecture Notes in Computer Science vol. 2439, Springer-Verlag (2002), pp. 271–280.

Jozefowiez, N., F. Semet and E-G. Talbi, (2007), “Multi Objective Vehicle Routing Problem”, European Journal of Operational Reseach, (in press).

Jozefowiez, N., F. Semet, and E-G. Talbi, (2004), “Applications of multi-objective evolutionary algorithm, Advance in Natural Computation”, chapter A multi-objective evolutionary algorithm for the covering tour problem, vol. 1, World Scientific, pp. 247–267.

Jozefowiez, N.,F. Semet and E-G. Talbi, (2007), “The bi-objective covering tour problem”, Computers and Operations Research, Vol. 34, pp. 1929–1942.

Jozefowiez, N., F. Semet and E-G. Talbi, (2005), “Enhancements of NSGA II and its application to the vehicle routing problem with route balancing”, In: E-G. Talbi, P. Liardet, P. Collet, E. Lutton and M. Schoenauer, Editors, Artificial Evolution 2005, 7th International Conference (EA’2005), Lecture Notes in Computer Science vol. 3871, Springer (2006), pp. 131–142.

Jozefowiez, N., F. Semet and E-G. Talbi, (2006), “Target Aiming Pareto Search and its application to the vehicle routing problem with route balancing”, Journal of Heuristics (2006).

Keller, C.P., (1985), “Routing to cover time dependent demand: A Multiple Objective Approach, Sixteen Annual Pittsburgh Conference on Modeling and Simulation, Vol. 16, PP. 651-655.

Keller, C.P., (1985), “Multi-objective routing through space and time: The MVP and TDVRP problems”, Ph.D. thesis, Department of Geography, University of Western Ontario, London, Ontario, Canada, 1985.

Keller, C.P., and M. Goodchild, (1988), “The multi objective vending problem: A generalization of the traveling salesman problem”, Environment and Planning B: Planning and Design 15 (1988), pp. 447–460.

Kim, B., Kim, S., Sahoo, S., (2006), “Waste Collection Vehicle Routing Problems with Time Windows”, Computers and Operations Research, Vol. 33, PP. 3624-3642.

Kohl, N., O.B.G. Madsen, (1997), “An Optimization Algorithm for the Vehicle Routing Problem with time Windows based upon Lagrangian Relaxation”, Operations Research, Vol. 45, PP. 395–406.

Kolen, A.W.J., A.H.G. Rinnooy Kan and H.W.J.M. Trienekens, (1987), “Vehicle Routing with Time Windows”, Operations Research, Vol. 35, PP. 266–273.

Koskosidis, Y.A., W.B. Powell and M.M. Solomon, (1992), “An optimization-based heuristic for vehicle routing and scheduling with soft time window constraints”, Transportation Science, Vol. 26, PP. 69–85.

Lacomme, P., Prins, C., Sevaux, M. (2006), “A Genetic Algorithm for a Bi-Objective Capacitated Arc Routing Problem”, Computers and Operations Research, Vol. 33, PP.3473-3493.

Lacomme, P., Prins, C., Sevaux, M. (2003), “Multi-Objective Capacitated Arc Routing Problem”, In: Fonseca CM., et al. editor, Evolutionary multi-criterion Optimization (Proceeding of EMO 2003, Faro, Portugal). Lecture Notes in Computer Science, Vol. 2632. Berlin: Springer, PP.550-564.

Lai, K.K., B. Liu, J. Peng, (2003), “Vehicle Routing Problem with Fuzzy Travel Times and its Genetic Algorithms”, Technical Report.

Laporte, G., (1992), “The Vehicle Routing Problem: An Overview of Exact and Approximate Algorithms”, European Journal of Operational Research, Vol. 59, PP.345-358.

Lau H.C., Sim, M., Toe, K.M., (2003), “Vehicle Routing Problem with Time Windows and a Limited Number of Vehicles”, European Journal of Operational Research, Vol. 148, PP. 559-569.

Lee, T-R, and J-H. Ueng, (1998), “A Study of Vehicle Routing Problem with Load Balancing”, International Journal of Physical Distribution and Logistics Management, Vol. 29, pp. 646–648.

Lee, Y., Kim, S., Lee, S., Kang, K., (2003), “A Location-Routing Problem in Designing Optical Internet with WDM Systems”, Photonic Network Communications, Vol. 6, pp. 151-160.

Li, W., (2005), ”Finding pareto-optimal set by merging attractors for a Bi-objective traveling salesman problem”, In: C.A. Coello Coello, A.H. Aguirre and E. Zitzler, Editors, Evolutionary Multi-Criterion Optimization, Third International Conference, EMO 2005, Lecture Notes in Computer Science vol. 3410, Springer, Guanajanto, Mexico (2005), pp. 797–810.

Lin, C.K.Y., and R.C.W. Kwok, (2006), “Multi Objective Metaheuristics for a Location-Routing Problem with Multiple use of Vehicles on real data and simulated data” European journal of Operational Research, Vol. 175, PP.1833-1849.

Lin, S., (1965), “Computer Solutions of the Traveling Salesman Problem”, Bell System Technical Journal, Vol. 44, PP.2245-2269.

Lin, S. and B.W. Kernighan, (1973), “An Effective Heuristic Algorithms for the Traveling Salesman Problem”, Operations Research, Vol. 21, PP.498-512.

Liu, B., K. Iwamura, (1998), “Chance Constrained Programming with Fuzzy Parameters”, Fuzzy Sets and Systems 94, PP.227-237.

Lourenço, Paixão and Portugal, (2001), “Multi Objective Metaheuristics for the Bus Driver Scheduling problem”, Transportation Science, Vol. 35, pp. 331–343.

Magnanti, T.L., (1981) “Combinatorial Optimization and Vehicle Fleet Planning: Prospectives and prospects.” Network 7, pp. 179-213.

Martinez, C.G., Cordon, O., Herrera, F., (2007), “A Taxonomy and an Empirical Analysis of Multiple Objective Ant Colony Optimization Algorithms for the bi-Criteria TSP”, European Journal of Operational Research, Vol. 180, PP. 116-148.

Min, H., (1991), “A Multi-Objective Vehicle Routing Problem with Soft Time Windows: The Case of a Public Library Distribution System”, Socio-Economic Planning Science, Vol. 25, PP. 179–188.

P. Moscato, Memetic Algorithms a Short Introduction. In: D. Corne, M. Dorigo and F. Glover, Editors, New ideas in optimization, McGraw-Hill, Maidenhead, UK (1999), pp. 219–234.

Mourgaya, M., Vanderbeck, F., (2007), “Column Generation Based Heuristic for Tactical Planning Multi-Period Vehicle Routing Problem”, European Journal of Operational Research, Vol. 183, PP. 1028-1041.

Murata, T., and R. Itai, (2007), “Local Search in two-fold EMO algorithm to enhance solution similarity for multi-objective vehicle routing problems”, In: S.

Obayashi, K. Deb, C. Poloni, T. Hiroyasu and T. Murata, Editors, EMO (2007) vol. 4403, Springer (2007), pp. 201–215.

Nagy, G. and Salhi, S., (2007), “Location-Routing: Issues, Models and Methods”, European Journal of Operational Research,Vol. 177, PP.649-672.

Murata, T., and R. Itai, (2005), “Multi-objective vehicle routing problems using two-fold EMO algorithm to enhance solution similiraty on non-dominated set”, In: C.A. Coello Coello, A.H. Aguirre and E. Zitzler, Editors, Evolutionary Multi-Criterion Optimization. Third International Conference, EMO 2005, Lecture Notes in Computer Science vol. 3410, Springer, Guanajanto, Mexico (2005), pp. 885–896.

Mirchandani, P., An integrated network/planar multi objective model for routing and siting for hazardous materials and wastes. Transportation Science 25 2 (1991), pp. 146–156.

Ombuki, B., B.J. Ross and F. Hanshar, (2006), “Multi-objective genetic algorithm for vehicle routing problem with time windows”, Applied Intelligence, Vol. 24, pp. 17–30.

Onieva, L., I.Garcia-Zarza, Larraneta, J. (1986), “Interactive Generation of Vehicle Schedules for an Urban Bus System on a Microcomputer”, OR Models in Microcomputers, PP. 67-64.

Pacheco, J., and R. Marti, (2006), “Tabu search for a Multi-objective routing problem”, Journal of the Operational Research Society, Vol. 57, pp. 29–37.

Paquete, L., L. Chiarandini and T. Stützle, (2004), “Pareto local optimum sets in the bi-objective traveling salesman problem: An experimental study”, In: X. Gandibleux,

M. Sevaux, K. Sörensen and V. T’Kindt(2004), Editors, Metaheuristics for Multiobjective Optimization, Lecture Notes in Economics and Mathematical Systems, vol. 535, Springer, pp. 177–199.

Paquete, L., and T. Stützle, (2003), “A two-phase local search for the bi-objective traveling salesman problem”, In: C.M. Fonseca et al., Editors, Evolutionary Multi-criterion Optimization, Lecture Notes in Computer Science vol. 2632, Springer-Verlag (2003), pp. 479–493.

Park, Y.B., Keolling, C.P.(1989) “An Interactive Computerized Algorithm for Multi-Criteria Vehicle Routing Problems”, Computers and Industrial Engineering, Vol. 16, PP.477-490.

Park, Y. B., (1984), “The Solution of Vehicle Routing Problems in a Multiple Objective Environment”, Ph.D. Dissertation, Oklahoma State University, Stillwater Oklahoma, USA.

Park, Y.B., and Keolling, C.P., (1986), ‘A Solution of Vehicle routing problem in Multiple objective environment”, Engineering Costs and Production Economics, vol. 10, PP.121-132.

Y. Park(2001), A hybrid genetic algorithm for the vehicle scheduling problem with due times and time deadlines. International Journal of Production Economics, Vol. 73, pp. 175–188.

J. Potvin, D. Dube and C. Robillard(1996), A hybrid approach to vehicle routing using neural networks and genetic algorithms. Artificial Intelligence, Vol. 6 , pp. 241–252.

Ronen, D. (1988), “Perspectives on Practical Aspects of Truck Routing and Scheduling”, European Journal of Operational Research, Vol. 35, PP.137-145.

Rahoual, M., Kitoun, B., Mabed, MH., Bachelet, V., and Benameur, F., (2001),” Multicriteria Genetic Algorithms for the Vehicle Routing Problem with Time Windows”, MIC 2001 – 4th Metaheuristics International Conference, PP.527-532.

Rahoual, M., B. Kitoun, M. Mabed, V. Bachelet, F. Benameur, (2001),“Multicriteria genetic algorithms for the vehicle routing problem with time windows”, in: Metaheuristic International Conference (MIC’2001), pp. 527–532.

Ribeiro, R., and H.R. Lourenço, (2001), “A multi-objective model for a multi-period distribution management problem”, in: Metaheuristic International Conference 2001 (MIC’2001), pp. 91–102.

Riera-Ledesma, J., and J.J. Salazar-González, (2005), “The bi-objective traveling purchaser problem”, European Journal of Operational Research 160 (2005), pp. 599–613.

Russell, R., and Igo, W., (1979), “An Assignment Routing Problem”, Network, Vol. 9, pp. 1-17.

Sarker, R., and C.A.C. Coello, (2002), “Assessment methodologies for multiobjective evolutionary algorithms”. In: R.

Sarkar, M. Mohammadian and X. Yao, (2002), Evolutionary Optimization, Kluwer Academic Publishers, Massachusetts, pp. 177–195.

Sessomboon, W., Watanabe, K. Irohara, K. “A Study on Multi-Objective Vehicle Routing Problem Considering Customer Satisfaction with due-time (The creation of Pareto Optimal solutions by hybrid genetic algorithm). Transactions of the Japan Society of Mechanical Engineering, 1998.

Schaffer, J.D., (1985), “Multiple objective optimization with vector evaluated genetic algorithms”, Genetic Algorithms and their Applications, Proceedings of the First International Conference on Genetic Algorithms, vch (1985), pp. 93–100.

Shang, J.S., Cuff, C., 1996, “Multi Criteria Pick-up and Delivery Problem with Transfer Opportunity “, computers and Industrial Engineering, Vol. 30, PP. 631-645.

Sessomboon, W. ,K. Watanabe, T. Irohara and K. Yoshimoto, (1998), “A study on multi-objective vehicle routing problem considering customer satisfaction with due-time (the creation of Pareto optimal solutions by hybrid genetic algorithm)”, Transaction of the Japan Society of Mechanical Engineering (1998).

Skitt, R.A. and Levary, R.R., (1985), “Vehicle Routing via Column Generation” European Journal of Operational Research, Vol. 21, PP. 65-75.

Solomon, M.M., (1987), “Algorithms for the vehicle routing and scheduling problem with time windows constraints”, Operations Research, Vol. 35, PP. 254–265.

Solomon, M.M., J. Desrosiers, (1988), “Time window constrained routing and scheduling problems”, Transportation Science, Vol. 22, PP. 1–13.

Solomon, M.M., (1987), “Algorithms for the Vehicle Routing and Scheduling Problem with Time Window Constraints”, Operations Research, Vol. 35, PP.254-265.

Stewart, W. R. (1981), “New Algorithms for Deterministic and Stochastic Vehicle Routing Problems”, Ph.D. Dissertation, University of Maryland.

Stewart, W. R., and Golden B.L., (1984), “A Lagrangian Relaxation Heuristic for Vehicle Routing”, European Journal of Operational Research, Vol. 17, PP.84-88.

Sutcliffe, C., and J. Board, (1990), “Optimal solution of a vehicle routing problem: Transporting mentally handicapped adults to an adult training centre”, Journal of the Operational Research Society, Vol. 41, pp. 61–67.

Sexton, T.R., Y.M. Choi, (1986), “Pickup and delivery of partial loads with soft time windows”, American Journal of Mathematical and Management Sciences, Vol. 6, PP. 369–398.

Taillard, E., P. Badezu, M. Gendreau, F. Guertin and J.Y. Potvin, (1997), “A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows”, Transportation Science, Vol. 31, PP. 170–186.

Talliard, E.D., (1999), “A Heuristic Column Generation Method for the Hetregeneous Fleet”, VRP, RAIRO, Vol. 33, PP.1-14.

Talbi, E.G., (2000), “Meta-heuristices pour l’optimisation combinatoire multi-objectif: Etat de l’art, Submitted to RAIRO 2000.

Tan, K.C., T.H., Chew, Y.H., Lee, L.H., (2003), “A Hybrid Multi-objective Evolutionary Algorithm for Solving Truck and Trailer Vehicle Routing Problems” In: Proceedings of the 2003 Congress on Evolutionary Computation, Canberra, Australia, 8-12 December, Vol. 3. PP. 2134-2141.

Tan, K.C., T.H., Chew, Y.H., Lee, L.H., (2003), “A Multi-objective Evolutionary Algorithm for Solving Vehicle Routing Problem with Time Windows” In: Proceedings of the IEEE International Congress on Systems, Man and Cybernetics, Washington, DC, USA, 5-8 October 2003, Vol.1, PP.361-366.

Tan, K.C., Cheong, C.Y., Goh, C.K., (2007) “Solving Multi-objective Vehicle Routing Problem with Stochastic Demand via Evolutionary Computation”, European Journal of Operational Research, Vol. 177, PP. 813-839.

Tan, K.C., Y.H. Chew and L.H. Lee, (2006), “A hybrid multi-objective evolutionary algorithm for solving vehicle routing problem with time windows”, European Journal of Operational Research, Vol. 34, pp. 115–151.

Tan, K.C., T.H. Lee, Y.H. Chew and L.H. Lee,(2003) “A Multi objective evolutionary algorithm for solving vehicle routing problem with time windows”, IEEE International Conference on Systems, Man, and Cybernetics, IEEE Service Center, pp. 361–366.

Tan, K.C., Y.H. Chew and L.H. Lee, (2006) ‘A hybrid multi-objective evolutionary algorithm for solving truck and trailer vehicle routing problems”, European Journal of Operational Research, Vol. 172, pp. 855–885.

Tan, C. and J., Beasley, (1984), “A Heuristic Algorithm for the Period Vehicle Routing Problem”, Omega 12, PP.497-504.

Tavakkoli-Moghaddam, R., N. Safaei, Y. Gholipour, (2006) “A Hybrid Simulated Annealing for Capacitated Vehicle Routing Problems with the Independent Route Length” Applied mathematics and Modeling.

Tavakkoli-Moghaddam, R., N. Safaei, M.M.O. Kah, and M. Rabbani(2007) “A New Capacitated Vehicle Routing Problem with Split Service for Minimizing Fleet Cost by Simulated Annealing”, Journal of the Franklin Institute Journal of Faraklin.

D. Teodorovic, G. Pavkovic, (1996), “The Fuzzy set Theory Approach to the Vehicle Routing Problem when Deman at nodes are uncertain”, Fuzzy Sets and Systems, vol. 82, PP.307-317.

Tillman, F. A., (1969), “The Multiple Terminal Delivery Problem with Probabilistic Demands”, Transportation Science, Vol. 3, PP.192-204.

Tillman, F. A., and Gain T. M., (1972), “An Upper Bound Algorithm for the Single and Multiple Terminal Delivery problem”, Management Science,Vol. 18, PP.664-682.

Turner, W.C., and Vu, V.T., (1979), “Systems Design for Rural Refuse Collections”, AIIE, Vol. 11, PP.84-85.

Ulungu, E., and J. Teghem,(1995) “The two-phase method: An efficient procedure to solve bi-objective combinatorial optimization problems”, Foundations of Computing and Decision Sciences, Vol. 20, pp. 149–165.

Van Landeghem, H.R.G., (1988), “A Bi-Criteria Heuristics for the Vehicle Routing Problem with Time Windows”, European Journal of Operational Research, Vol. 36, PP. 217-226.

Van Veldhuizen, D., Lamont, G.B., (1998), “Multiple Objective Evolutionary Algorithms Research: A history and Analysis”, Technical Report TR-98-03, Department of Electrical and Computer Engineering, Air Force institute of Technology,

Ohio. Viana, A., and J. Pinho de Sousa, 2000, “Using metaheuristics in Multi-objective resource constrained project scheduling”, European Journal of Operational Research, Vol. 120, PP: 359–374.

Wassan, N.A. & Osman, I.H., (2002), “Tabu Search Variants for the Mix Fleet Vehicle Routing Problem”, Journal of the Operational Research Society, Vol. 53, PP.768-782.

Waters, C.D., (1984), Interactive Vehicle Routing, “Operational Research Society”, Vol. 35, PP. 821-826.

Yee, J.R., and Golden, B.L., (1980), “A Note on Determining Strategies for Probabilistic Vehicle Routing”, Naval Research Logistics Quarterly, Vol. 27, PP. 159-163.

Yellow, P.C. (1970), “A Computational Modification of the Savings Method of Vehicle Scheduling”, Operational Research Quarterly, Vol. 21, PP. 281-283.

Zare Mehrjerdi, Y., (1993), “A Multiple Objective Stochastic Approach to Vehicle Routing Problem”, Conference on Applied Probability in Engineering, Computer and Communication Sciences INRIA/ORS/TIMS/SMAI, Paris, June 16-23, 1993.

Zare Mehrjerdi, Y., (1986), A Goal Programming Model of the Stochastic Vehicle Routing Problem”, Ph.D. Dissertation, Oklahoma State University, Stillwater, Oklahoma. USA.

Zare Mehrjerdi Y., (2014), “A Multiple Objective Stochastic Approach to Vehicle Routing Problem”, The International Journal of Advanced Manufacturing Technology Vol. 74.

Zare Mehrjerdi Y., (2013), “Stochastic Approach to Vehicle Routing Problem: Development and Theories”, International Journal of Industrial Engineering, Vol. 24 (4), pp. 285-295.

Zhenyu, Y., L. Zhang, K. Lishan and L. Guangming, (2003) “A new MOEA for multi-objective TSP and its convergence property analysis”, In: C.M. Fonseca et al., Editors, Evolutionary multi-criterion optimization, Lecture Notes in Computer Science vol. 2632, Springer-Verlag, pp. 342–354.

Zheng, Y., and Liu, B., (2006), “Fuzzy Vehicle Routing Model with Credibility Measure and its hybrid intelligent Algorithm”, Applied Mathematics and Computations,Vol. 176, PP. 673-683.

Zhou, G., Hokey, M., Mitsuo, G., (2003), “A Genetic Algorithm Approach to the Bi-Criteria Allocation of Customers to Warehouse”, International Journal Of Production Economics, Vol. 86, PP: 35-45.

E. Zitzler, K. Deb and L. (2000) Thiele, Comparison of multiobjective evolutionary algorithms empirical results, Evolutionary Computation, Vol. 8(2), pp. 173–195.

Zografos, K.G., and K.N. Androustsopoulos(2004), “A heuristic algorithm for solving hazardous material distribution problems”, European Journal of Operational Research, Vol. 152, pp. 507–519.

Books, Surveys and others Cohon, J.(2001), Multi Objective Programming and Planning, Academic Press, New York (1978). Deb, K, “Multi-objective Optimization using Evolutionary Algorithms, John Wiley and Sons .

Hwang, C., and K. Yoon.(1981) “Multiple Attribute Decision Making: Methods and Applications”, Springer, Berlin.

Ijiri, Y., (1965) “Management Goals and Accounting for Control”, Rand MCNally, Chicago.

Lee, Sang, M(1972) , “Goal Programming for Decision Making Analysis”, Auerbach Publishers, Philadelphia.

Romero, C., (1991), “Handbook of Critical Issues in Goal Programming”, Pergamon Press, Oxford.

Schniederjans, M., (1995), “Goal Programming Methodology and Applications”, Kluwer Publishers, Boston.

Zeleny, M., (1982), “Multiple Criteria Decision Making”, McGraw-Hill, New York.

Zeleny, M.(1974), “Linear Multiple Objective Programming”, Springer-Verlag, New York.

Tamiz, M., D.F. Jones and C. Romero, (1998), “Goal programming for decision making: An overview of the current state-of-the-art”, European Journal of Operational Research, Vol. 111, pp. 569–581.

Steuer, R., Na, P. “Multiple Criterion Decision Making Combined with Finance: A Categorized Bibliographical Study”, European Journal of Operational Research, Vol. 150, pp. 496-515.

Madsen, (1981). O.B.G. Madsen, A survey of methods for solving combined location-routing methods. In: N.K. Jaiswal, Ed., Scientific Management of Transport Systems, North-Holland, Amsterdam, Holland (1981), pp.194–201.

Yahia Zare Mehrjerdi, (2013d) Operations Research a Profit Making Tool, LAP publishing Co. Germany.

Yahia Zare Mehrjerdi, (2013e), Multi-Criteria Risk-Benefit Analysis of Healthcare Management, International Journal of Industrial Engineering, Vol. 24 (3), pp. 151-167.

Yahia Zare Mehrjerdi, (2013f) Group decision making process for RFID-based system selection using fuzzy TOPSIS approach, Artificial Intelligence Research, vol. 2 (3).

Colin, O.B.(1985), “A Linear Goal Programming Model for Public Sector Project Selection”, Journal of Operational Research Society, Vol. 36, PP.13-23.

Joiner, C., and Drakke, A.E., “Government Planning and Budgeting with Multiple Objective Models”, Omega, Vol. 11, PP. 57-66.

Gleason, J.M., and Lilly,C.C.(19770,”A Goal Programming Model for Insurance Agency Management”, Decision Sciences, Vol. 8, pp. 180-190.

W.R. Stewart, B.L. Golden and F. Gheysens (1982), “A survey of stochastic vehicle routing”. In: Proceedings of 1982 IEEE International Large Scale Systems Symposium, pp. 229–232.

D. F. Jones, D.F., S. K. Mirrazavi and M. Tamiz,(2002) “Multi-objective meta-heuristics: An overview of the current state-of-the-Art”, European Journal of Operational Research, Vol. 137, PP.1-9.

Romero, C., D.F. Jones and M. Tamiz ,(1998) “Goal programming, compromise programming, and reference-point method formulations: Linkages and utility theorems”. Journal of the Operational Research Society, Vol. 49, pp. 986–991.

Yu , P.L.,(1973) “A class of solutions for group decision problems”. Management Science, Vol. 19, pp. 936–946.

Bell, J.E., Mcmullen,P.R.,(2004) “Ant Colony Optimization techniques for the Vehicle Routing Problem”, Advanced Engineering Informatics, Vol. 18, PP. 41-48.

Yoshiike, N., Takefuji, Y., (2002) “Solving Vehicle Routing Problems by Maximum Neuron Model”, Advanced Engineering Informatics, Vol. 16, PP. 99-105.

Gebresenbet, G., Ljungberg, D.,(2001) “Coordination and Route Optimization of Agricultural Goods Transport to Attenuate Environmental Impacts“, Journal of Agricultural Engineering Research, Vol. 80, pp. 329-342.

DPS, Distribution Planning Software (1996), Route LogiX. Gebresenbet, G., Oostra, H., “Environmental Impact of goods transport with special emphasis on agricultural and related products: Part 1: A Simulation Model for Goods Transport and Environmental Research, MODTRANS. Department of Agricultural Engineering, Swedish University of Agricultural Sciences, Report 219, Uppsala, Sweden.

Zare Mehrjerdi, Yahia, (2008) RFID-enabled systems: a brief review, Assembly Automation, Vol.28(3), pp. 235–245.

Zare Mehrjerdi, Yahia (2009), RFID-enabled supply chain systems with computer Simulation, Assembly Automation 29/2, pp. 174–183

Zare Mehrjerdi, Yahia, (2011a), RFID Adoption: A Systems Thinking Perspective through Profitability Engagement, Assembly Automation.

Zare Mehrjerdi, Yahia, (2011b), RFID and its benefits: A Multiple case analysis, Assembly Automation.

Zare Mehrjerdi, Yahia, (2010) Coupling RFID with supply chain to enhance productivity, Business Strategy Series, VOL. 11 NO. 2, pp. 107-123.

Zare Mehrjerdi, Y. (2013c) A Framework for Six-Sigma Driven RFID-Enabled Supply Chain Systems, International Journal of Quality and Reliability Management.

Zare Mehrjerdi, Y. (2012) Vehicle routing problem: meta-heuristic approaches, International Journal of Applied Operational Research. vol. 2 (3), pp. 55-68

Zare Mehrjerdi, Y. and Nadizadeh, A. (2013a), using greedy clustering method to solve capacitated location-routing problem with fuzzy demands, European Journal of Operational Research, Vol. 229, 2013.

Moubed, Mitra, Zare Mehrjerdi, Y. (2015), A Robust Modeling Of Inventory Routing In Collaborative Reverse Supply Chains, Vol. 5, No.2.

M. Ruta, F. Scioscia, E. Di Sciascio, F. Gramegna, S. Ieva and G. Loseto, (2010) RFID-assisted Product Delivery in Sustainable Supply Chains: A Knowledge-based Approach, http://www.researchgate.net/publication/221311824.

Zare Mehrjerdi, Y. (2011c) RFID the big role player in the Libraries of the Future, The Electronic Library, Vol 29, No.1 pp.36-51.

Zare Mehrjerdi, Y. (2014) RFID: A Bibliographical Literature Review with Future Research Directions, International Journal of Industrial Engineering 25 (2), 151-190