Skip to main content
SpringerLink
Log in

A multi-objective vehicle routing and scheduling problem with uncertainty in customers’ request and priority

  • Published:
Journal of Combinatorial Optimization Aims and scope Submit manuscript

Abstract

In this paper, a multi-objective vehicle routing and scheduling problem with uncertainty in priority and request of customers is presented. In the proposed model, a set of dynamic requests is received over time, and the planner does not have any information regarding their location and size until they arrive. Moreover, the routing model aims to satisfy different customers according to their specific time windows which were predefined by an expert as (being very important, important, casual or unimportant). This paper uses the proposed model as a multi-objective problem where the total required number of vehicles, the total distance travelled and the waiting time imposed on vehicles are minimized, and the total customers’ satisfaction for service is maximized. An efficient framework for solving this model is designed and its performance is evaluated in different steps for various test problems generalized from Solomon’s VRPTW benchmark problems. The various heuristics and improvement concepts incorporate local exploitation in the evolutionary search, and the concept of Pareto optimality for the multi-objective optimization is used in the proposed procedure. The computational experiments on data sets illustrate the efficiency and effectiveness of the proposed approach.

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

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15

Similar content being viewed by others

References

  • Achutan N, Caccettal L, Hill S (2003) An improved branch-and-cut algorithm for the capacitated vehicle routing problem. Transp Sci 37:153–169

    Article  Google Scholar 

  • Andreatta G, Lulli G (2008) A multi-period TSP with stochastic regular and urgent demands. Eur J Oper Res 185:122–132

    Article  MATH  MathSciNet  Google Scholar 

  • Bent RW, Van Hentenryck P (2004) Scenario-based planning for partially dynamic vehicle routing with stochastic customers. Oper Res 52:977–987

    Article  MATH  Google Scholar 

  • Blaseiro SR, Loiseau I, Ramonet J (2011) An ant colony algorithm hybridized with insertion heuristics for the time dependent vehicle routing problem with time windows. Comput Oper Res 38:954–966

    Article  MathSciNet  Google Scholar 

  • Braysy O, Dullaert W, Gendreau M (2005) Evolutionary algorithm for the vehicle routing problem with time windows. J Heuristics 10:587–611

    Article  Google Scholar 

  • Chen ZL, Xu H (2006) Dynamic column generation for dynamic vehicle routing with time windows. Transp Sci 40:74–88

    Article  Google Scholar 

  • Czech ZJ, Czarnas P (2002) Parallel simulated annealing for the vehicle routing problem with time windows. 10th Euromicro workshop on parallel, distributed and network-based processing, Spain, pp 376–383

  • Desrochers M, Desrosiers J, Solomon M (1992) A new optimization algorithm for the vehicle routing problem with time windows. Oper Res 40:342–354

    Article  MATH  MathSciNet  Google Scholar 

  • Dondo R, Cerda J (2007) A cluster-based optimization approach for the multi-depot heterogeneous fleet vehicle routing problem with time windows. Eur J Oper Res 176:1478–1507

    Article  MATH  Google Scholar 

  • Dondo R, Cerda J (2009) A hybrid local improvement algorithm for large-scale multi-depot vehicle routing problems with time windows. Comput Chem Eng 33:513–530

    Article  Google Scholar 

  • Eksioglu B, Vural AV, Reisman A (2009) The vehicle routing problem: a taxonomic review. Comput Ind Eng 57:1472–1483

    Article  Google Scholar 

  • Erbao C, Mingyong L (2010) The open vehicle routing problem with fuzzy demands. Exp Syst Appl 37:2405–2411

    Article  Google Scholar 

  • Gambardella LM, Taillard E, Agazzi G (1999) MACS-VRPTW: a multiple ant colony system for vehicle routing problems with time windows. In: Corne D, Dorigo M, Glover F (eds) New ideas in optimization. McGraw- Hill, London, pp 63–76

  • Garcia-Najera A, Bullinaria JA (2011) An improved multi-objective evolutionary algorithm for the vehicle routing problem with time windows. Comput Oper Res 38:287–300

    Article  MATH  MathSciNet  Google Scholar 

  • Gendreau M, Guertin F, Potvin JV, Taillard E (1999) Parallel tabu search for real-time vehicle routing and dispatching. Transp Sci 33:381–390

    Article  MATH  Google Scholar 

  • Ghoseiri K, Ghannadpour SF (2010a) Multi-objective vehicle routing problem with time windows using goal programming and genetic algorithm. Appl Soft Comput 4:1096–1107

    Article  Google Scholar 

  • Ghoseiri K, Ghannadpour SF (2010b) A hybrid genetic algorithm for multi-depot homogeneous locomotive assignment with time windows. Appl Soft Comput 10:53–65

    Article  Google Scholar 

  • Godfrey G, Powell WB (2002) An adaptive dynamic programming algorithm for dynamic fleet management, I: Single period travel times. Transp Sci 36:21–39

    Article  MATH  Google Scholar 

  • Golden BL, Wasil EA, Kelly JP, Chao I-M (1998) The impact of metaheuristics on solving the vehicle routing problem: algorithms, problem sets, and computational results. In: Crainic TG, Laporte G (eds) Fleet management and logistics. Kluwer, Boston, pp 33–56

    Chapter  Google Scholar 

  • Gulczynski D, Golden B, Wasil E (2010) The split delivery vehicle routing problem with minimum delivery amounts. Transp Res E 46:612–626

    Article  Google Scholar 

  • Haghani A, Jung S (2005) A dynamic vehicle routing problem with time-dependent travel times. Comput Oper Res 32:2959–2986

    Article  MATH  Google Scholar 

  • Jemai J, Mellouli KH (2008) A neural-tabu search heuristic for the real time vehicle routing problems. J Math Model Algorithms 7:161–176

    Article  MATH  MathSciNet  Google Scholar 

  • Juan A, Faulin J, Garsman S, Riera D, Marull J, Mendez C (2011) Using safety stocks and simulation to solve the vehicle routing problem with stochastic demands. Transp Res C 19:751–765

    Article  Google Scholar 

  • Kilby P, Prosser P, Shaw P (1998) Dynamic VRPs: a study of scenarios. Technical Report APES-0-1998, University of Strathclyde

  • Kohl N (1995) Exact methods for time constrained routing and related scheduling problems. Ph.D. Thesis, Department of Mathematical Modeling, Technical University of Denmark

  • Larsen J (1999) Parallelization of the vehicle routing problem with time windows. Ph.D. thesis, IMM-PHS-1999-62, Department of Mathematical Modelling, Technical University of Denmark, Lynghy, Denmark

  • Larsen A, Madsen OBG, Solomon MM (2004) The a-priori dynamic traveling salesman problem with time windows. Transp Sci 38:459–572

    Article  Google Scholar 

  • Lei H, Laporte G, Guo B (2011) The capacitated vehicle routing problem with stochastic demands and time windows. Comput Oper Res 38:1775–1783

    Article  MATH  MathSciNet  Google Scholar 

  • Li F, Golden B, Wasil E (2005) Very large scale vehicle routing: new test problems algorithms and results. Comput Oper Res 32:1165–1179

    Article  MATH  Google Scholar 

  • Lin CKY (2011) A vehicle routing problem with pickup and delivery time windows, and coordination of transportable resources. Comput Oper Res 38:1596–1609

    Article  MATH  MathSciNet  Google Scholar 

  • Lorini S, Potvin JY, Zufferey N (2011) Online vehicle routing and scheduling with dynamic travel times. Comput Oper Res 38:1086–1090

    Article  MATH  Google Scholar 

  • Montemanni R, Gambardella LM, Rizzoli AE, Donati AV (2005) Ant colony system for a dynamic vehicle routing problem. J Comb Opt 10:327–343. doi:10.1007/s10878-005-4922-6

    Article  MATH  MathSciNet  Google Scholar 

  • Negata Y, Braysy O, Dullaret W (2010) A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows. Comput Oper Res 37:724–737

    Article  Google Scholar 

  • Ombuki B, Ross B, Hanshar F (2006) Multi-objective genetic algorithm for vehicle routing problem with time windows. Appl Intell 24:17–30

    Article  Google Scholar 

  • Pepin AS, Desaulniers G, Herts A, Huisman D (2009) A comparison of five heuristics for the multiple depot vehicle scheduling problem. J Sched 12:17–30

    Article  MATH  MathSciNet  Google Scholar 

  • Pisinger D, Ropke S (2007) A general heuristic for vehicle routing problems. Comput Oper Res 34:2403–2435

    Article  MATH  MathSciNet  Google Scholar 

  • Potvin JY, Xu Y, Benyahia I (2006) Vehicle routing and scheduling with dynamic travel time. Comput Oper Res 33:1129–1137

    Article  MATH  Google Scholar 

  • Salhi S, Petch RG (2007) A GA based heuristic for the vehicle routing problem with multiple trips. J Math Model Algorithms 6:591–613

    Article  MATH  MathSciNet  Google Scholar 

  • Sheng HH, Wang JC, Hanng HH, Yen DC (2006) Fuzzy measure on vehicle routing problem of hospital materials. Exp Syst Appl 30:367–377

    Article  Google Scholar 

  • Solomon MM (1987) Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper Res 35:254–265

    Article  MATH  MathSciNet  Google Scholar 

  • Tan KC, Lee LH, Zhu KQ, Qu K (2001) Heuristic methods for vehicle routing problem with time windows. Artif Intell Eng 15:281–295

    Article  Google Scholar 

  • Tan KC, Chew YH, Lee LH (2006) A hybrid multiobjective evolutionary algorithm for solving vehicle routing problem with time windows. Comput Optim Appl 34:115–151

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  Google Scholar 

  • Tanga J, Pan ZH, Fung RYK, Lau H (2009) vehicle routing problem with fuzzy time windows. Fuzzy Sets Syst 160:683–695

    Article  Google Scholar 

  • Taniguchi E, Shimamoto H (2004) Intelligent transportation system based dynamic vehicle routing and scheduling with variable travel times. Transp Res C 12:235–250

    Article  Google Scholar 

  • Tavakkoli-Moghaddam R, Saremi AR, Ziaee MS (2006) A memetic algorithm for a vehicle routing problem with backhauls. Appl Math Comput 181:1049–1060

    Article  MATH  MathSciNet  Google Scholar 

  • Tavakkoli-Moghaddam R, Safaei N, Kah MMO, Rabbani M (2007) A new capacitated vehicle routing problem with split service for minimizing fleet cost by simulated annealing. J Frankl Inst 344:406–425

    Article  MATH  MathSciNet  Google Scholar 

  • Wassan AN, Wassan AH, Nagy G (2008) A reactive tabu search algorithm for the vehicle routing problem with simultaneous pickups and deliveries. J Comb Opt 15:368–386. doi:10.1007/s10878-007-9090-4

    Article  MATH  MathSciNet  Google Scholar 

  • Yu S, Ding CH, Zhu K (2011) A hybrid GA-TS algorithm for open vehicle routing optimization of coal mines material. Exp Syst Appl 38:10568–10573

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Industrial Engineering, Iran University of Science and Technology, Tehran, Iran

    S. F. Ghannadpour & S. Noori

  2. Department of Industrial Engineering, College of Engineering, University of Tehran, Tehran, Iran

    R. Tavakkoli-Moghaddam

Authors
  1. S. F. Ghannadpour
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S. Noori
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. R. Tavakkoli-Moghaddam
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to S. F. Ghannadpour.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ghannadpour, S.F., Noori, S. & Tavakkoli-Moghaddam, R. A multi-objective vehicle routing and scheduling problem with uncertainty in customers’ request and priority. J Comb Optim 28, 414–446 (2014). https://doi.org/10.1007/s10878-012-9564-x

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-012-9564-x

Keywords

Search

Navigation