Skip to main content
SpringerLink
Log in

A Memetic Algorithm for Waste Collection Vehicle Routing Problem with Time Windows and Conflicts

  • Conference paper
Computational Science and Its Applications – ICCSA 2013 (ICCSA 2013)

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

Included in the following conference series:

Abstract

We address an application of vehicle routing problem (VRP) in the real life, namely waste collection problem. Constraints are considered including conflicts between waste properties, time windows of the waste, and multiple landfills. A combination of flow and set partitioning formulation is suggested to model the problem in case of multi-objective optimization. To minimize the total traveling time and number of vehicles of solution, we propose using a memetic algorithm (MA) with λ-interchange mechanism. The λ-interchange operator is modified to be compatible with new sub-routes construction for the multiple landfills.

In experiments, we compare the result of proposed MA method with some good results published as well as other meta-heuristic algorithms. The density of conflict matrix is also considered to understand its influence on the quality of the solution. Experimental results show that our approach can be competitive to other results in the VRP with time windows. Furthermore, the algorithm outperforms others in the VRP with time windows and conflict.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Bräysy, O., Gendreau, M.: Vehicle routing problem with time windows, part i: Route construction and local search algorithms. Transportation Science 39(1), 104–118 (2005)

    Article  Google Scholar 

  2. Desrochers, M., Lenstra, J., Savelsbergh, M., Soumis, F.: Vehicle routing with time windows: Optimization and approximation. In: Golden, B.L., Assad, A.A. (eds.) Vehicle Routing: Methods and Studies, pp. 65–84. North-Holland (1988)

    Google Scholar 

  3. Goldberg, D., Lingle, R.: Alleles, loci and the traveling salesman problem. In: Proceedings of the Second International Conference on Genetic Algorithms. Lawrence Eribaum Associates, Mahwah (1985)

    Google Scholar 

  4. Hamdi-Dhaoui, K., Labadie, N., Zhu, A.Y.Q.: The vehicle routing problem with conflicts. In: Proceedings of the 18th IFAC World Congress (2011)

    Google Scholar 

  5. Kim, B.I., Kimb, S., Sahoo, S.: Waste collection vehicle routing problem with time windows. Computers & Operations Research 3, 3624–3642 (2005)

    Google Scholar 

  6. Knight, K., Hofer, J.: Vehicle scheduling with timed and connected calls: A case study. Operational Research Quarterly 19, 299–310 (1968)

    Article  Google Scholar 

  7. Madsen, O.B.G.: Optimal scheduling of trucks - a routing problem with tight due times for delivery. In: Optimization Applied to Transportation Systems, pp. 126–136 (1976)

    Google Scholar 

  8. Osman, I.H., Christofides, N.: Capacitated clustering problems by hybrid simulated annealing and tabu search. International Transactions in Operational Research 1(3), 317–336 (1994)

    Article  MATH  Google Scholar 

  9. Pullen, H.G.M., Webb, M.H.J.: A computer application to a transport scheduling problem. The Computer Journal 10, 10–13 (1967)

    Article  Google Scholar 

  10. Savelsbergh, M.W.P.: Local search in routing problem with time windows. Annals of Operations Research 4, 285–305 (1985)

    Article  MathSciNet  Google Scholar 

  11. Solomon, M.M.: Algorithms for the vehicle routing and scheduling problems with time window constraints. Operational Research 35(2), 254–265 (1987)

    Article  MATH  Google Scholar 

  12. Solomon, M.M., Desrochers, M.: Time windows con-strained routing and scheduling problem. Transportation Science 22, 1–13 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  13. Tung, D.V., Pinnoi, A.: Vehicle routing-scheduling for waste collection in hanoi. European Journal of Operational Research 125, 449–468 (2000)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Ho Chi Minh City Institute of Physics, Vietnam Academy of Science and Technology, Vietnam

    Thai Tieu Minh

  2. Faculty of Computer Science & Engineering, Ho Chi Minh City University of Technology, Vietnam

    Tran Van Hoai

  3. Faculty of Computer Engineering, Ho Chi Minh City University of Information Technology, Vietnam

    Tran Thi Nhu Nguyet

Authors
  1. Thai Tieu Minh
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Tran Van Hoai
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Tran Thi Nhu Nguyet
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. L-I.S.U.T. - D.A.P.I.t. Facoltà Ingegneria, Università degli Studi della Basilicata, Viale dell’Ateneo Lucano, 10, 85100, Potenza, Italy

    Beniamino Murgante

  2. Covenant University, Canaanland, Ota, Nigeria

    Sanjay Misra

  3. Partimento di Scienze e Tecnologie per LAgricoltura, le Foreste, la Natura e lEnergia, Università degli Studi della Tuscia, Via S. Camillo de Lellis, snc, 01100, Viterbo, Italy

    Maurizio Carlini

  4. Dipartimento di Scienze dell’Ingegneria Civile e dell’Architecttura, Politecnico di Bari, Via Orabona, 4, 70125, Bari, Italy

    Carmelo M. Torre

  5. International University VNU-HCM, Quarter 6, Linh Trung, Thu Duc, Ho Chi Minh City, Vietnam

    Hong-Quang Nguyen

  6. School of Business Systems, Monash University, 3800, Clayton, VIC, Australia

    David Taniar

  7. Department of Intelligent Informatics, Kyushu Sangyo University, 2-3-1 Matsukadai, 813-8503, Higashi-ku, Fukuoka, Japan

    Bernady O. Apduhan

  8. Department of Mathematics and Computer Science, University of Perugia, Via Vanvitelli, 1, 06123, Perugia, Italy

    Osvaldo Gervasi

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Minh, T.T., Van Hoai, T., Nguyet, T.T.N. (2013). A Memetic Algorithm for Waste Collection Vehicle Routing Problem with Time Windows and Conflicts. In: Murgante, B., et al. Computational Science and Its Applications – ICCSA 2013. ICCSA 2013. Lecture Notes in Computer Science, vol 7971. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39637-3_38

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-39637-3_38

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-39636-6

  • Online ISBN: 978-3-642-39637-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation