Skip to main content
SpringerLink
Log in
Book cover

European Conference on Evolutionary Computation in Combinatorial Optimization

EvoCOP 2008: Evolutionary Computation in Combinatorial Optimization pp 135–146Cite as

An ILS Based Heuristic for the Vehicle Routing Problem with Simultaneous Pickup and Delivery and Time Limit

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4972))

Abstract

This paper deals with the Vehicle Routing Problem with Simultaneous Pick-up and Delivery and Time Limit (VRPSPDTL). Due to the combinatorial nature of the problem, heuristics methods are commonly used to generate good quality solutions within an acceptable computational time. Accordingly, an Iterated Local Search (ILS) procedure that uses a Variable Neighborhood Descent (VND) method to perform the local search is proposed. The algorithm was applied to test problems and, in most cases, was found to produce better results than those reported in the literature.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Min, H.: The multiple vehicle routing problem with simultaneous delivery and pick-up points. Transportation Research 23(5), 377–386 (1989)

    Article  MathSciNet  Google Scholar 

  2. Salhi, S., Nagy, G.: A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling. Journal of the Operational Research Society 50, 1034–1042 (1999)

    Article  MATH  Google Scholar 

  3. Nagy, G., Salhi, S.: Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries. European Journal of Operational Research 162(1) (2005)

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  5. Vural, A.V.: A ga based meta-heuristic for capacited vehicle routing problem with simultaneous pick-up and deliveries. Master’s thesis, Graduate School of Engineering and Natural Sciences, Sabanci University (2003)

    Google Scholar 

  6. Gökçe, E.I.: A revised ant colony system approach to vehicle routing problems. Master’s thesis, Graduate School of Engineering and Natural Sciences, Sabanci University (2004)

    Google Scholar 

  7. Crispim, J., Brandao, J.: Metaheuristics applied to mixed and simultaneous extensions of vehicle routing problems with backhauls. Journal of the Operational Research Society 56(7), 1296–1302 (2005)

    Article  MATH  Google Scholar 

  8. Montané, F.A.T., Galvão, R.D.: A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service. European Journal of Operational Research 33(3), 595–619 (2006)

    MATH  Google Scholar 

  9. Gribkovskaia, I., Halskau, Ø., Laporte, G., Vlcek, M.: General solutions to the single vehicle routing problem with pickups and deliveries. European Journal of Operational Research 180, 568–584 (2006)

    Article  MathSciNet  Google Scholar 

  10. Ropke, S., Pisinger, D.: A unified heuristic for a large class of vehicle routing problems with backhauls. Technical Report 2004/14, University of Copenhagen (2004)

    Google Scholar 

  11. Chen, J.F., Wu, T.H.: Vehicle routing problem with simultaneous deliveries and pickups. Journal of the Operational Research Society 57(5), 579–587 (2005)

    Article  Google Scholar 

  12. Chen, J.F.: Approaches for the vehicle routing problem with simultaneous deliveries and pickups. Journal of the Chinese Institute of Industrial Engineers 23(2), 141–150 (2006)

    Google Scholar 

  13. Bianchessi, N., Righini, G.: Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery. Computers & Operations Research 34(2), 578–594 (2007)

    Article  MATH  Google Scholar 

  14. Wasasn, N.A., Wassan, A.H., Nagy, G.: A reactive tabu search algorithm for the vehicle routing problem with simultaneous pickups and deliveries. Journal of Combinatorial Optimization (2007)

    Google Scholar 

  15. Dell’Amico, M., Righini, G., Salanim, M.: A branch-and-price approach to the vehicle routing problem with simultaneous distribution and collection. Transportation Science 40(2), 235–247 (2006)

    Article  Google Scholar 

  16. Angelelli, E., Mansini, R.: A branch-and-price algorithm for a simultaneous pick-up and delivery problem. In: Quantitative Approaches to Distribution Logistics and Supply Chain Management, pp. 249–267. Springer, Heidelberg (2002)

    Google Scholar 

  17. Lourenço, H.R., Martin, O.C., Stützle, T.: Iterated Local Search. In: Handbook of Metaheuristics, pp. 321–353. Kluwer Academic Publishers, Norwell, MA (2002)

    Google Scholar 

  18. Stützle, T.: Local Search Algorithms for Combinatorial Problems. PhD thesis, Darmstadt University of Technology, Germany (1998)

    Google Scholar 

  19. Mladenović, N., Hansen, P.: Variable neighborhood search. Computers & Operations Research 24(11), 1097–1100 (1997)

    Article  MathSciNet  Google Scholar 

  20. Or, I.: Traveling salesman-type combinational problems and their relation to the logistics of blood banking. PhD thesis, Northwestern University, USA (1976)

    Google Scholar 

  21. Martin, O., Otto, S.W., Felten, E.W.: Large-step markov chains for the traveling salesman problem. Complex Systems 5, 299–326 (1991)

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Departamento de Engenharia de Produção, Universidade Federal da Paraíba, Centro de Tecnologia - Campus I - Bloco G - Cidade Universitária, Castelo Branco, 58051-970, João Pessoa - PB, Brazil

    Anand Subramanian

  2. Universidade Federal da Paraíba Departamento de Estatística, Centro de Ciências Exatas e da Natureza - Campus I - Cidade Universitária, Castelo Branco, 58051-900 - João Pessoa - PB, Brazil

    Lucídio dos Anjos Formiga Cabral

Authors
  1. Anand Subramanian
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Lucídio dos Anjos Formiga Cabral
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jano van Hemert Carlos Cotta

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Subramanian, A., dos Anjos Formiga Cabral, L. (2008). An ILS Based Heuristic for the Vehicle Routing Problem with Simultaneous Pickup and Delivery and Time Limit. In: van Hemert, J., Cotta, C. (eds) Evolutionary Computation in Combinatorial Optimization. EvoCOP 2008. Lecture Notes in Computer Science, vol 4972. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-78604-7_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-78604-7_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-78603-0

  • Online ISBN: 978-3-540-78604-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation