Skip to main content
SpringerLink
Log in

Peer-induced fairness capacitated vehicle routing scheduling using a hybrid optimization ACO–VNS algorithm

  • Methodologies and Application
  • Published:
Soft Computing Aims and scope Submit manuscript

Abstract

In this paper, we address the problem of delivering a given amount of goods in emergency relief distribution. This problem is considered to be a specific case of capacitated vehicle routing. As a novel issue, peer-induced fairness concern is aimed at securing more customers’ needs by introducing the peer-induced fairness coefficient, which is the value of the population size divided by direct travel time. Thus, a peer-induced fairness capacitated vehicle routing scheduling model is proposed to handle the trade-off between timeliness and fairness in emergency material delivery. To solve the specific NP-hard capacitated vehicle routing problem, the properties of this problem are analysed, and an improved hybrid ACO–VNS algorithm based on ant colony optimization and variable neighbourhood search algorithm with five neighbourhood structures is accordingly presented. A comparison of the proposed algorithm with CPLEX and common optimization algorithms demonstrates that this method achieves better performance in a shorter time and is an efficient way to solve the vehicle routing scheduling problem in emergency relief distribution.

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

Similar content being viewed by others

References

  • Balcik B, Beamon BM, Smilowitz K (2008) Last mile distribution in humanitarian relief. J Intell Transp Syst 12(2):51–63

    Article  Google Scholar 

  • Barbarosoglu G, Arda Y (2004) A two-stage stochastic programming framework for transportation planning in disaster response. J Oper Res Soc 55(1):43–53

    Article  MATH  Google Scholar 

  • Barbarosoglu G, Ozdamar L, Cevik A (2002) An interactive approach for hierarchical analysis of helicopter logistics in disaster relief operations. Eur J Oper Res 140(1):118–133

    Article  MATH  Google Scholar 

  • Bonald T, Massoulié L, Proutière A, Virtamo J (2006) A queueing analysis of max-min fairness, proportional fairness and balanced fairness. Queueing Syst 53(1):65–84

    Article  MathSciNet  MATH  Google Scholar 

  • Bräysy I, Gendreau M (2005) Vehicle routing problem with time windows, part II: metaheuristics. Transp Sci 39(1):119–139

    Article  Google Scholar 

  • Brimberg J, Mladenovic N, Urosevic D (2008) Local and variable neighborhood search for the k-cardinality subgraph problem. J Heuristics 14(5):501–517

    Article  MATH  Google Scholar 

  • Carrabs F, Cerulli R, Sciomachen A (2017) An exact approach for the grocery delivery problem in urban areas. Soft Comput 21(9):2439–2450

    Article  Google Scholar 

  • Chan YP (1999) Facility location: a survey of applications and methods. Transp Sci 33(4):429–430

    Google Scholar 

  • Cordeau JF, Desaulniers G, Desrosiers J et al (2002) The vehicle routing problem. In: Toth P, Vigo D (eds) SIAM monographs on discrete mathematics and applications, vol 9. Society for Industrial and Applied Mathematics, Philidelphia

    Google Scholar 

  • Dorigo M (1992) Optimization, learning and natural algorithms, Ph.D. Thesis, Dipartimento diElettronica, Politecnico di Milano, Italy (in Italian)

  • Drazic M, Lavor C, Maculan N, Mladenovic N (2008) A continuous variable neighborhood search heuristic for finding the three-dimensional structure of a molecule. Eur J Oper Res 185(3):1265–1273

    Article  MATH  Google Scholar 

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

    Article  Google Scholar 

  • Equi L, Gallo G, Marziale S, Weintraub A (1997) A combined transportation and scheduling problem. Eur J Oper Res 97(1):94–104

    Article  MATH  Google Scholar 

  • Fiedrich F, Gehbauer F, Rickers U (2000) Optimized resource allocation for emergency response after earthquake disasters. Saf Sci 35(1–3):41–57

    Article  Google Scholar 

  • Funke B, Grunert T, Irnich S (2005) Local search for vehicle routing and scheduling problems: review and conceptual integration. J Heuristics 11:267–306

    Article  MATH  Google Scholar 

  • Gao J, Sun LY, Gen MS (2008) A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems. Comput Oper Res 35(9):2892–2907

    Article  MathSciNet  MATH  Google Scholar 

  • Garcia CG, Perez-Brito D, Campos V, Marti R (2006) Variable neighborhood search for the linear ordering problem. Comput Oper Res 33(12):3549–3565

    Article  MATH  Google Scholar 

  • Guneri AF (2007) Physical distribution activities and vehicle routing problems in logistics management: a case study. Proc Inst Mech Eng Part B J Eng Manuf 221(1):123–133

    Article  MathSciNet  Google Scholar 

  • Haghani A, Oh S (1996) Formulation and solution of a multi-commodity, multi-modal network flow model for disaster relief operations. Transp Res Part A (Policy and Practice) 30A(3):231–250

    Article  Google Scholar 

  • Herrmann JW (2011) Using aggregation to reduce response time variability in cyclic fair sequences. J Sched 14(1):39–55

    Article  MATH  Google Scholar 

  • Herrmann JW (2012) Finding optimally balanced words for production planning and maintenance scheduling. IIE Trans 44(3):215–229

    Article  Google Scholar 

  • Ho TH, Su X (2009) Peer-induced fairness in games. Am Econ Rev 99(5):2022–2049

    Article  Google Scholar 

  • Hu B, Leitner M, Raidl GR (2008) Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem. J Heuristics 14(5):473–499

    Article  MATH  Google Scholar 

  • Huang M, Smilowitz K, Balcik B (2012) Models for relief routing: equity, efficiency and efficacy. Transp Res Part E 48:2–18

    Article  Google Scholar 

  • Huang K, Jiang Y, Yuan Y, Zhao L (2015) Modeling multiple humanitarian objectives in emergency response to large-scale disasters. Transp Res Part E 75:1–17

    Article  Google Scholar 

  • Juan AA, Pascual I, Guimarans D, Barrios B (2015) Combining biased randomization with iterated local search for solving the multidepot vehicle routing problem. Int Trans Oper Res 22(4):647–667

    Article  MathSciNet  MATH  Google Scholar 

  • Ke L, Feng Z (2013) A two-phase metaheuristic for the cumulative capacitated vehicle routing problem. Comput Oper Res 40(2):633–638

    Article  MATH  Google Scholar 

  • Lazic J, Hanafi S, Mladenovic N, Urosevic D (2010) Variable neighbourhood decomposition search for 0-1 mixed integer programs. Comput Oper Res 37(6):1055–1067

    Article  MathSciNet  MATH  Google Scholar 

  • Luss H (1991) A nonlinear minimax allocation problem with multiple knapsack constraints. Oper Res Lett 10(4):183–187

    Article  MathSciNet  MATH  Google Scholar 

  • Mandell MB (1991) Modelling effectiveness-equity trade-offs in public service delivery systems. Manag Sci 37(4):467–482

    Article  Google Scholar 

  • McCoy JH, Lee HL (2014) Using fairness models to improve equity in health delivery fleet management. Prod Oper Manag 23:965–977

    Article  Google Scholar 

  • Mladenovic N, Hansen P (1997) Variable neighborhood search. Comput Oper Res 24(11):1097–1100

    Article  MathSciNet  MATH  Google Scholar 

  • Mladenovic N, Drazic M, Kovacevic-Vujcic V, Cangalovic M (2008) General variable neighborhood search for the continuous optimization. Eur J Oper Res 191(3):753–770

    Article  MathSciNet  MATH  Google Scholar 

  • Ngueveu SU, Prins C, Wolfler-Calvo R (2010) An effective memetic algorithm for the cumulative capacitated vehicle routing problem. Comput Oper Res 37(11):1877–1885

    Article  MathSciNet  MATH  Google Scholar 

  • Özdamar L, Demir O (2012) A hierarchical clustering and routing procedure for large scale disaster relief logistics planning. Transp Res Part E 48:591–602

    Article  Google Scholar 

  • Pillac V, Gendreau M, Guéret C, Medaglia AL (2013) A review of dynamic vehicle routing problems. Eur J Oper Res 225:1–11

    Article  MathSciNet  MATH  Google Scholar 

  • Polacek M, Doerner KF, Hartl RF, Maniezzo V (2008) A variable neighborhood search for the capacitated arc routing problem with intermediate facilities. J Heuristics 14(5):405–423

    Article  MATH  Google Scholar 

  • Potvin J (2009) State-of-the art review-evolutionary algorithms for vehicle routing. INFORMS J Comput 21(4):518–548

    Article  MathSciNet  MATH  Google Scholar 

  • Ralphs TK, Kopman L, Pulleyblank WR, Trotter LE (2003) On the capacitated vehicle routing problem. Math Program 94(2–3):343–359

    Article  MathSciNet  MATH  Google Scholar 

  • Rennemo SJ, Rø KF, Hvattum LM, Tirado G (2014) A three-stage stochastic facility routing model for disaster response planning. Transp Res Part E 62:116–135

    Article  Google Scholar 

  • Ribeiro G, Laporte G (2012) An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem. Comput Oper Res 39(3):728–735

    Article  MathSciNet  MATH  Google Scholar 

  • Salavati-Khoshghalb M, Gendreau M, Jabali O, Rei W (2019) An exact algorithm to solve the vehicle routing problem with stochastic demands under an optimal restocking policy. Eur J Oper Res 273(1):175–189

    Article  MathSciNet  MATH  Google Scholar 

  • Savelsbergh MWP (1992) The vehicle routing problem with time windows: minimizing route duration. ORSA J Comput 4(2):146–154

    Article  MATH  Google Scholar 

  • Toth P, Vigo D (eds) (2015) Vehicle routing: problems, methods, and applications. Society for Industrial and Applied Mathematics, Pennsylvania

    Google Scholar 

  • Tzeng G, Cheng H, Huang T (2007) Multi-objective optimal planning for designing relief delivery systems. Transp Res Part E 43:673–686

    Article  Google Scholar 

  • Vidal T, Crainic TG, Gendreau M, Prins C (2013) Heuristics for multi-attribute vehicle routing problems: A survey and synthesis. Eur J Oper Res 231:1–21

    Article  MathSciNet  MATH  Google Scholar 

  • Xiao Y, Zhao Q, Kaku I, Mladenovic N (2014) Variable neighbourhood simulated annealing algorithm for capacitated vehicle routing problems. Eng Optim 46(4):562–579

    Article  Google Scholar 

  • Zhang X, Zhang Z, Zhang Y, Wei D, Deng Y (2013) Route selection for emergency logistics management: a bio-inspired algorithm. Saf Sci 54:87–91

    Article  Google Scholar 

  • Zheng Y, Chen S, Ling H (2015) Evolutionary optimization for disaster relief operations: A survey. Appl Soft Comput 27:553–566

    Article  Google Scholar 

  • Zhu Q, Hu J, Cai W, Henschen L (2011) A new robot navigation algorithm for dynamic unknown environments based on dynamic path re-computation and an improved scout ant algorithm. Appl Soft Comput 11:4667–4676

    Article  Google Scholar 

Download references

Funding

This study was funded in part by the National Natural Science Foundation of China (Grant Numbers 71471062, 71431004 and 71632008), the National Social Science Foundation of China (Grant Number 16ZDA083), the Ministry of Education Humanities and Social Science Research Planning Fund Project (Grant Number 18YJAZH046), the Natural Science Foundation of Shanghai (Grant Number 18ZR1409400).

Author information

Authors and Affiliations

  1. School of Business, East China University of Science and Technology, Shanghai, 200237, China

    Yifan Wu, Shuxia Li & Zhen Chen

  2. Sino-US Global Logistics Institute, Shanghai Jiao Tong University, Shanghai, 200030, China

    Fan Pan

  3. Antai College of Economics and Management, Shanghai Jiao Tong University, Shanghai, 200052, China

    Ming Dong

Authors
  1. Yifan Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Fan Pan
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Shuxia Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Zhen Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Ming Dong
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Shuxia Li.

Ethics declarations

Conflict of interest

Author Yifan Wu declares that he has no conflict of interest. Author Fan Pan declares that he has no conflict of interest. Author Shuxia Li declares that she has no conflict of interest. Author Zhen Chen declares that he has no conflict of interest. Author Ming Dong declares that he has no conflict of interest.

Ethical approval

This article does not contain any studies with human participants or animals performed by any of the authors.

Additional information

Communicated by V. Loia.

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Wu, Y., Pan, F., Li, S. et al. Peer-induced fairness capacitated vehicle routing scheduling using a hybrid optimization ACO–VNS algorithm. Soft Comput 24, 2201–2213 (2020). https://doi.org/10.1007/s00500-019-04053-9

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-019-04053-9

Keywords

Search

Navigation