Soft Computing

, Volume 22, Issue 9, pp 2851–2865 | Cite as

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

  • Setareh Majidi
  • Seyyed-Mahdi Hosseini-Motlagh
  • Joshua Ignatius
Methodologies and Application


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.


PRPSPD Simultaneous pickup and delivery Fuel consumption and emissions ALNS 



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.

Compliance with ethical standards

Conflict of interest

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


  1. 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)Google Scholar
  2. Bektaş T, Laporte G (2011) The pollution-routing problem. Transp Res Part B Methodol 45(8):1232–1250CrossRefGoogle Scholar
  3. 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–357CrossRefGoogle Scholar
  4. Demir E, Bektaş T, Laporte G (2014) A review of recent research on green road freight transportation. Eur J Oper Res 237:775–793CrossRefzbMATHGoogle Scholar
  5. Demir E, Bektaş T, Laporte G (2014) The bi-objective pollution-routing problem. Eur J Oper Res 232:464–478MathSciNetCrossRefzbMATHGoogle Scholar
  6. Demir E, Bektaş T, Laporte G (2012) An adaptive large neighborhood search heuristic for the pollution-routing problem. Eur J Oper Res 223:346–359MathSciNetCrossRefzbMATHGoogle Scholar
  7. Dethloff J (2001) Vehicle routing and reverse logistics: the vehicle routing problem with simultaneous delivery and pick-up. OR Spektrum, pp 79–96Google Scholar
  8. EPA (2003) User’s guide to MOBILE6.1 and MOBILE6.2: mobile source emission factor model. Technical report, United States Environmental Protection Agency, USAGoogle Scholar
  9. Franceschetti A, Honhon D, vanWoensel T, Bektaş T, Laporte G (2013) The time-dependent pollution-routing problem. Transp Res Part B Methodol 56:265–293CrossRefGoogle Scholar
  10. Kara I, Kara BY, Yetis MK (2007) Energy minimizing vehicle routing problem. Comb Optim Appl 4616:62–71Google Scholar
  11. 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–282Google Scholar
  12. 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–58Google Scholar
  13. 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–539MathSciNetCrossRefzbMATHGoogle Scholar
  14. Kuo Y (2010) Using simulated annealing to minimize fuel consumption for the time-dependent vehicle routing problem. Comput Ind Eng 59(1):157–165CrossRefGoogle Scholar
  15. Kuo Y, Wang CC (2011) Optimizing the VRP by minimizing fuel consumption. Manag Environ Qual Int J 22(4):440–450CrossRefGoogle Scholar
  16. Palmer A (2007) The development of an integrated routing and carbon dioxide emissions model for goods vehicles. Ph.D. thesis. Cranfield University, BedfordGoogle Scholar
  17. 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–827Google Scholar
  18. Pisinger D, Ropke S (2007) A general heuristic for vehicle routing problems. Comput Oper Res 34(8):2403–2435MathSciNetCrossRefzbMATHGoogle Scholar
  19. Salimifard K, Shahbandarzadeh H, Raeesi R (2012) Green transportation and the role of operation research. Int Conf Traffic Transp Eng 26:74–79Google Scholar
  20. 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–150Google Scholar
  21. Solomon MM (1987) Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper Res 35(2):254–265MathSciNetCrossRefzbMATHGoogle Scholar
  22. Ubeda S, Arcelus FJ, Faulin J (2011) Green logistics at Eroski: a case study. Int J Prod Econ 131(1):44–51CrossRefGoogle Scholar
  23. Wang HF, Chen YY (2012) A genetic algorithm for the simultaneous delivery and pickup problems with time window. Comput Ind Eng 62(1):84–95MathSciNetCrossRefGoogle Scholar
  24. 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–1431MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2017

Authors and Affiliations

  1. 1.School of Industrial EngineeringIran University of Science and TechnologyTehranIran
  2. 2.School of Mathematical SciencesUniversiti Sains MalaysiaGelugorMalaysia
  3. 3.Warwick Manufacturing GroupUniversity of WarwickCoventryUK

Personalised recommendations