Skip to main content
SpringerLink
Log in

Adaptive large neighborhood search heuristic for pollution-routing problem with simultaneous pickup and delivery

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

Abstract

This paper deals with the pollution-routing problem with simultaneous pickup and delivery, where the goal is to minimize fuel consumption and emissions by scheduling and routing customers. A nonlinear mix integer programing model is presented for this problem, and an adaptive large neighborhood search heuristic is proposed for the solution method including new removal and insertion operators. Also a heuristic algorithm is proposed to construct the initial solution. The proposed method is validated by computational experiments conducted on two classes of benchmark instances. The experiments further show that our proposed heuristic outperforms related heuristics and improved the results of existing literature.

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

Similar content being viewed by others

References

  • Barth M, Younglove T, Scora G (2005) Development of a heavy-duty diesel modal emissions and fuel consumption model. California Partners for Advanced Transit and Highways (PATH)

  • Bektaş T, Laporte G (2011) The pollution-routing problem. Transp Res Part B Methodol 45(8):1232–1250

    Article  Google Scholar 

  • Demir E, Bektaş T, Laporte G (2011) A comparative analysis of several vehicle emission models for road freight transportation. Transp Res Part D Transp Environ 6(5):347–357

    Article  Google Scholar 

  • Demir E, Bektaş T, Laporte G (2014) A review of recent research on green road freight transportation. Eur J Oper Res 237:775–793

    Article  MATH  Google Scholar 

  • Demir E, Bektaş T, Laporte G (2014) The bi-objective pollution-routing problem. Eur J Oper Res 232:464–478

    Article  MathSciNet  MATH  Google Scholar 

  • Demir E, Bektaş T, Laporte G (2012) An adaptive large neighborhood search heuristic for the pollution-routing problem. Eur J Oper Res 223:346–359

    Article  MathSciNet  MATH  Google Scholar 

  • Dethloff J (2001) Vehicle routing and reverse logistics: the vehicle routing problem with simultaneous delivery and pick-up. OR Spektrum, pp 79–96

  • EPA (2003) User’s guide to MOBILE6.1 and MOBILE6.2: mobile source emission factor model. Technical report, United States Environmental Protection Agency, USA

  • Franceschetti A, Honhon D, vanWoensel T, Bektaş T, Laporte G (2013) The time-dependent pollution-routing problem. Transp Res Part B Methodol 56:265–293

    Article  Google Scholar 

  • Kara I, Kara BY, Yetis MK (2007) Energy minimizing vehicle routing problem. Comb Optim Appl 4616:62–71

  • Kirby HR, Hutton B, McQuaid RW, Raeside R, Zhang X (2000) Modelling the effects of transport policy levers on fuel efficiency and national fuel consumption. Transp Res Part D Transp Environ 5(4):265–282

  • Kopfer HW, Kopfer H (2013) Emissions minimization vehicle routing problem in dependence of different vehicle classes. In: Dynamics in logistics. Springer, Berlin, Heidelberg, pp 49–58

  • Kramer R, Subramanian A, Vidal T, Lucídio dos Anjos FC (2015) A matheuristic approach for the pollution-routing problem. Eur J Oper Res 243:523–539

    Article  MathSciNet  MATH  Google Scholar 

  • Kuo Y (2010) Using simulated annealing to minimize fuel consumption for the time-dependent vehicle routing problem. Comput Ind Eng 59(1):157–165

    Article  Google Scholar 

  • Kuo Y, Wang CC (2011) Optimizing the VRP by minimizing fuel consumption. Manag Environ Qual Int J 22(4):440–450

    Article  Google Scholar 

  • Palmer A (2007) The development of an integrated routing and carbon dioxide emissions model for goods vehicles. Ph.D. thesis. Cranfield University, Bedford

  • Peng Y, Wang X (2009) Research on a vehicle routing schedule to reduce fuel consumption. In: Proceedings of the 2009 international conference on measuring technology and mechatronics automation, vol 03, pp 825–827

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

    Article  MathSciNet  MATH  Google Scholar 

  • Salimifard K, Shahbandarzadeh H, Raeesi R (2012) Green transportation and the role of operation research. Int Conf Traffic Transp Eng 26:74–79

    Google Scholar 

  • Scott C, Urquhart N, Hart E (2010) Influence of topology and payload on CO2 optimised vehicle routing. In: European conference on the applications of evolutionary computation, vol 6025, pp 141–150

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

    Article  MathSciNet  MATH  Google Scholar 

  • Ubeda S, Arcelus FJ, Faulin J (2011) Green logistics at Eroski: a case study. Int J Prod Econ 131(1):44–51

    Article  Google Scholar 

  • Wang HF, Chen YY (2012) A genetic algorithm for the simultaneous delivery and pickup problems with time window. Comput Ind Eng 62(1):84–95

    Article  MathSciNet  Google Scholar 

  • Xiao Y, Zhao Q, Kaku I, Xu Y (2012) Development of a fuel consumption optimization model for the capacitated vehicle routing problem. Comput Oper Res 39(7):1419–1431

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

The third author would like to acknowledge the Fundamental Research Grant Scheme (FRGS) by the Ministry of Higher Education of Malaysia (Grant No. 203/PMATHS/6711364), which made this cooperation possible.

Author information

Authors and Affiliations

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

    Setareh Majidi & Seyyed-Mahdi Hosseini-Motlagh

  2. School of Mathematical Sciences, Universiti Sains Malaysia, Gelugor, Penang, Malaysia

    Joshua Ignatius

  3. Warwick Manufacturing Group, University of Warwick, Coventry, UK

    Joshua Ignatius

Authors
  1. Setareh Majidi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Seyyed-Mahdi Hosseini-Motlagh
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Joshua Ignatius
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Seyyed-Mahdi Hosseini-Motlagh.

Ethics declarations

Conflict of interest

The authors declare that there is no conflict of interests regarding the publication of this paper.

Additional information

Communicated by V. Loia.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Majidi, S., Hosseini-Motlagh, SM. & Ignatius, J. Adaptive large neighborhood search heuristic for pollution-routing problem with simultaneous pickup and delivery. Soft Comput 22, 2851–2865 (2018). https://doi.org/10.1007/s00500-017-2535-5

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-017-2535-5

Keywords

Search

Navigation