Skip to main content
SpringerLink
Log in

A multiple objective stochastic approach to vehicle routing problem

  • ORIGINAL ARTICLE
  • Published:
The International Journal of Advanced Manufacturing Technology Aims and scope Submit manuscript

Abstract

This research incorporates the concept of chance-constrained programming and multiple objective goal programming in the area of vehicle routing problem. The research led to the development of the model of the goal programming (GP) stochastic vehicle routing problem (SVRP) that allows decision-makers’ involvement in the solution process of problem for obtaining satisfactory solutions. Due to the complexity of the SVRP, a set of stations to be visited by a fleet of vehicles needs to be partitioned into feasible sets of routes, one for each vehicle enabling the application of the multiple objectives GP technique to each of the vehicle routes. The multiple objectives SVRP then consisted of the following two major stages: (1) route construction stage (RCS) and (2) route improvement stage (RIS). The RCS of the problem consists of the problem formulation and partitioning a set of stations into feasible sets of vehicle routes. Due to the complexity of the problem, only heuristic methods for solving SVRP are considered in this stage. On the other hand, the RIS of the problem consists of (1) problem formulation in which goals and probabilistic constraints are identified, (2) transformation of problem in (1) into an equivalent deterministic form, and (3) GP formulation of RIS in which priorities of various goals are identified. To solve the problems stated in the RCS and RIS of the problem, two interactive computer programs coded in Fortran computer language are developed. To test and validate the algorithm proposed in this research, two test problems, usually employed by other researchers, were took into consideration. A modification of the Clarke and Write algorithm is developed to determine the most favorable vehicle routes of the SVRP for the “E”-type problem. Additionally, two heuristic algorithms which are the modification of the Clarke and Wright “savings” approach are developed for solving the “F”-type problem. The E- and F-type problems are the name given to the equivalent deterministic form of the probabilistic cost minimization problem and total loading and unloading time minimization problem, respectively.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Bent R, Hentenrych PV (2006) A two-stage hybrid for pickup and delivery vehicle routing problems with time windows. Comput Oper Res 33:875–893

    Article  MATH  Google Scholar 

  2. Bertsimas DJ, Jaillet P, Odoni AR (1990) A priori optimization. Oper Res 38:1019–1033

    Article  MathSciNet  MATH  Google Scholar 

  3. Bianchi L et al (2004) Metaheuristics for the vehicle routing problem with stochastic demands. PPSN, VIII, LNCS 3242, pp.450–460

  4. Bianchi L et al (2006) Hybrid metaheuristics for the vehicle routing problem with stochastic demands. J Math Model Algorithm 5:91–110

    Article  MathSciNet  MATH  Google Scholar 

  5. Bodin L, Golden B, Asad A, Ball M (1983) Vehicle routing and scheduling. Comput Oper Res 10(1983):67–211

    Google Scholar 

  6. Buxery G (1979) The vehicle scheduling problem and Monte Carlo simulation. J Oper Res Soc 30:563–573

    Article  Google Scholar 

  7. Charnes A, Cooper W (1963) Deterministic equivalents for optimizing and satisfying under chance constraints. Oper Res 11:18–39

    Article  MathSciNet  MATH  Google Scholar 

  8. Christofides N, Eilon S (1979) The vehicle routing problem. Combinatorial optimization. Wiley, New York

    Google Scholar 

  9. Christofides N, Eilon S (1972) Algorithms for large scale TSP. Oper Res Q 23:511–518

    Article  MathSciNet  MATH  Google Scholar 

  10. Clarke G, Wright JW (1964) Scheduling of vehicle from a central depot to a number of delivery points. Oper Res 12:568–581

    Article  Google Scholar 

  11. Cook MT, Russell RA (1978) A simulation and statistical analysis of stochastic vehicle routing with timing constraints. Decision Sci 9:673–687

    Article  Google Scholar 

  12. Dror M, Laporte G (1993) Vehicle routing with stochastic demands and restricted failures. Z Oper Res 37:273-283

  13. Foster BA, Ryan DM (1976) An integer programming approach to the vehicle scheduling problem. Oper Res Q 27:3367–3384

    Article  MathSciNet  Google Scholar 

  14. Golden BL, Yee JR (1979) A framework for probabilistic vehicle routing. AIIE 11:109–112

    Article  Google Scholar 

  15. Golden BL, Assad A, Levy L, Gheysens F (1984) The fleet size and mix vehicle routing problem. Comput Oper Res 1:49–66

    Article  Google Scholar 

  16. Golden BL, Stewart RA (1977) Vehicle routing with probabilistic demands. Proceedings of the Tenth Annual Symp. on the Interface of Computer Science and Statistics, Gaithersburg, Maryland

  17. Golden BL, Magnanti TL, Nguyen HQ (1977) Implementing vehicle routing algorithms. Networks 7:113–148

    Article  MATH  Google Scholar 

  18. Haugland D, Ho SC, Laporte G (2005) Designing delivery districts for vehicle routing problem with stochastic demand

  19. Holmes RA, Parker RG (1976) A vehicle scheduling procedure based upon savings and a solution perturbation scheme. Oper Res Q 27:83–92

    Article  MATH  Google Scholar 

  20. Jaillet P, Odoni AR (1988) The probabilistic vehicle routing problem. In: Golden BL, Assad AA (eds) Vehicle routing: methods and studies. North-Holland, Amsterdam

    Google Scholar 

  21. Jaillet P (1987) Stochastic routing problems. In: Andretta G, Mason F, Serafini P (eds) Stochastics in combinatorial optimization. World Scientific, New Jersey

    Google Scholar 

  22. Kataoka S (1963) A stochastic programming model. Econometrica 31:181–196

    Article  MathSciNet  MATH  Google Scholar 

  23. Laporte G (1992) The vehicle routing problem: an overview of exact and approximate algorithms. Eur J Oper Res 59:345–358

    Article  MATH  Google Scholar 

  24. Laporte G, Louveaux F (1993) The integer L-shaped method for stochastic integer programs with complete recourse. Oper Res Lett 33:133–142

    Article  MathSciNet  Google Scholar 

  25. Lawler E, Lenstra A, Rinnooy Kan G (1985) The traveling salesman problem. Wiley, New York

  26. Magnanti TL (1981) Combinatorial optimization and vehicle fleet planning: perspectives and prospects. Networks 7:179–213

    Article  MathSciNet  Google Scholar 

  27. Nagy G, Salhi S (2007) Location-routing: issues, models and methods. Eur J Oper Res 177:649–672

    Article  MathSciNet  MATH  Google Scholar 

  28. Park YB (1984) The solution of vehicle routing problems in a multiple objective environment. Ph.D. dissertation, Oklahoma State University, Stillwater Oklahoma, USA

  29. Peters RJ, Chu K, Jamshidi M (1978) Optimal operation of a water resources system by stochastic programming. Mathematical programming study 9, North Holand Publishing Company, Amsterdam, pp. 152–177

  30. Salhi S, Rand GK (1987) Improvements to vehicle routing heuristics. J Oper Res Soc 38:293–295

    Article  Google Scholar 

  31. Stacey PJ (1983) Practical vehicle routing using computer programs. J Oper Res Soc 34:975–981

    Article  Google Scholar 

  32. Stewart WR (1981) New algorithms for deterministic and stochastic vehicle routing problems. Ph.D. Dissertation, University of Maryland

  33. Stewart WR, Golden BL (1984) A Lagrangian relaxation heuristic for vehicle routing. Eur J Oper Res 17:84–88

    Article  Google Scholar 

  34. Tan KC, Cheong CY, Goh CK (2007) Solving multi objective vehicle routing problem with stochastic demand via evolutionary computations. Eur J Oper Res 177:813–839

    Article  MATH  Google Scholar 

  35. Tillman FA (1969) The multiple terminal delivery problem with probabilistic demands. Transp Sci 3:192–204

    Article  Google Scholar 

  36. Tillman FA, Gain TM (1972) An upper bound algorithm for the single and multiple terminal delivery problem. Manag Sci 18:664–682

    Article  MATH  Google Scholar 

  37. Turner WC, Vu VT (1979) Systems design for rural refuse collections. AIIE 11:84–85

    Google Scholar 

  38. Wassan NA, Osman IH (2002) Tabu search variants for the mix fleet vehicle routing problem. J Oper Res Soc 53:768–782

    Article  MATH  Google Scholar 

  39. Waters CD (1984) Interactive vehicle routing. Oper Res Soc 35:821–826

    Article  Google Scholar 

  40. Yee JR, Golden BL (1980) A note on determining strategies for probabilistic vehicle routing. Nav Res Logist Q 27:159–163

    Article  MATH  Google Scholar 

  41. Yellow PC (1970) A computational modification of the savings method of vehicle scheduling. Oper Res Q 21:281–283

    Article  Google Scholar 

  42. Zare Mehrjerdi Y (1986) A goal programming model of the stochastic vehicle routing problem. Ph.D. Dissertation, Oklahoma State University, Stillwater, Oklahoma, USA

  43. Zare Mehrjerdi Y (1993) Planning and Development of water resources systems: a multiple objective approach. Second Conference on Planning and Development, Tehran, Iran

  44. Zheng Y, Liu B (2006) Fuzzy vehicle routing model with credibility measure and its hybrid intelligent algorithm. Appl Math Computat 176:673–683

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Industrial Engineering, Yazd University, Yazd, Iran

    Yahia Zare Mehrjerdi

Authors
  1. Yahia Zare Mehrjerdi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yahia Zare Mehrjerdi.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zare Mehrjerdi, Y. A multiple objective stochastic approach to vehicle routing problem. Int J Adv Manuf Technol 74, 1149–1158 (2014). https://doi.org/10.1007/s00170-014-5895-3

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-014-5895-3

Keywords

Search

Navigation